: A graph has the neighbor-closed-co-neighbor, or ncc property, if for each of its vertices x, the subgraph induced by the neighbor set of x is isomorphic to the subgraph induced b...
For a Heyting algebra A, we show that the following conditions are equivalent: (i) A is profinite; (ii) A is finitely approximable, complete, and completely join-prime generated; (...
Access-control policies have grown from simple matrices to non-trivial specifications written in sophisticated languages. The increasing complexity of these policies demands corres...
Daniel J. Dougherty, Kathi Fisler, Shriram Krishna...
The straightforward elimination of union types is known to break subject reduction, and for some extensions of the lambda-calculus, to break strong normalization as well. Similarly...
We investigate an application of RFIDs referred to in the literature as group scanning, in which several tags are "simultaneously" scanned by a reader device. Our goal is...