178 search results - page 28 / 36 » Boolean Algebras in Visser Algebras |
ENTCS
2006
14 years 9 months ago
2006
Several variants of Bryant's ordered binary decision diagrams have been suggested in the literature to reason about discrete functions. In this paper, we introduce a generic ...
77
Voted
CORR
2007
Springer
14 years 9 months ago
2007
Springer
When a physicist performs a quantic measurement, new information about the system at hand is gathered. This presentation studies the logical properties of how this new information...
119
Voted
FROCOS
2009
Springer
15 years 4 months ago
2009
Springer
Motivated by applications in software verification, we explore automated reasoning about the non-disjoint combination of theories of infinitely many finite structures, where the...
68
Voted
MFCS
2009
Springer
15 years 4 months ago
2009
Springer
Functional graph grammars are finite devices which generate the class of regular automata. We recall the notion of synchronization by grammars, and for any given grammar we consid...
86
Voted
CALCO
2005
Springer
15 years 3 months ago
2005
Springer
Every endofunctor B on the category Set can be lifted to a fibred functor on the category (fibred over Set) of equivalence relations and relation-preserving functions. In this pa...