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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 74,310

External links

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

Through your library

Similar books and articles

Analytics

Added to PP
2009-01-28

Downloads
96 (#126,647)

6 months
2 (#276,659)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Correspondences Between Gentzen and Hilbert Systems.J. G. Raftery - 2006 - Journal of Symbolic Logic 71 (3):903 - 957.
Order algebraizable logics.James G. Raftery - 2013 - Annals of Pure and Applied Logic 164 (3):251-283.
A Closer Look at Some Subintuitionistic Logics.Sergio Celani & Ramon Jansana - 2001 - Notre Dame Journal of Formal Logic 42 (4):225-255.
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.

View all 47 citations / Add more citations