𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Proof theory for theories of ordinals—I: recursively Mahlo ordinals

✍ Scribed by Toshiyasu Arai

Book ID
104307250
Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
801 KB
Volume
122
Category
Article
ISSN
0168-0072

No coin nor oath required. For personal study only.

✦ Synopsis

This paper deals with a proof theory for a theory T22 of recursively Mahlo ordinals in the form of 2-re ecting on 2-re ecting ordinals using a subsystem Od( ) of the system O( ) of ordinal diagrams in Arai (Arch. Math. Logic 39 (2000) 353). This paper is the ÿrst published one in which a proof-theoretic analysis  a la Gentzen-Takeuti of recursively large ordinals is expounded.

📜 SIMILAR VOLUMES

Decision procedures for elementary subla
Decision procedures for elementary sublanguages of set theory. II. Formulas involving restricted quantifiers, together with ordinal, integer, map, and domain notions
✍ M. Breban; A. Ferro; E. G. Omodeo; J. T. Schwartz 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 801 KB

In this paper we describe a simple semi-decision algorithm applicable to a wide class of quantified formulas. The formulas we consider are built using the propositional connectives from prenex formulas in a language for which a decision algorithm for the corresponding quantifier-free theory T is ava