Sciweavers

133 search results - page 17 / 27
» The basic intuitionistic logic of proofs
Sort
View
FSEN
2007
Springer
14 years 27 days ago
Logical Bisimulations and Functional Languages
Developing a theory of bisimulation in higher-order languages can be hard. Particularly challenging can be the proof of congruence and, related to this, enhancements of the bisimul...
Davide Sangiorgi, Naoki Kobayashi, Eijiro Sumii
LPAR
2007
Springer
14 years 26 days ago
Permutative Additives and Exponentials
Abstract. Permutative logic (PL) is a noncommutative variant of multiplicative linear logic (MLL) arising from recent investigations concerning the topology of linear proofs. Permu...
Gabriele Pulcini
IGPL
2011
12 years 10 months ago
Interpolation and FEP for logics of residuated algebras
A residuated algebra (RA) is a generalization of a residuated groupoid; instead of one basic binary operation · with residual operations \, /, it admits finitely many basic oper...
Wojciech Buszkowski
CORR
2010
Springer
194views Education» more  CORR 2010»
13 years 4 months ago
A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems
Basic proof search tactics in logic and type theory can be seen as the root-rst applications of rules in an appropriate sequent calculus, preferably without the redundancies gener...
Stéphane Lengrand, Roy Dyckhoff, James McKi...
ASIAN
2006
Springer
116views Algorithms» more  ASIAN 2006»
13 years 10 months ago
Secrecy Analysis in Protocol Composition Logic
We present formal proof rules for inductive reasoning about the way that data transmitted on the network remains secret from a malicious attacker. Extending a compositional protoco...
Arnab Roy, Anupam Datta, Ante Derek, John C. Mitch...