𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Undecidable Extensions of Monadic Second Order Successor Arithmetic

✍ Scribed by Dirk Siefkes

Publisher
John Wiley and Sons
Year
1971
Tongue
English
Weight
628 KB
Volume
17
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

✦ Synopsis

TJNDEClDABLE EXTENSIONS OF MONADIC SECOND ORDER SUCCESSOR ARITHMETIC by DIRK SIEFKES in Heidelberg (GFR)

πŸ“œ SIMILAR VOLUMES

Uniform versions of some axioms of secon
Uniform versions of some axioms of second order arithmetic
✍ Nobuyuki Sakamoto; Takeshi Yamazaki πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 132 KB

## Abstract In this paper, we discuss uniform versions of some axioms of second order arithmetic in the context of higher order arithmetic. We prove that uniform versions of weak weak KΓΆnig's lemma WWKL and Ξ£^0^~1~ separation are equivalent to (βˆƒ^2^) over a suitable base theory of higher order arit

Coloring rules for finite trees, and pro
Coloring rules for finite trees, and probabilities of monadic second order sentences
✍ Alan R. Woods πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 296 KB

A system of coloring rules is a set of rules for coloring the vertices of any finite rooted tree, starting at its leaves, which has the property that the color assigned to each vertex depends only on how many of its immediate predecessors there are of each color. The asymptotic behavior of the fract