204 search results - page 16 / 41 » A Connection Based Proof Method for Intuitionistic Logic |
98
Voted
CSR
2006
Springer
15 years 4 months ago
2006
Springer
We present a method to convert the construction of binary decision diagrams (BDDs) into extended resolution proofs. Besides in proof checking, proofs are fundamental to many applic...
101
Voted
FM
2001
Springer
15 years 4 months ago
2001
Springer
The Irish School of Constructive Mathematics (M♣ c ), which extends the VDM, exploits an algebraic notation based upon monoids and their morphisms for the purposes of abstract mo...
111
Voted
TCS
2010
14 years 10 months ago
2010
The paper contains the first complete proof of strong normalization (SN) for full second order linear logic (LL): Girard’s original proof uses a standardization theorem which i...
LPAR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We present Zenon, an automated theorem prover for first order classical logic (with equality), based on the tableau method. Zenon is intended to be the dedicated prover ...
117
click to vote
SAC
2010
ACM
14 years 10 months ago
2010
ACM
Verification conditions (VCs) are logical formulae whose validity implies the correctness of a program with respect to a specification. The technique of checking software properti...