𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Ordinal notations and well-orderings in bounded arithmetic

✍ Scribed by Arnold Beckmann; Chris Pollett; Samuel R. Buss

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
244 KB
Volume
120
Category
Article
ISSN
0168-0072

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

ORDINAL NUMBERS IN ARITHMETIC PROGRESSIO
ORDINAL NUMBERS IN ARITHMETIC PROGRESSION
✍ Frederick Bagemihl; F. Bagemihl πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 209 KB

## Abstract The class of all ordinal numbers can be partitioned into two subclasses in such a way that neither subclass contains an arithmetic progression of order type Ο‰, where an arithmetic progression of order type Ο„ means an increasing sequence of ordinal numbers (ß + δγ)Ξ³<Ξ³<>r, Ξ΄ β‰  0.

Herbrandizing search problems in Bounded
Herbrandizing search problems in Bounded Arithmetic
✍ JiΕ™Γ­ Hanika πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 172 KB

We study search problems and reducibilities between them with known or potential relevance to bounded arithmetic theories. Our primary objective is to understand the sets of low complexity consequences (esp. Ξ£ b 1 or Ξ£ b 2 ) of theories S i 2 and T i 2 for a small i, ideally in a rather strong sense

Structure and definability in general bo
Structure and definability in general bounded arithmetic theories
✍ Chris Pollett πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 399 KB

The bounded arithmetic theories R i 2 ; S i 2 , and T i 2 are closely connected with complexity theory. This paper is motivated by the questions: what are the b i+1 -deΓΏnable multifunctions of R i 2 ? and when is one theory conservative over another? To answer these questions we consider theories Ri