On optimal Scott sentences of finitely generated algebraic structures

DOI10.1090/proc/14063OpenAlexW2590309738MaRDI QIDQ3177855

Meng-Che Ho, Matthew Harrison-Trainor

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

Mathematics Subject Classification ID

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

Related Items (6)

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

Cites Work

• Unnamed Item
• Index sets and Scott sentences
• Computable structures and the hyperarithmetical hierarchy
• Combinatorial group theory.
• Describing free groups
• Describing groups
• Index sets of computable structures
• The Invariant ∏ 0 α Separation Principle
• Complexity of Scott sentences

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