On Guaspari's problem about partially conservative sentences
Taishi Kurahashi, Yuya Okawa, V. Yu. Shavrukov, Albert Visser

TL;DR
This paper extends the understanding of partially conservative sentences over multiple theories, providing necessary and sufficient conditions for their existence and solving a specific case of Guaspari's problem.
Contribution
It generalizes Bennet's results to more than two theories and constructs sentences with specific unprovability and conservativity properties across finite families of theories.
Findings
Existence of $ ext{Pi}_n$ sentences unprovable in each theory
Existence of $ ext{Sigma}_n$ sentences conservative over each theory
Several non-implication results among properties of theory families
Abstract
We investigate sentences which are simultaneously partially conservative over several theories. First, we generalize Bennet's results on this topic to the case of more than two theories. In particular, for any finite family of consistent r.e. extensions of Peano Arithmetic, we give a necessary and sufficient condition for the existence of a sentence which is unprovable in and -conservative over for all . Secondly, we prove that for any finite family of such theories, there exists a sentence which is simultaneously unprovable and -conservative over each of these theories. This constitutes a positive solution to a particular case of Guaspari's problem. Finally, we demonstrate several non-implications among related properties of families of theories.
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.
