151
click to vote
RELMICS
10 years 7 days ago
2015 Springer 
We prove strong completeness of a range of substructural logics with respect to their relational semantics by completeness-viacanonicity. Specifically, we use the topological theo...
139
click to vote
RELMICS
10 years 7 days ago
2015 Springer
Gabbay and Ciancia (2011) presented a nominal extension of Kleene algebra as a framework for trace semantics with statically scoped allocation of resources, along with a semantics ...
111
click to vote
RELMICS
10 years 7 days ago
2015 Springer
This paper introduces the metaphorism pattern of relational specification and addresses how specification following this pattern can be refined into recursive programs. Metaphor...
110
click to vote
RELMICS
10 years 7 days ago
2015 Springer 
Abstract. We give an informal description of a recursive representabilitypreserving reduction of relation algebras to cylindric algebras.
|
Theoretical Computer Science