A propositional logic with explicit fixed points

Albert Visser

doi:10.1007/BF01874706

A propositional logic with explicit fixed points

Albert Visser^*

^*Corresponding author for this work

OFR - Theoretical Philosophy

Research output: Contribution to journal › Article › Academic › peer-review

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.

Original language	English
Pages (from-to)	155-175
Number of pages	21
Journal	Studia Logica
Volume	40
Issue number	2
DOIs	https://doi.org/10.1007/BF01874706
Publication status	Published - Jun 1981

Access to Document

10.1007/BF01874706

Cite this

@article{3d4e8a0de4f34d9b89ac300be1e8d2f8,

title = "A propositional logic with explicit fixed points",

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 = "Albert Visser",

year = "1981",

month = jun,

doi = "10.1007/BF01874706",

language = "English",

volume = "40",

pages = "155--175",

journal = "Studia Logica",

issn = "0039-3215",

publisher = "Springer Netherlands",

number = "2",

}

TY - JOUR

T1 - A propositional logic with explicit fixed points

AU - Visser, Albert

PY - 1981/6

Y1 - 1981/6

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/0000097297

U2 - 10.1007/BF01874706

DO - 10.1007/BF01874706

M3 - Article

AN - SCOPUS:0000097297

SN - 0039-3215

VL - 40

SP - 155

EP - 175

JO - Studia Logica

JF - Studia Logica

IS - 2

ER -

A propositional logic with explicit fixed points

Abstract

Access to Document

Other files and links

Fingerprint

Cite this