𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Herbrand consistency in weak arithmetic

✍ Scribed by Zofia Adamowicz; Paweł Zbierski

Book ID
105842489
Publisher
Springer
Year
2001
Tongue
English
Weight
118 KB
Volume
40
Category
Article
ISSN
0933-5846

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

Consistency of Heyting arithmetic in nat
Consistency of Heyting arithmetic in natural deduction
✍ Annika Kanckos 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 153 KB 👁 1 views

## Abstract A proof of the consistency of Heyting arithmetic formulated in natural deduction is given. The proof is a reduction procedure for derivations of falsity and a vector assignment, such that each reduction reduces the vector. By an interpretation of the expressions of the vectors as ordina