<?xml version="1.0" encoding="UTF-8"?>
<mods xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" version="3.1" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
  <titleInfo>
    <title>Finite Ordered Sets</title>
    <subTitle>Concepts, Results and Uses / [electronic resource]</subTitle>
  </titleInfo>
  <name type="personal">
    <namePart>Caspard, Nathalie</namePart>
    <role>
      <roleTerm authority="marcrelator" type="text">creator</roleTerm>
    </role>
    <role>
      <roleTerm type="text">author.</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Leclerc, Bruno</namePart>
    <role>
      <roleTerm type="text">author.</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Monjardet, Bernard</namePart>
    <role>
      <roleTerm type="text">author.</roleTerm>
    </role>
  </name>
  <typeOfResource>text</typeOfResource>
  <originInfo>
    <place>
      <placeTerm type="code" authority="marccountry">enk</placeTerm>
    </place>
    <dateIssued encoding="marc">2012</dateIssued>
    <issuance>monographic</issuance>
  </originInfo>
  <language>
    <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
  </language>
  <physicalDescription>
    <form authority="marcform">electronic</form>
    <extent>1 online resource (350 pages) : digital, PDF file(s).</extent>
  </physicalDescription>
  <abstract>Ordered sets are ubiquitous in mathematics and have significant applications in computer science, statistics, biology and the social sciences. As the first book to deal exclusively with finite ordered sets, this book will be welcomed by graduate students and researchers in all of these areas. Beginning with definitions of key concepts and fundamental results (Dilworth's and Sperner's theorem, interval and semiorders, Galois connection, duality with distributive lattices, coding and dimension theory), the authors then present applications of these structures in fields such as preference modelling and aggregation, operational research and management, cluster and concept analysis, and data mining. Exercises are included at the end of each chapter with helpful hints provided for some of the most difficult examples. The authors also point to further topics of ongoing research.</abstract>
  <note type="statement of responsibility">Nathalie Caspard, Bruno Leclerc, Bernard Monjardet.</note>
  <note>Title from publisher's bibliographic system (viewed on 09 Oct 2015).</note>
  <subject authority="lcsh">
    <topic>Ordered sets</topic>
  </subject>
  <subject authority="lcsh">
    <topic>Finite groups</topic>
  </subject>
  <classification authority="lcc">QA171.48  .C374 2012</classification>
  <classification authority="ddc" edition="23">511.3/2</classification>
  <relatedItem type="series">
    <titleInfo>
      <title>Encyclopedia of Mathematics and its Applications ; no. 144</title>
    </titleInfo>
  </relatedItem>
  <relatedItem type="otherFormat" displayLabel="Print version: "/>
  <relatedItem type="series">
    <titleInfo>
      <title>Encyclopedia of Mathematics and its Applications ; no. 144</title>
    </titleInfo>
  </relatedItem>
  <identifier type="isbn">9781139005135 (ebook)</identifier>
  <identifier type="isbn" invalid="yes"/>
  <identifier type="uri">http://dx.doi.org/10.1017/CBO9781139005135</identifier>
  <location>
    <url>http://dx.doi.org/10.1017/CBO9781139005135</url>
  </location>
  <recordInfo>
    <recordContentSource authority="marcorg">UkCbUP</recordContentSource>
    <recordCreationDate encoding="marc">110131</recordCreationDate>
    <recordChangeDate encoding="iso8601">20180107143414.0</recordChangeDate>
    <recordIdentifier source="UkCbUP">CR9781139005135</recordIdentifier>
  </recordInfo>
</mods>
