The additive group of the rationals does not have an automatic presentation

DOI10.2178/jsl/1318338853zbMath1247.03070arXiv0905.1505OpenAlexW2063448403MaRDI QIDQ3107358

Todor Tsankov

Publication date: 23 December 2011

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

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

zbMATH Keywords

abelian groupstorsion-free groupsadditive combinatoricsautomatic structuresFA-presentable

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items

Tree-automatic scattered linear orders ⋮ Automatic learners with feedback queries ⋮ Learning pattern languages over groups ⋮ Automatic models of first order theories ⋮ Graphs are not universal for online computability ⋮ Word automatic groups of nilpotency class 2 ⋮ Semiautomatic structures ⋮ A structure of punctual dimension two ⋮ On automaton presentations of projective planes ⋮ On the Complexity of Infinite Advice Strings ⋮ Algebraic structures computable without delay ⋮ Model-theoretic properties of \(\omega\)-automatic structures ⋮ Eliminating unbounded search in computable algebra ⋮ The back-and-forth method and computability without delay ⋮ Punctual dimension of algebraic structures in certain classes ⋮ COMPUTABLE ABELIAN GROUPS ⋮ AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES ⋮ FOUNDATIONS OF ONLINE STRUCTURE THEORY ⋮ Random Subgroups of Rationals ⋮ Where Automatic Structures Benefit from Weighted Automata ⋮ Learning Pattern Languages over Groups ⋮ The isomorphism problem on classes of automatic structures with transitive relations ⋮ Unnamed Item

Cites Work

• Unnamed Item