Bulletin of Symbolic Logic 7 (1):1-36 (2001)
|Abstract||In 1933 Godel introduced a calculus of provability (also known as modal logic S4) and left open the question of its exact intended semantics. In this paper we give a solution to this problem. We find the logic LP of propositions and proofs and show that Godel's provability calculus is nothing but the forgetful projection of LP. This also achieves Godel's objective of defining intuitionistic propositional logic Int via classical proofs and provides a Brouwer-Heyting-Kolmogorov style provability semantics for Int which resisted formalization since the early 1930s. LP may be regarded as a unified underlying structure for intuitionistic, modal logics, typed combinatory logic and λ-calculus|
|Through your library||Configure|
Similar books and articles
V. V. Rybakov (1990). Logical Equations and Admissible Rules of Inference with Parameters in Modal Provability Logics. Studia Logica 49 (2):215 - 239.
Albert Visser (1981). A Propositional Logic with Explicit Fixed Points. Studia Logica 40 (2):155 - 175.
Hirohiko Kushida (forthcoming). The Modal Logic of Gödel Sentences. Journal of Philosophical Logic.
Frank Wolter (1998). On Logics with Coimplication. Journal of Philosophical Logic 27 (4):353-387.
Arnold Nat (1979). First-Order Indefinite and Uniform Neighbourhood Semantics. Studia Logica 38 (3):277 - 296.
Konstantin N. Ignatiev (1993). On Strong Provability Predicates and the Associated Modal Logics. Journal of Symbolic Logic 58 (1):249-290.
Aldo Ursini (1979). A Modal Calculus Analogous to K4w, Based on Intuitionistic Propositional Logic, Iℴ. Studia Logica 38 (3):297 - 311.
Jeremy D. Avigad (2002). Review: Sergei N. Artemov, Explicit Provability and Constructive Semantics. [REVIEW] Bulletin of Symbolic Logic 8 (3):432-433.
Added to index2009-01-28
Total downloads18 ( #67,474 of 548,984 )
Recent downloads (6 months)1 ( #63,327 of 548,984 )
How can I increase my downloads?