4217 search results - page 75 / 844 » Computational indistinguishability logic |
CONCUR
2004
Springer
15 years 3 months ago
2004
Springer
Existing spatial logics for concurrency are intensional, in the sense that they induce an equivalence that coincides with structural congruence. In this work, we study a contextual...
120
click to vote
SAS
1991
Springer
15 years 1 months ago
1991
Springer
d Abstract) Marcelo Fiore1 Chung-Kil Hur2,3 Computer Laboratory University of Cambridge Cambridge, UK We introduce an abstract general notion of system of equations between terms,...
JAPLL
2010
14 years 8 months ago
2010
We introduce the extended modal logic EML with regularity constraints and full Presburger constraints on the number of children that generalize graded modalities, also known as nu...
LICS
1991
IEEE
15 years 1 months ago
1991
IEEE
When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal ...
CORR
2006
Springer
14 years 10 months ago
2006
Springer
of proposed research. A short bibliography is optional. Domain theory has been developed around 40 years since 1970s by D. Scott, and S. Abramsky revealed the "junction betwee...