2000 character limit reached
Truth and collection
Published 28 Mar 2024 in math.LO | (2403.19367v1)
Abstract: Answering a question of Kaye, we show that the compositional truth theory with a full collection scheme is conservative over Peano Arithmetic. We demonstrate it by showing that countable models of compositional truth which satisfy the internal induction or collection axioms can be end-extended to models of the respective theory.
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.