國立虎尾科技大學 |

Introduction to Discrete Mathematics via Logic and Proof

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Introduction to Discrete Mathematics via Logic and Proof/ by Calvin Jongsma.
Author:	Jongsma, Calvin.
Description:	XX, 482 p. 854 illus., 5 illus. in color.online resource. :
Contained By:	Springer Nature eBook
Subject:	Discrete mathematics. -
Online resource:	https://doi.org/10.1007/978-3-030-25358-5
ISBN:	9783030253585

Introduction to Discrete Mathematics via Logic and Proof
Jongsma, Calvin.

Introduction to Discrete Mathematics via Logic and Proof[electronic resource] /by Calvin Jongsma. - 1st ed. 2019. - XX, 482 p. 854 illus., 5 illus. in color.online resource. - Undergraduate Texts in Mathematics,0172-6056. - Undergraduate Texts in Mathematics,.

Preface -- List of Notations -- 1. Propositional Logic -- 2. First-Order Logic -- 3. Mathematical Induction and Arithmetic -- 4. Basic Set Theory and Combinatorics -- 5. Set Theory and Infinity -- 6. Functions and Equivalence Relations -- 7. Posets, Lattices, and Boolean Algebra -- 8. Topics in Graph Theory -- A. Inference Rules for PL and FOL -- Index.

This textbook introduces discrete mathematics by emphasizing the importance of reading and writing proofs. Because it begins by carefully establishing a familiarity with mathematical logic and proof, this approach suits not only a discrete mathematics course, but can also function as a transition to proof. Its unique, deductive perspective on mathematical logic provides students with the tools to more deeply understand mathematical methodology—an approach that the author has successfully classroom tested for decades. Chapters are helpfully organized so that, as they escalate in complexity, their underlying connections are easily identifiable. Mathematical logic and proofs are first introduced before moving onto more complex topics in discrete mathematics. Some of these topics include: Mathematical and structural induction Set theory Combinatorics Functions, relations, and ordered sets Boolean algebra and Boolean functions Graph theory Introduction to Discrete Mathematics via Logic and Proof will suit intermediate undergraduates majoring in mathematics, computer science, engineering, and related subjects with no formal prerequisites beyond a background in secondary mathematics.

ISBN: 9783030253585

Standard No.: 10.1007/978-3-030-25358-5doiSubjects--Topical Terms:

1254302
Discrete mathematics.

LC Class. No.: QA150-272

Dewey Class. No.: 511.1

Introduction to Discrete Mathematics via Logic and Proof
LDR:02978nam a22004095i 4500 001 1011742
003 DE-He213
005 20200702151347.0
007 cr nn 008mamaa
008 210106s2019 gw | s |||| 0|eng d
020 $a 9783030253585 $9 978-3-030-25358-5
024 7 $a 10.1007/978-3-030-25358-5 $2 doi
035 $a 978-3-030-25358-5
050 4 $a QA150-272
072 7 $a PBD $2 bicssc
072 7 $a MAT008000 $2 bisacsh
072 7 $a PBD $2 thema
082 0 4 $a 511.1 $2 23
100 1 $a Jongsma, Calvin. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1305937
245 1 0 $a Introduction to Discrete Mathematics via Logic and Proof $h [electronic resource] / $c by Calvin Jongsma.
250 $a 1st ed. 2019.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a XX, 482 p. 854 illus., 5 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Undergraduate Texts in Mathematics, $x 0172-6056
505 0 $a Preface -- List of Notations -- 1. Propositional Logic -- 2. First-Order Logic -- 3. Mathematical Induction and Arithmetic -- 4. Basic Set Theory and Combinatorics -- 5. Set Theory and Infinity -- 6. Functions and Equivalence Relations -- 7. Posets, Lattices, and Boolean Algebra -- 8. Topics in Graph Theory -- A. Inference Rules for PL and FOL -- Index.
520 $a This textbook introduces discrete mathematics by emphasizing the importance of reading and writing proofs. Because it begins by carefully establishing a familiarity with mathematical logic and proof, this approach suits not only a discrete mathematics course, but can also function as a transition to proof. Its unique, deductive perspective on mathematical logic provides students with the tools to more deeply understand mathematical methodology—an approach that the author has successfully classroom tested for decades. Chapters are helpfully organized so that, as they escalate in complexity, their underlying connections are easily identifiable. Mathematical logic and proofs are first introduced before moving onto more complex topics in discrete mathematics. Some of these topics include: Mathematical and structural induction Set theory Combinatorics Functions, relations, and ordered sets Boolean algebra and Boolean functions Graph theory Introduction to Discrete Mathematics via Logic and Proof will suit intermediate undergraduates majoring in mathematics, computer science, engineering, and related subjects with no formal prerequisites beyond a background in secondary mathematics.
650 0 $a Discrete mathematics. $3 1254302
650 0 $a Mathematical logic. $2 bicssc $3 810627
650 1 4 $a Discrete Mathematics. $3 796600
650 2 4 $a Mathematical Logic and Foundations. $3 669393
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030253578
776 0 8 $i Printed edition: $z 9783030253592
776 0 8 $i Printed edition: $z 9783030253608
830 0 $a Undergraduate Texts in Mathematics, $x 0172-6056 $3 1253653
856 4 0 $u https://doi.org/10.1007/978-3-030-25358-5
912 $a ZDB-2-SMA
912 $a ZDB-2-SXMS
950 $a Mathematics and Statistics (SpringerNature-11649)
950 $a Mathematics and Statistics (R0) (SpringerNature-43713)