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...
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 ...
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...
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...
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...