551 search results - page 15 / 111 » Natural proofs |
123
click to vote
LATINCRYPT
2010
15 years 1 months ago
2010
We consider the following problem: can we construct constant-round zero-knowledge proofs (with negligible soundness) for NP assuming only the existence of one-way permutations? We...
130
click to vote
TPHOL
1999
IEEE
15 years 7 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...
148
Voted
CORR
2010
Springer
15 years 22 days ago
2010
Springer
Basic proof search tactics in logic and type theory can be seen as the root-rst applications of rules in an appropriate sequent calculus, preferably without the redundancies gener...
133
click to vote
LFCS
2009
Springer
15 years 10 months ago
2009
Springer
We explore an intuitionistic fragment of Art¨emov’s Logic of Proofs as a type system for a programming language for mobile units. Such units consist of both a code and certific...
157
click to vote
MKM
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. The relationship between theorems and lemmas in mathematical reasoning is often vague. No system exists that formalizes the structure of theorems in a mathematical librar...