A robuster Scott rank

DOI10.1090/PROC/12669MaRDI QIDQ3450085zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• SCOTT COMPLEXITY OF COUNTABLE STRUCTURES
• An introduction to the Scott complexity of countable structures and a survey of recent results
• Some new computable structures of high rank
• Scott ranks of models of a theory
• Categoricity of computable infinitary theories

Cites work

• Admissible Sets and Structures
• An interpolation theorem for denumerably long formulas
• Autostability of models
• Autostability of models and Abelian groups
• Bounds on weak scattering
• Categoricity in hyperarithmetical degrees
• Complexity ranks of countable models
• Computable categoricity of trees of finite height
• Computable structures and the hyperarithmetical hierarchy
• Counting the back-and-forth types
• Effective categoricity of equivalence structures
• Effective Categoricity of Injection Structures
• Effective choice for relations and reducibilities in classes of constructive and positive models
• Effective model theory vs. recursive model theory
• Generic copies of countable structures
• scientific article; zbMATH DE number 3767640 (Why is no real title available?)
• scientific article; zbMATH DE number 3572144 (Why is no real title available?)
• scientific article; zbMATH DE number 2167522 (Why is no real title available?)
• scientific article; zbMATH DE number 3266609 (Why is no real title available?)
• Model theory for infinitary logic. Logic with countable conjunctions and finite quantifiers
• On automorphic tuples of elements in computable models
• On the n-back-and-forth types of Boolean algebras
• Recursively Categorical Linear Orderings
• Subspaces of computable vector spaces
• The computable dimension of ordered abelian groups

Cited in

(25)

• Scott ranks of models of a theory
• Finitely generated groups are universal among finitely generated structures
• Computable analysis and classification problems
• Effectively existentially-atomic structures
• Revisiting uniform computable categoricity: for the sixtieth birthday of prof. Rod Downey
• scientific article; zbMATH DE number 5178687 (Why is no real title available?)
• Computable Polish group actions
• BOREL FUNCTORS AND INFINITARY INTERPRETATIONS
• SCOTT COMPLEXITY OF COUNTABLE STRUCTURES
• An introduction to the Scott complexity of countable structures and a survey of recent results
• Assigning an isomorphism type to a hyperdegree
• Complexity of Scott sentences
• scientific article; zbMATH DE number 967392 (Why is no real title available?)
• Degrees of categoricity on a cone via -systems
• THE COMPLEXITY OF SCOTT SENTENCES OF SCATTERED LINEAR ORDERS
• The 𝜔-Vaught’s conjecture
• Generically Computable abelian groups
• Scott sentence complexities of linear orderings
• Generically computable abelian groups and isomorphisms
• Scott analysis, linear orders, and almost periodic functions
• On categoricity of scattered linear orders of constructive ranks
• The structural complexity of models of arithmetic
• Scott complexity of reduced abelian p-groups
• Étale structures and the Joyal-Tierney representation theorem in countable model theory
• Optimal syntactic definitions of back-and-forth types

This page was built for publication: A robuster Scott rank

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3450085)