N. Aubrun and M. Sablik, An order on sets of tilings corresponding to an order on languages, 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, pp.99-110, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00359625

N. Aubrun and M. Sablik, Simulation of Effective Subshifts by Two-dimensional Subshifts of Finite Type, Acta Applicandae Mathematicae, vol.12, issue.3, 2013.
DOI : 10.1007/BF01418780

URL : https://hal.archives-ouvertes.fr/hal-01275179

A. Ballier and E. Jeandel, Tilings and Model Theory, Symposium on Cellular Automata Journées Automates Cellulaires (JAC), pp.29-39, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00273698

A. Ballier and E. Jeandel, Computing (or not) quasiperiodicity functions of tilings, Symposium on Cellular Automata (JAC), pp.54-64, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00542498

O. V. Belegradek, Algebraically Closed Groups. Algebra and Logic, pp.135-143, 1974.

O. V. Belegradek, Higman's Embedding Theorem in a General Setting and Its Application to Existentially Closed Algebras, Notre Dame Journal of Formal Logic, vol.37, issue.4, pp.613-624, 1996.
DOI : 10.1305/ndjfl/1040046145

W. W. Boone, Certain Simple, Unsolvable Problems of Group Theory. V 29,3029Parts I, II, III and IV have appeared in Series A, 57, Nos. 3 and 5; 58, Nos. 2 and 5 of these Proceedings, as well as Indag. Math., 16, Nos. 3 and 5 (1954); 17, Nos. 2 and 5 (1955).In Part I, page 234, the ninth and tenth lines following the displayed material, for both occurrences of A read D and for both occurrences of B read E: In part II, page 497, for all occurrences of M in Diagrams A and D read C. In Part IV, page 574, the third displayed line, for z??iLread z?????iL. 19).30The proof of the unsolvability of the word problem contained in this and subsequent paper is not contained in the dissertation Several simple unsolvable problems of group theory related to the word problem. (See footnote 1 of Part I.) Our proof was finally completed during the period 1954-56 while in residence at the Institute for Advanced Study. We were supported in 1954-55 directly by the Institute and in 1955-56 by National Science Foundation contract G-1974. Certain improvements were evolved ans preparations for publication were completed while the author held a Fulbright grant to the University of Oslo.Our thanks are due to Professor Kurt G??del for his kind encouragement in these matter; certain related problems for study he has suggested we hope to deal with later. When an earlier version of Lemmas 30 and 31 was explained at a colloquium at the University of Michigan, August 3, 1956, Professor Roger Lyndon suggested an improvement which is incorporated in our present version. We are indeed indebted to Dr. John Addison and Dr. Michael Rabin for checking many of the new details during July of 1956.), Indagationes Mathematicae (Proceedings), vol.60, pp.22-27, 1957.
DOI : 10.1016/S1385-7258(57)50003-6

W. W. Boone, Certain Simple, Unsolvable Problems of Group Theory. VI, Indagationes Mathematicae (Proceedings), vol.60, pp.227-232, 1957.
DOI : 10.1016/S1385-7258(57)50030-9

W. William, G. Boone, and . Higman, An algebraic characterization of groups with soluble word problem, Journal of the Australian Mathematical Society, vol.18, issue.1, pp.41-53, 1974.

D. Cenzer and J. B. , ? 0 1 classes in mathematics, Handbook of Recursive Mathematics - Logic and the Foundations of Mathematics, chapter 13, pp.623-821, 1998.

D. Cenzer and J. B. , Effectively Closed Sets, ASL Lecture Notes in Logic, 2015.

W. Craig and R. L. Vaught, Finite Axiomatizability using additional predicates, The Journal of Symbolic Logic, vol.17, issue.03, pp.289-308, 1958.
DOI : 10.1002/malq.19560021007

Y. De-cornulier, L. Guyot, and W. Pitsch, On the isolated points in the space of groups, Journal of Algebra, vol.307, issue.1, pp.254-277, 2007.
DOI : 10.1016/j.jalgebra.2006.02.012

URL : https://hal.archives-ouvertes.fr/hal-00458877

R. G. Downey, G. Laforte, and A. Nies, Computably enumerable sets and quasi-reducibility, Annals of Pure and Applied Logic, vol.95, issue.1-3, pp.1-31, 1998.
DOI : 10.1016/S0168-0072(98)00013-X

URL : http://doi.org/10.1016/s0168-0072(98)00013-x

B. Durand, A. Romashchenko, and A. Shen, Effective Closed Subshifts in 1D Can Be Implemented in 2D, Fields of Logic and Computation, number 6300 in Lecture Notes in Computer Science, pp.208-226, 2010.
DOI : 10.1002/j.1538-7305.1961.tb03975.x

URL : http://arxiv.org/abs/1003.3103

M. Richard, H. Friedberg, and . Rogers, Reducibility and Completeness for Sets of Integers, Zeitschrift für mathematische Logik und Grundlagen der Mathematik, pp.117-125, 1959.

R. I. Grigorchuk, DEGREES OF GROWTH OF FINITELY GENERATED GROUPS, AND THE THEORY OF INVARIANT MEANS, Mathematics of the USSR-Izvestiya, pp.259-300, 1985.
DOI : 10.1070/IM1985v025n02ABEH001281

G. Higman, Subgroups of Finitely Presented Groups, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol.262, issue.1311, pp.455-475, 1961.
DOI : 10.1098/rspa.1961.0132

G. Higman and E. Scott, Existentially Closed Groups, 1988.

M. Hochman, On the dynamics and recursive properties of multidimensional symbolic systems, Inventiones mathematicae, vol.47, issue.1, 2009.
DOI : 10.1007/978-1-4612-5775-2

M. Hochman and T. Meyerovitch, A characterization of the entropies of multidimensional shifts of finite type, Annals of Mathematics, vol.171, issue.3, pp.2011-2038, 2010.
DOI : 10.4007/annals.2010.171.2011

V. Huber and D. , A Family of Groups with Nice Word Problems, Journal of the Australian Mathematical Society, vol.17, issue.4, pp.414-425, 1974.

A. Janiczak, A remark concerning decidability of complete theories, The Journal of Symbolic Logic, vol.1, issue.04, pp.277-279, 1950.
DOI : 10.1090/S0002-9904-1944-08111-1

E. Jeandel and P. Vanier, Turing degrees of multidimensional SFTs, Theoretical Computer Science, vol.505, pp.81-92, 2013.
DOI : 10.1016/j.tcs.2012.08.027

URL : http://arxiv.org/abs/1108.1012

S. C. Kleene, Two Papers on the Predicate Calculus., chapter Finite Axiomatizability of Theories in the Predicate Calculus Using Additional Predicate Symbols. Number 10 in Memoirs of the, 1952.

A. V. Kuznetsov, Algorithms as operations in algebraic systems, Uspekhi Matematicheskikh Nauk, vol.13, issue.381, pp.240-241, 1958.

A. Douglas, B. Lind, and . Marcus, An Introduction to Symbolic Dynamics and Coding, 1995.

A. Macintyre, The word problem for division rings, The Journal of Symbolic Logic, vol.37, issue.03, pp.428-436, 1973.
DOI : 10.2307/1969933

M. Norman, S. Martin, and . Pollard, Closure Spaces and Logic, Number 369 in Mathematics and its Applications. Kluwer, 1996.

P. S. Novikov, On the algorithmic unsolvability of the word problem in group theory, Trudy Mat. Inst. Steklov, vol.44, pp.3-143, 1955.

P. G. Odifreddi, Classical Recursion Theory Volume I, volume 125 of Studies in Logic and The Foundations of Mathematics, 1989.

P. G. Odifreddi, Classical Recursion Theory Volume II, volume 143 of Studies in Logic and The Foundations of Mathematics, 1999.

E. L. Post, Recursive Unsolvability of a problem of Thue, The Journal of Symbolic Logic, vol.1, issue.01, pp.1-11, 1947.
DOI : 10.1090/S0002-9904-1944-08111-1

R. M. Robinson, An essentially undecidable axiom system, Proceedings of the International Congress of Mathematicians, pp.729-730, 1950.

R. M. Robinson, Undecidability and nonperiodicity for tilings of the plane, Inventiones Mathematicae, vol.40, issue.3, pp.177-209, 1971.
DOI : 10.1002/j.1538-7305.1961.tb03975.x

A. L. Selman, Arithmetical Reducibilities I. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, pp.335-350, 1971.
DOI : 10.1002/malq.19710170139

A. Tarski, Fundamentale Begriffe der Methodologie der deduktiven Wissesnchaften, Monatshefte für Mathematik und Physik, pp.361-404, 1930.
DOI : 10.1007/bf01696782

M. Ziegler, Gruppen mit vorgeschriebenem Wortproblem, Mathematische Annalen, vol.94, issue.1, pp.43-51, 1976.
DOI : 10.1007/BF01360857

M. Ziegler, Algebraisch Abgeschlossene Gruppen, Word Problems II, volume 95 of Studies in Logic and the Foundations of Mathematics, pp.449-576, 1980.
DOI : 10.1016/S0049-237X(08)71350-8