An Epistemic Perspective on Consistency of Concurrent Computations

Consistency properties of concurrent computations, e.g., sequential consistency, linearizability, or eventual consistency, are essential for devising correct concurrent algorithms. In this paper, we present a logical formalization of such consistency properties that is based on a standard logic of knowledge. Our formalization provides a declarative perspective on what is imposed by consistency requirements and provides some interesting unifying insight on differently looking properties

Three Essays in Intuitionistic Epistemology

We present three papers studying knowledge and its logic from an intuitionistic viewpoint. An Arithmetic Interpretation of Intuitionistic Verification Intuitionistic epistemic logic introduces an epistemic operator to intuitionistic logic which reflects the intended BHK semantics of intuitionism. The fundamental assumption concerning intuitionistic knowledge and belief is that it is the product of verification. The BHK interpretation of intuitionistic logic has a precise formulation in the Logic of Proofs and its arithmetical semantics. We show here that this interpretation can be extended to the notion of verification upon which intuitionistic knowledge is based. This provides the systems of intuitionistic epistemic logic extended by an epistemic operator based on verification with an arithmetical semantics too. This confirms the conception of verification incorporated in these systems reflects the BHK interpretation. Intuitionistic Verification and Modal Logics of Verification The systems of intuitionistic epistemic logic, IEL, can be regarded as logics of intuitionistic verification. The intuitionistic language, however, has expressive limitations. The classical modal language is more expressive, enabling us to formulate various classical principles which make explicit the relationship between intuitionistic verification and intuitionistic truth, implicit in the intuitionistic epistemic language. Within the framework of the arithmetic semantics for IEL we argue that attempting to base a general verificationism on the properties of intuitionistic verification, as characterised by IEL, yields a view of verification stronger than is warranted by its BHK reading. Intuitionistic Knowledge and Fallibilism Fallibilism is the view that knowledge need not guarantee the truth of the proposition known. In the context of a classical conception of truth fallibilism is incompatible with the truth condition on knowledge, i.e. that false propositions cannot be known. We argue that an intuitionistic approach to knowledge yields a view of knowledge which is both fallibilistic and preserves the truth condition. We consider some problems for the classical approach to fallibilism and argue that an intuitionistic approach also resolves them in a manner consonant with the motivation for fallibilism