國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Introduction to discrete mathematics...

Jongsma, Calvin.

Introduction to discrete mathematics via logic and proof

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Introduction to discrete mathematics via logic and proofby Calvin Jongsma.
作者:	Jongsma, Calvin.
出版者:	Cham :Springer International Publishing :2019.
面頁冊數:	xx, 482 p. :ill. (some col.), digital ;24 cm.
Contained By:	Springer eBooks
標題:	Discrete mathematics.
電子資源:	https://doi.org/10.1007/978-3-030-25358-5
ISBN:	9783030253585$q(electronic bk.)

Introduction to discrete mathematics via logic and proof
Jongsma, Calvin.

Introduction to discrete mathematics via logic and proof[electronic resource] /by Calvin Jongsma. - Cham :Springer International Publishing :2019. - xx, 482 p. :ill. (some col.), digital ;24 cm. - 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$q(electronic bk.)

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

853871
Discrete mathematics.

LC Class. No.: QA297.4 / .J65 2019

Dewey Class. No.: 511.1

Introduction to discrete mathematics via logic and proof
LDR:02596nmm a2200337 a 4500 001 569642
003 DE-He213
005 20191108085629.0
006 m d
007 cr nn 008maaau
008 200723s2019 gw s 0 eng d
020 $a 9783030253585$q(electronic bk.)
020 $a 9783030253578$q(paper)
024 7 $a 10.1007/978-3-030-25358-5 $2 doi
035 $a 978-3-030-25358-5
040 $a GP $c GP
041 0 $a eng
050 4 $a QA297.4 $b .J65 2019
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
090 $a QA297.4 $b .J79 2019
100 1 $a Jongsma, Calvin. $3 855733
245 1 0 $a Introduction to discrete mathematics via logic and proof $h [electronic resource] / $c by Calvin Jongsma.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a xx, 482 p. : $b ill. (some col.), digital ; $c 24 cm.
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 853871
650 2 4 $a Mathematical Logic and Foundations. $3 274479
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
830 0 $a Undergraduate texts in mathematics. $3 490158
856 4 0 $u https://doi.org/10.1007/978-3-030-25358-5
950 $a Mathematics and Statistics (Springer-11649)