3552 search results - page 50 / 711 » Proof theory in the abstract |
168
Voted
TCC
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We investigate whether it is possible to obtain any meaningful type of zero-knowledge proofs using a one-message (i.e., noninteractive) proof system. We show that, under ...
CADE
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Focused proof systems provide means for reducing and structuring the non-determinism involved in searching for sequent calculus proofs. We present a focused proof system ...
117
click to vote
ENTCS
2008
15 years 2 months ago
2008
This note is about work in progress on the topic of "internal type theory" where we investigate the internal formalization of the categorical metatheory of constructive ...
105
Voted
TPHOL
2003
IEEE
15 years 7 months ago
2003
IEEE
Abstract. We show that certain input-output relations, termed inductive invariants are of central importance for termination proofs of algorithms defined by nested recursion. Indu...
94
Voted
CSL
2004
Springer
15 years 7 months ago
2004
Springer
We present a novel third-order theory W1 1 of bounded arithmetic suitable for reasoning about PSPACE functions. This theory has the advantages of avoiding the smash function symbol...