34 search results - page 6 / 7 » lics 2006 |
LICS
2006
IEEE
14 years 3 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...
LICS
2006
IEEE
14 years 3 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...
LICS
2006
IEEE
14 years 3 months ago
2006
IEEE
The semantics of process calculi has traditionally been specified by labelled transition systems (LTS), but with the development of name calculi it turned out that reaction rules...
LICS
2006
IEEE
14 years 3 months ago
2006
IEEE
for reasoning about abstract models of protocols. The work on informal methods attempts to discern common patterns in the extensive record of flawed protocols, and to formulate po...
LICS
2006
IEEE
14 years 3 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...