2000 character limit reached
Rosser provability and the second incompleteness theorem
Published 19 Feb 2019 in math.LO | (1902.06863v2)
Abstract: This paper is a continuation of Arai's paper on derivability conditions for Rosser provability predicates. We investigate the limitations of the second incompleteness theorem by constructing three different Rosser provability predicates satisfying several derivability conditions.
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.