<?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>Sets, logic and maths for computing</title>
  </titleInfo>
  <name type="personal">
    <namePart>Makinson, David.</namePart>
    <role>
      <roleTerm authority="marcrelator" type="text">creator</roleTerm>
    </role>
  </name>
  <typeOfResource>text</typeOfResource>
  <genre authority="marc">bibliography</genre>
  <originInfo>
    <place>
      <placeTerm type="code" authority="marccountry">nyu</placeTerm>
    </place>
    <place>
      <placeTerm type="text">New York</placeTerm>
    </place>
    <publisher>Springer</publisher>
    <dateIssued>2008</dateIssued>
    <issuance>monographic</issuance>
  </originInfo>
  <language>
    <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
  </language>
  <physicalDescription>
    <form authority="marcform">print</form>
    <extent>xv, 301 p. : ill. ; 24 cm.</extent>
  </physicalDescription>
  <abstract>This easy-to-follow text allows readers to carry out their computing studies with a clear understanding of the basic finite mathematics and logic that they will need. Written explicitly for undergraduates, it requires only a minimal mathematical background and is ideal for self-study as well as classroom use</abstract>
  <tableOfContents>Before the Beginning.- Do I really need to know about this?.- Proving and disproving: Logical techniques.- Proving and disproving: Mathematical techniques.- First Steps.- Flat set theory.- Families of sets.- Relations.- Functions.- Structures.- Order.- Trees.- Graphs.- Logic.- Truth-functional connectives.- Quantifiers.- Counting.- The pigeonhole principles.- The addition and multiplication rules.- Selection rules.- Probability.- The Kolmogorov axioms for finitely additive probability.- Combining combinatorics and probability</tableOfContents>
  <targetAudience authority="marctarget">specialized</targetAudience>
  <note type="statement of responsibility">by David Makinson</note>
  <note>Includes bibliographical references and index</note>
  <subject authority="lcsh">
    <topic>Computer science</topic>
    <topic>Mathematics</topic>
  </subject>
  <subject authority="rvm">
    <topic>Informatique</topic>
    <topic>Mathématiques</topic>
  </subject>
  <relatedItem type="series">
    <titleInfo>
      <title>Undergraduate topics in computer science</title>
    </titleInfo>
  </relatedItem>
  <identifier type="isbn">9781846288449</identifier>
  <identifier type="isbn">1846288444</identifier>
  <recordInfo>
    <recordContentSource authority="marcorg">UMP</recordContentSource>
    <recordCreationDate encoding="marc">090617</recordCreationDate>
    <recordChangeDate encoding="iso8601">20251117145416.0</recordChangeDate>
    <recordIdentifier source="KUKTEM">vtls000038070</recordIdentifier>
  </recordInfo>
</mods>
