133 search results - page 15 / 27 » The basic intuitionistic logic of proofs |
RTA
2005
Springer
14 years 6 days ago
2005
Springer
We present constructive arithmetic in Deduction modulo with rewrite rules only. In natural deduction and in sequent calculus, the cut elimination theorem and the analysis of the st...
TABLEAUX
1997
Springer
13 years 11 months ago
1997
Springer
Free-variable semantic tableaux are a well-established technique for first-order theorem proving where free variables act as a meta-linguistic device for tracking the eigenvariabl...
ASM
2010
ASM
13 years 9 months ago
2010
ASM
Abstract. Software development in B and Event-B generates proof obligations that have to be discharged using theorem provers. The cost of such developments therefore depends direct...
LOGCOM
2002
13 years 6 months ago
2002
In this paper we present a labelled proof method for computing nonmonotonic consequence relations in a conditional logic setting. The method exploits the strong connection between...
TASE
2007
IEEE
14 years 1 months ago
2007
IEEE
Safety is an important property of high-assurance software, and one of the hot research topics on it is the verification method for software to meet its safety policies. In our p...