✦ LIBER ✦

The modal logic of provability: Cut-elimination

✍ Scribed by Silvio Valentini

Publisher: Springer Netherlands
Year: 1983
Tongue: English
Weight: 216 KB
Volume: 12
Category: Article
ISSN: 0022-3611
DOI: 10.1007/bf00249262

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cut-elimination Theorems for Some Infini

Cut-elimination Theorems for Some Infinitary Modal Logics

✍ Yoshihito Tanaka 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 189 KB

In this article, a cut-free system TLMω 1 for infinitary propositional modal logic is proposed which is complete with respect to the class of all Kripke frames. The system TLMω 1 is a kind of Gentzen style sequent calculus, but a sequent of TLMω 1 is defined as a finite tree of sequents in a standar

A modal provability logic of explicit an

A modal provability logic of explicit and implicit proofs

✍ Evan Goris 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 830 KB

Continuum of normal extensions of the mo

Continuum of normal extensions of the modal logic of provability with the interpolation property

✍ L. L. Maksimova 📂 Article 📅 1990 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 631 KB

Cut-Elimination Theorem for the Logic of

Cut-Elimination Theorem for the Logic of Constant Domains

✍ Ryo Kashima; Tatsuya Shimura 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 776 KB

## Abstract The logic CD is an intermediate logic (stronger than intuitionistic logic and weaker than classical logic) which exactly corresponds to the Kripke models with constant domains. It is known that the logic CD has a Gentzen‐type formulation called LD (which is same as LK except that (→) an

PROVABILITY LOGIC IN THE GENTZEN FORMULA

PROVABILITY LOGIC IN THE GENTZEN FORMULATION OF ARITHMETIC

✍ Paolo Gentilini; P. Gentilini 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 796 KB

## Abstract In this paper are studied the properties of the proofs in PRA of provability logic sentences, i.e. of formulas which are Boolean combinations of formulas of the form P~IPRA~(h), where h is the Gödel‐number of a sentence in PRA. The main result is a Normal Form Theorem on the proof‐trees

The completeness of monotonic modal logi

The completeness of monotonic modal logics

✍ Brian F. Chellas; Audrey McKinney 📂 Article 📅 1975 🏛 John Wiley and Sons 🌐 English ⚖ 379 KB

The purpose of this paper is to point out an error in KRISTER SEGERBERG'S proof of the completeness of the modal logic R, and to provide a correct proof.2) The correct proofbased on a notion and a strategy suggested by SEOERBERO'S techniquesintroduces a general approach for obtaining completeness th