- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
A propositional logic with explicit fixed points
Studia Logica 40 (2):155 - 175 (1981)
Abstract
This paper studies a propositional logic which is obtained by interpreting implication as formal provability. It is also the logic of finite irreflexive Kripke Models.A Kripke Model completeness theorem is given and several completeness theorems for interpretations into Provability Logic and Peano Arithmetic.Author's Profile
Other Versions
No versions found
My notes
Similar books and articles
Arithmetical Completeness Theorem for Modal Logic $$mathsf{}$$.Taishi Kurahashi - 2018 - Studia Logica 106 (2):219-235.
Propositional Provability Logics.Seyed Ahmad Mirsanei & Lotfollah Nabavi - 2022 - Philosophical Thought 1 (4):313-339.
Generic Generalized Rosser Fixed Points.Dick H. J. de Jongh & Franco Montagna - 1987 - Studia Logica 46 (2):193-203.
Generic generalized Rosser fixed points.Dick H. J. Jongh & Franco Montagna - 1987 - Studia Logica 46 (2):193 - 203.
Provability multilattice logic.Yaroslav Petrukhin - 2022 - Journal of Applied Non-Classical Logics 32 (4):239-272.
Finite Kripke models and predicate logics of provability.Sergei Artemov & Giorgie Dzhaparidze - 1990 - Journal of Symbolic Logic 55 (3):1090-1098.
An Escape From Vardanyan’s Theorem.Ana de Almeida Borges & Joost J. Joosten - 2023 - Journal of Symbolic Logic 88 (4):1613-1638.
Kripke Completeness of Bi-intuitionistic Multilattice Logic and its Connexive Variant.Norihiro Kamide, Yaroslav Shramko & Heinrich Wansing - 2017 - Studia Logica 105 (6):1193-1219.
Reverse Mathematics and Completeness Theorems for Intuitionistic Logic.Takeshi Yamazaki - 2001 - Notre Dame Journal of Formal Logic 42 (3):143-148.
Analytics
Added to PP
2009-01-28
Downloads
167 (#150,526)
6 months
12 (#377,837)
2009-01-28
Downloads
167 (#150,526)
6 months
12 (#377,837)
Historical graph of downloads
Author's Profile
Citations of this work
Intuitionistic Modal Algebras.Sergio A. Celani & Umberto Rivieccio - 2024 - Studia Logica 112 (3):611-660.
Collection Frames for Distributive Substructural Logics.Greg Restall & Shawn Standefer - 2023 - Review of Symbolic Logic 16 (4):1120-1157.
Basic Propositional Calculus I.Mohammad Ardeshir & Wim Ruitenburg - 1998 - Mathematical Logic Quarterly 44 (3):317-343.
Bounded distributive lattices with strict implication.Sergio Celani & Ramon Jansana - 2005 - Mathematical Logic Quarterly 51 (3):219-246.
A Closer Look at Some Subintuitionistic Logics.Ramon Jansana & Sergio Celani - 2001 - Notre Dame Journal of Formal Logic 42 (4):225-255.
References found in this work
Elements of Intuitionism.Michael Dummett - 1977 - New York: Oxford University Press. Edited by Roberto Minio.
The unprovability of consistency: an essay in modal logic.George Boolos - 1979 - New York: Cambridge University Press.
A propositional calculus with denumerable matrix.Michael Dummett - 1959 - Journal of Symbolic Logic 24 (2):97-106.
Arithmetical necessity, provability and intuitionistic logic.Rob Goldblatt - 1978 - Theoria 44 (1):38-46.
Calculating self-referential statements, I: Explicit calculations.Craig Smorynski - 1979 - Studia Logica 38 (1):17 - 36.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-6dc498764b-4pdvg uwo