<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">445813695</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180317145219.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170323e20110301xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s11083-010-9152-6</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s11083-010-9152-6</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
   <subfield code="a">Cīrulis</subfield>
   <subfield code="D">Jānis</subfield>
   <subfield code="u">Department of Computing, University of Latvia, Raiņa b. 19, 1586, Riga, Latvia</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
   <subfield code="a">Nearlattices with an Overriding Operation</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Jānis Cīrulis]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">A nearlattice A is a meet semilattice in which every initial segment is a lattice; A is said to be Boolean if all of these lattices are Boolean. Overriding on A is a binary operation $\triangleleft$ defined by $ a \triangleleft {b} := \sup\{x\colon (x \le a \mbox{ and } x {\mathrel{\mbox{\,\raisebox{.7ex}{$\scriptstyle|$}\hspace{-.75ex}\raisebox{-.35ex}{$\circ$}}}}b) \mbox{ or } x \le b\} $, where $x{\mathrel{\mbox{\,\raisebox{.7ex}{$\scriptstyle|$}\hspace{-.75ex}\raisebox{-.35ex}{$\circ$}}}}b$ means that the join of x and b exists. In particular, ${\triangleleft}$ extends the partial join operation. Natural examples of overriding nearlattices are provided by trees and by appropriate algebras of partial functions. In the paper, elementary properties of overriding are studied, an axiomatic description of it is obtained, and several results concerning associativity of the operation and the structure of function nearlattices with overriding are presented. The main result is a representation theorem (in terms of algebras of partial functions) for Boolean nearlattices with associative overriding.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer Science+Business Media B.V., 2010</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Flat poset</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Nearlattice</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Overriding</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Semilattice</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Subdirectly irreducible</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Subdirect product</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Tree</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Order</subfield>
   <subfield code="d">Springer Netherlands</subfield>
   <subfield code="g">28/1(2011-03-01), 33-51</subfield>
   <subfield code="x">0167-8094</subfield>
   <subfield code="q">28:1&lt;33</subfield>
   <subfield code="1">2011</subfield>
   <subfield code="2">28</subfield>
   <subfield code="o">11083</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s11083-010-9152-6</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1007/s11083-010-9152-6</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">100</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Cīrulis</subfield>
   <subfield code="D">Jānis</subfield>
   <subfield code="u">Department of Computing, University of Latvia, Raiņa b. 19, 1586, Riga, Latvia</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Order</subfield>
   <subfield code="d">Springer Netherlands</subfield>
   <subfield code="g">28/1(2011-03-01), 33-51</subfield>
   <subfield code="x">0167-8094</subfield>
   <subfield code="q">28:1&lt;33</subfield>
   <subfield code="1">2011</subfield>
   <subfield code="2">28</subfield>
   <subfield code="o">11083</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
 </record>
</collection>
