5 citations · 10 across the 5 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.LO2011★ 2 cited
Intuitionistic Completeness of First-Order Logic
Robert Constable, Mark Bickford
We establish completeness for intuitionistic first-order logic, iFOL, showing that a formula is provable if and only if its embedding into minimal logic, mFOL, is uniformly valid u…
cs.LO2011★ 5 cited
Effectively Nonblocking Consensus Procedures Can Execute Forever - a Constructive Version of FLP
Robert Constable
The Fischer-Lynch-Paterson theorem (FLP) says that it is impossible for processes in an asynchronous distributed system to achieve consensus on a binary value when a single process…