PASEKA, Jan. The strength of Engeler's lemma. Mathematical Structures in Computer Science. Cambridge: Cambridge University Press, 2006, vol. 16, No 2, p. 291-297. ISSN 0960-1295.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name The strength of Engeler's lemma
Name in Czech Síla Engelerova lemmatu
Authors PASEKA, Jan (203 Czech Republic, guarantor).
Edition Mathematical Structures in Computer Science, Cambridge, Cambridge University Press, 2006, 0960-1295.
Other information
Original language English
Type of outcome Article in a journal
Field of Study 10101 Pure mathematics
Country of publisher United Kingdom of Great Britain and Northern Ireland
Confidentiality degree is not subject to a state or trade secret
Impact factor Impact factor: 1.102
RIV identification code RIV/00216224:14310/06:00015879
Organization unit Faculty of Science
UT WoS 000238274300009
Keywords in English partial semilattice; Engeler's lemma; Prime Ideal Theorem; quantale
Tags Engeler's lemma, partial semilattice, Prime Ideal Theorem, quantale
Changed by Changed by: prof. RNDr. Jan Paseka, CSc., učo 1197. Changed: 25/6/2009 15:26.
Abstract
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.
Abstract (in Czech)
Je dokázán ekvivalence užitečného lemmatu o oddělování pro parciální cm-svazy s PIT (věta o prvoideálu). Zároveň je zkoumán vztah různých verzí lemmatu mezi sebou a s PIT.
Links
GA201/02/0148, research and development projectName: Kategoriální metody teorie struktur a informatiky
Investor: Czech Science Foundation, Categorical Methods of the Theory of Structures and Computer Science
PrintDisplayed: 22/5/2024 04:19