119 search results - page 5 / 24 » A First-Order Isomorphism Theorem |
72
Voted
CONCUR
1997
Springer
15 years 2 months ago
1997
Springer
We study properties of asynchronous communication independently of any concrete concurrent process paradigm. We give a general-purpose, mathematically rigorous definition of sever...
73
Voted
CIE
2008
Springer
14 years 10 months ago
2008
Springer
We study the complexity of the model checking problem, for fixed models A, over certain fragments L of first-order logic, obtained by restricting which of the quantifiers and boole...
ENTCS
2006
14 years 10 months ago
2006
Effective formal verification tools require that robust implementations of automatic procedures for first-order logic and satisfiability modulo theories be integrated into express...
IGPL
2002
14 years 10 months ago
2002
Fibring is defined as a mechanism for combining logics with a firstorder base, at both the semantic and deductive levels. A completeness theorem is established for a wide class of...
79
Voted
JSYML
2010
14 years 5 months ago
2010
A set A of vertices of a graph G is called d-scattered in G if no two d-neighborhoods of (distinct) vertices of A intersect. In other words, A is d-scattered if no two distinct ver...