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)

On quasitautologies
Extension and interpretability
MODEL THEORY AND PROOF THEORY OF THE GLOBAL REFLECTION PRINCIPLE
A theory for Log-Space and NLIN versus co-NLIN
Parallel strategies
Local collection and end-extensions of models of compositional truth
Reflection algebras and conservation results for theories of iterated truth
The incompleteness theorems after 70 years
On the jumps of the degrees below a recursively enumerable degree
Hierarchical incompleteness results for arithmetically definable extensions of fragments of arithmetic
On efficiency of notations for natural numbers
A Note on Relative Efficiency of Axiom Systems
Reverse mathematics and infinite traceable graphs
Minimal truth and interpretability
Maximum Schemes in Arithmetic
Axiomatic truth, syntax and metatheoretic reasoning
Short propositional refutations for dense random 3CNF formulas
Pell Equations and Weak Regularity Principles
Revisiting the conservativity of fixpoints over intuitionistic arithmetic
TWO NEW SERIES OF PRINCIPLES IN THE INTERPRETABILITY LOGIC OF ALL REASONABLE ARITHMETICAL THEORIES
Arithmetical definability and computational complexity
Metamathematics of first-order arithmetic
The strength of extensionality. II: Weak weak set theories without infinity
Classifying the Provably Total Functions of PA
Fragments of Heyting arithmetic
Groundwork for weak analysis
Lewisian fixed points. I: Two incomparable constructions
The scope of Gödel's first incompleteness theorem
Incompleteness for higher-order arithmetic. An example based on Harrington's principle
First-order reasoning and efficient semi-algebraic proofs
Theories of arithmetics in finite models
Relatively Recursively Enumerable Versus Relatively Σ₁ in Models of Peano Arithmetic
Iterated multiplication in $VTC^0$
Hard provability logics
The interpretation existence lemma
The small-is-very-small principle
Predicative logic and formal arithmetic
The predicative Frege hierarchy
On the finite axiomatizability of $\forall\hat{\Sigma}^{\mathrm{b}}_1 (\hat{\mathsf{R}}^1_2)$
European Summer Meeting of the Association for Symbolic Logic, Uppsala 1991
Interpreting the compositional truth predicate in models of arithmetic
Incompleteness of boundedly axiomatizable theories
Some upper bounds on ordinal-valued Ramsey numbers for colourings of pairs
Saturated models of universal theories
EXTENDED FRAMES AND SEPARATIONS OF LOGICAL PRINCIPLES
Transfinite Progressions: A Second Look at Completeness
Truth, disjunction, and induction
Circuit principles and weak pigeonhole variants
PREDICATIVITY THROUGH TRANSFINITE REFLECTION
Formalizing non-standard arguments in second-order arithmetic
Approximate counting in bounded arithmetic
On Overspill Principles and Axiom Schemes for Bounded Formulas
Algebraic combinatorics in bounded induction
Elementary patterns of resemblance
Existentially closed models in the framework of arithmetic
End-extensions of models of weak arithmetic from complexity-theoretic containments
Weak forms of the Regularity Principle in the presence of \documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}$\bf {\mathsf {I}{\mathrm{E}}_1}$\end{document}
Approximate counting by hashing in bounded arithmetic
Weak arithmetics and Kripke models
Marginalia on a theorem of Woodin
Categorical characterizations of the natural numbers require primitive recursion
On the possibilistic approach to linear regression models involving uncertain, indeterminate or interval data
On arithmetic in the Cantor-Łukasiewicz fuzzy set theory
R.e. Prime powers and total rigidity
Self-embeddings of models of arithmetic; fixed points, small submodels, and extendability
A CLASSICAL MODAL THEORY OF LAWLESS SEQUENCES
An algebraic treatment of quantifier-free systems of arithmetic
$\Delta_ 0$-complexity of the relation $y= \prod_{i\leq n} F(i)$
Envelopes, indicators and conservativeness
Triangular norm based predicate fuzzy logics
A fortuitous year with Leon Henkin
On a question of Krajewski's
The prime number theorem is PRA-provable
A new proof of the weak pigeonhole principle
scientific article; zbMATH DE number 713985 (Why is no real title available?)
Reduction games, provability and compactness
Polynomial time ultrapowers and the consistency of circuit lower bounds
Independence results for variants of sharply bounded induction
On End‐Extensions of Models of ¬exp
Nonstandard models that are definable in models of Peano Arithmetic
scientific article; zbMATH DE number 4099294 (Why is no real title available?)
Infinitary action logic with exponentiation
The omega-rule interpretation of transfinite provability logic
A model of $\widehat{R}^2_3$ inside a subexponential time resource
Unprovability results for clause set cycles
Weihrauch Complexity in Computable Analysis
Nonerasing, counting, and majority over the linear time hierarchy
On end extensions of models of subsystems of Peano arithmetic
Universal Rosser predicates
Interpreting weak König's lemma using the arithmetized completeness theorem
NEW RELATIONS AND SEPARATIONS OF CONJECTURES ABOUT INCOMPLETENESS IN THE FINITE DOMAIN
The canonical Ramsey theorem and computability theory
Logical Closure Properties of Propositional Proof Systems
The proof-theoretic strength of Ramsey's theorem for pairs and two colors
A note on Σ₁-maximal models
On the limit existence principles in elementary arithmetic and $\varSigma_{n}^{0}$-consequences of theories
The closed fragment of the interpretability logic of PRA with a constant for I$\Sigma^1$
Truth and speed-up
On axiom schemes for $T$-provably $\Delta_1$ formulas
On collection schemes and Gaifman's splitting theorem

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)