166
click to vote
LICS
15 years 10 months ago
2006 IEEE 
We consider the monadic boundedness problem for least fixed points over FO formulae as a decision problem: Given a formula ϕ(X, x), positive in X, decide whether there is a unif...
156
click to vote
LICS
15 years 10 months ago
2006 IEEE
In this paper we show that the Stone representation theorem for Boolean algebras can be generalized to combinatory algebras. In every combinatory algebra there is a Boolean algebr...
146
Voted
LICS
15 years 10 months ago
2006 IEEE
We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by order-n recursion schemes (whether safe or not, and w...
159
click to vote
LICS
15 years 10 months ago
2006 IEEE 
d Abstract) Marcelo Fiore∗ and Sam Staton† Computer Laboratory, University of Cambridge We introduce a mathematical structural operational semantics that yields a congruence r...
135
click to vote
LICS
15 years 10 months ago
2006 IEEE 
A compositional Petri net based semantics is given to a simple pointer-manipulating language. The model is then applied to give a notion of validity to the judgements made by conc...
|
Automated Reasoning