Scott sentences for certain groups

DOI10.1007/s00153-017-0578-zOpenAlexW2962709929MaRDI QIDQ1745362

Julia F. Knight, Vikram Saraph

Publication date: 17 April 2018

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

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

zbMATH Keywords

index setscomputable groupscomputable infinitary formulasScott sentences

Mathematics Subject Classification ID

General structure theorems for groups (20E34) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items (8)

AN INTRODUCTION TO THE SCOTT COMPLEXITY OF COUNTABLE STRUCTURES AND A SURVEY OF RECENT RESULTS ⋮ Index sets and Scott sentences ⋮ Describing groups ⋮ Computable Scott sentences for quasi-Hopfian finitely presented structures ⋮ Complexity of Scott sentences ⋮ Finitely generated groups are universal among finitely generated structures ⋮ Scott sentences for equivalence structures ⋮ SCOTT COMPLEXITY OF COUNTABLE STRUCTURES

Cites Work

• Index sets and Scott sentences
• The isomorphism problem for classes of computable fields
• Genericity, the Arzhantseva-Ol'shanskii method and the isomorphism problem for one-relator groups.
• Complexity of the index set of a constructive model
• Elementary theory of free non-abelian groups.
• Computable structures and the hyperarithmetical hierarchy
• Boolean algebras, Tarski invariants, and index sets
• Model theory for infinitary logic. Logic with countable conjunctions and finite quantifiers
• A characterization of the subgroups of the additive rationals
• Describing free groups
• Describing free groups, Part II: Π⁰₄ hardness and no Σ₂⁰ basis
• Turing Computability
• Describing groups
• On optimal Scott sentences of finitely generated algebraic structures
• The isomorphism problem for computable Abelian _p-groups of bounded length
• Index sets of computable structures
• On the complexity of categoricity in computable structures
• Π₁¹ relations and paths through
• Comparing Classes of Finite Structures
• Computable Algebra, General Theory and Theory of Computable Fields
• Elementary properties of Abelian groups
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Scott sentences for certain groups