MARC record from Internet Archive

LEADER: 06485cam 2200733 a 4500
001 ocm23383913
003 OCoLC
005 20200106172209.0
008 910313s1992 enka b 001 0 eng
010 $a 91014090
040 $aDLC$beng$cDLC$dIAI$dXBM$dUKM$dIXA$dBAKER$dNLGGC$dBTCTA$dLVB$dYDXCP$dOCLCG$dQE2$dBTN$dZWZ$dGBVCP$dOCLCO$dOCLCF$dBDX$dOCLCQ$dIFC$dOCLCQ$dUV1$dOCLCQ$dUKMGB
015 $aGB9212262$2bnb
015 $aGB9187632$2bnb
016 7 $a010721930$2Uk
019 $a26358493$a1059079692$a1091864731
020 $a075030135X
020 $a9780750301350
020 $a0750301368$q(pbk.)
020 $a9780750301367$q(pbk.)
035 $a(OCoLC)23383913$z(OCoLC)26358493$z(OCoLC)1059079692$z(OCoLC)1091864731
050 00 $aQA76.9.M35$bG38 1992
082 00 $a004/.01/51$220
084 $a31.12$2bcl
084 $a31.76$2bcl
084 $a*00-01$2msc
084 $a00A06$2msc
100 1 $aGarnier, Rowan.
245 10 $aDiscrete mathematics for new technology /$cRowan Garnier and John Taylor.
260 $aBristol ;$aPhiladelphia :$bA. Hilger,$c℗♭1992.
300 $axvii, 678 pages :$billustrations ;$c23 cm
336 $atext$btxt$2rdacontent
337 $aunmediated$bn$2rdamedia
338 $avolume$bnc$2rdacarrier
500 $aIncludes index.
504 $aIncludes bibliographical references and index.
520 1 $a"Discrete Mathematics for New Technology has been designed to cover the core mathematics requirement for undergraduate computer science students in the UK and the USA. This has been approached in a comprehensive way whilst maintaining an easy to follow progression from the basic mathematical concepts covered by the GCSE in the UK and by high-school algebra in the USA, to the more sophisticated mathematical concepts examined in the latter stages of the book. The rigorous treatment of theory is punctuated by frequent use of pertinent examples. This is then reinforced with exercises to allow the reader to achieve a "feel" for the subject at hand. Hints and solutions are provided for these brain-teasers at the end of the book." "Although aimed primarily at computer science students, the structured development of the mathematics enables this text to be used by undergraduate mathematicians, scientists and others who require an understanding of discrete mathematics. The topics covered include: logic and the nature of mathematical proof set theory, relations and functions, matrices and systems of linear equations, algebraic structures, Boolean algebras and a thorough treatise on graph theory." "The authors have extensive experience of teaching undergraduate mathematics at colleges and universities in the British and American systems. They have developed and taught courses for a varied of non-specialists and have established reputations for presenting rigorous mathematical concepts in a manner which is accessible to this audience. Their current research interests lie in the fields of algebra, topology and mathematics education." "Discrete Mathematics for New Technology is therefore a rare thing; a readable, friendly textbook designed for non-mathematicians, presenting material which is at the foundations of mathematics itself. It is essential reading."--Jacket.
505 0 $aCh. 1. Logic. 1.1. Propositions and Truth Values. 1.2. Logical Connectives and Truth Tables. 1.3. Tautologies and Contradictions. 1.4. Logical Equivalence and Logical Implication. 1.5. The Algebra of Propositions. 1.6. More about Conditionals. 1.7. Arguments. 1.8. Predicate Logic. 1.9. Arguments in Predicate Logic -- Ch. 2. Mathematical Proof. 2.1. The Nature of Proof. 2.2. Axioms and Axiom Systems. 2.3. Methods of Proof. 2.4. Mathematical Induction -- Ch. 3. Sets. 3.1. Sets and Membership. 3.2. Subsets. 3.3. Operations on Sets. 3.4. Counting Techniques. 3.5. The Algebra of Sets. 3.6. Families of Sets. 3.7. The Cartesian Product -- Ch. 4. Relations. 4.1. Relations and Their Representations. 4.2. Properties of Relations. 4.3. Intersections and Unions of Relations. 4.4. Equivalence Relations and Partitions. 4.5. Order Relations. 4.6. Hasse Diagrams. 4.7. Application: Relational Databases -- Ch. 5. Functions. 5.1. Definitions and Examples. 5.2. Composite Functions. 5.3. Injections and Surjections.
505 8 $a5.4. Bijections and Inverse Functions. 5.5. More on Cardinality. 5.6. Databases: Functional Dependence and Normal Forms -- Ch. 6. Matrix Algebra. 6.1. Introduction. 6.2. Some Special Matrices. 6.3. Operations on Matrices. 6.4. Elementary Matrices. 6.5. The Inverse of a Matrix -- Ch. 7. Systems of Linear Equations. 7.1. Introduction. 7.2. Matrix Inverse Method. 7.3. Gauss-Jordan Elimination. 7.4. Gaussian Elimination -- Ch. 8. Algebraic Structures. 8.1. Binary Operations and their Properties. 8.2. Algebraic Structures. 8.3. More about Groups. 8.4. Some Families of Groups. 8.5. Substructures. 8.6. Morphisms. 8.7. Group Codes -- Ch. 9. Boolean Algebra. 9.1. Introduction. 9.2. Properties of Boolean Algebras. 9.3. Boolean Functions. 9.4. Switching Circuits. 9.5. Logic Networks. 9.6. Minimization of Boolean Expressions -- Ch. 10. Graph Theory. 10.1. Definitions and Examples. 10.2. Paths and Circuits. 10.3. Isomorphism of Graphs. 10.4. Trees. 10.5. Planar Graphs. 10.6. Directed Graphs.
650 0 $aComputer science$xMathematics.
650 6 $aInformatique$xMathe matiques.
650 7 $aComputer science$xMathematics.$2fast$0(OCoLC)fst00872460
650 7 $aInformatique.$2ram
650 7 $aMathe matiques.$2ram
653 0 $aMathematics
700 1 $aTaylor, John,$d1957-
856 41 $3Table of contents$uhttp://www.gbv.de/dms/bowker/toc/9780750301350.pdf
856 42 $3Inhaltstext$uhttp://www.zentralblatt-math.org/zmath/en/search/?an=0743.00001
856 42 $3Publisher description$uhttp://catdir.loc.gov/catdir/enhancements/fy0654/91014090-d.html
938 $aBaker & Taylor$bBKTY$c189.95$d189.95$i0750301368$n0002082607$sactive
938 $aBrodart$bBROD$n45192065
938 $aBaker and Taylor$bBTCP$n91014090
938 $aYBP Library Services$bYANK$n608308
029 1 $aAU@$b000007917704
029 1 $aGBVCP$b01957200X
029 1 $aHEBIS$b029361664
029 1 $aNLGGC$b082090424
029 1 $aNZ1$b3990044
029 1 $aNZ1$b50151
029 1 $aUNITY$b010194193
029 1 $aYDXCP$b608308
029 1 $aZWZ$b021935289
029 1 $aUKMGB$b010721930
994 $aZ0$bP4A
948 $hNO HOLDINGS IN P4A - 252 OTHER HOLDINGS