| 000 -LEADER |
|---|
| fixed length control field |
03911nam a22004815i 4500 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
OSt |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20140310151110.0 |
| 007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION |
|---|
| fixed length control field |
cr nn 008mamaa |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
120227s2012 xxk| s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9781447125006 |
|
978-1-4471-2500-6 |
| 050 #4 - LIBRARY OF CONGRESS CALL NUMBER |
|---|
| Classification number |
QA76.9.M35 |
| 082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
004.0151 |
| Edition number |
23 |
| 264 #1 - |
|---|
| -- |
London : |
| -- |
Springer London, |
| -- |
2012. |
| 912 ## - |
|---|
| -- |
ZDB-2-SCS |
| 100 1# - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Makinson, David. |
| Relator term |
author. |
| 245 10 - IMMEDIATE SOURCE OF ACQUISITION NOTE |
|---|
| Title |
Sets, Logic and Maths for Computing |
| Medium |
[electronic resource] / |
| Statement of responsibility, etc |
by David Makinson. |
| 250 ## - EDITION STATEMENT |
|---|
| Edition statement |
2nd ed. 2012. |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
XXI, 283p. 17 illus. |
| Other physical details |
online resource. |
| 440 1# - SERIES STATEMENT/ADDED ENTRY--TITLE |
|---|
| Title |
Undergraduate Topics in Computer Science, |
| International Standard Serial Number |
1863-7310 |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
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. |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc |
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. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Computer science. |
|
|---|
| Topical term or geographic name as entry element |
Computational complexity. |
|
|---|
| Topical term or geographic name as entry element |
Algebra |
| General subdivision |
Data processing. |
|
|---|
| Topical term or geographic name as entry element |
Computer science |
| General subdivision |
Mathematics. |
|
|---|
| Topical term or geographic name as entry element |
Computer Science. |
|
|---|
| Topical term or geographic name as entry element |
Discrete Mathematics in Computer Science. |
|
|---|
| Topical term or geographic name as entry element |
Mathematical Logic and Formal Languages. |
|
|---|
| Topical term or geographic name as entry element |
Symbolic and Algebraic Manipulation. |
|
|---|
| Topical term or geographic name as entry element |
Probability and Statistics in Computer Science. |
|
|---|
| Topical term or geographic name as entry element |
Computational Mathematics and Numerical Analysis. |
| 710 2# - ADDED ENTRY--CORPORATE NAME |
|---|
| Corporate name or jurisdiction name as entry element |
SpringerLink (Online service) |
| 773 0# - HOST ITEM ENTRY |
|---|
| Title |
Springer eBooks |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY |
|---|
| Display text |
Printed edition: |
| International Standard Book Number |
9781447124993 |
| 856 40 - ELECTRONIC LOCATION AND ACCESS |
|---|
| Uniform Resource Identifier |
http://dx.doi.org/10.1007/978-1-4471-2500-6 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Source of classification or shelving scheme |
|
| Item type |
E-Book |
