20 search results - page 3 / 4 » Proof Search Tree and Cut Elimination |
TABLEAUX
2009
Springer
14 years 5 days ago
2009
Springer
We consider two sequent calculi for tense logic in which the syntactic judgements are nested sequents, i.e., a tree of traditional onesided sequents built from multisets of formula...
ICFP
2000
ACM
13 years 10 months ago
2000
ACM
We review the close relationship between abstract machines for (call-by-name or call-by-value) λ-calculi (extended with Felleisen’s C) and sequent calculus, reintroducing on the...
AGP
1995
IEEE
13 years 9 months ago
1995
IEEE
In this paper, we describe a Prolog implementation of a new theorem prover for (normal propositional) modal and multi–modal logics. The theorem prover, which is called KEM, arise...
CIE
2010
Springer
13 years 10 months ago
2010
Springer
Game semantics provides an interactive point of view on proofs, which enables one to describe precisely their dynamical behavior during cut elimination, by considering formulas as ...
CORR
2010
Springer
13 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 ...