Witnessing flows in arithmetic
From MaRDI portal
Cites work
- A Characterisation of Definable NP Search Problems in Peano Arithmetic
- An Application of Boolean Complexity to Separation Problems in Bounded Arithmetic
- Bounded arithmetic and the polynomial hierarchy
- Characterising definable search problems in bounded arithmetic via proof notations
- Elementary descent recursion and proof theory
- Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem
- scientific article; zbMATH DE number 440477 (Why is no real title available?)
- scientific article; zbMATH DE number 4059391 (Why is no real title available?)
- scientific article; zbMATH DE number 3769614 (Why is no real title available?)
- scientific article; zbMATH DE number 3557241 (Why is no real title available?)
- scientific article; zbMATH DE number 1215493 (Why is no real title available?)
- scientific article; zbMATH DE number 1215494 (Why is no real title available?)
- scientific article; zbMATH DE number 1215495 (Why is no real title available?)
- scientific article; zbMATH DE number 1215497 (Why is no real title available?)
- scientific article; zbMATH DE number 1215498 (Why is no real title available?)
- scientific article; zbMATH DE number 733384 (Why is no real title available?)
- scientific article; zbMATH DE number 1070621 (Why is no real title available?)
- scientific article; zbMATH DE number 1088186 (Why is no real title available?)
- scientific article; zbMATH DE number 1870411 (Why is no real title available?)
- scientific article; zbMATH DE number 819737 (Why is no real title available?)
- scientific article; zbMATH DE number 1390277 (Why is no real title available?)
- Improved witnessing and local improvement principles for second-order bounded arithmetic
- Notation systems for infinitary derivations
- NP search problems in low fragments of bounded arithmetic
- On the interpretation of non-finitist proofs–Part II
- Ordinal notations and well-orderings in bounded arithmetic
- Polynomial local search in the polynomial hierarchy and witnessing in fragments of bounded arithmetic
- Provability algebras and proof-theoretic ordinals. I
- Quantified propositional calculi and fragments of bounded arithmetic
- The NP search problems of Frege and extended Frege proofs
- The provably total NP search problems of weak second order bounded arithmetic
- The provably total search problems of bounded arithmetic
This page was built for publication: Witnessing flows in arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6646013)