2000 character limit reached
Ranks for families of all theories of given languages
Published 28 Jan 2019 in math.LO | (1901.09903v1)
Abstract: For families of all theories of arbitrary given languages we describe ranks and degrees. In particular, we characterize (non-)totally transcendental families. We apply these characterizations for the families of all theories of given languages, with models of given finite or infinite cardinality.
Paper Prompts
Sign up for free to create and run prompts on this paper.