PL EN


Journal
2019 | 27 | 2(106) | 5-15
Article title

Yablo’s Paradoxes in Non-arithmetical Setting

Authors
Content
Title variants
Languages of publication
EN
Abstracts
EN
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.
Journal
Year
Volume
27
Issue
Pages
5-15
Physical description
Contributors
author
  • Department of Mathematics, Behbahan Khatam Alanbia University of Technology, Behbahan, Iran, karimi@bkatu.ac.ir
References
Document Type
Publication order reference
Identifiers
YADDA identifier
bwmeta1.element.desklight-076574a8-6d12-4656-97de-1fae22ea9dd1
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.