989 search results - page 15 / 198 » Pebbling and Proofs of Work |
TYPES
2000
Springer
13 years 12 months ago
2000
Springer
Higman's lemma has a very elegant, non-constructive proof due to Nash-Williams [NW63] using the so-called minimal-bad-sequence argument. The objective of the present paper is ...
LISP
2008
13 years 8 months ago
2008
Higher-order logic proof systems combine functional programming with logic, providing functional programmers with a comfortable setting for the formalization of programs, specifica...
ITP
2010
14 years 7 days ago
2010
We present a formalisation of separation logic which, by avoiding the use of existential quantifiers, allows proofs that only use standard equational rewriting methods as found in...
ICAIL
2007
ACM
14 years 7 days ago
2007
ACM
In this paper we examine some previous AI and Law attempts to characterise standards of proof, and relate these to the notions of acceptability found in argumentation frameworks, ...
IGPL
2007
13 years 8 months ago
2007
This work studies the structure of proofs containing non-analytic cuts in the cut-based system, a sequent inference system in which the cut rule is not eliminable and the only bra...