Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Büchi, J. Richard
and
Siefkes, Dirk
1983.
THE COMPLETE EXTENSIONS OF THE MONADIC SECOND ORDER THEORY OF COUNTABLE ORDINALS.
Mathematical Logic Quarterly,
Vol. 29,
Issue. 5,
p.
289.
Tuschik, Hans-Peter
1987.
The expressive power of Malitz quantifiers for linear orderings.
Annals of Pure and Applied Logic,
Vol. 36,
Issue. ,
p.
53.
Shelah, Saharon
1987.
Classification Theory.
Vol. 1292,
Issue. ,
p.
264.
Shelah, Saharon
1988.
Notes on monadic logic. part A. Monadic theory of the real line.
Israel Journal of Mathematics,
Vol. 63,
Issue. 3,
p.
335.
Büchi, J. Richard
and
Siefkes, Dirk
1990.
The Collected Works of J. Richard Büchi.
p.
469.
Shelah, Saharon
1990.
More on monadic logic. part C: Monadically interpreting in stable unsuperstable ℱ and the monadic theory of $$^\omega \lambda $$.
Israel Journal of Mathematics,
Vol. 70,
Issue. 3,
p.
353.
Shelah, S.
1990.
Notes on monadic logic. Part B: Complexity of linear orders in ZFC.
Israel Journal of Mathematics,
Vol. 69,
Issue. 1,
p.
94.
Seese, D.
1991.
The structure of the models of decidable monadic theories of graphs.
Annals of Pure and Applied Logic,
Vol. 53,
Issue. 2,
p.
169.
Lifsches, Shmuel
and
Shelah, Saharon
1992.
The monadic theory of (? 2, <) may be complicated.
Archive for Mathematical Logic,
Vol. 31,
Issue. 3,
p.
207.
Shen, Enshao
and
Tian, Qijia
1996.
Monadic partition logics and finite automata.
Theoretical Computer Science,
Vol. 166,
Issue. 1-2,
p.
63.
Thomas, Wolfgang
1997.
Structures in Logic and Computer Science.
Vol. 1261,
Issue. ,
p.
118.
Lafitte, Grégory
2002.
Foundations of Information Technology in the Era of Network and Mobile Computing.
p.
267.
2004.
Infinite Words - Automata, Semigroups, Logic and Games.
Vol. 141,
Issue. ,
p.
499.
Finkel, Olivier
2005.
On Decidability Properties of Local Sentences.
Electronic Notes in Theoretical Computer Science,
Vol. 123,
Issue. ,
p.
75.
Finkel, Olivier
2006.
On decidability properties of local sentences.
Theoretical Computer Science,
Vol. 364,
Issue. 2,
p.
196.
Hliněný, Petr
and
Seese, Detlef
2006.
Trees, grids, and MSO decidability: From graphs to matroids.
Theoretical Computer Science,
Vol. 351,
Issue. 3,
p.
372.
Bès, Alexis
and
Rabinovich, Alexander
2010.
Fields of Logic and Computation.
Vol. 6300,
Issue. ,
p.
95.
Bes, Alexis
and
Rabinovich, Alexander
2011.
Decidable Expansions of Labelled Linear Orderings.
Logical Methods in Computer Science,
Vol. Volume 7, Issue 2,
Issue. ,
Choffrut, Christian
and
Grigorieff, Serge
2015.
Fields of Logic and Computation II.
Vol. 9300,
Issue. ,
p.
109.