ON THE INEVITABILITY OF THE CONSISTENCY OPERATOR

DOI10.1017/JSL.2018.65zbMATH Open1456.03091arXiv1708.07615OpenAlexW2750112826WikidataQ128296852 ScholiaQ128296852MaRDI QIDQ4628679FDOQ4628679

Authors:

Publication date: 15 March 2019

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

Abstract: We examine recursive monotonic functions on the Lindenbaum algebra of $mathsfEA$. We prove that no such function sends every consistent $varphi$ to a sentence with deductive strength strictly between $varphi$ and $(varphiwedgemathsfCon(varphi))$. We generalize this result to iterates of consistency into the effective transfinite. We then prove that for any recursive monotonic function $f$, if there is an iterate of $mathsfCon$ that bounds $f$ everywhere, then $f$ must be somewhere equal to an iterate of $mathsfCon$.

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

Recommendations

• A note on the consistency operator
• Evitable iterates of the consistency operator
• On consistent operators and reflexivity
• On the composability of consistency conditions
• Consistency, optimality, and incompleteness
• On the consistency of consistent conjectures
• Consistency and its converse: an introduction
• Consistency, completeness, and classicality
• Towards a Theory of Consistency Primitives
• Note on universal conditional consistency

zbMATH Keywords

consistencyreflection principles

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Gödel numberings and issues of incompleteness (03F40)

Cites Work

• Proof-theoretic analysis by iterated reflection
• Provability algebras and proof-theoretic ordinals. I
• Reflection principles and provability algebras in formal arithmetic
• Slow consistency
• Title not available (Why is that?)
• Recursive Pseudo-Well-Orderings
• Iterated local reflection versus iterated consistency
• Incompleteness along paths in progressions of theories
• Deduction-preserving "Recursive Isomorphisms" between theories
• On the structure of the degrees of relative provability
• Turing-Taylor expansions for arithmetic theories
• Title not available (Why is that?)
• Provability logics for natural Turing progressions of arithmetical theories
• Uniform density in Lindenbaum algebras

Cited In (2)

• Evitable iterates of the consistency operator
• A note on the consistency operator

This page was built for publication: ON THE INEVITABILITY OF THE CONSISTENCY OPERATOR

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