𝔖 Bobbio Scriptorium
✦   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

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


Relatively Complete Theories
✍ D. W. H. Gillam πŸ“‚ Article πŸ“… 1976 πŸ› John Wiley and Sons 🌐 English βš– 360 KB
Complete, Recursively Enumerable Relatio
✍ 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