Is Cantor's theorem automatic?

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2850, Issue , 2003, Pages 332-345

  Kuske, Dietrich ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; COMPUTER PROGRAMMING LANGUAGES; FORMAL LOGIC; MATHEMATICAL MODELS; THEOREM PROVING; COMPUTERS;

CANTOR'S THEOREM; ISOMORPHISM; NATURAL NUMBERS;

FINITE AUTOMATA; ARTIFICIAL INTELLIGENCE;

AUTOMORPHISMS; BINARY RELATION; LINEAR ORDER;

EID: 9444262562     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-39813-4_24     Document Type: Conference Paper

References (18)

1. A. Blumensath. Automatic structures. Technical report, RWTH Aachen, 1999.
2. A. Blumensath and E. Grädel. Automatic Structures. In LICS'00, pages 51-62, 2000.
3. G. Cantor. Beiträge zur Begründung der transfiniten Mengenlehre, II. Math. Annalen, 49:207-246, 1897.
4. D. Cenzer and J.B. Remmel. Complexity theoretic model theory and algebra. In [7], Chapter 10. 1998.
5. C. Delhommé, V. Goranko, and T. Knapik. Automatic linear orderings, 2003.
6. Manuscript. 6. C.C. Elgot. Decision problems of finite automata design and related arithmetics. Trans. Am. Math. Soc., 98:21-51, 1961.
7. Yu.L. Ershov, S.S. Goncharov, A. Nerode, and J.B. Remmel. Handbook of Recursive Mathematics I and II. Elsevier, 1998.
8. B.R. Hodgson. On direct products of automaton decidable theories. Theoretical Comp. Science, 19:331-335, 1982.
9. C. Holland. The lattice-ordered groups of automorphisms of an ordered set. Michigan Math. J., 10:399-408, 1963.
10. I. Ishihara, B. Khoussainov, and S. Rubin. Some results on automatic structures. In LICS'02, pages 235-244, 2002.
11. B. Khoussainov and A. Nerode. Automatic presentations of structures. In Logic and Computational Complexity, Lecture Notes in Comp. Science vol. 960, pages 367-392. Springer, 1995.
12. B. Khoussainov and S. Rubin. Graphs with automatic presentations over a unary alphabet. J. Autom. Lang. Comb., 6:467-480, 2001.
13. B. Khoussainov, S. Rubin, and F. Stephan. Definability and regularity in automatic presentations of subsystems of arithmetic, 2003. Manuscript.
14. B. Khoussainov, S. Rubin, and F. Stephan. On automatic partial orders, 2003. accepted for LICS'03.
15. C.P. McCarty. A formula for Tribonacci numbers. Fibonacci Quarterly, 19:391-393, 1981.
16. A.S. Morozov and J.K. Truss. On computable automorphisms of the rational numbers. J. Symb. Logic, 66(3):1458-1470, 2001.
17. J.B. Remmel. Polynomial time categoricity and linear orderings. Progress in Computer Science and Applied Logic (Papers from Conference in honor of Anil Nerod's 60th birthday), 12:713-746, 1993.
18. J.G. Rosenstein. Linear Orderings. Academic Press, 1982.