2000 character limit reached
Shepherdson's theorems for fragments of open induction
Published 8 Jan 2017 in math.LO | (1701.02001v1)
Abstract: By a well-known result of Shepherdson, models of the theory IOpen (a first order arithmetic containing the scheme of induction for all quantifier free formulas) are exactly all the discretely ordered semirings that are integer parts of their real closures. In this paper we prove several analogous results that provide algebraic equivalents to various fragments of IOpen.
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.