Completely representable lattices

It is known that a lattice is representable as a ring of sets iff the lattice is distributive. CRL is the class of bounded distributive lattices (DLs) which have representations preserving arbitrary joins and meets. jCRL is the class of DLs which have representations preserving arbitrary joins, mCRL...

Full description

Saved in:
Bibliographic Details
Published in:Algebra universalis 2012-05, Vol.67 (3), p.205-217
Main Authors: Egrot, Robert, Hirsch, Robin
Format: Article
Language:English
Subjects:
Algebra
Mathematics
Mathematics and Statistics
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c288t-d46b64dad466177fe5251ef23277e8f1683168f01a5ca5497ee52e3ae38158c43
cites cdi_FETCH-LOGICAL-c288t-d46b64dad466177fe5251ef23277e8f1683168f01a5ca5497ee52e3ae38158c43
container_end_page 217
container_issue 3
container_start_page 205
container_title Algebra universalis
container_volume 67
creator Egrot, Robert
Hirsch, Robin
description It is known that a lattice is representable as a ring of sets iff the lattice is distributive. CRL is the class of bounded distributive lattices (DLs) which have representations preserving arbitrary joins and meets. jCRL is the class of DLs which have representations preserving arbitrary joins, mCRL is the class of DLs which have representations preserving arbitrary meets, and biCRL is defined to be . We prove where the marked inclusions are proper. Let L be a DL. Then iff L has a distinguishing set of complete, prime filters. Similarly, iff L has a distinguishing set of completely prime filters, and iff L has a distinguishing set of complete, completely prime filters. Each of the classes above is shown to be pseudo-elementary , hence closed under ultraproducts. The class CRL is not closed under elementary equivalence, hence it is not elementary.
doi_str_mv 10.1007/s00012-012-0181-4
format article
fullrecord <record><control><sourceid>crossref_sprin</sourceid><recordid>TN_cdi_crossref_primary_10_1007_s00012_012_0181_4</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>10_1007_s00012_012_0181_4</sourcerecordid><originalsourceid>FETCH-LOGICAL-c288t-d46b64dad466177fe5251ef23277e8f1683168f01a5ca5497ee52e3ae38158c43</originalsourceid><addsrcrecordid>eNp9j81OwzAQhC0EEqHwANzKAxi8_omdI4qAIlXiAmfLddeolZtEtjn07XEUzhw-zWFnRjuE3AN7BMb0U2aMAacLBqi8IA1IzqjpAC5JU8-cKi7ZNbnJ-Tibdaca8tCPpyliwXheJ5wSZhyK20VcR1fKwWO-JVfBxYx3f7oiX68vn_2Gbj_e3vvnLfXcmEL3st21cu-qtqB1QMUVYOCCa40mQGtEJTBwyjslO43VgcKhMKCMl2JFYOn1acw5YbBTOpxcOltgdt5ol412wYCdM3zJ5OodvjHZ4_iThvrmP6FfZA5SyA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Completely representable lattices</title><source>Springer Link</source><creator>Egrot, Robert ; Hirsch, Robin</creator><creatorcontrib>Egrot, Robert ; Hirsch, Robin</creatorcontrib><description>It is known that a lattice is representable as a ring of sets iff the lattice is distributive. CRL is the class of bounded distributive lattices (DLs) which have representations preserving arbitrary joins and meets. jCRL is the class of DLs which have representations preserving arbitrary joins, mCRL is the class of DLs which have representations preserving arbitrary meets, and biCRL is defined to be . We prove where the marked inclusions are proper. Let L be a DL. Then iff L has a distinguishing set of complete, prime filters. Similarly, iff L has a distinguishing set of completely prime filters, and iff L has a distinguishing set of complete, completely prime filters. Each of the classes above is shown to be pseudo-elementary , hence closed under ultraproducts. The class CRL is not closed under elementary equivalence, hence it is not elementary.</description><identifier>ISSN: 0002-5240</identifier><identifier>EISSN: 1420-8911</identifier><identifier>DOI: 10.1007/s00012-012-0181-4</identifier><language>eng</language><publisher>Basel: SP Birkhäuser Verlag Basel</publisher><subject>Algebra ; Mathematics ; Mathematics and Statistics</subject><ispartof>Algebra universalis, 2012-05, Vol.67 (3), p.205-217</ispartof><rights>Springer Basel AG 2012</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c288t-d46b64dad466177fe5251ef23277e8f1683168f01a5ca5497ee52e3ae38158c43</citedby><cites>FETCH-LOGICAL-c288t-d46b64dad466177fe5251ef23277e8f1683168f01a5ca5497ee52e3ae38158c43</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27903,27904</link.rule.ids></links><search><creatorcontrib>Egrot, Robert</creatorcontrib><creatorcontrib>Hirsch, Robin</creatorcontrib><title>Completely representable lattices</title><title>Algebra universalis</title><addtitle>Algebra Univers</addtitle><description>It is known that a lattice is representable as a ring of sets iff the lattice is distributive. CRL is the class of bounded distributive lattices (DLs) which have representations preserving arbitrary joins and meets. jCRL is the class of DLs which have representations preserving arbitrary joins, mCRL is the class of DLs which have representations preserving arbitrary meets, and biCRL is defined to be . We prove where the marked inclusions are proper. Let L be a DL. Then iff L has a distinguishing set of complete, prime filters. Similarly, iff L has a distinguishing set of completely prime filters, and iff L has a distinguishing set of complete, completely prime filters. Each of the classes above is shown to be pseudo-elementary , hence closed under ultraproducts. The class CRL is not closed under elementary equivalence, hence it is not elementary.</description><subject>Algebra</subject><subject>Mathematics</subject><subject>Mathematics and Statistics</subject><issn>0002-5240</issn><issn>1420-8911</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2012</creationdate><recordtype>article</recordtype><recordid>eNp9j81OwzAQhC0EEqHwANzKAxi8_omdI4qAIlXiAmfLddeolZtEtjn07XEUzhw-zWFnRjuE3AN7BMb0U2aMAacLBqi8IA1IzqjpAC5JU8-cKi7ZNbnJ-Tibdaca8tCPpyliwXheJ5wSZhyK20VcR1fKwWO-JVfBxYx3f7oiX68vn_2Gbj_e3vvnLfXcmEL3st21cu-qtqB1QMUVYOCCa40mQGtEJTBwyjslO43VgcKhMKCMl2JFYOn1acw5YbBTOpxcOltgdt5ol412wYCdM3zJ5OodvjHZ4_iThvrmP6FfZA5SyA</recordid><startdate>20120501</startdate><enddate>20120501</enddate><creator>Egrot, Robert</creator><creator>Hirsch, Robin</creator><general>SP Birkhäuser Verlag Basel</general><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>20120501</creationdate><title>Completely representable lattices</title><author>Egrot, Robert ; Hirsch, Robin</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c288t-d46b64dad466177fe5251ef23277e8f1683168f01a5ca5497ee52e3ae38158c43</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Algebra</topic><topic>Mathematics</topic><topic>Mathematics and Statistics</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Egrot, Robert</creatorcontrib><creatorcontrib>Hirsch, Robin</creatorcontrib><collection>CrossRef</collection><jtitle>Algebra universalis</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Egrot, Robert</au><au>Hirsch, Robin</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Completely representable lattices</atitle><jtitle>Algebra universalis</jtitle><stitle>Algebra Univers</stitle><date>2012-05-01</date><risdate>2012</risdate><volume>67</volume><issue>3</issue><spage>205</spage><epage>217</epage><pages>205-217</pages><issn>0002-5240</issn><eissn>1420-8911</eissn><abstract>It is known that a lattice is representable as a ring of sets iff the lattice is distributive. CRL is the class of bounded distributive lattices (DLs) which have representations preserving arbitrary joins and meets. jCRL is the class of DLs which have representations preserving arbitrary joins, mCRL is the class of DLs which have representations preserving arbitrary meets, and biCRL is defined to be . We prove where the marked inclusions are proper. Let L be a DL. Then iff L has a distinguishing set of complete, prime filters. Similarly, iff L has a distinguishing set of completely prime filters, and iff L has a distinguishing set of complete, completely prime filters. Each of the classes above is shown to be pseudo-elementary , hence closed under ultraproducts. The class CRL is not closed under elementary equivalence, hence it is not elementary.</abstract><cop>Basel</cop><pub>SP Birkhäuser Verlag Basel</pub><doi>10.1007/s00012-012-0181-4</doi><tpages>13</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0002-5240
ispartof Algebra universalis, 2012-05, Vol.67 (3), p.205-217
issn 0002-5240
1420-8911
language eng
recordid cdi_crossref_primary_10_1007_s00012_012_0181_4
source Springer Link
subjects Algebra
Mathematics
Mathematics and Statistics
title Completely representable lattices
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-28T02%3A33%3A11IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Completely%20representable%20lattices&rft.jtitle=Algebra%20universalis&rft.au=Egrot,%20Robert&rft.date=2012-05-01&rft.volume=67&rft.issue=3&rft.spage=205&rft.epage=217&rft.pages=205-217&rft.issn=0002-5240&rft.eissn=1420-8911&rft_id=info:doi/10.1007/s00012-012-0181-4&rft_dat=%3Ccrossref_sprin%3E10_1007_s00012_012_0181_4%3C/crossref_sprin%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c288t-d46b64dad466177fe5251ef23277e8f1683168f01a5ca5497ee52e3ae38158c43%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true