𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Accumulation of switchings in search problems

✍ Scribed by L. V. Lokutsievskii

Publisher
Springer US
Year
2008
Tongue
English
Weight
136 KB
Volume
151
Category
Article
ISSN
1573-8795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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