Symmetric logic of proofs

1Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The Logic of Proofs LP captures the invariant propositional properties of proof predicates t is a proof of F with a set of operations on proofs sufficient for realizing the whole modal logic S4 and hence the intuitionistic logic IPC. Some intuitive properties of proofs, however, are not invariant and hence not present in LP. For example, the choice function '+' in LP, which is specified by the condition s:Fvt:F→(s∈+∈t):F, is not necessarily symmetric. In this paper, we introduce an extension of the Logic of Proofs, SLP, which incorporates natural properties of the standard proof predicate in Peano Arithmetic: t is a code of a derivation containing F, including the symmetry of Choice. We show that SLP produces Brouwer-Heyting-Kolmogorov proofs with a rich structure, which can be useful for applications in epistemic logic and other areas. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Artemov, S. (2008). Symmetric logic of proofs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4800 LNCS, pp. 58–71). https://doi.org/10.1007/978-3-540-78127-1_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free