We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
We describe a logic for reasoning about higher-order strictness properties of typed lambda terms. The logic arises from axiomatising the inclusion order on certain closed subsets ...
Arbitrary public announcement logic (APAL) is an extension of multi-agent epistemic logic that allows agents' knowledge states to be updated by the public announcement of (pos...
Bar Induction occupies a central place in Brouwerian mathematics. This note is concerned with the strength of Bar Induction on the basis of Constructive ZermeloFraenkel Set Theory...
We discuss the question of inclusions between positive relational terms and some of its aspects, using the form of a dialogue. Two possible approaches to the problem are emphasize...
Renata P. de Freitas, Paulo A. S. Veloso, Sheila R...