42 search results - page 3 / 9 » The proof monad |
STACS
2001
Springer
13 years 10 months ago
2001
Springer
In 1974 R. Fagin proved that properties of structures which are in NP are exactly the same as those expressible by existential second order sentences, that is sentences of the form...
LOPSTR
2009
Springer
14 years 16 days ago
2009
Springer
Abstract. We present a method based on logic program transformation, for verifying Computation Tree Logic (CTL∗ ) properties of finite state reactive systems. The finite state ...
ITP
2010
13 years 10 months ago
2010
Abstract. This paper presents a new HOL4 formalization of the current ARM instruction set architecture, ARMv7. This is a modern RISC architecture with many advanced features. The f...
CLIMA
2006
13 years 7 months ago
2006
If we are to take the notion of speech act seriously, we must be able to treat speech acts as acts. In what follows, I will try to model changes brought about by various acts of co...
CSL
2007
Springer
13 years 10 months ago
2007
Springer
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...