Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
1982.
Linear Orderings.
Vol. 98,
Issue. ,
p.
370.
1982.
Linear Orderings.
Vol. 98,
Issue. ,
p.
456.
McNulty, George F.
1982.
Ordered Sets.
p.
299.
Gurevich, Yuri
and
Shelah, Saharon
1982.
Monadic theory of order and topology in ZFC.
Annals of Mathematical Logic,
Vol. 23,
Issue. 2-3,
p.
179.
Gurevich, Yuri
and
Shelah, Saharon
1984.
The monadic theory and the “next world”.
Israel Journal of Mathematics,
Vol. 49,
Issue. 1-3,
p.
55.
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.
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.
Thomas, Wolfgang
1997.
Structures in Logic and Computer Science.
Vol. 1261,
Issue. ,
p.
118.
Moller, F.
and
Rabinovich, L.
1999.
On the expressive power of CTL.
p.
360.
Gurevich, Y.
and
Shelah, S.
2003.
Spectra of monadic second-order formulas with one unary function.
p.
291.
Moller, Faron
and
Rabinovich, Alexander
2003.
Counting on CTL*: on the expressive power of monadic path logic.
Information and Computation,
Vol. 184,
Issue. 1,
p.
147.
Важенин, Юрий Михайлович
Vazhenin, Yurii Mikhailovich
Пинус, Александр Георгиевич
and
Pinus, Aleksandr Georgievich
2005.
Элементарная классификация и разрешимость теории производных структур.
Успехи математических наук,
Vol. 60,
Issue. 3,
p.
3.
Rabinovich, Alexander
2005.
Composition Theorems for Generalized Sum and Recursively Defined Types.
Electronic Notes in Theoretical Computer Science,
Vol. 123,
Issue. ,
p.
209.
Rabinovich, Alexander
2007.
On compositionality and its limitations.
ACM Transactions on Computational Logic,
Vol. 8,
Issue. 1,
p.
4.
Thomas, Wolfgang
2010.
Fields of Logic and Computation.
Vol. 6300,
Issue. ,
p.
615.
Colcombet, Thomas
2010.
Factorization forests for infinite words and applications to countable scattered linear orderings.
Theoretical Computer Science,
Vol. 411,
Issue. 4-5,
p.
751.
Bès, Alexis
and
Rabinovich, Alexander
2010.
Fields of Logic and Computation.
Vol. 6300,
Issue. ,
p.
95.