We give a semantic account of the execution time (i.e. the number of cut elimination steps leading to the normal form) of an untyped MELL net. We first prove that: 1) a net is he...
Daniel de Carvalho, Michele Pagani, Lorenzo Tortor...
We propose a normal modal deontic logic based on a dyadic operator, similar in structure to the temporal "until". By bringing significant expressiveness to the logic, it ...
The paper focusses on the logical backgrounds of the Dijkstra-Scholten program development style for correct programs. For proving the correctness of a program (i.e. the fact that...
In this article, we study parameterized complexity theory from the perspective of logic, or more specifically, descriptive complexity theory. We propose to consider parameterized ...
We observe that every rst-order logic formula over the untyped version of some many-sorted vocabulary is equivalent to a union of manysorted formulas over that vocabulary. This re...