We want to prove \automatically" that a program is correct with respect to a set of given properties that is a speci cation. Proofs of speci cations contain logical parts and ...
Abstract. Motivated by strong Karp-Lipton collapse results in bounded arithmetic, Cook and Kraj´ıˇcek [7] have recently introduced the notion of propositional proof systems with...
Arrow’s Impossibility Theorem is one of the landmark results in social choice theory. Over the years since the theorem was proved in 1950, quite a few alternative proofs have be...
Abstract. Besides the features of a class-based object-oriented language, Java integrates concurrency via its thread-classes, allowing for a multithreaded flow of control. Besides ...
Abstract. We present a new proof of axiomatic completeness for Proposition Temporal Logic (PTL) for discrete, linear time for both finite and infinite time (without past-time). T...