Saturation properties for compositional truth with propositional correctness
Bartosz Wcis{\l}o

TL;DR
This paper investigates the impact of propositional soundness on compositional truth theories, revealing that it enforces saturation-like properties that limit their conservativity over base arithmetical theories.
Contribution
It demonstrates that propositional soundness introduces saturation properties, providing new insights into the limitations of conservativity in compositional truth theories.
Findings
Propositional soundness induces saturation-like properties.
These properties impose limitations on conservativity.
The results clarify the relationship between truth principles and model properties.
Abstract
It is an open question whether compositional truth with the principle of propositional soundness ,,all arithmetical sentences which are propositional tautologies are true'' is conservative over its arithmetical base theory. In this article, we show that the principle of propositional soundness imposes some saturation-like properties on the underlying model, thus showing significant limitations to the possible conservativity proof.
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
