Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleNovember 2013
Constraint satisfaction tractability from semi-lattice operations on infinite sets
ACM Transactions on Computational Logic (TOCL), Volume 14, Issue 4Article No.: 30, Pages 1–19https://doi.org/10.1145/2528933A famous result by Jeavons, Cohen, and Gyssens shows that every Constraint Satisfaction Problem (CSP) where the constraints are preserved by a semi-lattice operation can be solved in polynomial time. This is one of the basic facts for the so-called ...
- research-articleApril 2012
On Vaught’s Conjecture and finitely valued MV algebras
Mathematical Logic Quarterly (E256), Volume 58, Issue 3Pages 139–152https://doi.org/10.1002/malq.201020091AbstractWe show that the complete first order theory of an MV algebra has countable models unless the MV algebra is finitely valued. So, Vaught's Conjecture holds for all MV algebras except, possibly, for finitely valued ones. Additionally, we show ...
- research-articleMay 2003
ω‐categorical weakly o‐minimal expansions of Boolean lattices
Mathematical Logic Quarterly (E256), Volume 49, Issue 4Pages 394–400https://doi.org/10.1002/malq.200310042AbstractWe study ω‐categorical weakly o‐minimal expansions of Boolean lattices. We show that a structure 𝒜 = (A,≤, ℐ) expanding a Boolean lattice (A,≤) by a finite sequence I of ideals of A closed under the usual Heyting algebra operations is weakly o‐...