Hierarchies of Subsystems of Weak Arithmetic
From MaRDI portal
Abstract: We completely characterize the logical hierarchy of various subsystems of weak arithmetic, namely: ZR, ZR + N, ZR + GCD, ZR + Bez, OI + N, OI + GCD, OI + Bez.
Recommendations
- Diophantine equations in fragments in arithmetic
- scientific article; zbMATH DE number 1827828
- scientific article; zbMATH DE number 1215494
- scientific article; zbMATH DE number 4039892
- scientific article; zbMATH DE number 4023274
- scientific article; zbMATH DE number 4099294
- scientific article; zbMATH DE number 4091496
- An algebraic treatment of quantifier-free systems of arithmetic
- Metamathematics of first-order arithmetic
- The joint embedding property in normal open induction
Cited in
(6)- Nonstandard Models for a Fragment of the Arithmetic and Their Decision Problem
- scientific article; zbMATH DE number 4051591 (Why is no real title available?)
- Prime numbers and factorization in IE1 and weaker systems
- The strength of replacement in weak arithmetic
- A note on subsystems of open induction
- Weak arithmetics
This page was built for publication: Hierarchies of Subsystems of Weak Arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3118398)