MAT 224: Foundations of Higher Mathematics

Similar documents
Mat 243 Exam 1 Review

Lecture Notes 1 Basic Concepts of Mathematics MATH 352

Chapter 1 : The language of mathematics.

MATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017

586 Index. vertex, 369 disjoint, 236 pairwise, 272, 395 disjoint sets, 236 disjunction, 33, 36 distributive laws

Review CHAPTER. 2.1 Definitions in Chapter Sample Exam Questions. 2.1 Set; Element; Member; Universal Set Partition. 2.

Exploring the infinite : an introduction to proof and analysis / Jennifer Brooks. Boca Raton [etc.], cop Spis treści

HANDOUT AND SET THEORY. Ariyadi Wijaya

Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes

Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr.

MAT2345 Discrete Math

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics. Introductory Notes in Discrete Mathematics Solution Guide

The following techniques for methods of proofs are discussed in our text: - Vacuous proof - Trivial proof

MATH 2200 Final Review

Proofs. Joe Patten August 10, 2018

Section 3.1: Direct Proof and Counterexample 1

MATH 13 FINAL EXAM SOLUTIONS

Math Survey Curriculum Guide Scranton School District Scranton, PA

MATH 115 Concepts in Mathematics

Finite Mathematics

Final Exam Review. 2. Let A = {, { }}. What is the cardinality of A? Is

Tribhuvan University Institute of Science and Technology Micro Syllabus

Handbook of Logic and Proof Techniques for Computer Science

CSE 1400 Applied Discrete Mathematics Proofs

Discrete Mathematics: Lectures 6 and 7 Sets, Relations, Functions and Counting Instructor: Arijit Bishnu Date: August 4 and 6, 2009

CSCE 222 Discrete Structures for Computing. Review for Exam 1. Dr. Hyunyoung Lee !!!

Section 1.7 Proof Methods and Strategy. Existence Proofs. xp(x). Constructive existence proof:

COMP 182 Algorithmic Thinking. Proofs. Luay Nakhleh Computer Science Rice University

MATH 2200 Final LC Review

MATH 363: Discrete Mathematics

Discrete Mathematics. W. Ethan Duckworth. Fall 2017, Loyola University Maryland

Contents Propositional Logic: Proofs from Axioms and Inference Rules

Logic and Proof. Aiichiro Nakano

Chapter 1, Logic and Proofs (3) 1.6. Rules of Inference

Math Final Exam December 14, 2009 Page 1 of 5

UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION B Sc (MATHEMATICS) I Semester Core Course. FOUNDATIONS OF MATHEMATICS (MODULE I & ii) QUESTION BANK

n logical not (negation) n logical or (disjunction) n logical and (conjunction) n logical exclusive or n logical implication (conditional)

n Empty Set:, or { }, subset of all sets n Cardinality: V = {a, e, i, o, u}, so V = 5 n Subset: A B, all elements in A are in B

CA320 - Computability & Complexity

PURE MATHEMATICS Unit 1

COURSE OUTLINE CHAFFEY COLLEGE

Discrete Mathematics & Mathematical Reasoning Course Overview

5 Set Operations, Functions, and Counting

STRATEGIES OF PROBLEM SOLVING

FOUNDATION OF COMPUTER SCIENCE ETCS-203

Lecture 1. Econ 2001: Introduction to Mathematical Methods (a.k.a. Math Camp) 2015 August 10

Notation Index. gcd(a, b) (greatest common divisor) NT-16

SETS AND FUNCTIONS JOSHUA BALLEW

Propositional Logic, Predicates, and Equivalence

Lecture 2. Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits. Reading (Epp s textbook)

1. Mathematical Proofs

Section 1.2 Propositional Equivalences. A tautology is a proposition which is always true. A contradiction is a proposition which is always false.

Steinhardt School of Culture, Education, and Human Development Department of Teaching and Learning. Mathematical Proof and Proving (MPP)

Discrete Mathematics & Mathematical Reasoning Predicates, Quantifiers and Proof Techniques

Section 0. Sets and Relations

Copyright c 2007 Jason Underdown Some rights reserved. statement. sentential connectives. negation. conjunction. disjunction

Intro to Logic and Proofs

A Brief Introduction to Proofs

7.11 A proof involving composition Variation in terminology... 88

Math 10850, fall 2017, University of Notre Dame

1. Foundations of Numerics from Advanced Mathematics. Mathematical Essentials and Notation

5. Use a truth table to determine whether the two statements are equivalent. Let t be a tautology and c be a contradiction.

Date: October 24, 2008, Friday Time: 10:40-12:30. Math 123 Abstract Mathematics I Midterm Exam I Solutions TOTAL

Practice Midterm Exam Solutions

ROCHESTER INSTITUTE OF TECHNOLOGY COURSE OUTLINE FORM COLLEGE OF SCIENCE. School of Mathematical Sciences

Boolean Algebra and Proof. Notes. Proving Propositions. Propositional Equivalences. Notes. Notes. Notes. Notes. March 5, 2012

Review 3. Andreas Klappenecker

Theorem. For every positive integer n, the sum of the positive integers from 1 to n is n(n+1)

RED. Name: Instructor: Pace Nielsen Math 290 Section 1: Winter 2014 Final Exam

Major Matrix Mathematics Education 7-12 Licensure - NEW

Lecture 4: Proposition, Connectives and Truth Tables

SAN DIEGO COMMUNITY COLLEGE DISTRICT CITY, MESA, AND MIRAMAR COLLEGES ASSOCIATE DEGREE COURSE OUTLINE

Manual of Logical Style

1.4 Cardinality. Tom Lewis. Fall Term Tom Lewis () 1.4 Cardinality Fall Term / 9

COURSE OF STUDY MATHEMATICS

Equivalence of Propositions

Propositional Logic. Spring Propositional Logic Spring / 32

HOSTOS COMMUNITY COLLEGE DEPARTMENT OF MATHEMATICS

Review Sheet for the Final Exam of MATH Fall 2009

3. Only sequences that were formed by using finitely many applications of rules 1 and 2, are propositional formulas.

Logic and Propositional Calculus

First year syllabus under Autonomy First year syllabus under Autonomy

Math 109 September 1, 2016

9th and 10th Grade Math Proficiency Objectives Strand One: Number Sense and Operations

Proof Terminology. Technique #1: Direct Proof. Learning objectives. Proof Techniques (Rosen, Sections ) Direct Proof:

MATHEMATICS (MAT) Professors William Harris and Homer White (Chair); Visiting Assistant Professor Jianning Su; Visiting Lecturer Lucas Garnett

Math/EECS 1028M: Discrete Mathematics for Engineers Winter Suprakash Datta

Chapter 1 Elementary Logic

Elementary Equivalence, Partial Isomorphisms, and. Scott-Karp analysis

Chabot College Fall Course Outline for Mathematics 47 MATHEMATICS FOR LIBERAL ARTS

Solutions to Homework Set 1

Algebra 2 Secondary Mathematics Instructional Guide

Background for Discrete Mathematics

CHAPTER 1. MATHEMATICAL LOGIC 1.1 Fundamentals of Mathematical Logic

In N we can do addition, but in order to do subtraction we need to extend N to the integers

Math 117: Topology of the Real Numbers

Automata Theory and Formal Grammars: Lecture 1

Logic Overview, I. and T T T T F F F T F F F F

Math.3336: Discrete Mathematics. Proof Methods and Strategy

Quantifiers. P. Danziger

Transcription:

Kutztown University Kutztown, Pennsylvania MAT 224: Foundations of Higher Mathematics I. Three semester hours; three clock hours; required course for B.S. in Mathematics & B.S. in Secondary Education (Mathematics); also required for Mathematics minor. II. Course Description: MAT 224: Foundations of Higher Mathematics 3 s.h., 3 c.h. This course is designed to prepare the student for the study of advanced mathematics. Topics include fundamentals of logic; proof strategies; the algebra of sets; relations; including equivalence relations; functions and their properties; countable sets and counting techniques; ordered and well-ordered sets. This course should be taken only after the student has taken at least two college-level mathematics courses. Prerequisite: C or better in MAT 171. III. Course Objectives: The student will: A. Learn to use the proper mathematical techniques in analyzing information, extracting pertinent facts and drawing appropriate conclusions. B. Examine the basic logic that underlies mathematical proofs C. Write mathematical proofs using the following methods: direct proof; proof by contrapositive; proof by contradiction; proof by exhaustion; proof by induction. D. Interpret and prove or disprove quantified mathematical statements. E. Apply the abstract concepts of relations and functions in mathematical applications. F. Recognize the foundational nature of set theory in mathematics and its development. G. Apply the concepts and operations of sets in mathematical disciplines. IV.Course Assessment The course assessment will be a subset of tests, projects, presentations, quizzes, homework, team assignments and final exam. V. Course Outline

A. Fundamentals of Mathematical Logic and Proof Strategies 1. Preliminaries a. The language of mathematics-defined and undefined terms b. Statements and truth values c. Definitions, axioms and theorems 2. Fundamentals of Logic a. The basic sentential connectives; negation and conjugation b. Truth tables, equivalent statements, tautologies, and contradictions c. Disjunctions d. Various properties of the above connectives 3. Conditionals and Biconditionals a. Conditionals and their relatives b. Biconditionals 4. Statement Formulas and Quantification a. Sets, statement formulas and quantifiers b. Combinations of the universal and existential quantifiers c. Negation of quantified statements 5. Strategies for Mathematical Proof a. Argumentation and valid consequences b. Rules of Inference c. Method of indirect proof d. Quantification in argumentation e. Fallacies commonly found in argumentation f. Inconsistent and/or unsatisfiable sets of premises g. Counterexamples B. Set Theory and Related Concepts 1. Fundamentals of Classes and Sets a. Definitions of classes and sets b. The set N and proof by induction c. Algebra of sets d. Proofs of the properties of the algebra of sets 2. Relations a. Ordered pairs and cartesian products b. Relations, images and pre-images c. Properties of images and pre-images with respect to the algebra of sets d. Algebra of relations 2

3. Equivalence Relations and Partitions of Sets a. Equivalence relations and equivalence classes b. Partitions of a set c. Relationships between equivalence relations and partitions 4. Functions a. Functions, images and pre-images b. Properties of images and pre-images with respect to the algebra of sets c. Properties of functions-injectivity, surjectivity and bijectivity d. Algebra of functions 5. Families of Sets a. Indexed collection of sets b. Generalized algebra of sets c. Generalized cartesian products d. Applications 6. Countable Sets and Counting Techniques a. Infinite sets and equinumerous sets b. Countable sets and their properties c. Cantor s Theorem d. The existence of uncountable sets 7. Ordered Sets and Well-Ordered Sets a. Partial orderings b. Special elements of partially ordered sets c. Order isomorphism d. Well ordered sets e. Zorn s Lemma VI. Instructional Resources Barnier, W. and N. Feldman.. Introduction to Advanced Mathematics. 2nd ed. Upper Saddle River, NJ: Prentice Hall, 2000. Biggs, N.L., E.K. Lloyd,, and R.J. Wilson, R.J. Graph Theory 1736-1936. Clarendon: Oxford, 1976. Bittinger, M.L. Logic Proof and Sets. 2nd ed. New York, NY: West, 1983. Bond, R. J. and W.J. Keane. An Introduction to Abstract Mathematics. Pacific Grove, CA: Brooks/Cole Pub. Co., 1999. D Angelo, J. P. and Douglas B. West. Mathematical Thinking: Problem-Solving and Proofs. 2nd ed. Upper Saddle River, NJ: Prentice Hall, 2000. 3

Dudley, J. Elementary Number Theory. San Francisco, CA: Freeman, 1978. Dumas, Bob A. Transition to Higher Mathematics: Structure and Proof. New York, NY: McGraw-Hill, 2007. Eisenberg, Murray. The Mathematical Method: A Transition to Advanced Mathematics. Englewood Cliffs, NJ: Prentice Hall, 1996. Fisher, J.L. Application Oriented Algebra. New York, NY: T.Y. Crowell, 1977. Foerster, P.A. Algebra and Trigonometry: Functions and Applications. Reading, MA: Addison- Wesley, 1980. Gilbert, W.J. Modern Algebra with Applications. New York, NY: Wiley and Sons, 1976. Gilbert, Will J., and Scott A. Vanstone. Introduction to Mathematical Thinking: Algebra and Number Systems. Englewood Cliffs, NJ: Prentice Hall, 2005. Gibilisco, Stan. Math Proofs Demystified, New York, NY: McGraw-Hill, 2005. Hummel, K.E. Introductory Concepts for Abstract Mathematics. Boca Raton, FL: Chapman & Hall/CRC. 2000. Kurtz, D.C. Foundations of Abstract Mathematics. New York: McGraw-Hill, Inc. 1992. Lay, Steven R. Analysis: With an Introduction to Proof. 4th ed. Englewood Cliffs, NJ: Prentice Hall, 2004. Lucas, J. F. Introduction to Abstract Mathematics. 2nd ed. New York, NY: Ardsley House Publishers, 1990. Mendelson, E. Boolean Algebra and Switching Circuits. New York, NY: McGraw-Hill, 1970. Niven, I. Numbers: Rational and Irrational. New York, NY: Random House, 1961. O Leary, Michael L. The Structure of Proof: With Logic and Set Theory. Englewood Cliffs, NJ: Prentice Hall, 2002. Pinter, C. A Book of Abstract Algebra. New York, NY: McGraw-Hill, 1982. Richmond, Bettina, and Thomas Richmond. A Discrete Transition to Advanced Mathematics. Pacific Grove, CA: Brooks/Cole Pub. Co., 2004. Rodgers, Nancy. Learning to Reason: An Introduction to Logic, Sets, and Relations. Pacific Grove, CA: Brooks/Cole Pub. Co., 2000. 4

Rotman, Joseph J. Journey into Mathematics: An Introduction to Proofs. Englewood Cliffs, NJ: Prentice Hall, 1998. Smith, D., M. Eggen, and R. Andre. A Transition to Advanced Mathematics. Monterey, CA: Brooks/Cole Pub. Co, 1983. Solow, D. How to Read and Do Proofs: An Introduction to Mathematical Thought Processes. 4th ed. New York, NY: John Wiley and Sons, 2004. Solow, D. The Keys to Advanced Mathematics: Recurrent Themes in Abstract Reasoning. Mansfield, Ohio: Books Unlimited, 1995. Stein, Sherman K. How the Other Half Thinks: Adventures in Mathematical Reasoning. New York, NY: McGraw-Hill, 2003. Sundstrom, Ted A. Mathematical Reasoning: Writing and Proof. Englewood Cliffs, NJ: Prentice Hall, 2003. Wilson, R.J. Introduction to Graph Theory. 2nd ed. New York, NY: Academic Press, 1979. 2007 5