scientific article; zbMATH DE number 3784875

Cited in

(39)

Models of arithmetic and categories with finiteness conditions
On the scheme of induction for bounded arithmetic formulas
Combinatorial principles in elementary number theory
On some formalized conservation results in arithmetic
A direct method for simulating partial recursive functions by Diophantine equations
The prime number theorem and fragments of PA
On induction-free provability
Induction rules, reflection principles, and provably recursive functions
Toward the limits of the Tennenbaum phenomenon
Improved bounds on the weak pigeonhole principle and infinitely many primes from weaker axioms
Non-standard finite fields over \(I\Delta_0+\Omega_1\)
Fixed points of self-embeddings of models of arithmetic
\(\Delta_ 0\)-complexity of the relation \(y= \prod_{i\leq n} F(i)\)
Transfinite induction within Peano arithmetic
Pell equations and exponentiation in fragments of arithmetic
Algebraic combinatorics in bounded induction
R.e. Prime powers and total rigidity
Model-theoretic applications of cofinality spectrum problems
End extensions of models of weak arithmetic theories
Division by zero
Cofinality spectrum theorems in model theory, set theory, and general topology
On Extensions of Models of Strong Fragments of Arithmetic
Proof theoretic analysis by iterated reflection
A theory for Log-Space and NLIN versus co-NLIN
Categorical characterizations of the natural numbers require primitive recursion
The de Jongh property for basic arithmetic
Where pigeonhole principles meet Koenig lemmas
Cofinal elementary extensions
Diophantine induction
ON SHAVRUKOV’S NON-ISOMORPHISM THEOREM FOR DIAGONALIZABLE ALGEBRAS
Varieties of truth definitions
Incompleteness of boundedly axiomatizable theories
Hilbert's tenth problem for weak theories of arithmetic
Enumerating error bounded polytime algorithms through arithmetical theories
A parameterized halting problem, _0 truth and the MRDP theorem
The provably total functions of basic arithmetic and its extensions
Partial collapses of the \(\Sigma _1\) complexity hierarchy in models for fragments of bounded arithmetic
Exponentiation and second-order bounded arithmetic
\(S_{k,\text{exp}}\) does not prove \(\text{NP} = \text{co-NP}\) uniformly

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 Q3962995)