scientific article; zbMATH DE number 227056

zbMATH Open0781.03047MaRDI QIDQ5286672FDOQ5286672

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

consistency interpretability bounded arithmetic model theory conservativity recursion theory incompleteness provability self-reference indicators fragments of arithmetic definable cuts reflexive theories combinatorics in fragments foundations of arithmetic of natural numbers partial truth definitions witnessing 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)

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
Proof theoretic analysis by iterated reflection
Counting as integration in feasible analysis
Skolem functions of arithmetical sentences.
Slow reflection
Provability logics relative to a fixed extension of Peano arithmetic
Partial collapses of the $\Sigma _1$ complexity hierarchy in models for fragments of bounded arithmetic
Preservation theorems for bounded formulas
On the Herbrand notion of consistency for finitely axiomatizable fragments of bounded arithmetic theories
Friedman-reflexivity
Extension and interpretability
Hierarchical incompleteness results for arithmetically definable extensions of fragments of arithmetic
A Note on Relative Efficiency of Axiom Systems
TWO NEW SERIES OF PRINCIPLES IN THE INTERPRETABILITY LOGIC OF ALL REASONABLE ARITHMETICAL THEORIES
Short propositional refutations for dense random 3CNF formulas
Arithmetical definability and computational complexity
Groundwork for weak analysis
Some upper bounds on ordinal-valued Ramsey numbers for colourings of pairs
Transfinite Progressions: A Second Look at Completeness
PREDICATIVITY THROUGH TRANSFINITE REFLECTION
Truth, disjunction, and induction
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
An algebraic treatment of quantifier-free systems of arithmetic
$\Delta_ 0$-complexity of the relation $y= \prod_{i\leq n} F(i)$
On a question of Krajewski's
Reduction games, provability and compactness
Nonstandard models that are definable in models of Peano Arithmetic
Title not available (Why is that?)
Weihrauch Complexity in Computable Analysis
Universal Rosser predicates
Unprovability results for clause set cycles
NEW RELATIONS AND SEPARATIONS OF CONJECTURES ABOUT INCOMPLETENESS IN THE FINITE DOMAIN
Logical Closure Properties of Propositional Proof Systems
On axiom schemes for $T$-provably $\Delta_1$ formulas
AXIOMATIZATIONS OF PEANO ARITHMETIC: A TRUTH-THEORETIC VIEW
A note on derivability conditions
Title not available (Why is that?)
Deflationism beyond arithmetic
On the strength of Ramsey's theorem for trees
Intrinsic reasoning about functional programs. II: Unipolar induction and primitive-recursion
The logical strength of compositional principles
Self-reference in arithmetic. II
A small reflection principle for bounded arithmetic
Some conservation results on weak König's lemma
Reference in arithmetic
Fixed points of self-embeddings of models of arithmetic
End extensions of models of linearly bounded arithmetic
Separations of first and second order theories in bounded arithmetic
On partial disjunction properties of theories containing Peano arithmetic
Some variations of the Hardy hierarchy
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

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)