Yablo’s Paradoxes in Non-arithmetical Setting

Abstract

Proving a paradox from very weak assumptions helps us to reveal what the source of the paradox is. We introduce a weak non-arithmetical theory in a language of predicate logic and give proofs for various versions of Yablo’s paradox in this weak system. We prove Always, Sometimes, Almost ,Always, and Infinitely Often versions of Yablo’s paradox in the presented weak axiom system, which is much weaker than the arithmetical setting.