{"title":"非算术环境中的亚布罗悖论","authors":"A. Karimi","doi":"10.14394/FILNAU.2019.0008","DOIUrl":null,"url":null,"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.","PeriodicalId":41424,"journal":{"name":"Filozofia Nauki","volume":" ","pages":""},"PeriodicalIF":0.3000,"publicationDate":"2019-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Yablo’s Paradoxes in Non-arithmetical Setting\",\"authors\":\"A. Karimi\",\"doi\":\"10.14394/FILNAU.2019.0008\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":41424,\"journal\":{\"name\":\"Filozofia Nauki\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.3000,\"publicationDate\":\"2019-06-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Filozofia Nauki\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.14394/FILNAU.2019.0008\",\"RegionNum\":4,\"RegionCategory\":\"哲学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"0\",\"JCRName\":\"PHILOSOPHY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Filozofia Nauki","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.14394/FILNAU.2019.0008","RegionNum":4,"RegionCategory":"哲学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"0","JCRName":"PHILOSOPHY","Score":null,"Total":0}
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.
期刊介绍:
Filozofia Nauki (The Philosophy of Science) is a double-blind peer-reviewed academic quarterly published by the Institute of Philosophy, University of Warsaw. It publishes articles, notes, and reviews covering the whole range of analytic philosophy, including among others: epistemology, ontology, general philosophy of science, philosophy of physics, philosophy of biology, philosophy of mathematics, philosophical logic, philosophy of language, philosophy of action, philosophy of mind, cognitive sciences, experimental philosophy. We invite papers not only from professional philosophers but also from specialists in different areas, interested in generalizing their scientific experiences towards more foundational issues.