Ranks for families of all theories of given languages

2019/01/28 by N. D. Markhabatov, Markhabatov, Nurlan, S. V. Sudoplatov +1
Computer Science · #Advanced Algebra and Logic #Computability, Logic, AI Algorithms #FOS: Mathematics #Logic (math.LO) #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.1901.09903

openalex publication_date 2019/01/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related

• Ranks for families of theories and their spectra
• Definable families of theories, related calculi and ranks
• Formulas and properties
• Expansions and restrictions of structures and theories, their hierarchies
• Ranking theories via encoded β-models