We present a method for using standard techniques from satisfiability checking to automatically verify and discover theorems in an area of economic theory known as ranking sets o...
All sufficient (as well as necessary) conditions for a binary relation on a metric space to admit a maximal element on every nonempty compact subset of its domain that have been f...
We study the equational theory of Timed CCS as proposed by Wang Yi in CONCUR’90. Common to Wang Yi’s paper, we particularly focus on a class of linearly-ordered time domains ex...
We give two impossibility results regarding strong encryption over an infinite enumerable domain. The first one relates to statistically secure one-time encryption. The second on...