A propositional logic with explicit fixed points

Studia Logica 40 (2):155 - 175 (1981)
  Copy   BIBTEX

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.

Categories

Keywords

Reprint years

DOI

10.1007/bf01874706

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 106,169

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Arithmetical Completeness Theorem for Modal Logic mathsfmathsf{}.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
166 (#148,353)

6 months
13 (#259,115)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Intuitionistic Modal Algebras.Sergio A. Celani & Umberto Rivieccio - 2024 - Studia Logica 112 (3):611-660.
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.

View all 62 citations / Add more citations

References found in this work

Elements of Intuitionism.Michael Dummett - 1977 - New York: Oxford University Press. Edited by Roberto Minio.
A propositional calculus with denumerable matrix.Michael Dummett - 1959 - Journal of Symbolic Logic 24 (2):97-106.

View all 8 references / Add more references