We investigate existentially complete lattice-ordered groups in this paper. In particular, we list some of their algebraic properties and show that there are continuum many countable pairwise non-elementarily equivalent such latticeordered groups. In particular, existentially complete lattice-ordered groups...
In [5], they show that Q/JM has the strong Lefshetz property in the narrow sense (see Definition 4.1 for the definition, see also [2]) if and only if the lattice L(M) is modular, and that Q/JM=AM if and only if L(M) is modular. In [3], for a simple matroid M with ...
Node Expr Node impl Stmt Expr impl Decl Stmt impl Var Decl impl Var impl Figure 2: Early design of the IPR class hierarchy The obvious design of such class hierarchies is an elaborate lattice relying on interfaces presented as abstract virtual base classes, and implementation class hierarchies, ...
poset is less than the ω-th infinite cardinal. If one accepts the Continuum Hypothesis this means that the weaker relation is adequate in many posets likely to be of interest to computer science. Finally, even in the presence of the "weaker" type of basis in a complete lattice, the meet...
Optimal Broadcast Encryption and CP-ABE from Evasive Lattice Assumptions Chapter © 2022 Broadcast Encryption with Size $$N^{1/3}$$ and More from k-Lin Chapter © 2021 References AACS: Advanced Access Content System, http://www.aacsla.com . Asano T.: A revocation scheme with mini...
We study the complexity of the evaluation of bounded-variable fixpoint queries in relational databases. We exhibit a finite database such that the problem of deciding whether a closed fixpoint formula using only 2 individual variables is satisfied in this database is PSPACE-complete. This clarifies...
Minimal pairs and complete problems Steven Homer © 1990 Springer-Verlag Berlin Heidelberg