On optimal Scott sentences of finitely generated algebraic structures

DOI10.1090/PROC/14063OpenAlexW2590309738MaRDI QIDQ3177855FDOQ3177855

Authors: Matthew Harrison-Trainor, Meng-Che Ho 

Publication date: 2 August 2018

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

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

Recommendations

• SCOTT COMPLEXITY OF COUNTABLE STRUCTURES
• Complexity of Scott sentences
• An introduction to the Scott complexity of countable structures and a survey of recent results
• Index sets and Scott sentences
• Describing groups

Mathematics Subject Classification ID

Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations (20E06) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Cancellation theory of groups; application of van Kampen diagrams (20F06) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Cites Work

• Computable structures and the hyperarithmetical hierarchy
• Index sets of computable structures
• Combinatorial group theory.
• Title not available (Why is that?)
• Describing free groups
• Index sets and Scott sentences
• Describing groups
• The Invariant ∏ 0 α Separation Principle
• Complexity of Scott sentences

Cited In (11)

• Scott sentences for certain groups
• On optimal Scott sentences of finitely generated algebraic structures
• THE COMPLEXITY OF SCOTT SENTENCES OF SCATTERED LINEAR ORDERS
• Complexity of Scott sentences
• Scott sentences in uncountable structures
• Finitely generated groups are universal among finitely generated structures
• Computable Scott sentences and the weak Whitehead problem for finitely presented groups
• Computable Scott sentences for quasi-Hopfian finitely presented structures
• An introduction to the Scott complexity of countable structures and a survey of recent results
• Scott sentences for equivalence structures
• SCOTT COMPLEXITY OF COUNTABLE STRUCTURES

This page was built for publication: On optimal Scott sentences of finitely generated algebraic structures

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