361 search results - page 24 / 73 » Analytic Methods for the Logic of Proofs |
CORR
2008
Springer
14 years 9 months ago
2008
Springer
The methods used to establish PSPACE-bounds for modal logics can roughly be grouped into two classes: syntax driven methods establish that exhaustive proof search can be performed...
TPHOL
1999
IEEE
15 years 1 months ago
1999
IEEE
Abstract. We present a generic approach to readable formal proof documents, called Intelligible semi-automated reasoning (Isar). It addresses the major problem of existing interact...
ENTCS
2008
14 years 9 months ago
2008
Normalization for the simply-typed -calculus is proven in Twelf, an implementation of the Edinburgh Logical Framework. Since due to proof-theoretical restrictions Twelf Tait'...
87
Voted
PPDP
2009
Springer
15 years 2 months ago
2009
Springer
We present direct proofs of termination of evaluation for typed delimited-control operators shift and reset using a variant of Tait’s method with context-based reducibility pred...
94
Voted
ENTCS
2008
14 years 9 months ago
2008
HOL-TestGen is a specification and test case generation environment extending the interactive theorem prover Isabelle/HOL. The HOL-TestGen method is two-staged: first, the origina...