✦ LIBER ✦

Uniform arithmetical completeness of modal provability logics

✍ Scribed by S. N. Artemov

Publisher: SP MAIK Nauka/Interperiodica
Year: 1990
Tongue: English
Weight: 420 KB
Volume: 48
Category: Article
ISSN: 0001-4346
DOI: 10.1007/bf01164256

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Provability logics for natural turing pr

Provability logics for natural turing progressions of arithmetical theories

✍ L. D. Beklemishev 📂 Article 📅 1991 🏛 Springer Netherlands 🌐 English ⚖ 974 KB

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

On strictly arithmetical completeness in

On strictly arithmetical completeness in logics of programs

✍ Andrzej Szalas 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 892 KB

Syntactical results on the arithmetical

Syntactical results on the arithmetical completeness of modal logic

✍ Paolo Gentilini 📂 Article 📅 1993 🏛 Springer Netherlands 🌐 English ⚖ 801 KB

Completeness of modal logics with prefin

Completeness of modal logics with prefinite width

✍ V. V. Rybakov 📂 Article 📅 1982 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 219 KB

The modal logic of provability: Cut-elim

The modal logic of provability: Cut-elimination

✍ Silvio Valentini 📂 Article 📅 1983 🏛 Springer Netherlands 🌐 English ⚖ 216 KB