We study the definability of constraint satisfaction problems (CSP) in various fixed-point and infinitary logics. We show that testing the solvability of systems of equations over...
This paper ties together much of the model theory of the last 50 years. Shelah's attempts to generalize the Morley theorem beyond first order logic led to the notion of excel...
One of the previous articles in this column was devoted to the zero-one laws for a number of logics playing prominent role in finite model theory: first-order logic FO, the extens...
Recently visibly pushdown automata have been extended to so called k-phase multistack visibly pushdown automata (k-MVPAs). On the occasion of introducing kMVPAs, it has been asked...