The strength of Engeler's lemma

@article{Paseka2006TheSO,
  title={The strength of Engeler's lemma},
  author={Jan Paseka},
  journal={Mathematical Structures in Computer Science},
  year={2006},
  volume={16},
  pages={291 - 297}
}
  • Jan Paseka
  • Published 2006
  • Computer Science, Mathematics
  • Mathematical Structures in Computer Science
A useful separation lemma for partial cm-lattices is proved equivalent to PIT, the Prime Ideal Theorem. The relation of various versions of the Lemma to each other and to PIT is also explored. 
More on the Strength of Engeler’s Lemma

References

SHOWING 1-10 OF 15 REFERENCES
On Krull's Separation Lemma
Prime Ideal Theory for General Algebras
  • M. Erné
  • Computer Science
  • Appl. Categorical Struct.
  • 2000
Prime elements from prime ideals
Scott-open distributive filters and prime elements of quantales
Semiprime ideals in general lattices
Distributive Quantales
  • David Kruml
  • Computer Science
  • Appl. Categorical Struct.
  • 2003
A Compactness Theorem for Infinite Constraint Satisfaction
  • R. Cowen
  • Mathematics, Computer Science
  • Reports Math. Log.
  • 1998
On Quantales and Spectra of C*-Algebras
Prime Ideal Theorems and systems of finite character
Prime elements from prime ideals. Order 2 211–213
  • Banaschewski, B. and Erné, M
  • 1985
...
1
2
...