Sciweavers

545 search results - page 19 / 109
» Recursive logic frames
Sort
View
FOSSACS
2004
Springer
15 years 5 months ago
Soft lambda-Calculus: A Language for Polynomial Time Computation
Soft linear logic ([Lafont02]) is a subsystem of linear logic characterizing the class PTIME. We introduce Soft lambda-calculus as a calculus typable in the intuitionistic and affi...
Patrick Baillot, Virgile Mogbil
AIML
2008
15 years 1 months ago
Modal logic of time division
A logic LTD is defined, inspired by [37]. It is syntactically like basic modal logic with an additional unary operator but it has an interval-based semantics on structures with arb...
Tero Tulenheimo
ENTCS
2007
116views more  ENTCS 2007»
14 years 11 months ago
A Logical Characterisation of Static Equivalence
The work of Abadi and Fournet introduces the notion of a frame to describe the knowledge of the environment of a cryptographic protocol. Frames are lists of terms; two frames are ...
Hans Hüttel, Michael D. Pedersen
LICS
2002
IEEE
15 years 4 months ago
Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory
This paper provides a unifying axiomatic account of the interpretation of recursive types that incorporates both domain-theoretic and realizability models as concrete instances. O...
Alex K. Simpson
IANDC
2007
111views more  IANDC 2007»
14 years 11 months ago
Expressiveness and complexity of graph logic
We investigate the complexity and expressive power of a spatial logic for reasoning about graphs. This logic was previously introduced by Cardelli, Gardner and Ghelli, and provide...
Anuj Dawar, Philippa Gardner, Giorgio Ghelli