Publications

Journal: Logical Methods In Computer Science

Number of publications: 20

2018

• Matteo Mio, Michał Paweł Skrzypczak and Henryk Michalewski, Monadic Second Order Logic with Measure and Category Quantifiers, Logical Methods In Computer Science 14 (2) 2018.see in PBN
• Eryk Kopczyński and Tony Tan, A note on first-order spectra with binary relations, Logical Methods In Computer Science 14 (2) 2018.see in PBN

2017

• Anuj Dawar and Eryk Kopczyński, Bounded degree and planar spectra, Logical Methods In Computer Science Volume 13, Issue 4 2017.see in PBN

2016

• Bartosz Klin and Jurriaan Rot, Coalgebraic trace semantics via forgetful logics, Logical Methods In Computer Science 12 (4) 2016, p. 1–34.see in PBN
• Aleksy Andrzej Schubert, Paweł Urzyczyn and Konrad Zdanowski, On the Mints Hierarchy in First-Order Intuitionistic Logic, Logical Methods In Computer Science 12 (4) 2016, p. 1–25.see in PBN
• Piotr Hofman, Sławomir Lasota, Richard Mayr and Patrick Totzke, Simulation Problems Over One-Counter Nets, Logical Methods In Computer Science 12 (1) 2016.see in PBN

2015

• Eryk Kopczyński, Complexity of Problems of Commutative Grammars, Logical Methods In Computer Science 11 (1) 2015.see in PBN

2014

• Samuel R. Buss and Leszek Aleksander Kołodziejczyk, Small stone in pool, Logical Methods In Computer Science 10 (2) 2014, p. 1–22.see in PBN
• Mikołaj Bojańczyk, Bartosz Klin and Sławomir Lasota, Automata theory in nominal sets, Logical Methods In Computer Science 10 (3:4) 2014.see in PBN
• Michał Paweł Skrzypczak, Separation Property for wB- and wS-regular Languages, Logical Methods In Computer Science 10 (1:8) 2014, p. 1–20.see in PBN

2013

• Wojciech Czerwiński, Piotr Hofman and Sławomir Lasota, Reachability problem for weak multi-pushdown automata, Logical Methods In Computer Science 9 (3:13) 2013.see in PBN
• Anuj Dawar, Eryk Kopczyński, Bjarki Holm, Erich Graedel and Wied Pakusa, Definability of linear equation systems over groups and rings, Logical Methods In Computer Science 9 (4) 2013, p. 12.see in PBN

2012

• Mikołaj Bojańczyk and Sławomir Lasota, An extension of data automata that captures XPath, Logical Methods In Computer Science 8 (1) 2012.see in PBN
• Paweł Parys and Igor Walukiewicz, Weak Alternating Timed Automata, Logical Methods In Computer Science 8 (3) 2012.see in PBN
• Mikołaj Bojańczyk, Howard Straubing and Igor Walukiewicz, Wreath Products of Forest Algebras, with Applications to Tree Logics, Logical Methods In Computer Science 8 (3) 2012, p. 1–39.see in PBN
• Mikołaj Bojańczyk, Luc Segoufin and Howard Straubing, Piecewise testable tree languages, Logical Methods In Computer Science 8 (3) 2012.see in PBN

2010

• Mikołaj Bojańczyk and Luc Segoufin, Tree Languages Defined in First-Order Logic with One Quantifier Alternation, Logical Methods In Computer Science 6 (4) 2010, p. 1–26.see in PBN

2009

• Mikołaj Bojańczyk, Two-Way Unary Temporal Logic over Trees, Logical Methods In Computer Science 5 (3) 2009, p. 1–29.see in PBN

2008

• Filip Murlak, The Wadge Hierarchy of Deterministic Tree Languages, Logical Methods In Computer Science 4 (4) 2008, p. 1–44.see in PBN
• Daria Walukiewicz-Chrząszcz and Jacek Chrząszcz, Consistency and completeness of rewriting in the Calculus of Constructions, Logical Methods In Computer Science 4 (3:8) 2008, p. 1–20.see in PBN