Sciweavers

3658 search results - page 293 / 732
» The logic of proofs, semantically
Sort
View
PRIMA
2007
Springer
16 years 27 days ago
An Asymmetric Protocol for Argumentation Games in Defeasible Logic
Agent interactions where the agents hold conflicting goals could be modelled as adversarial argumentation games. In many real-life situations (e.g., criminal litigation, consumer ...
Jenny Eriksson Lundström, Guido Governatori, ...
TLCA
1999
Springer
15 years 11 months ago
Strong Normalisation of Cut-Elimination in Classical Logic
In this paper we present a strongly normalising cut-elimination procedure for classical logic. This procedure adapts Gentzen’s standard cut-reductions, but is less restrictive th...
Christian Urban, Gavin M. Bierman
ASIAN
2006
Springer
140views Algorithms» more  ASIAN 2006»
15 years 10 months ago
On Completeness of Logical Relations for Monadic Types
Interesting properties of programs can be expressed using contextual equivalence. The latter is difficult to prove directly, hence (pre-)logical relations are often used as a tool ...
Slawomir Lasota, David Nowak, Yu Zhang
ENTCS
2006
176views more  ENTCS 2006»
15 years 6 months ago
Automatic Formal Synthesis of Hardware from Higher Order Logic
A compiler that automatically translates recursive function definitions in higher order logic to clocked synchronous hardware is described. Compilation is by mechanised proof in t...
Mike Gordon, Juliano Iyoda, Scott Owens, Konrad Sl...
TARK
2009
Springer
16 years 1 months ago
A logical characterization of iterated admissibility
Brandenburger, Friedenberg, and Keisler provide an epistemic characterization of iterated admissibility (i.e., iterated deletion of weakly dominated strategies) where uncertainty ...
Joseph Y. Halpern, Rafael Pass