Sciweavers

6978 search results - page 7 / 1396
» On Proofs in System P
Sort
View
ARSCOM
2002
69views more  ARSCOM 2002»
13 years 7 months ago
On Deuber's partition theorem for (m, p, c)-sets
In 1973, Deuber published his famous proof of Rado's conjecture regarding partition regular sets. In his proof, he invented structures called (m, p, c)-sets and gave a partit...
David S. Gunderson
TLCA
1997
Springer
13 years 11 months ago
Coinductive Axiomatization of Recursive Type Equality and Subtyping
We present new sound and complete axiomatizations of type equality and subtype inequality for a first-order type language with regular recursive types. The rules are motivated by ...
Michael Brandt, Fritz Henglein
STACS
1997
Springer
13 years 11 months ago
Probabilistic Proof Systems - A Survey
Various types of probabilistic proof systems have played a central role in the development of computer science in the last decade. In this exposition, we concentrate on three such...
Oded Goldreich
TPDS
2008
116views more  TPDS 2008»
13 years 7 months ago
Pseudo Trust: Zero-Knowledge Authentication in Anonymous P2Ps
Most trust models in Peer-to-Peer (P2P) systems are identity based, which means that in order for one peer to trust another, it needs to know the other peer's identity. Hence,...
Li Lu, Jinsong Han, Yunhao Liu, Lei Hu, Jinpeng Hu...
CADE
2008
Springer
14 years 8 months ago
randoCoP: Randomizing the Proof Search Order in the Connection Calculus
Abstract. We present randoCoP, a theorem prover for classical firstorder logic, which integrates randomized search techniques into the connection prover leanCoP 2.0. By randomly re...
Thomas Raths, Jens Otten