Mathematical reasoning : (Record no. 24183)

000 -LEADER
fixed length control field 02048nam a2200205 4500
001 - CONTROL NUMBER
control field vtls002388660
003 - CONTROL NUMBER IDENTIFIER
control field MY-SjTCS
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20200306154022.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 110218s2003 njua 001 eng
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 0130618152
039 #9 - LEVEL OF BIBLIOGRAPHIC CONTROL AND CODING DETAIL [OBSOLETE]
Level of rules in bibliographic description 201910021518
Level of effort used to assign nonsubject heading access points ummi
Level of effort used to assign subject headings 201102181243
Level of effort used to assign classification VLOAD
-- 200407271937
-- VLOAD
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 511.3
Item number SUN
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Sundstrom, Theodore A.
9 (RLIN) 205816
245 10 - TITLE STATEMENT
Title Mathematical reasoning :
Remainder of title writing and proof /
Statement of responsibility, etc. Ted Sundstrom
260 ## - PUBLICATION, DISTRIBUTION, ETC.
Place of publication, distribution, etc. Upper Saddle River, N.J. :
Name of publisher, distributor, etc. Prentice Hall,
Date of publication, distribution, etc. c2003.
300 ## - PHYSICAL DESCRIPTION
Extent xiv, 435 p. :
Other physical details ill. ;
Dimensions 24 cm.
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Preface. - 1. Introduction to writing in mathematics. 1.1. Statements. 1.2. Constructing direct proofs. - 2. Logical reasoning. 2.1. Predicates, sets, and quantifiers. 2.2. Statements and logical operators. 2.3. Logically equivalent statements. 2.4. Quantifiers and negations. - 3. Constructing and writing proofs in mathematics. 3.1. Direct proofs. 3.2. More methods of proof. 3.3. Proof by contradiction. 3.4. Using cases in proofs. 3.5. Constructive proofs. - 4. Set theory. 4.1. Operations on sets. 4.2. Proving set relationships. 4.3. Properties of set operations. 4.4. Cartesian products. - 5. Mathematical induction. 5.1. The principle of mathematical induction. 5.2. Other forms of mathematical induction. 5.3. Induction and recursion. 6. Function. 6.1. Introduction to functions. 6.2. More about functions. 6.3. Types of functions. 6.4. Composition of functions. 6.5. Inverse functions. - 7. Equivalence relations. 7.1. Relations. 7.2. Equivalence relations. 7.3. Equivalence classes. 7.4. Modular arithmetic. - 8. Topics in number theory. 8.1. The greatest common divisor. 8.2. Prime numbers and prime factorizations. 8.3. Linear diophantine equations. - 9. Topics in set theory. 9. 1. Functions acting on sets. 9.2. Finite sets. 9.3. Countable sets. 9.4. Uncountable sets. - A guidelines for writing mathematical proofs. - B. Answers and hints for selected exercises. - C. List of symbols. - Index.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Proof theory.
9 (RLIN) 7378
920 ## - Programme
Programme CIT(DIP) : 540283
999 ## - SYSTEM CONTROL NUMBERS (KOHA)
Koha biblionumber 24183
Koha biblioitemnumber 24183
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Permanent Location Current Location Date acquired Total Checkouts Barcode Date last seen Date last checked out Copy number Uniform Resource Identifier Koha item type Public note
          Taylor's Library-TU Taylor's Library-TU 2004-07-27 4 5000030379 2019-12-05 2014-11-06 1 Floor 4, Shelf 15 , Side 1, TierNo 4, BayNo 4 Main Collection SOCIT,15009,03,GR