Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Kudinov, Oleg V.
and
Selivanov, Victor L.
2006.
Logical Approaches to Computational Barriers.
Vol. 3988,
Issue. ,
p.
289.
Kudinov, Oleg V.
and
Selivanov, Victor L.
2007.
Computation and Logic in the Real World.
Vol. 4497,
Issue. ,
p.
436.
Selivanov, V. L.
2007.
The quotient algebra of labeled forests modulo h-equivalence.
Algebra and Logic,
Vol. 46,
Issue. 2,
p.
120.
Lehtonen, Erkko
2008.
Labeled posets are universal.
European Journal of Combinatorics,
Vol. 29,
Issue. 2,
p.
493.
Altenbernd, Jan-Henrik
2008.
Language and Automata Theory and Applications.
Vol. 5196,
Issue. ,
p.
40.
Kudinov, Oleg V.
and
Selivanov, Victor L.
2009.
Mathematical Theory and Computational Practice.
Vol. 5635,
Issue. ,
p.
290.
Kudinov, Oleg V.
and
Selivanov, Victor L.
2009.
Developments in Language Theory.
Vol. 5583,
Issue. ,
p.
454.
Selivanov, V. L.
2009.
Undecidability in Some Structures Related to Computation Theory.
Journal of Logic and Computation,
Vol. 19,
Issue. 1,
p.
177.
Kudinov, Oleg V.
Selivanov, Victor L.
and
Zhukov, Anton V.
2009.
Definability in the h-quasiorder of labeled forests.
Annals of Pure and Applied Logic,
Vol. 159,
Issue. 3,
p.
318.
Kudinov, Oleg V.
Selivanov, Victor L.
and
Yartseva, Lyudmila V.
2010.
Programs, Proofs, Processes.
Vol. 6158,
Issue. ,
p.
246.
Zhukov, A. V.
Kudinov, O. V.
and
Selivanov, V. L.
2010.
Definability of closure operations in the h-quasiorder of labeled forests.
Algebra and Logic,
Vol. 49,
Issue. 2,
p.
120.
Kudinov, Oleg V.
Selivanov, Victor L.
and
Yartseva, Lyudmila V.
2010.
Definability in the structure of words with the inclusion relation.
Siberian Mathematical Journal,
Vol. 51,
Issue. 3,
p.
456.
Kwuida, Léonard
and
Lehtonen, Erkko
2011.
On the Homomorphism Order of Labeled Posets.
Order,
Vol. 28,
Issue. 2,
p.
251.
Ramanujam, R.
and
Thinniyam, R. S.
2016.
Logical Foundations of Computer Science.
Vol. 9537,
Issue. ,
p.
331.
Demri, Stéphane
and
Deters, Morgan
2016.
Temporal logics on strings with prefix relation.
Journal of Logic and Computation,
Vol. 26,
Issue. 3,
p.
989.
Halfon, Simon
Schnoebelen, Philippe
and
Zetzsche, Georg
2017.
Decidability, complexity, and expressiveness of first-order logic over the subword ordering.
p.
1.
Thinniyam, Ramanathan S.
2017.
Logic and Its Applications.
Vol. 10119,
Issue. ,
p.
211.
Kuske, Dietrich
and
Zetzsche, Georg
2019.
Foundations of Software Science and Computation Structures.
Vol. 11425,
Issue. ,
p.
348.
Kuske, Dietrich
2020.
Computer Science – Theory and Applications.
Vol. 12159,
Issue. ,
p.
289.
Ramanujam, R
and
Thinniyam, Ramanathan S
2020.
Definability in first-order theories of graph orderings ⋆.
Journal of Logic and Computation,
Vol. 30,
Issue. 1,
p.
403.