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)

Positive provability logic for uniform reflection principles
A model-theoretic characterization of the weak pigeonhole principle
Solutions to the knower paradox in the light of Haack's criteria
An exponential lower bound to the size of bounded depth frege proofs of the pigeonhole principle
The self-embedding theorem of \(\text{WKL}_ 0\) and a non-standard method
Notations for exponentiation.
Mutual interpretability of Robinson arithmetic and adjunctive set theory with extensionality
Some variations of the Hardy hierarchy
Relative Truth Definability of Axiomatic Truth Theories
The logical strength of Büchi's decidability theorem
Epistemic entrenchment and arithmetical hierarchy
Extensions of the Finitist Point of View
TRUTH AND FEASIBLE REDUCIBILITY
Tarski on ``essentially richer metalanguages
A note on typed truth and consistency assertions
MÜNCHHAUSEN PROVABILITY
Local induction and provably total computable functions
Petr Hájek: A Scientific Biography
scientific article; zbMATH DE number 51556 (Why is no real title available?)
Interpretability degrees of finitely axiomatized sequential theories
On the strength of Ramsey's theorem for pairs
The equivalence of theories that characterize ALogTime
Bootstrapping. I
The strength of sharply bounded induction requires MSP
A note on predicative ordinal analysis. I. Iterated comprehension and transfinite induction
Semi-honest subrecursive degrees and the collection rule in arithmetic
Where pigeonhole principles meet Koenig lemmas
Compositional truth with propositional tautologies and quantifier-free correctness
AN ESCAPE FROM VARDANYAN’S THEOREM
Lean induction principles for tableaux
On sharply bounded length induction
Unary interpretability logics for sublogics of the interpretability logic \textbf{IL}
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
Dickson's lemma and weak Ramsey theory
Burgess’PVis Robinson’sQ
Induction rules, reflection principles, and provably recursive functions
On the uniform computational content of Ramsey's theorem
Unifying the model theory of first-order and second-order arithmetic via \(\mathrm{WKL}_0^\ast\)
Fragments of approximate counting
Deflationary truth and the ontology of expressions
Modeling sorites reasoning with adaptive fuzzy logic
Reflection calculus and conservativity spectra
On \(\mathsf{Q}\)
Graph properties checkable in linear time in the number of vertices
Other Proofs of Old Results
The Complexity of Propositional Proofs
Introduction to clarithmetic. I
On feasible numbers
Undecidability in diagonalizable algebras
Mirroring theorems in free logic
Notes on polynomially bounded arithmetic
Ekeland's variational principle in weak and strong systems of arithmetic
On inclusions between quantified provability logics
A finite model-theoretical proof of a property of bounded query classes within PH
Faith \& falsity
Fermat's last theorem and Catalan's conjecture in weak exponential arithmetics
Monomial ideals and independence of
TWO-SORTED FREGE ARITHMETIC IS NOT CONSERVATIVE
On the complexity of learning programs
Reverse mathematics: the playground of logic
Theories of initial segments of standard models of arithmetics and their complete extensions
Bounded Scott Set Saturation
Incompleteness in the finite domain
Rules and arithmetics
Extracting Algorithms from Intuitionistic Proofs
On the computational complexity of reachability in 2D binary images and some basic problems of 2D digital topology
Arithmetical interpretations and Kripke frames of predicate modal logic of provability
Provability logic: models within models in Peano arithmetic
On Brouwer's continuity principle
On Guaspari's problem about partially conservative sentences
The expressive power of truth
scientific article; zbMATH DE number 7155168 (Why is no real title available?)
The two halves of disjunctive correctness
Consistency statements and iterations of computable functions in \(\mathrm{I}\Sigma_1\) and PRA
Implicit definability of subfields
More on Systems of Truth and Predicative Comprehension
The absorption law. Or: how to Kreisel a Hilbert-Bernays-Löb
Skolem functions of arithmetical sentences.
Proof theoretic analysis by iterated reflection
Transductions in arithmetic
On the strength of Ramsey's theorem without \(\Sigma _{1}\)-induction
Saturation and Σ₂-transfer for ERNA
Slow reflection
A new proof of Ajtai's completeness theorem for nonstandard finite structures
Weak theories of concatenation and arithmetic
NONCLASSICAL TRUTH WITH CLASSICAL STRENGTH. A PROOF-THEORETIC ANALYSIS OF COMPOSITIONAL TRUTH OVER HYPE
Transfinite induction within Peano arithmetic
Counting as integration in feasible analysis
scientific article; zbMATH DE number 2236634 (Why is no real title available?)
Partial collapses of the \(\Sigma _1\) complexity hierarchy in models for fragments of bounded arithmetic
Preservation theorems for bounded formulas
SELF-REFERENCE UPFRONT: A STUDY OF SELF-REFERENTIAL GÖDEL NUMBERINGS
Concrete mathematical incompleteness: basic emulation theory
Fragment of Nonstandard Analysis with a Finitary Consistency Proof
scientific article; zbMATH DE number 964558 (Why is no real title available?)
Provability logics relative to a fixed extension of Peano arithmetic
Friedman-reflexivity
On the Herbrand notion of consistency for finitely axiomatizable fragments of bounded arithmetic theories
The structure of models of Peano 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)