Complexity of Scott sentences

DOI10.4064/FM865-6-2020zbMath1485.03103arXiv1807.02715OpenAlexW3041425964MaRDI QIDQ5146417

Charles McCoy Csc, Rachael Alvir, Julia F. Knight

Publication date: 25 January 2021

Published in: Fundamenta Mathematicae (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1807.02715

zbMATH Keywords

finitely generated groupsinfinitary logicBorel hierarchyScott sentencecomputable structure theory

Mathematics Subject Classification ID

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

Related Items (5)

On optimal Scott sentences of finitely generated algebraic structures ⋮ AN INTRODUCTION TO THE SCOTT COMPLEXITY OF COUNTABLE STRUCTURES AND A SURVEY OF RECENT RESULTS ⋮ Computable Scott sentences for quasi-Hopfian finitely presented structures ⋮ Finitely generated groups are universal among finitely generated structures ⋮ THE COMPLEXITY OF SCOTT SENTENCES OF SCATTERED LINEAR ORDERS

Cites Work

• Unnamed Item
• On the Borel classification of the isomorphism class of a countable model
• Computable enumerations of families of general recursive functions
• Computable structures and the hyperarithmetical hierarchy
• Scott sentences for certain groups
• Model theory for infinitary logic. Logic with countable conjunctions and finite quantifiers
• Describing free groups
• Describing groups
• On optimal Scott sentences of finitely generated algebraic structures
• Lectures on Infinitary Model Theory
• A robuster Scott rank
• The Invariant ∏ 0 α Separation Principle
• Barwise: Infinitary Logic and Admissible Sets
• The effective Borel hierarchy

This page was built for publication: Complexity of Scott sentences