Difference between revisions of "MAT3013"

From Department of Mathematics at UTSA
Jump to navigation Jump to search
(Weeks 3 & 4: Proofs, techniques, and mathematical writing.)
 
(11 intermediate revisions by 2 users not shown)
Line 31: Line 31:
 
! Date !! Sections !! Topics !! Prerequisite Skills !! Student Learning Outcomes
 
! Date !! Sections !! Topics !! Prerequisite Skills !! Student Learning Outcomes
 
|-
 
|-
−
|1.
+
| <!-- * Week -->
 +
1.
 
||
 
||
 +
<!-- * Sections -->
 
* 1.1-1.2
 
* 1.1-1.2
 
||
 
||
 +
<!-- * Topics -->
 
* [[Statements]]
 
* [[Statements]]
 
* [[Sentential Logic]]
 
* [[Sentential Logic]]
 
||
 
||
−
* Prerequisites
+
<!-- * Prerequisites -->
 
||
 
||
 +
<!-- * Outcomes -->
 
* Identify syntactically correct formulas in sentential logic.
 
* Identify syntactically correct formulas in sentential logic.
 
* Translate compound statements in informal language to formal propositional sentences.
 
* Translate compound statements in informal language to formal propositional sentences.
 
* Find the interpretation of a sentential formula given interpretations of the propositional symbols therein.
 
* Find the interpretation of a sentential formula given interpretations of the propositional symbols therein.
 
|-
 
|-
−
|2.
+
| <!-- * Week -->
 +
2.
 
||
 
||
 +
<!-- * Sections -->
 
* 1.3-1.4
 
* 1.3-1.4
 
||
 
||
−
* [[Semantic Implication]]
+
<!-- * Topics -->
−
* [[Semantic Equivalence]]
+
* [[Logical Implication]]
 +
* [[Logical Equivalence]]
 
* [[Deductive Rules]]
 
* [[Deductive Rules]]
 
||
 
||
 +
<!-- * Prerequisites -->
 
* [[Sentential Logic]]
 
* [[Sentential Logic]]
 
||
 
||
 +
<!-- * Outcomes -->
 
* Express informally stated relations between sentences in terms of semantic implication and equivalence.
 
* Express informally stated relations between sentences in terms of semantic implication and equivalence.
 
* State and recognize basic rules of deductive reasoning and their correct application.
 
* State and recognize basic rules of deductive reasoning and their correct application.
Line 59: Line 68:
 
* Distinguish between correct and incorrect applications of deductive rules.
 
* Distinguish between correct and incorrect applications of deductive rules.
 
|-
 
|-
−
|2/3
+
| <!-- * Week -->
 +
3.
 
||
 
||
 +
<!-- * Sections -->
 
* 1.5-2.2
 
* 1.5-2.2
 
||
 
||
 +
<!-- * Topics -->
 
* [[Quantifiers]]
 
* [[Quantifiers]]
 
* [[Mathematical Proofs]]
 
* [[Mathematical Proofs]]
 
* [[Proofs:Direct]]
 
* [[Proofs:Direct]]
 
||
 
||
 +
<!-- * Prerequisites -->
 
* [[Sentential Logic]]
 
* [[Sentential Logic]]
 
* [[Deductive Rules]]
 
* [[Deductive Rules]]
 
||
 
||
−
* Outcomes
+
<!-- * Outcomes -->
 
|-
 
|-
−
|3.
+
| <!-- * Week -->
 +
4.
 
||
 
||
 +
<!-- * Sections -->
 
* 2.3-2.4
 
* 2.3-2.4
 
||
 
||
 +
<!-- * Topics -->
 
* [[Proofs:Contraposition]]
 
* [[Proofs:Contraposition]]
 
* [[Proofs:Contradiction]]
 
* [[Proofs:Contradiction]]
 
* [[Proofs:Cases]]
 
* [[Proofs:Cases]]
−
* [[Proofs:Biconditionals]]
 
 
||
 
||
 +
<!-- * Prerequisites -->
 
* [[Mathematical Proofs]]
 
* [[Mathematical Proofs]]
 
* [[Proofs:Direct]]
 
* [[Proofs:Direct]]
 
||
 
||
−
* Outcomes
+
<!-- * Outcomes -->
 
|-
 
|-
−
|4.
+
| <!-- * Week -->
 +
5.
 
||
 
||
−
* 2.5-2.6
+
<!-- * Sections -->
 +
* 2.4-2.6
 
||
 
||
 +
<!-- * Topics -->
 +
* [[Proofs:Biconditionals]]
 
* [[Proofs:Quantifiers]]
 
* [[Proofs:Quantifiers]]
 
* [[Writing Mathematics]]
 
* [[Writing Mathematics]]
 
||
 
||
 +
<!-- * Prerequisites -->
 
* [[Quantifiers]]
 
* [[Quantifiers]]
 
* [[Mathematical Proofs]]
 
* [[Mathematical Proofs]]
 
||
 
||
−
* Outcomes
+
<!-- * Outcomes -->
 
|-
 
|-
−
|5.
+
| <!-- * Week -->
 +
6.
 
||
 
||
 +
<!-- * Sections -->
 
* 3.1-3.3
 
* 3.1-3.3
 
||
 
||
 +
<!-- * Topics -->
 
* [[Sets:Definitions]]
 
* [[Sets:Definitions]]
 
* [[Sets:Operations]]
 
* [[Sets:Operations]]
 +
* [[Sets:Families]]
 
||
 
||
−
* Prerequisites
+
<!-- * Prerequisites -->
−
||
 
−
* Outcomes
 
−
|-
 
−
|5.
 
−
||
 
−
* 3.4-3.5
 
−
||
 
−
* [[Family of sets]]
 
−
||
 
−
* Prerequisites
 
−
||
 
−
* Outcomes
 
−
|-
 
−
|5.
 
−
||
 
−
* 3.4-3.5
 
−
||
 
−
* [[Axioms of set theory]]
 
 
||
 
||
−
* Prerequisites
+
<!-- * Outcomes -->
−
||
 
−
* Outcomes
 
 
|-
 
|-
−
|6.
+
| <!-- * Week -->
 +
7.
 
||
 
||
−
 
+
<!-- * Sections -->
 
||
 
||
−
 
+
<!-- * Topics -->
 +
* Review of Chapters 1-3.
 +
* Midterm exam.
 
||
 
||
−
 
+
<!-- * Prerequisites -->
 
||
 
||
−
 
+
<!-- * Outcomes -->
 
|-
 
|-
−
|7.
+
| <!-- * Week -->
 +
8.
 
||
 
||
 +
<!-- * Sections -->
 
* 4.1-4.3
 
* 4.1-4.3
 
||
 
||
−
* [[Definition of functions]]
+
<!-- * Topics -->
 +
* [[Functions:Definition]]
 +
* [[Functions:Forward Image]]
 +
* [[Functions:Forward Image|Functions:Inverse Image]]
 +
* [[Functions:Composition]]
 
||
 
||
−
* Prerequisites
+
<!-- * Prerequisites -->
 +
* [[Sets:Definitions]]
 +
* [[Sets:Operations]]
 
||
 
||
−
* Outcomes
+
<!-- * Outcomes -->
 
|-
 
|-
−
|7.
+
| <!-- * Week -->
 +
9.
 
||
 
||
−
* 4.1-4.3
+
<!-- * Sections -->
 +
* 4.3-4.4
 
||
 
||
−
* [[Image and inverse image]]
+
<!-- * Topics -->
 +
* [[Functions:Inverses]]
 +
* [[Functions:Injective]]
 +
* [[Functions:Surjective]]
 +
* [[Functions:Bijective]]
 
||
 
||
−
* Prerequisites
+
<!-- * Prerequisites -->
 +
* [[Functions:Definition]]
 +
* [[Functions:Composition]]
 
||
 
||
−
* Outcomes
+
<!-- * Outcomes -->
 
|-
 
|-
−
|7.
+
| <!-- * Week -->
 +
10.
 
||
 
||
−
* 4.1-4.3
+
<!-- * Sections -->
 +
* 5.1 & 5.3
 
||
 
||
−
* [[Composition and inverse functions]]
+
<!-- * Topics -->
 +
* [[Relations]]
 +
* [[Functions as Relations]]
 +
* [[Equivalence Relations]]
 
||
 
||
−
* Prerequisites
+
<!-- * Prerequisites -->
 +
* [[Sets:Definitions]]
 +
* [[Sets:Operations]]
 
||
 
||
−
* Outcomes
+
<!-- * Outcomes -->
 
|-
 
|-
−
|8.
+
| <!-- * Week -->
 +
11.
 
||
 
||
−
* 4.4-4.5
+
<!-- * Sections -->
 +
* 6.1-6.3
 
||
 
||
−
* [[Injectivity, surjectivity and bijectivity]]
+
<!-- * Topics -->
−
||
+
* [[Natural Numbers:Postulates]]
−
* Prerequisites
+
* [[Natural Numbers:Well-Ordering]]
−
||
+
* [[Proofs:Induction]]
−
* Outcomes
 
−
|-
 
−
|8.
 
−
||
 
−
* 4.4-4.5
 
−
||
 
−
* [[Sets of functions]]
 
−
||
 
−
* Prerequisites
 
−
||
 
−
* Outcomes
 
−
|-
 
−
|9.
 
−
||
 
−
* 5.1-5.2
 
 
||
 
||
 +
<!-- * Prerequisites -->
 +
* [[Sets:Definitions]]
 +
* [[Functions:Definition]]
 
* [[Relations]]
 
* [[Relations]]
 
||
 
||
−
* Prerequisites
+
<!-- * Outcomes -->
−
||
 
−
* Outcomes
 
 
|-
 
|-
−
|9.
+
| <!-- * Week -->
 +
12.
 
||
 
||
−
* 5.1-5.2
+
<!-- * Sections -->
−
||
+
* 6.3-6.4
−
* [[Congruence]]
 
−
||
 
−
* Prerequisites
 
−
||
 
−
* Outcomes
 
−
|-
 
−
|10.
 
−
||
 
−
* 4.3-4
 
−
||
 
−
* [[Equivalence relations]]
 
−
||
 
−
* Prerequisites
 
−
||
 
−
* Outcomes
 
−
|-
 
−
|11.
 
−
||
 
−
* 6.1-6.2
 
−
||
 
−
* [[Introduction]]
 
−
||
 
−
* Prerequisites
 
−
||
 
−
* Outcomes
 
−
|-
 
−
|11.
 
−
||
 
−
* 6.1-6.2
 
−
||
 
−
* [[Properties of natural numbers]]
 
−
||
 
−
* Prerequisites
 
−
||
 
−
* Outcomes
 
−
|-
 
−
|12.
 
−
||
 
−
 
 
−
||
 
−
 
 
−
||
 
−
 
 
−
||
 
−
 
 
−
|-
 
−
|13.
 
−
||
 
−
* 6.2-6.3
 
−
||
 
−
* [[Mathematical induction]]
 
−
||
 
−
* Prerequisites
 
−
||
 
−
* Outcomes
 
−
|-
 
−
|13.
 
−
||
 
−
* 6.2-6.3
 
 
||
 
||
 +
<!-- * Topics -->
 +
* [[Proofs:Induction|Induction:Variants]]
 
* [[Recursion]]
 
* [[Recursion]]
 
||
 
||
−
* Prerequisites
+
<!-- * Prerequisites -->
 +
* [[Proofs:Induction]]
 +
* [[Functions:Definition]]
 
||
 
||
−
* Outcomes
+
<!-- * Outcomes -->
 
|-
 
|-
−
|14.
+
| <!-- * Week -->
 +
13.
 
||
 
||
−
* 6.4 - 6.7
+
<!-- * Sections -->
 +
* 6.5
 
||
 
||
−
* [[Cardinality of sets]]
+
<!-- * Topics -->
 +
* [[Sets:Cardinality]]
 
||
 
||
−
* Prerequisites
+
<!-- * Prerequisites -->
 +
* [[Sets:Definitions]]
 +
* [[Equivalence Relations]]
 +
* [[Functions:Injective]]
 +
* [[Functions:Bijective]]
 
||
 
||
−
* Outcomes
+
<!-- * Outcomes -->
 
|-
 
|-
−
|14.
+
| <!-- * Week -->
 +
14.
 
||
 
||
−
* 6.4 - 6.7
+
<!-- * Sections -->
 +
* 6.6-6.7
 
||
 
||
−
* [[Finite sets and countable sets]]
+
<!-- * Topics -->
 +
* [[Sets:Finite]]
 +
* [[Sets:Countable]]
 +
* [[Sets:Uncountable]]
 +
* [[Cardinality of important sets|Cardinality:𝐍]]
 +
* [[Cardinality of important sets|Cardinality:𝐙]]
 +
* [[Cardinality of important sets|Cardinality:𝐐]]
 +
* [[Cardinality of important sets|Cardinality:𝐑]]
 
||
 
||
−
* Prerequisites
+
<!-- * Prerequisites -->
 +
* [[Sets:Cardinality]]
 +
* [[Natural Numbers:Postulates]]
 
||
 
||
−
* Outcomes
+
<!-- * Outcomes -->
 
|-
 
|-
−
|14.
+
| <!-- * Week -->
 +
15.
 
||
 
||
−
* 6.4 - 6.7
+
<!-- * Sections -->
 
||
 
||
−
* [[Cardinality of number systems]]
+
<!-- * Topics -->
 +
* Catch-up and review for final exam.
 
||
 
||
−
* Prerequisites
+
<!-- * Prerequisites -->
−
||
 
−
* Outcomes
 
−
|-
 
−
|15.0
 
 
||
 
||
 +
<!-- * Outcomes -->
 +
|}
  
−
||
 
−
 
−
||
 
−
* Prerequisites
 
−
||
 
−
* Outcomes
 
−
|}
 
 
==See also==
 
==See also==
  
 
* [https://catalog.utsa.edu/undergraduate/coursedescriptions/mat/ UTSA Undergraduate Mathematics Course Descriptions]
 
* [https://catalog.utsa.edu/undergraduate/coursedescriptions/mat/ UTSA Undergraduate Mathematics Course Descriptions]

Latest revision as of 14:15, 14 October 2021

Foundations of Mathematics (3-0) 3 Credit Hours

Course Catalog

MAT 3013. Foundations of Mathematics. (3-0) 3 Credit Hours.

Prerequisite: MAT1214. Development of theoretical tools for rigorous mathematics. Topics may include mathematical logic, propositional and predicate calculus, set theory, functions and relations, cardinal and ordinal numbers, Boolean algebras, and construction of the natural numbers, integers, and rational numbers. Emphasis on theorem proving. (Formerly MAT2243. Credit cannot be earned for MAT3013 and MAT2243.) Generally offered: Fall, Spring, Summer. Differential Tuition: $150.

Description

Foundations of Mathematics is a pivotal course for mathematics majors. It serves as the first major step towards modern mathematics of rigorous proofs and a true pre-requisite to real analysis and abstract algebra. Up to this point students are asked to do few proofs (notably geometry and perhaps some epsilon-delta in calculus). The course particularly emphasizes set-theoretical constructions, such as functions, composition, inversion, forward and inverse images, relations, equivalence relations, partial orders, quotient sets and products and unions of sets, vital to further work in mathematics.

Evaluation

  • No makeup exams are offered.
  • An absence may be excused if sufficient evidence of extenuating circumstances is provided. In this case, the final exam grade

could be used as the grade for the missed exam.

  • Students will have access to several past exams for practice.

Text

Topics List

Date Sections Topics Prerequisite Skills Student Learning Outcomes

1.

  • 1.1-1.2
  • Identify syntactically correct formulas in sentential logic.
  • Translate compound statements in informal language to formal propositional sentences.
  • Find the interpretation of a sentential formula given interpretations of the propositional symbols therein.

2.

  • 1.3-1.4
  • Express informally stated relations between sentences in terms of semantic implication and equivalence.
  • State and recognize basic rules of deductive reasoning and their correct application.
  • Use the rules of deduction to prove basic semantic relations (implication or equivalence) between formal interpretations of propositional formulas.
  • Distinguish between correct and incorrect applications of deductive rules.

3.

  • 1.5-2.2

4.

  • 2.3-2.4

5.

  • 2.4-2.6

6.

  • 3.1-3.3

7.

  • Review of Chapters 1-3.
  • Midterm exam.

8.

  • 4.1-4.3

9.

  • 4.3-4.4

10.

  • 5.1 & 5.3

11.

  • 6.1-6.3

12.

  • 6.3-6.4

13.

  • 6.5

14.

  • 6.6-6.7

15.

  • Catch-up and review for final exam.

See also

Retrieved from "https://mathresearch.utsa.edu/wiki/index.php?title=MAT3013&oldid=2281"