scientific article; zbMATH DE number 424614
From MaRDI portal
Publication:3136460
Recommendations
- Arithmetic theories for computational complexity problems
- scientific article; zbMATH DE number 1531922
- scientific article; zbMATH DE number 4114622
- scientific article; zbMATH DE number 4053608
- The computational content of arithmetical proofs
- Arithmetical definability and computational complexity
- scientific article; zbMATH DE number 1231647
- scientific article; zbMATH DE number 3966052
- scientific article; zbMATH DE number 819737
- scientific article; zbMATH DE number 1070621
Cited in
(19)- \(\text{Count}(q)\) does not imply \(\text{Count}(p)\)
- Nondeterministic stack register machines
- Cutting planes, connectivity, and threshold logic
- \(k\)-provability in \(\mathrm{PA}\)
- Efficient elimination of Skolem functions in \(\text{LK}^\text{h} \)
- Translation of resolution proofs into short first-order proofs without choice axioms
- Petr Hájek: A Scientific Biography
- Von Neumann, Gödel and complexity theory
- scientific article; zbMATH DE number 3966052 (Why is no real title available?)
- Towards NP-P via proof complexity and search
- scientific article; zbMATH DE number 1531922 (Why is no real title available?)
- Models of true arithmetic are integer parts of models of real exponentation
- VARIANTS OF KREISEL’S CONJECTURE ON A NEW NOTION OF PROVABILITY
- Where pigeonhole principles meet Koenig lemmas
- Real closed fields and models of Peano arithmetic
- Peano Corto and Peano Basso: a study of local induction in the context of weak theories
- Frege proof system and TNC°
- A dichotomy for T-convex fields with a monomial group
- Complexity barriers as independence
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3136460)
