scientific article; zbMATH DE number 227056

MaRDI QIDQ5286672zbMATH OpenFDO

Authors Petr Hájek, Pavel Pudlák

Publication date 6 July 1993

Recommendations

Metamathematics of first-order arithmetic
scientific article; zbMATH DE number 1215494
scientific article; zbMATH DE number 51556
A model-theoretic approach to proof theory. Edited by Zofia Adamowicz, Teresa Bigorajska and Konrad Zdanowski

Cited in

(only showing first 100 items - show all)

Tarski on ``essentially richer metalanguages
Bounded arithmetic, proof complexity and two papers of Parikh
Induction rules, reflection principles, and provably recursive functions
End extensions of models of linearly bounded arithmetic
Improved bounds on the weak pigeonhole principle and infinitely many primes from weaker axioms
Theories with self-application and computational complexity.
Skolem functions of arithmetical sentences.
On the computational complexity of reachability in 2D binary images and some basic problems of 2D digital topology
The proof-theoretic strength of Ramsey's theorem for pairs and two colors
The omega-rule interpretation of transfinite provability logic
On \(\mathsf{Q}\)
The logical strength of compositional principles
On the jumps of the degrees below a recursively enumerable degree
Fixed points of self-embeddings of models of arithmetic
Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017
Dickson's lemma and weak Ramsey theory
On partial disjunction properties of theories containing Peano arithmetic
On Brouwer's continuity principle
Intrinsic reasoning about functional programs. II: Unipolar induction and primitive-recursion
Some conservation results on weak König's lemma
A model-theoretic characterization of the weak pigeonhole principle
Notations for exponentiation.
Nonerasing, counting, and majority over the linear time hierarchy
Ordinal notations and well-orderings in bounded arithmetic
Saturated models of universal theories
Well-behaved principles alternative to bounded induction
Arithmetical definability and computational complexity
\(\Delta_ 0\)-complexity of the relation \(y= \prod_{i\leq n} F(i)\)
An algebraic treatment of quantifier-free systems of arithmetic
Transfinite induction within Peano arithmetic
Parameter free induction and provably total computable functions
Mirroring theorems in free logic
Ekeland's variational principle in weak and strong systems of arithmetic
Interpreting the compositional truth predicate in models of arithmetic
Deflationism beyond arithmetic
Infinitary action logic with exponentiation
Unprovability results for clause set cycles
Rosser provability and the second incompleteness theorem
On inclusions between quantified provability logics
On Guaspari's problem about partially conservative sentences
Reflection algebras and conservation results for theories of iterated truth
On efficiency of notations for natural numbers
Iterated multiplication in VTC^0
Friedman-reflexivity
On the strength of Ramsey's theorem for trees
Some upper bounds on ordinal-valued Ramsey numbers for colourings of pairs
End extensions of models of fragments of \(\mathrm{PA}\)
Tanaka's theorem revisited
Algebraic combinatorics in bounded induction
First-order concatenation theory with bounded quantifiers
The scope of Gödel's first incompleteness theorem
Triangular norm based predicate fuzzy logics
The predicative Frege hierarchy
R.e. Prime powers and total rigidity
Polynomial time ultrapowers and the consistency of circuit lower bounds
Induction rules in bounded arithmetic
Truth, disjunction, and induction
A new proof of Ajtai's completeness theorem for nonstandard finite structures
Fundamental notions of analysis in subsystems of second-order arithmetic
Circuit principles and weak pigeonhole variants
Separations of first and second order theories in bounded arithmetic
On arithmetic in the Cantor-Łukasiewicz fuzzy set theory
Unifying the model theory of first-order and second-order arithmetic via \(\mathrm{WKL}_0^\ast\)
Slow reflection
Interpretability degrees of finitely axiomatized sequential theories
On axiom schemes for \(T\)-provably \(\Delta_1\) formulas
Local induction and provably total computable functions
The closed fragment of the interpretability logic of PRA with a constant for I\(\Sigma^1\)
On the limit existence principles in elementary arithmetic and \(\varSigma_{n}^{0}\)-consequences of theories
A note on typed truth and consistency assertions
Effectively inseparable Boolean algebras in lattices of sentences
Extension and interpretability
Hard provability logics
Local collection and end-extensions of models of compositional truth
The absorption law. Or: how to Kreisel a Hilbert-Bernays-Löb
A few more dissimilarities between second-order arithmetic and set theory
Provability logic: models within models in Peano arithmetic
On the strength of Ramsey's theorem for pairs
Update procedures and the 1-consistency of arithmetic
Weak arithmetics and Kripke models
Interpreting weak König's lemma using the arithmetized completeness theorem
Truth definitions without exponentiation and the \(\Sigma _{1}\) collection scheme
Fragments of approximate counting
Truth and speed-up
Petr Hájek: A Scientific Biography
End-extensions of models of weak arithmetic from complexity-theoretic containments
Formalizing non-standard arguments in second-order arithmetic
A note on parameter free \(\Pi _{1}\)-induction and restricted exponentiation
Reverse mathematics and infinite traceable graphs
European Summer Meeting of the Association for Symbolic Logic, Uppsala 1991
Linear extensions of partial orders and reverse mathematics
Groundwork for weak analysis
Relative Truth Definability of Axiomatic Truth Theories
Reverse mathematics: the playground of logic
Existentially closed models in the framework of arithmetic
Consistency and the theory of truth
More on Systems of Truth and Predicative Comprehension
Theories of arithmetics in finite models
Envelopes, indicators and conservativeness
Approximate counting by hashing in bounded arithmetic

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