scientific article; zbMATH DE number 227056

zbMATH Open0781.03047MaRDI QIDQ5286672FDOQ5286672

Authors: Petr Hájek, Pavel Pudlák 

Publication date: 6 July 1993

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

consistencyinterpretabilitybounded arithmeticmodel theoryconservativityrecursion theoryincompletenessprovabilityself-referenceindicatorsfragments of arithmeticdefinable cutsreflexive theoriescombinatorics in fragmentsfoundations of arithmetic of natural numberspartial truth definitionswitnessing functions

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) First-order arithmetic and fragments (03F30) Complexity of computation (including implicit computational complexity) (03D15)

Cited In (only showing first 100 items - show all)

• Positive provability logic for uniform reflection principles
• Relative Truth Definability of Axiomatic Truth Theories
• The self-embedding theorem of \(\text{WKL}_ 0\) and a non-standard method
• Extensions of the Finitist Point of View
• Title not available (Why is that?)
• On the strength of Ramsey's theorem for pairs
• A note on typed truth and consistency assertions
• Burgess’PVis Robinson’sQ
• Bootstrapping. I
• The strength of sharply bounded induction requires MSP
• On the uniform computational content of Ramsey's theorem
• Induction rules, reflection principles, and provably recursive functions
• The Complexity of Propositional Proofs
• Other Proofs of Old Results
• Deflationary truth and the ontology of expressions
• On \(\mathsf{Q}\)
• Notes on polynomially bounded arithmetic
• Graph properties checkable in linear time in the number of vertices
• Undecidability in diagonalizable algebras
• A finite model-theoretical proof of a property of bounded query classes within PH
• Introduction to clarithmetic. I
• Incompleteness in the finite domain
• Reverse mathematics: the playground of logic
• Rules and arithmetics
• Arithmetical interpretations and Kripke frames of predicate modal logic of provability
• Theories of initial segments of standard models of arithmetics and their complete extensions
• The expressive power of truth
• On the computational complexity of reachability in 2D binary images and some basic problems of 2D digital topology
• Implicit definability of subfields
• On the strength of Ramsey's theorem without \(\Sigma _{1}\)-induction
• Saturation and Σ₂-transfer for ERNA
• A new proof of Ajtai's completeness theorem for nonstandard finite structures
• Transductions in arithmetic
• Transfinite induction within Peano arithmetic
• Weak theories of concatenation and arithmetic
• Fragment of Nonstandard Analysis with a Finitary Consistency Proof
• The structure of models of Peano arithmetic
• On the jumps of the degrees below a recursively enumerable degree
• Minimal truth and interpretability
• The incompleteness theorems after 70 years
• Axiomatic truth, syntax and metatheoretic reasoning
• Fragments of Heyting arithmetic
• Classifying the Provably Total Functions of PA
• The strength of extensionality. II: Weak weak set theories without infinity
• Theories of arithmetics in finite models
• Predicative logic and formal arithmetic
• The predicative Frege hierarchy
• Saturated models of universal theories
• Approximate counting in bounded arithmetic
• Formalizing non-standard arguments in second-order arithmetic
• Elementary patterns of resemblance
• Categorical characterizations of the natural numbers require primitive recursion
• On arithmetic in the Cantor-Łukasiewicz fuzzy set theory
• On the possibilistic approach to linear regression models involving uncertain, indeterminate or interval data
• A new proof of the weak pigeonhole principle
• Triangular norm based predicate fuzzy logics
• Independence results for variants of sharply bounded induction
• The omega-rule interpretation of transfinite provability logic
• The canonical Ramsey theorem and computability theory
• Nonerasing, counting, and majority over the linear time hierarchy
• The proof-theoretic strength of Ramsey's theorem for pairs and two colors
• 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\)
• Theories with self-application and computational complexity.
• A Model-Theoretic Property of Sharply Bounded Formulae, with some Applications
• Linear extensions of partial orders and reverse mathematics
• Fundamental notions of analysis in subsystems of second-order arithmetic
• Effectively inseparable Boolean algebras in lattices of sentences
• Parameter free induction and provably total computable functions
• Construction of models of bounded arithmetic by restricted reduced powers
• Bounded arithmetic, proof complexity and two papers of Parikh
• On predicate provability logics and binumerations of fragments of Peano arithmetic
• Induction rules in bounded arithmetic
• Algorithmic randomness, reverse mathematics, and the dominated convergence theorem
• Ordinal notations and well-orderings in bounded arithmetic
• Well-behaved principles alternative to bounded induction
• Update procedures and the 1-consistency of arithmetic
• Consistency and the theory of truth
• Arithmetic on semigroups
• An exponential lower bound to the size of bounded depth frege proofs of the pigeonhole principle
• Notes on the computational aspects of Kripke's theory of truth
• Proof lengths for instances of the Paris-Harrington principle
• The logical strength of Büchi's decidability theorem
• TRUTH AND FEASIBLE REDUCIBILITY
• Local induction and provably total computable functions
• Epistemic entrenchment and arithmetical hierarchy
• Tarski on ``essentially richer metalanguages
• Interpretability degrees of finitely axiomatized sequential theories
• The equivalence of theories that characterize ALogTime
• Reflection calculus and conservativity spectra
• 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
• Unifying the model theory of first-order and second-order arithmetic via \(\mathrm{WKL}_0^\ast\)
• Fragments of approximate counting
• Modeling sorites reasoning with adaptive fuzzy logic
• Faith \& falsity
• Provability logic: models within models in Peano arithmetic
• On Brouwer's continuity principle
• Consistency statements and iterations of computable functions in \(\mathrm{I}\Sigma_1\) and PRA

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)