Sciweavers

532 search results - page 88 / 107
» The Logic of Quasi-MV Algebras
Sort
View
ENTCS
2000
60views more  ENTCS 2000»
13 years 9 months ago
Incompleteness of Behavioral Logics
Incompleteness results for behavioral logics are investigated. We show that there is a basic finite behavioral specification for which the behavioral satisfaction problem is not r...
Samuel R. Buss, Grigore Rosu
LOGCOM
2007
125views more  LOGCOM 2007»
13 years 9 months ago
Epistemic Actions as Resources
We provide algebraic semantics together with a sound and complete sequent calculus for information update due to epistemic actions. This semantics is flexible enough to accommoda...
Alexandru Baltag, Bob Coecke, Mehrnoosh Sadrzadeh
BSL
1999
103views more  BSL 1999»
13 years 9 months ago
The logic of bunched implications
We consider a classical (propositional) version, CBI, of O'Hearn and Pym's logic of bunched implications (BI) from a model- and prooftheoretic perspective. We present a c...
Peter W. O'Hearn, David J. Pym
FSS
2010
112views more  FSS 2010»
13 years 8 months ago
Fuzzy sets and geometric logic
H¨ohle has identified fuzzy sets, valued in a frame (complete Heyting algebra) Ω, with certain sheaves over Ω: the subsheaves of constant sheaves More general sheaves can be...
Steven Vickers
POPL
2004
ACM
14 years 10 months ago
Free theorems in the presence of seq
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
Janis Voigtländer, Patricia Johann