Scott sentences for equivalence structures

DOI10.1007/S00153-019-00701-XzbMath1442.03025OpenAlexW2984489964MaRDI QIDQ2309506

Sara B. Quinn

Publication date: 1 April 2020

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-019-00701-x

zbMATH Keywords

index setsequivalence structuresScott sentences

Mathematics Subject Classification ID

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

Related Items (1)

Generalization of Shapiro's theorem to higher arities and noninjective notations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Index sets and Scott sentences
• Computable models of theories with few models
• Computable structures and the hyperarithmetical hierarchy
• Scott sentences for certain groups
• Effective categoricity of equivalence structures
• Model theory for infinitary logic. Logic with countable conjunctions and finite quantifiers
• Describing free groups
• Describing free groups, Part II: Π⁰₄ hardness and no Σ₂⁰ basis
• The isomorphism problem for computable Abelian _p-groups of bounded length
• Index sets of computable structures
• Invariant sets in topology and logic
• The effective Borel hierarchy
• An interpolation theorem for denumerably long formulas

This page was built for publication: Scott sentences for equivalence structures