D. Kuske, M. Lohrey, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), 2006, 91
Ludwig Staiger, 7300, Languages Alive, 2012, 236
A. Bès, P. Cégielski, “Nonmaximal decidable structures”, J Math Sci, 158, № 5, 2009, 615
Arnaud Carayol, Christof Löding, Damian Niwinski, Igor Walukiewicz, “Choice functions and well-orderings over the infinite binary tree”, Open Mathematics, 8, № 4, 2010
S. A. Aleksandrova, N. A. Bazhenov, “On Decidability of List Structures”, Sib Math J, 60, № 3, 2019, 377
Paweł Parys, 12730, Computer Science – Theory and Applications, 2021, 395
Ludwig Staiger, 1414, Computer Science Logic, 1998, 478
Wolfgang Thomas, 2747, Mathematical Foundations of Computer Science 2003, 2003, 113
Achim Blumensath, “Simple monadic theories and partition width”, Mathematical Logic Quarterly, 57, № 4, 2011, 409
Nathanaël Fijalkow, Charles Paperman, “Monadic Second-Order Logic with Arbitrary Monadic Predicates”, ACM Trans. Comput. Logic, 18, № 3, 2017, 1