Index sets and Scott sentences

DOI10.1007/S00153-014-0377-8zbMATH Open1338.03087OpenAlexW2088164268MaRDI QIDQ403398FDOQ403398

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

Recommendations

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

Mathematics Subject Classification ID

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

Cites Work

• Computable structures and the hyperarithmetical hierarchy
• Index sets of computable structures
• Title not available (Why is that?)
• Title not available (Why is that?)
• Scott sentences for certain groups
• Describing free groups
• Describing free groups. II: \(\Pi ^{0}_{4}\) hardness and no \(\Sigma _{2}^{0}\) basis
• The effective Borel hierarchy

Cited In (8)

• Scott sentences for certain groups
• THE COMPLEXITY OF SCOTT SENTENCES OF SCATTERED LINEAR ORDERS
• AN INTRODUCTION TO THE SCOTT COMPLEXITY OF COUNTABLE STRUCTURES AND A SURVEY OF RECENT RESULTS
• Describing groups
• On optimal Scott sentences of finitely generated algebraic structures
• Complexity of Scott sentences
• Scott sentences for equivalence structures
• Index sets of computable 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)