Developing a theory of bisimulation in higher-order languages can be hard. Particularly challenging can be: (1) the proof of congruence, as well as enhancements of the bisimulatio...
In this paper, we study the generalization algorithms for second-order terms, which are treated as first-order terms with function variables, under an instantiation order denoted ...
This paper addresses the crucial issue in the design of a proof development system of how to deal with partial functions and the related question of how to treat undefined terms. ...
: This paper considers differential linear repetitive processes which are a distinct class of 2D systems whose dynamics evolve over a subset of the upper right quadrant of the 2D p...
Pawel Grzegorz Dabkowski, Krzysztof Galkowski, Eri...
We compare the expressiveness of two extensions of monadic second-order logic (MSO) over the class of finite structures. The first, counting monadic second-order logic (CMSO), ex...