Scott sentences for certain groups

DOI10.1007/S00153-017-0578-ZMaRDI QIDQ1745362zbMATH OpenOpenAlexFDO

Authors J. 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

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

Recommendations

• Complexity of Scott sentences
• Describing groups
• SCOTT COMPLEXITY OF COUNTABLE STRUCTURES
• Index sets and Scott sentences
• On optimal Scott sentences of finitely generated algebraic structures

Cites work

• scientific article; zbMATH DE number 5595151 (Why is no real title available?)
• scientific article; zbMATH DE number 3574107 (Why is no real title available?)
• scientific article; zbMATH DE number 2047478 (Why is no real title available?)
• scientific article; zbMATH DE number 5175704 (Why is no real title available?)
• scientific article; zbMATH DE number 3266609 (Why is no real title available?)
• scientific article; zbMATH DE number 3339488 (Why is no real title available?)
• A characterization of the subgroups of the additive rationals
• Boolean algebras, Tarski invariants, and index sets
• Comparing Classes of Finite Structures
• Complexity of the index set of a constructive model
• Computable Algebra, General Theory and Theory of Computable Fields
• Computable structures and the hyperarithmetical hierarchy
• Describing free groups
• Describing free groups. II: \(\Pi ^{0}_{4}\) hardness and no \(\Sigma _{2}^{0}\) basis
• Describing groups
• Elementary properties of Abelian groups
• Elementary theory of free non-abelian groups.
• Genericity, the Arzhantseva-Ol'shanskii method and the isomorphism problem for one-relator groups.
• Index sets and Scott sentences
• Index sets of computable structures
• Model theory for infinitary logic. Logic with countable conjunctions and finite quantifiers
• On optimal Scott sentences of finitely generated algebraic structures
• On the complexity of categoricity in computable structures
• The isomorphism problem for classes of computable fields
• The isomorphism problem for computable Abelian _p-groups of bounded length
• Turing computability. Theory and applications
• Π₁¹ relations and paths through

Cited in

(11)

• Scott heights of abelian groups
• Index sets and Scott sentences
• Describing groups
• Scott sentences for certain groups
• Complexity of Scott sentences
• Finitely generated groups are universal among finitely generated structures
• Computable Scott sentences for quasi-Hopfian finitely presented structures
• Scott sentences for equivalence structures
• Computable Scott sentences and the weak Whitehead problem for finitely presented groups
• An introduction to the Scott complexity of countable structures and a survey of recent results
• SCOTT COMPLEXITY OF COUNTABLE STRUCTURES

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

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