A robuster Scott rank

DOI10.1090/proc/12669zbMath1386.03053OpenAlexW1972311151MaRDI QIDQ3450085

Antonio Montalbán

Publication date: 2 November 2015

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/1076498b8cb22f79390019bfdefc6243d29b6123

Mathematics Subject Classification ID

Other infinitary logic (03C75) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items

Scott ranks of models of a theory, AN INTRODUCTION TO THE SCOTT COMPLEXITY OF COUNTABLE STRUCTURES AND A SURVEY OF RECENT RESULTS, COMPUTABLE POLISH GROUP ACTIONS, ASSIGNING AN ISOMORPHISM TYPE TO A HYPERDEGREE, The 𝜔-Vaught’s conjecture, Generically Computable abelian groups, Effectively Existentially-Atomic Structures, Revisiting Uniform Computable Categoricity: For the Sixtieth Birthday of Prof. Rod Downey, Complexity of Scott sentences, BOREL FUNCTORS AND INFINITARY INTERPRETATIONS, Finitely generated groups are universal among finitely generated structures, DEGREES OF CATEGORICITY ON A CONE VIAη-SYSTEMS, THE COMPLEXITY OF SCOTT SENTENCES OF SCATTERED LINEAR ORDERS, Computable analysis and classification problems, SCOTT COMPLEXITY OF COUNTABLE STRUCTURES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounds on weak scattering
• Complexity ranks of countable models
• Generic copies of countable structures
• Autostability of models and Abelian groups
• Autostability of models
• Effective choice for relations and reducibilities in classes of constructive and positive models
• Computable structures and the hyperarithmetical hierarchy
• Categoricity in hyperarithmetical degrees
• The computable dimension of ordered abelian groups
• Subspaces of computable vector spaces
• Effective categoricity of equivalence structures
• Model theory for infinitary logic. Logic with countable conjunctions and finite quantifiers
• Counting the back-and-forth types
• Effective Categoricity of Injection Structures
• On the $n$-back-and-forth types of Boolean algebras
• Computable categoricity of trees of finite height
• Recursively Categorical Linear Orderings
• Admissible Sets and Structures
• An interpolation theorem for denumerably long formulas
• Effective model theory vs. recursive model theory