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 a question of Krajewski's
Friedman-reflexivity
On Brouwer's continuity principle
Separations of first and second order theories in bounded arithmetic
Improved bounds on the weak pigeonhole principle and infinitely many primes from weaker axioms
Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017
Reflection calculus and conservativity spectra
Dickson's lemma and weak Ramsey theory
Extension and interpretability
Self-reference in arithmetic. II
Hierarchical incompleteness results for arithmetically definable extensions of fragments of arithmetic
Fixed points of self-embeddings of models of arithmetic
The equivalence of theories that characterize ALogTime
Universal Rosser predicates
Weak arithmetics and Kripke models
End extensions of models of linearly bounded arithmetic
A small reflection principle for bounded arithmetic
Some upper bounds on ordinal-valued Ramsey numbers for colourings of pairs
Unifying the model theory of first-order and second-order arithmetic via $\mathrm{WKL}_0^\ast$
Fragments of approximate counting
Transfinite Progressions: A Second Look at Completeness
Reduction games, provability and compactness
The logical strength of Büchi's decidability theorem
Unprovability results for clause set cycles
On the strength of Ramsey's theorem for trees
Local induction and provably total computable functions
Counting as integration in feasible analysis
Some conservation results on weak König's lemma
Short propositional refutations for dense random 3CNF formulas
Skolem functions of arithmetical sentences.
Groundwork for weak analysis
NEW RELATIONS AND SEPARATIONS OF CONJECTURES ABOUT INCOMPLETENESS IN THE FINITE DOMAIN
Provability logics relative to a fixed extension of Peano arithmetic
AXIOMATIZATIONS OF PEANO ARITHMETIC: A TRUTH-THEORETIC VIEW
Epistemic entrenchment and arithmetical hierarchy
On partial disjunction properties of theories containing Peano arithmetic
Reference in arithmetic
A note on derivability conditions
Partial collapses of the $\Sigma _1$ complexity hierarchy in models for fragments of bounded arithmetic
Preservation theorems for bounded formulas
PREDICATIVITY THROUGH TRANSFINITE REFLECTION
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}
Tarski on ``essentially richer metalanguages
Consistency statements and iterations of computable functions in $\mathrm{I}\Sigma_1$ and PRA
An algebraic treatment of quantifier-free systems of arithmetic
Intrinsic reasoning about functional programs. II: Unipolar induction and primitive-recursion
Slow reflection
On axiom schemes for $T$-provably $\Delta_1$ formulas
Interpretability degrees of finitely axiomatized sequential theories
A Note on Relative Efficiency of Axiom Systems
Arithmetical definability and computational complexity
scientific article; zbMATH DE number 1390282 (Why is no real title available?)
Faith \& falsity
Logical Closure Properties of Propositional Proof Systems
Provability logic: models within models in Peano arithmetic
TRUTH AND FEASIBLE REDUCIBILITY
On the Herbrand notion of consistency for finitely axiomatizable fragments of bounded arithmetic theories
Nonstandard models that are definable in models of Peano Arithmetic
Deflationism beyond arithmetic
Proof theoretic analysis by iterated reflection
The logical strength of compositional principles
Truth, disjunction, and induction
Modeling sorites reasoning with adaptive fuzzy logic
$\Delta_ 0$-complexity of the relation $y= \prod_{i\leq n} F(i)$
TWO NEW SERIES OF PRINCIPLES IN THE INTERPRETABILITY LOGIC OF ALL REASONABLE ARITHMETICAL THEORIES
Some variations of the Hardy hierarchy
Weihrauch Complexity in Computable Analysis
Approximate counting by hashing in bounded arithmetic
scientific article; zbMATH DE number 4099294 (Why is no real title available?)
Implicit definability of subfields
Arithmetical interpretations and Kripke frames of predicate modal logic of provability
Fragments of Heyting arithmetic
On arithmetic in the Cantor-Łukasiewicz fuzzy set theory
On the strength of Ramsey's theorem without $\Sigma _{1}$-induction
Triangular norm based predicate fuzzy logics
The structure of models of Peano arithmetic
On $\mathsf{Q}$
Formalizing non-standard arguments in second-order arithmetic
Positive provability logic for uniform reflection principles
The strength of extensionality. II: Weak weak set theories without infinity
Classifying the Provably Total Functions of PA
Well-behaved principles alternative to bounded induction
Predicative logic and formal arithmetic
Update procedures and the 1-consistency of arithmetic
Weak theories of concatenation and arithmetic
Theories of initial segments of standard models of arithmetics and their complete extensions
On the possibilistic approach to linear regression models involving uncertain, indeterminate or interval data
Arithmetic on semigroups
Elementary patterns of resemblance
The proof-theoretic strength of Ramsey's theorem for pairs and two colors
Theories with self-application and computational complexity.
Induction rules, reflection principles, and provably recursive functions
Graph properties checkable in linear time in the number of vertices
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$
Notes on polynomially bounded arithmetic
Fundamental notions of analysis in subsystems of second-order arithmetic
scientific article; zbMATH DE number 51556 (Why is no real title available?)
Saturation and Σ₂-transfer for ERNA
Relative Truth Definability of Axiomatic Truth Theories

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)