Theorem provers based on model elimination have exhibited extremely high inference rates but have lacked a redundancy control mechanism such as subsumption. In this paper we repor...
We describe a logic for reasoning about higher-order strictness properties of typed lambda terms. The logic arises from axiomatising the inclusion order on certain closed subsets ...
In this paper we describe some certified algorithms for exact real arithmetic based on co-recursion. Our work is based on previous experiences using redundant digits of base 2 but ...
In this work we present the principles of a flexible quantum key distribution (QKD) system using quadraturephase-shift-keying (QPSK) base and symbol encoding and dualthreshold bala...
Qing Xu 0006, Manuel Sabban, Philippe Gallion, Fra...
Inspired by recent work on approximations of classical logic, we present a method that approximates several modal logics in a modular way. Our starting point is the limitation of ...