21 search results - page 3 / 5 » Resource modalities in tensor logic |
TCS
2011
13 years 11 days ago
2011
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
LOGCOM
2007
13 years 5 months ago
2007
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...
ENTCS
2007
13 years 5 months ago
2007
We introduce a class of coalgebraic models and a family of modal logics that support the speci cation of spatial properties of distributed applications. The evaluation of a formul...
BIRTHDAY
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. Bounded fairness is a stronger notion than ordinary eventuality-based fairness, one that guarantees occurrence of an event within a fixed number of occurrences of anothe...
WOLLIC
2010
Springer
13 years 10 months ago
2010
Springer
In type logical categorial grammar the analysis of an expression is a resource-conscious proof. Anaphora represents a particular challenge to this approach in that the antecedent ...