Sciweavers

12774 search results - page 135 / 2555
» A Framework for Proof Systems
Sort
View
LICS
2009
IEEE
15 years 11 months ago
Dinatural Terms in System F
We provide in this article two characterisation results, describing exactly which terms verify the dinaturality diagram, in Church-style system F and in Curry-style system F. The ...
Joachim De Lataillade
APAL
1999
88views more  APAL 1999»
15 years 4 months ago
A Simple Propositional S5 Tableau System
We give a sound and complete propositional S5 tableau system of a particularly simple sort, having an easy completeness proof. It sheds light on why the satisfiability problem for...
Melvin Fitting
CADE
1999
Springer
15 years 8 months ago
System Description: CutRes 0.1: Cut Elimination by Resolution
CutRes is a system which takes as input an LK-proof with arbitrary cuts and skolemized end-sequent and gives as output an LKproof with atomic cuts only. The elimination of cuts is ...
Matthias Baaz, Alexander Leitsch, Georg Moser
ALIFE
2007
15 years 4 months ago
Computational Realizations of Living Systems
Robert Rosen’s central theorem states that organisms are fundamentally different to machines, mainly because they are ‘‘closed with respect to effcient causation.’’ The p...
Dominique Chu, Weng Kin Ho
COMMA
2010
14 years 11 months ago
Expanding Argumentation Frameworks: Enforcing and Monotonicity Results
This paper addresses the problem of revising a Dung-style argumentation framework by adding finitely many new arguments which may interact with old ones. We study the behavior of t...
Ringo Baumann, Gerhard Brewka