Abstract
We study automatic equivalence and nested equivalence structures. The goal is to compare and contrast these automatic structures with computable equivalence and nested equivalence structures. Equivalence structures \(\mathcal {A}\) may be characterized by their characters \(\chi ({\mathcal {A}})\) which encodes the number of equivalence classes of any given size. The characters of computably categorical, \({{\Delta }^{0}_{2}}\) categorical but not computably categorical, or \({{\Delta }^{0}_{3}}\) categorical but not \({{\Delta }^{0}_{2}}\) categorical have been determined. We show that every computably categorical equivalence structure has an automatic copy, but not every \({{\Delta }^{0}_{2}}\) categorical structure has an automatic copy. We construct an automatic equivalence structure which is \({{\Delta }^{0}_{2}}\) categorical but not computably categorical and another automatic equivalence structure which is not \({{\Delta }^{0}_{2}}\) categorical. We observe that the theory of an automatic equivalence structure is decidable and hence the character of any automatic equivalence structure is computable. On the other hand, there is a computable character which is not the character of any automatic equivalence structure. We show that any two automatic equivalence structures which are isomorphic are in fact computably isomorphic. Moreover, we show that for certain characters, there is always a exponential time isomorphism between two automatic equivalence structures with that character. Finally, we briefly consider nested equivalence structures and construct an automatic nested equivalence structure that is not \({{\Delta }^{0}_{3}}\) categorical but \({{\Delta }^{0}_{4}}\) categorical and an automatic nested equivalence structure that is not \({{\Delta }^{0}_{4}}\) categorical.
Similar content being viewed by others
References
Alaev, P.: Atomless boolean algebras computable in polynomial time. Sib. Electron. Mat. Izv. 13, 1035–1039 (2016)
Alaev, P.: Existence and uniqueness of structures computable in polynomial time. Algebra Log. 55, 72–76 (2016)
Alaev, P.: Structures computable in polynomial time one. Algebra Log. 55, 421–435 (2016)
Alaev, P.: Structures computable in polynomial time two. Algebra Log. 56, 429–442 (2017)
Alaev, P.: Categoricity for primitively recursive and polynomial boolean algebras. Algebra Log. 57, 251–274 (2018)
Ash, C., Knight, J., Manasse, M., Slaman, T.: Generic copies of countable structures. Ann. Pure Appl. Log. 42, 195–205 (1989)
Bar-Hillel, Y., Perlse, M., Shamir, E.: On formal properties of simple phrase structure grammars. Z. Phonetik. Sprachwiss. Kommunikationsforsch. 14, 143–172 (1961)
Bazhenov, N., Downey, R., Kalimullin, I., Melnikov, A.: Foundations of online structure theory. Bull. Symbol. Log. 25, 141–181 (2019)
Bazhenov, N., Harrison-Trainor, M., Kalimullin, I., Melnikov, A., Ng, K.M.x: Automatic and polynomial-time algebraic structures. J. Symbolic Logic, To appear
Blumensath, A., Grädel, E.: Automatic structures. In: Proc. LICS ’00, pp. 51–62 (2000)
Büchi, J.R.: Weak second-order arithmetic and finite automata. Z. Math. Logik Grundlagen Math. 6, 66–92 (1960)
Buss, S., Douglas Cenzer, S., Minnes, M., Remmel, J.B.: Injection structures specified by finite state transducers. In: Computability and complexity, volume 10010 of Lecture Notes in Comput. Sci., pp. 394–417. Springer, Cham (2017)
Calvert, W., Cenzer, D., Harizanov, V., Morozov, A.: Effective categoricity of equivalence structures. Ann. Pure Appl. Log. 141(2006), 61–78 (2005)
Carson, J.: Computational complexity of automatic structures. Ph.D Dissertation, University of Notre Dame (2011)
Cenzer, D., Remmel, J.B.: Complexity and categoricity. Inf. Comput. 140, 2–25 (1998)
Delhommé, C.: Automaticité des ordinaux et des graphes homogènes. C. R. Math. Acad. Sci. Paris 339(1), 5–10 (2004)
Ganardi, M., Khoussainov, B.: Automatic equivalence structures of polynomial growth. In Maribel Ferná,ndez and Anca Muscholl, editors, CSL 2020, Proceedings of the Computer Science Logic Conference, volume 152 of LIPIcs, pp. 21:1–21:16 (2020)
Hodgson, B.R.: On direct products of automaton decidable theories. Theoret. Comput. Sci. 19(3), 331–335 (1982)
Kach, A. M., Turetsky, D.: \({\delta _{2}^{0}}\) categoricity of equivalence structures. New Zealand J. Math. 39, 143–149 (2009)
Karp, R.M, Held, M.: Finite-state processes and dynamic programming. SIAM J. Appl. Math. 15, 693–718 (1967)
Khoussainov, B., Liu, J., Minnes, M.: Unary automatic graphs: an algorithmic perspective. Math. Struct. Comput. Sci. 19(1), 133–152 (2009)
Khoussainov, B., Minnes, M.: Three lectures on automatic structures. In: Delon, F., Kohlenbach, U., Maddy, P., Stephan, F. (eds.) Logic Colloquium Lecture Notes in Logic, p 2010. Cambridge University Press (2007)
Khoussainov, B., Nerode, A.: Automatic presentations of structures. volume 960 of Springer Lecture Notes in Computer Science, pp. 367–392 (1995)
Khoussainov, B., Nerode, A.: Open qeustions in the theory of automatic structures. Bullet. Eur. Assoc. Theor. Comput. Sci. (EATCS) 94, 181–204 (2008)
Khoussainov, B., Nies, A., Rubin, S., Stephan, F.: Automatic structures: richness and limitations. Log. Methods Comput. Sci., (Special issue: Conference “Logic in Computer Science 2004”) 2(2), 18 (2004)
Khoussainov, B., Rubin, S., Stephan, F.: On automatic partial orders. In: Proceedings of LICS ’03, pp. 168–177 (2003)
Khoussainov, B., Nerodel, A.: Automata theory and its applications, volume 21 of Progress in Computer Science and Applied Logic. Birkhäuser Boston, Inc., Boston (2001)
Khoussainov, B., Rubin, S.: Graphs with automatic presentations over a unary alphabet. J. Autom. Lang. Comb. 6, 467–480 (2001)
Kuske, D., Liu, J., Lohrey, M.: The isomorphism problem on classes of automatic structures with transitive relations. Trans. Amer. Math. Soc. 365, 5103–5151 (2013)
Liu, J., Minnes, M.: Deciding the isomorphism problem in classes of unary automatic structures. Theor. Comput. Sci. 412(18), 1705–1717 (2011)
Melnikov, A., Ng, K.M.: The back-and-forth method and computability without delay. Isreal J. Math., To appear
Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Trans. Amer. Math. Soc. 141, 1–35 (1969)
Soare, R. I.: Recursively enumerable sets and degrees. Springer, Berlin (1987)
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Carson, J., Cenzer, D. & Remmel, J.B. Effective Categoricity of Automatic Equivalence and Nested Equivalence Structures. Theory Comput Syst 64, 1110–1139 (2020). https://doi.org/10.1007/s00224-020-09974-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00224-020-09974-9