Extensional Independence
Taishi Kurahashi, Albert Visser

TL;DR
This paper investigates the existence of extensional formulas that are independent over PA, proving non-existence for certain types and providing positive results under weaker conditions, advancing understanding of independence and extensionality in formal theories.
Contribution
It establishes the non-existence of extensional Rosser formulas of any complexity and offers positive results for weaker forms like Consistent Extensionality and Conditional Extensionality.
Findings
No extensional Rosser formulas of any complexity exist.
Positive results for formulas satisfying Consistent Extensionality.
Negative results for intensional versions under Conditional Extensionality.
Abstract
Joel Hamkins asks whether there is a -formula such that is independent over , if this theory is consistent, where this construction is extensional in with respect to -provable equivalence. We show that there can be no such extensional Rosser formula of any complexity. We give a positive answer to Hamkins' question for the case where we replace Extensionality by a weaker demand *Consistent Extensionality*. We also prove that we can demand the negation of to be -conservative, if we ask for the still weaker *Conditional Extensionality*. We show that an intensional version of the result for Conditional Extensionality cannot work.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRough Sets and Fuzzy Logic
