1101 search results - page 148 / 221 » Forcing in proof theory |
76
Voted
AML
2007
15 years 22 days ago
2007
A method is described for obtaining conjunctive normal forms for logics using Gentzen-style rules possessing a special kind of strong invertibility. This method is then applied to ...
CORR
2010
Springer
15 years 21 days ago
2010
Springer
In this paper, we prove that type-tagging prevents type-flaw attacks on security protocols that use the Exclusive-OR operator as our main contribution. Our proof method is general ...
82
Voted
AMAI
2006
Springer
15 years 20 days ago
2006
Springer
In nonmonotonic reasoning, a default conditional has most often been informally interpreted as a defeasible version of a classical conditional, usually the material conditional...
ENTCS
2008
15 years 20 days ago
2008
RZ is a tool which translates axiomatizations of mathematical structures to program specifications using the realizability interpretation of logic. This helps programmers correctl...
67
Voted
APAL
2006
15 years 20 days ago
2006
We introduce the notion of infinitary preorder and use it to obtain a predicative presentation of sup-lattices by generators and relations. The method is uniform in that it extend...