Graduate studies at Western
Annals of Pure and Applied Logic 132 (1) (2005)
|Abstract||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)|
No categories specified
(categorize this paper)
|Through your library||Configure|
Similar books and articles
Jan Krajíček (1995). Bounded Arithmetic, Propositional Logic, and Complexity Theory. Cambridge University Press.
Henry Africk (1992). Classical Logic, Intuitionistic Logic, and the Peirce Rule. Notre Dame Journal of Formal Logic 33 (2):229-235.
M. W. Bunder (1987). Some Consistency Proofs and a Characterization of Inconsistency Proofs in Illative Combinatory Logic. Journal of Symbolic Logic 52 (1):89-110.
Paolo Gentilini (1993). Syntactical Results on the Arithmetical Completeness of Modal Logic. Studia Logica 52 (4):549 - 564.
Sergei N. Artemov (2001). Explicit Provability and Constructive Semantics. Bulletin of Symbolic Logic 7 (1):1-36.
Michael R. Gardner (1971). Is Quantum Logic Really Logic? Philosophy of Science 38 (4):508-529.
Duccio Luchi & Franco Montagna (1999). An Operational Logic of Proofs with Positive and Negative Information. Studia Logica 63 (1):7-25.
Added to index2009-06-23
Total downloads16 ( #81,785 of 739,305 )
Recent downloads (6 months)1 ( #61,243 of 739,305 )
How can I increase my downloads?