47 citations · 115 across the 13 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.FL2018★ 2 cited
A non-regular language of infinite trees that is recognizable by a sort-wise finite algebra
Mikołaj Bojańczyk, Bartek Klin
-clones are multi-sorted structures that naturally emerge as algebras for infinite trees, just as -semigroups are convenient algebras for infinite words. In the algebraic the…
cs.LO2018
Scalar and Vectorial mu-calculus with Atoms
Bartek Klin, Mateusz Łełyk
We study an extension of modal -calculus to sets with atoms and we study its basic properties. Model checking is decidable on orbit-finite structures, and a correspondence to pa…
cs.LO2018★ 1 cited
Definable isomorphism problem
Khadijeh Keshvardoost, Bartek Klin, Sławomir Lasota +2
We investigate the isomorphism problem in the setting of definable sets (equivalent to sets with atoms): given two definable relational structures, are they related by a definable…