The logic of proofs, semantically

Annals of Pure and Applied Logic 132 (1):1-25 (2005)
A new semantics is presented for the logic of proofs (LP), [1, 2], based on the intuition that it is a logic of explicit knowledge. This semantics is used to give new proofs of several basic results concerning LP. In particular, the realization of S4 into LP is established in a way that carefully examines and explicates the role of the + operator. Finally connections are made with the conventional approach, via soundness and completeness results.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 14,766
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA
Citations of this work BETA
Melvin Fitting (2012). Prefixed Tableaus and Nested Sequents. Annals of Pure and Applied Logic 163 (3):291 - 313.

View all 22 citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

21 ( #131,309 of 1,707,585 )

Recent downloads (6 months)

2 ( #265,718 of 1,707,585 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.