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

Journal of Symbolic Logic 76 (4):1341-1351 (2011)
  Copy   BIBTEX

Abstract

We prove that the additive group of the rationals does not have an automatic presentation. The proof also applies to certain other abelian groups, for example, torsion-free groups that are p-divisible for infinitely many primes p, or groups of the form ⊕ p∈I Z(p ∞ ), where I is an infinite set of primes

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,593

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Fusing O-Minimal Structures.A. J. Wilkie - 2005 - Journal of Symbolic Logic 70 (1):271 - 281.
Automata presenting structures: A survey of the finite string case.Sasha Rubin - 2008 - Bulletin of Symbolic Logic 14 (2):169-209.
Some elementary results in intutionistic model theory.Wim Veldman & Frank Waaldijk - 1996 - Journal of Symbolic Logic 61 (3):745-767.
Automatic continuity of group homomorphisms.Christian Rosendal - 2009 - Bulletin of Symbolic Logic 15 (2):184-214.
Une correspondance entre anneaux partiels et groupes.Patrick Simonetta - 1997 - Journal of Symbolic Logic 62 (1):60-78.
On computable automorphisms of the rational numbers.A. S. Morozov & J. K. Truss - 2001 - Journal of Symbolic Logic 66 (3):1458-1470.
Disbelief as the dual of belief.John D. Norton - 2007 - International Studies in the Philosophy of Science 21 (3):231 – 252.
Non-Additive Beliefs in Solvable Games.Hans Haller - 2000 - Theory and Decision 49 (4):313-338.
Ethical Automaticity.Michael Brownstein & Alex Madva - 2012 - Philosophy of the Social Sciences 42 (1):68-98.
Probability logic of finitely additive beliefs.Chunlai Zhou - 2010 - Journal of Logic, Language and Information 19 (3):247-282.

Analytics

Added to PP
2011-10-12

Downloads
22 (#606,933)

6 months
1 (#1,040,386)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Computable Abelian groups.Alexander G. Melnikov - 2014 - Bulletin of Symbolic Logic 20 (3):315-356,.
Automatic models of first order theories.Pavel Semukhin & Frank Stephan - 2013 - Annals of Pure and Applied Logic 164 (9):837-854.
Online, computable and punctual structure theory.Matthew Askes & Rod Downey - 2023 - Logic Journal of the IGPL 31 (6):1251-1293.

Add more citations

References found in this work

Describing groups.André Nies - 2007 - Bulletin of Symbolic Logic 13 (3):305-339.
Finite automata presentable Abelian groups.André Nies & Pavel Semukhin - 2010 - Annals of Pure and Applied Logic 161 (3):458-467.

Add more references