Index sets and Scott sentences

DOI10.1007/S00153-014-0377-8MaRDI QIDQ403398zbMATH OpenOpenAlexFDO

Authors J. F. Knight, Charles McCoy

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)

Recommendations

• Scott sentences for equivalence structures
• Index sets of computable structures
• Scott sentences for certain groups
• Describing groups
• SCOTT COMPLEXITY OF COUNTABLE STRUCTURES

Cites work

• scientific article; zbMATH DE number 3266609 (Why is no real title available?)
• scientific article; zbMATH DE number 3399227 (Why is no real title available?)
• Computable structures and the hyperarithmetical hierarchy
• Describing free groups
• Describing free groups. II: \(\Pi ^{0}_{4}\) hardness and no \(\Sigma _{2}^{0}\) basis
• Index sets of computable structures
• Scott sentences for certain groups
• The effective Borel hierarchy

Cited in

(8)

• Index sets of computable structures
• Scott sentences for certain groups
• THE COMPLEXITY OF SCOTT SENTENCES OF SCATTERED LINEAR ORDERS
• Describing groups
• An introduction to the Scott complexity of countable structures and a survey of recent results
• Scott sentences for equivalence structures
• Complexity of Scott sentences
• On optimal Scott sentences of finitely generated algebraic structures

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

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