2000 character limit reached
Saturation properties for compositional truth with propositional correctness
Published 22 May 2024 in math.LO | (2405.13942v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.