A MATHEMATICAL COMMITMENT WITHOUT COMPUTATIONAL STRENGTH

DOI10.1017/S1755020321000265MaRDI QIDQ5046601

Anton Freund

Publication date: 8 November 2022

Published in: The Review of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2004.06915

zbMATH Keywords

independencepolynomial-time algorithmKruskal's theoremGödel's second incompleteness theoremHilbert's programcomputational strength

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Philosophical and critical aspects of logic and foundations (03A05) First-order arithmetic and fragments (03F30) Gödel numberings and issues of incompleteness (03F40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph minors. XX: Wagner's conjecture
• Proof theory. The first step into impredicativity
• Harvey Friedman's research on the foundations of mathematics
• Proof theory. 2nd ed
• Proof-theoretic investigations on Kruskal's theorem
• Logic, language and computation. Festschrift in Honor of Satoru Takasu
• Elementary descent recursion and proof theory
• Provability algebras and proof-theoretic ordinals. I
• Transfinite induction within Peano arithmetic
• Short proofs for slow consistency
• Notation systems for infinitary derivations
• On the limit existence principles in elementary arithmetic and \(\varSigma_{n}^{0}\)-consequences of theories
• Beweisbarkeit und Unbeweisbarkeit von Anfangsfällen der transfiniten Induktion in der reinen Zahlentheorie
• Reflection principles and provability algebras in formal arithmetic
• David Hilbert's Lectures on the Foundations of Arithmetic and Logic 1917-1933
• On Partially Conservative Sentences and Interpretability
• Nonconstructive tools for proving polynomial-time decidability
• Ordinal numbers and the Hilbert basis theorem
• On Well-Partial-Order Theory and Its Application to Combinatorial Problems of VLSI Design
• Bounds for the closure ordinals of replete monotonic increasing functions
• A Short Proof of Two Recently Discovered Independence Results Using Recursion Theoretic Methods
• Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
• Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems
• The consistency of arithmetics

This page was built for publication: A MATHEMATICAL COMMITMENT WITHOUT COMPUTATIONAL STRENGTH