Teaching engineering students courses such as computer science theory, automata theory and discrete mathematics took us to realize that introducing basic notions of logic, especial...
Abstract. This paper describes an attempt to combine theorem proving and model-checking to formally verify real-time systems in a discrete time setting. The Timed Automata Modeling...
In Twenty Problems in the Theory of Cellular Automata, Stephen Wolfram asks “how common computational universality and undecidability [are] in cellular automata.” This papers p...
We give a new proof showing that it is not possible to define in monadic second-order logic (MSO) a choice function on the infinite binary tree. This result was first obtained by G...
Axiomatic characterization results in social choice theory are usually compared either regarding the normative plausibility or regarding the logical strength of the axioms involved...