Is Cantor’s Theorem Automatic?
- 1 January 2003
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Definability and Regularity in Automatic StructuresPublished by Springer Nature ,2004
- On automatic partial ordersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Some results on automatic structuresPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- On computable automorphisms of the rational numbersThe Journal of Symbolic Logic, 2001
- Chapter 10 Complexity theoretic model theory and algebraPublished by Elsevier ,1998
- Automatic presentations of structuresPublished by Springer Nature ,1995
- On direct products of automaton decidable theoriesTheoretical Computer Science, 1982
- The lattice-ordered groups of automorphisms of an ordered set.The Michigan Mathematical Journal, 1963
- Decision problems of finite automata design and related arithmeticsTransactions of the American Mathematical Society, 1961
- Beitr ge zur Begr ndung der transfiniten MengenlehreMathematische Annalen, 1897