134
Voted
RELMICS
2015
Springer
9 years 11 months 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...
100
Voted
RELMICS
2015
Springer
9 years 11 months ago
2015
Springer
Abstract. We give an informal description of a recursive representabilitypreserving reduction of relation algebras to cylindric algebras.
130
Voted
RELMICS
2015
Springer
9 years 11 months 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 ...
128
Voted
REFSQ
2015
Springer
9 years 11 months ago
2015
Springer
136
Voted
REFSQ
2015
Springer
9 years 11 months ago
2015
Springer
Abstract. [Context and motivation] It is desirable that requirement engineering methods are reliable, that is, that methods can be repeated with the same results. Risk assessments ...