Definability and regularity in automatic structures

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2996, Issue , 2004, Pages 440-451

  Khoussainov, Bakhadyr ^a   Rubin, Sasha ^a   Stephan, Frank ^b  

^a UNIVERSITY OF AUCKLAND   (New Zealand)

^b CSIRO   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; RECONFIGURABLE HARDWARE;

AUTOMATIC STRUCTURES; DEFINABILITY; FIRST ORDER LOGIC; REGULAR RELATIONS;

COMPUTER CIRCUITS;

EID: 33745617998     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24749-4_39     Document Type: Article

References (6)

1. Christopher J. Ash and Anil Nerode. Intrinsically recursive relations. In Aspects of effective algebra (Clayton, 1979), pages 26-41. Upside Down A Book Co. Yarra Glen, 1981.
2. Veronique Bruyère, Georges Hansel, Christian Michaux and Roger Villemaire. Logic and p-recognizable sets of integers. Bull. Belg. Math. Soc., 1:191-238, 1994.
3. Achim Blumensath and Erich Grädel. Automatic Structures, Proceedings of 15th Symposium on Logic in Computer Science, LICS 2000.
4. Herbert B. Enderton. A mathematical introduction to logic. Academic Press, first edition, 1972.
5. Ershov et al. (eds). Handbook of Recursive Mathematics Volume 1. Studies in Logic and the foundations of Mathematics, Elsevier, 1998.
6. Bakhadyr Khoussainov and Anil Nerode. Automatic presentations of structures. Lecture Notes in Computer Science, 960:367-392, 1995.