Maximal essential extensions in the context of frames

Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F18%3A10386932" target="_blank" >RIV/00216208:11320/18:10386932 - isvavai.cz</a>
Výsledek na webu
<a href="https://doi.org/10.1007/s00012-018-0508-x" target="_blank" >https://doi.org/10.1007/s00012-018-0508-x</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s00012-018-0508-x" target="_blank" >10.1007/s00012-018-0508-x</a>

Jazyk výsledku
angličtina
Název v původním jazyce
Maximal essential extensions in the context of frames
Popis výsledku v původním jazyce
We show that every frame can be essentially embedded in a Boolean frame, and that this embedding is the maximal essential extension of the frame in the sense that it factors uniquely through any other essential extension. This extension can be realized as the embedding L -> N(L) -> BN(L), where L -> N(L) is the familiar embedding of L into its congruence frame N(L), and N(L) -> BN(L) is the Booleanization of N(L). Finally, we show that for subfit frames the extension can also be realized as the embedding L -> S-c(L) of L into its complete Boolean algebra S-c(L) of sublocales which are joins of closed sublocales.
Název v anglickém jazyce
Maximal essential extensions in the context of frames
Popis výsledku anglicky
We show that every frame can be essentially embedded in a Boolean frame, and that this embedding is the maximal essential extension of the frame in the sense that it factors uniquely through any other essential extension. This extension can be realized as the embedding L -> N(L) -> BN(L), where L -> N(L) is the familiar embedding of L into its congruence frame N(L), and N(L) -> BN(L) is the Booleanization of N(L). Finally, we show that for subfit frames the extension can also be realized as the embedding L -> S-c(L) of L into its complete Boolean algebra S-c(L) of sublocales which are joins of closed sublocales.

Druh
J<sub>imp</sub> - Článek v periodiku v databázi Web of Science
CEP obor
—
OECD FORD obor
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt
<a href="/cs/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Centrum excelence - Institut teoretické informatiky (CE-ITI)</a><br>
Návaznosti
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění
2018
Kód důvěrnosti údajů
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Podobné výsledky(10)