An introduction to proofs with set theory / Daniel Ashlock (University of Guelph), Colin Lee (Ashlock and McGuinnes Consulting Inc.).
"This text is intended as an introduction to mathematical proofs for students. It is distilled from the lecture notes for a course focused on set theory subject matter as a means of teaching proofs. Chapter 1 contains an introduction and provides a brief summary of some background material stud...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Ebook |
| Language: | English |
| Published: |
Cham, Switzerland :
Springer,
[2022]
|
| Series: | Synthesis lectures on mathematics and statistics ;
#35. |
| Subjects: | |
| Online Access: | Springer Nature Synthesis Collection of Technology (R0) eBook Collection 2020 |
MARC
| LEADER | 00000czm a2200000Ii 4500 | ||
|---|---|---|---|
| 005 | 20231003141646.0 | ||
| 006 | m o d | ||
| 007 | cr ||||||||||| | ||
| 008 | 230130s2022 sz a fob 001 0 eng d | ||
| 011 | |a Z3950 Record: 5 of 7 | ||
| 011 | |a Z3950 Search: @or @attr 1=7 "9783031002724" @attr 1=7 "9783031024269" | ||
| 020 | |a 3031002725 |q Internet | ||
| 020 | |a 3031024265 |q Internet | ||
| 020 | |a 9783031002724 |q Internet | ||
| 020 | |a 9783031024269 |q Internet | ||
| 020 | |z 3031012984 | ||
| 020 | |z 9783031012983 | ||
| 035 | |a (EDS)EDS100514984 | ||
| 035 | |a (OCoLC)1366501746 | ||
| 040 | |a VLB |b eng |e rda |c VLB |d VLB |d Z5A | ||
| 050 | 4 | |a QA248 |b .A755 2020eb | |
| 082 | 0 | 4 | |a 511.322 |2 23 |
| 099 | |a 511.322 ASH | ||
| 100 | 1 | |a Ashlock, Daniel, |e author. |9 859692 | |
| 245 | 1 | 3 | |a An introduction to proofs with set theory / |c Daniel Ashlock (University of Guelph), Colin Lee (Ashlock and McGuinnes Consulting Inc.). |
| 264 | 1 | |a Cham, Switzerland : |b Springer, |c [2022] | |
| 264 | 4 | |c ©2022 | |
| 300 | |a 1 online resource : |b illustrations. | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 490 | 1 | |a Synthesis lectures on mathematics and statistics, |x 1938-1751 ; |v #35 | |
| 504 | |a Includes bibliographical references and index. | ||
| 505 | 0 | 0 | |t Introduction and Review of Background Material -- |t Boolean Logic and Truth (Values) -- |t Quantified Predicates, Rules of Inference, and Arguments -- |t Mathematical Proofs -- |t Intuitive Set Theory -- |t Mathematical Induction -- |t Functions -- |t The Integers and Beyond -- |t Counting Things -- |t Relations -- |t Number Bases, Number Systems, and Operations -- |t Many Infinities: Cardinal Numbers -- |t Many Infinities: Ordinal Numbers -- |t Paradoxes and Axiomatic Set Theory. |
| 520 | |a "This text is intended as an introduction to mathematical proofs for students. It is distilled from the lecture notes for a course focused on set theory subject matter as a means of teaching proofs. Chapter 1 contains an introduction and provides a brief summary of some background material students may be unfamiliar with. Chapters 2 and 3 introduce the basics of logic for students not yet familiar with these topics. Included is material on Boolean logic, propositions and predicates, logical operations, truth tables, tautologies and contradictions, rules of inference and logical arguments. Chapter 4 introduces mathematical proofs, including proof conventions, direct proofs, proof-by-contradiction, and proof-by-contraposition. Chapter 5 introduces the basics of naive set theory, including Venn diagrams and operations on sets. Chapter 6 introduces mathematical induction and recurrence relations. Chapter 7 introduces set-theoretic functions and covers injective, surjective, and bijective functions, as well as permutations. Chapter 8 covers the fundamental properties of the integers including primes, unique factorization, and Euclid's algorithm. Chapter 9 is an introduction to combinatorics; topics included are combinatorial proofs, binomial and multinomial coefficients, the Inclusion-Exclusion principle, and counting the number of surjective functions between finite sets. Chapter 10 introduces relations and covers equivalence relations and partial orders. Chapter 11 covers number bases, number systems, and operations. Chapter 12 covers cardinality, including basic results on countable and uncountable infinities, and introduces cardinal numbers. Chapter 13 expands on partial orders and introduces ordinal numbers. Chapter 14 examines the paradoxes of naive set theory and introduces and discusses axiomatic set theory. This chapter also includes Cantor's Paradox, Russel's Paradox, a discussion of axiomatic theories, an exposition on Zermelo‒Fraenkel Set Theory with the Axiom of Choice, and a brief explanation of Gödel's Incompleteness Theorems."--Publisher's website. | ||
| 534 | |p Originally published: |c [San Rafael, California] : Morgan & Claypool, [2020] | ||
| 588 | |a Description based on online resource; title from PDF title page (Ebook Central, viewed January 30, 2023). | ||
| 650 | 0 | |a Proof theory. |9 322833 | |
| 650 | 0 | |a Set theory. |9 323862 | |
| 700 | 1 | |a Lee, C. |q (Colin), |e author. |9 1156086 | |
| 830 | 0 | |a Synthesis lectures on mathematics and statistics ; |v #35. |9 292440 | |
| 856 | 4 | 0 | |u https://ezproxy.aut.ac.nz/login?url=https://link.springer.com/10.1007/978-3-031-02426-9 |z Springer Nature Synthesis Collection of Technology (R0) eBook Collection 2020 |x TEMPORARY ERM URL |
| 942 | |c EB | ||
| 999 | |c 1820389 |d 1820389 | ||