This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Aspects of Effective Algebra, Proceedings of a Conference at Monash University, 1979, edited by J.N. Crossley.
C.J. Ash, A. Nerode, Intrinsically Recursive Relations, Aspects of Effective Algebra, Proceeding of a Conference at Monash University, Australia, 1979.
R. Buchi, The Monadic Theory of ω1, in: Decidable Theories II, Lecture Notes in Mathematics, 328, 1–127.
R. Buchi, D. Siefkes, Axiomatization of the Monadic second Order Theory of ω1, in: Decidable Theories II, Lect. Not. in Mathematics, 328, 127–215.
S. Eilenberg, Automata, Languages, and Mashines, vol. A, Academic Press, New York, 1974.
D.Epstein, J.Cannon, and others, Word Processing in Groups, Jones and Bartlett Publishers, Boston, London.
Yu.L. Ershov, Problems of Decidability and Constructive Models, Moscow, 1989.
A.Frohlich, J. Shepherdson, Effective Procedures in Field Theory, Philos. Tranns. Roy. Soc, London, ser A 248, 1955, 432–487.
S.S. Goncharov, The Problem of the Number Of Non-Self-Equivalent Constructivizations, Algebra and Logic, No 6, 1980.
Y. Gurevich and L. Harrington, Trees, Automata and Games, Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982, 60–65.
A.I. Mal'cev A.I, Constructive Algebras, Uspekhi Matem. Nauk, 16, No 3, 1961.
M. Rabin, Decidability of Second-Order Theories and Automata on Infinite Trees, Trans. of American Math. Soc., 141, 1969, 1–35.
M.Rabin, Weakly Definable Relations and Special Automata, Mathematical Logic and Foundations of Set Theory, North-Holland, Amsterdam, 1970, 1–23.
M. Rabin, Computable Algebra: General theory and Theory of Computable Fields, Trans. Amer. Math. Soc., 95, 1960, 341–360
J.B. Remmel, D. Cenzer, Polynomial Time Versus Recursive Models, Annals of Pure and Applied Logic, 1991.
J.B. Remmel, D. Cenzer, Feasibly Categorical Abelian Groups, Proceedings of the Workshop Feasible Mathematics II, to appear.
H. Rogers, Theory of Recursive Function and Effective Computability, New York, 1967.
W. Thomas, Automata on Infinite Objects, in Handbook of Theoretical Computer Science, Volume B, J. van Leeuwen editor, The MIT Press/Elsevier, 1990, 133–192.
C. Frougny, J. Sakarovitch, Synchronized Ratinal Relations of Finite and Infinite Words, Theoretical Computer Science, 108, 1993, 45–82.
B.Khoussainov, A. Nerode, Automatic Models and S2S, in preparation.
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Khoussainov, B., Nerode, A. (1995). Automatic presentations of structures. In: Leivant, D. (eds) Logic and Computational Complexity. LCC 1994. Lecture Notes in Computer Science, vol 960. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60178-3_93
Download citation
DOI: https://doi.org/10.1007/3-540-60178-3_93
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60178-4
Online ISBN: 978-3-540-44720-7
eBook Packages: Springer Book Archive