rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Sets, Logic and Maths for Computing
  name:
    name part: Makinson, David.
    role:
      role term: creator
    role:
      role term: author.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: xxk
    date issued: 2012
    edition: 2nd ed. 2012.
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XXI, 283 p. 17 illus. online resource.
  abstract: This easy-to-follow textbook introduces the mathematical language, knowledge and problem-solving skills that undergraduate students need to enter the world of computer and information sciences. The language is in part qualitative, with concepts such as set, relation, function and recursion/induction; but it is also partly quantitative, with principles of counting and finite probability. Entwined with both are the fundamental notions of logic and their use for representation and proof. In ten chapters on these topics, the book guides the student through essential concepts and techniques. The extensively revised second edition provides further clarification of matters that typically give rise to difficulty in the classroom and restructures the chapters on logic to emphasize the role of consequence relations and higher-level rules, as well as including more exercises and solutions. Topics and features: Teaches finite mathematics as a language for thinking, as much as knowledge and skills to be acquired Uses an intuitive approach with a focus on examples for all general concepts Brings out the interplay between the qualitative and the quantitative in all areas covered, particularly in the treatment of recursion and induction Balances carefully the abstract and concrete, principles and proofs, specific facts and general perspectives Includes highlight boxes that raise common queries and clear away confusions Provides numerous exercises, with selected solutions, to test and deepen the reader’s understanding This clearly-written text/reference is a must-read for first-year undergraduate students of computing. Assuming only minimal mathematical background, it is ideal for both the classroom and independent study. Dr. David Makinson is a Visiting Professor in the Department of Philosophy, Logic and Scientific Method at the London School of Economics, UK.
  table of contents: Collecting Things Together: Sets -- Comparing Things: Relations -- Associating One Item with Another: Functions -- Recycling Outputs as Inputs: Induction and Recursion -- Counting Things: Combinatorics -- Weighing the Odds: Probability -- Squirrel Math: Trees -- Yea and Nay: Propositional Logic -- Something about Everything: Quantificational Logic -- Just Supposing: Proof and Consequence.
  note: by David Makinson.
  subject:
    topic: Computer science
  subject:
    topic: Mathematical logic
  subject:
    topic: Computer science
    topic: Mathematics
  subject:
    topic: Mathematical statistics
  subject:
    topic: Computer mathematics
  subject:
    topic: Computer Science
  subject:
    topic: Discrete Mathematics in Computer Science
  subject:
    topic: Mathematical Logic and Formal Languages
  subject:
    topic: Symbolic and Algebraic Manipulation
  subject:
    topic: Probability and Statistics in Computer Science
  subject:
    topic: Computational Mathematics and Numerical Analysis
  classification: QA76.9.M35
  classification: 004.0151
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Undergraduate Topics in Computer Science
  identifier: 9781447125006
  identifier: http://dx.doi.org/10.1007/978-1-4471-2500-6
  record info:
    record creation date: 120227
    record change date: 20151204170611.0
    record identifier: 978-1-4471-2500-6