193 search results - page 6 / 39 » A Sequent Calculus for Type Theory |
177
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We consider the problem of intruder deduction in security protocol analysis: that is, deciding whether a given message M can be deduced from a set of messages under the theory of ...
137
click to vote
CLIMA
2007
15 years 7 months ago
2007
The proof theory of multi-agent epistemic logic extended with operators for distributed knowledge is studied. Distributed knowledge of A within a group G means that A follows from ...
164
click to vote
LICS
1994
IEEE
15 years 9 months ago
1994
IEEE
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic ...
182
click to vote
PPDP
2004
Springer
15 years 11 months ago
2004
Springer
We investigate some fundamental properties of the reduction relation in the untyped term calculus derived from Curien and Herbelin’s λµµ. The original λµµ has a system of ...
164
click to vote
FOSSACS
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Nominal logic is a variant of first-order logic equipped with a “freshname quantifier” N and other features useful for reasoning about languages with bound names. I...