Numeral completeness of weak theories of arithmetic

DOI10.1093/LOGCOM/EXAD075MaRDI QIDQ6915783zbMATH OpenFDO

Authors Reinhard Kahle, Isabel Oitavem, P. G. Santos

Publication date 15 October 2025

Published in Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/LOGCOM/EXAD075

zbMATH Keywords

metamathematicsnumeral completenessweak theory of arithmetic

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Cites work

• A New Hierarchy of Elementary Functions
• A new perspective on completeness and finitist consistency
• A proof-theoretic analysis of collection
• A small reflection principle for bounded arithmetic
• Another look at the second incompleteness theorem
• Arithmetical soundness and completeness for \(\Sigma_{2}\) numerations
• Arithmetization of metamathematics in a general setting
• Generalizations of Gödel's incompleteness theorems for \(\Sigma_n\)-definable theories of arithmetic
• Gödel-Rosser's incompleteness theorem, generalized and optimized for definable theories
• Handbook of proof theory
• Herbrand analyses
• scientific article; zbMATH DE number 4004177 (Why is no real title available?)
• scientific article; zbMATH DE number 4006252 (Why is no real title available?)
• scientific article; zbMATH DE number 4059391 (Why is no real title available?)
• scientific article; zbMATH DE number 3583767 (Why is no real title available?)
• scientific article; zbMATH DE number 1144041 (Why is no real title available?)
• scientific article; zbMATH DE number 910749 (Why is no real title available?)
• Induction rules, reflection principles, and provably recursive functions
• Interpretability suprema in Peano arithmetic
• On Gödel's theorems on lengths of proofs I: Number of lines and speedup for arithmetics
• On the number of steps in proofs
• On the proof complexity of deep inference
• Peano Corto and Peano Basso: a study of local induction in the context of weak theories
• Propositional proof systems, the consistency of first order theories and the complexity of computations
• Provability logics relative to a fixed extension of Peano arithmetic
• Representability op recursively enumerable sets in formal theories
• The absorption law. Or: how to Kreisel a Hilbert-Bernays-Löb
• The interpretability logic of all reasonable arithmetical theories. The new conjecture
• The relative efficiency of propositional proof systems

This page was built for publication: Numeral completeness of weak theories of arithmetic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6915783)