Index sets and Scott sentences

DOI10.1007/S00153-014-0377-8zbMath1338.03087OpenAlexW2088164268MaRDI QIDQ403398

Charles F. D. McCoy, Julia F. Knight

Publication date: 29 August 2014

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

Full work available at URL: https://doi.org/10.1007/s00153-014-0377-8

Mathematics Subject Classification ID

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

Related Items (6)

On optimal Scott sentences of finitely generated algebraic structures ⋮ AN INTRODUCTION TO THE SCOTT COMPLEXITY OF COUNTABLE STRUCTURES AND A SURVEY OF RECENT RESULTS ⋮ Describing groups ⋮ Scott sentences for certain groups ⋮ Scott sentences for equivalence structures ⋮ THE COMPLEXITY OF SCOTT SENTENCES OF SCATTERED LINEAR ORDERS

Cites Work

• Computable structures and the hyperarithmetical hierarchy
• Scott sentences for certain groups
• Describing free groups
• Describing free groups, Part II: Π⁰₄ hardness and no Σ₂⁰ basis
• Index sets of computable structures
• The effective Borel hierarchy
• Unnamed Item
• Unnamed Item

This page was built for publication: Index sets and Scott sentences