## Abstract The paper characterizes the second order arithmetic theorems of a set theory that features a recursively Mahlo universe; thereby complementing prior proofβtheoretic investigations on this notion. It is shown that the property of being recursively Mahlo corresponds to a certain kind of Ξ²
The recursive sets in certain monadic second order fragments of arithmetic
β Scribed by Siefkes, Dirk
- Publisher
- Springer-Verlag
- Year
- 1975
- Weight
- 593 KB
- Volume
- 17
- Category
- Article
- ISSN
- 0003-9268
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We consider the class US k of uniformly k-sparse simple graphs, i.e., the class of ΓΏnite or countable simple graphs, every ΓΏnite subgraph of which has a number of edges bounded by k times the number of vertices. We prove that for each k, every monadic second-order formula (intended to express a grap
## Abstract In this paper we study the determinacy strength of infinite games in the Cantor space and compare them with their counterparts in the Baire space. We show the following theorems: 1. RCA~0~ β’ $ \Delta^0\_1 $βDet\* β $ \Sigma^0\_1 $βDet\* β WKL~0~. 2. RCA~0~ β’ ($ \Sigma^0\_1 $)2βDet\* β
## Abstract Some conditions on the size of the exceptional set that arise in Nevanlinna's Second Fundamental Theorem are established, showing that previous sharp results can be improved by restricting the class of functions considered and suggesting a close relationship between the size of the exce