✦ LIBER ✦

Arithmetical completeness versus relative completeness

✍ Scribed by Michal Grabowski

Publisher: Springer Netherlands
Year: 1988
Tongue: English
Weight: 451 KB
Volume: 47
Category: Article
ISSN: 0039-3215
DOI: 10.1007/bf00370552

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper we study the status of the arithmetical completeness of dynamic logic. We prove that for finitistic proof systems for dynamic logic results beyond arithmetical completeness are very unlikely. The role of the set of natural numbers is carefully analyzed.

📜 SIMILAR VOLUMES

Uniform arithmetical completeness of mod

Uniform arithmetical completeness of modal provability logics

✍ S. N. Artemov 📂 Article 📅 1990 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 420 KB

On strictly arithmetical completeness in

On strictly arithmetical completeness in logics of programs

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

Completeness in the arithmetical hierarc

Completeness in the arithmetical hierarchy and fixed points

✍ M. M. Arslanov 📂 Article 📅 1989 🏛 Springer US 🌐 English ⚖ 687 KB

Syntactical results on the arithmetical

Syntactical results on the arithmetical completeness of modal logic

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

Relatively Complete Theories

✍ D. W. H. Gillam 📂 Article 📅 1976 🏛 John Wiley and Sons 🌐 English ⚖ 360 KB

Complete, Recursively Enumerable Relatio

Complete, Recursively Enumerable Relations in Arithmetic

✍ Giovanna D'Agostino; Mario Magnago 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 489 KB

## Abstract Using only propositional connectives and the provability predicate of a Σ~1~‐sound theory __T__ containing Peano Arithmetic we define recursively enumerable relations that are complete for specific natural classes of relations, as the class of all r. e. relations, and the class of all s