End extensions of models of linearly bounded arithmetic
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 440487 (Why is no real title available?)
- scientific article; zbMATH DE number 4137758 (Why is no real title available?)
- scientific article; zbMATH DE number 819737 (Why is no real title available?)
- scientific article; zbMATH DE number 227056 (Why is no real title available?)
- Combinatorial principles in elementary number theory
- Counting $Δ_0$ sets
- Notes on polynomially bounded arithmetic
- On the scheme of induction for bounded arithmetic formulas
- Provability of the pigeonhole principle and the existence of infinitely many primes
- Relating the bounded arithmetic and polynomial time hierarchies
Cited in
(5)- A theory for Log-Space and NLIN versus co-NLIN
- Iterated multiplication in \(VTC^0\)
- End-extensions of models of weak arithmetic from complexity-theoretic containments
- Truth definitions without exponentiation and the \(\Sigma _{1}\) collection scheme
- Separations of first and second order theories in bounded arithmetic
This page was built for publication: End extensions of models of linearly bounded arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1377910)