ON THE INEVITABILITY OF THE CONSISTENCY OPERATOR

Authors

Abstract: We examine recursive monotonic functions on the Lindenbaum algebra of

m a t h s f E A

. We prove that no such function sends every consistent

v a r p h i

to a sentence with deductive strength strictly between

v a r p h i

and

(v a r p h i w e d g e m a t h s f C o n (v a r p h i))

. 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

m a t h s f C o n

that bounds

f

everywhere, then

f

must be somewhere equal to an iterate of

m a t h s f C o n

.

Recommendations

Cites work

Cited in

(2)

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