Hostname: page-component-7b7567c8c-8tzhz Total loading time: 0 Render date: 2026-11-19T11:03:19.386Z Has data issue: false hasContentIssue false

ON THE INEVITABILITY OF THE CONSISTENCY OPERATOR

Published online by Cambridge University Press:  14 March 2019

ANTONIO MONTALBÁN
Affiliation:
DEPARTMENT OF MATHEMATICS UNIVERSITY OF CALIFORNIA, BERKELEY BERKELEY, CA 94720, USAE-mail: antonio@math.berkeley.edu
JAMES WALSH
Affiliation:
GROUP IN LOGIC AND THE METHODOLOGY OF SCIENCE UNIVERSITY OF CALIFORNIA, BERKELEY BERKELEY, CA 94720, USAE-mail: walsh@math.berkeley.edu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We examine recursive monotonic functions on the Lindenbaum algebra of $EA$. We prove that no such function sends every consistent φ to a sentence with deductive strength strictly between φ and $\left( {\varphi\wedge Con\left( \varphi\right)} \right)$. 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 $Con$ that bounds f everywhere, then f must be somewhere equal to an iterate of $Con$.

Information

Type
Articles
Copyright
Copyright © The Association for Symbolic Logic 2019