2000 character limit reached
The interpretability logic of all reasonable arithmetical theories
Published 27 Apr 2020 in math.LO | (2004.12685v1)
Abstract: This paper from 2000 is a presentation of a status qu{\ae}stionis at that tiime, to wit of the problem of the interpretability logic of {\em all}\/ reasonable arithmetical theories. We present both the arithmetical side and the modal side of the question.
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.