Alexander Knop
S.E. Warschawski Assistant Professor
Research interests:
Proof complexity, structural complexity, algorithms, cryptography.
En Ru

For UCSD students
Math 160A (Elementary Mathematical Logic I)

Fall, 2019

Links

Information

Textbook:
The textbook for this course is: H. Enderton, A Mathematical Introduction to Logic
Grading policy:
Student's cumulative average will be computed by taking the maximum of these two grading schemes:
  • 10% Homework, 25% Midterm I, 25% Midterm II, 40% Final Exam
  • 10% Homework, 30% maximum of Midterm I and Midterm II, 60% Final Exam
Homework:
Homework is a very important part of the course and in order to fully master the topics it is essential that you work carefully on every assignment and try your best to complete every problem.
Your total homework score will be based on the total possible homework points available. After each homework you can complete an optional online HW review highlighting key concepts. If you complete the questionnaire for an assignment and that assignment is your lowest homework score, that score will be dropped from your homework average.
Homework may be done alone or in a group of at most 5 people. Partners may be in any of the sections of the class. You are free to change partners between assignments. Problems should be solved together, not divided up between partners. For homework help, consult your textbook, class notes, lecturer, and TAs. It is considered a violation of the policy on academic integrity to:
  • look or ask for answers to homework problems in other texts or sources, including the internet, or to
  • discuss the homework problems with anyone outside of your group (unless you are in office hours with someone from the instructional team).
Homework solutions should be neatly written or typed and turned in through Gradescope by 11pm on Friday. Illegible assignments will not be graded. For step-by-step instructions on scanning and uploading your homework, see this handout. Late homeworks will not be accepted. Submit early drafts well before the deadline to make sure partial work is graded.
Quizzes:
Quizzes are another significant part of the course. We will have them in the last ten minutes of each Friday lectures and they will cover the material covered in the previous three lectures.
Discussion Board:
The Piazza forum for our class where questions can be posted and answered. It is a very helpful resource!

Office Hours

  • 6432, AP&M building,
    • Monday: 4:00 - 5 PM
    • Wednesday: 3:15 - 4:15 PM

Teaching assistants

  • Oisin Parkinsoncoombs,
    CSB 226:
    • Wednesday: 3.30-4.30 PM

Calendar

Sunday Monday Tuesday Wednesday Thursday Friday Saturday
September 22 September 23 September 24 September 25 September 26
Discussion
September 27
Introductory Lecture
September 28
September 29 September 30
Proofs by Induction
October 01 October 02
Sets
October 03
Discussion
October 04
Functions
October 05
October 06 October 07
Structural Induction
October 08 October 09
Structural Induction
October 10
Discussion
October 11
Structural Induction
October 12
October 13 October 14
Relations
October 15 October 16
Catch up Review
October 17
Discussion
October 18
Midterm I
October 19
October 20 October 21
Relations
October 22 October 23
Predicates and Connectives
October 24
Discussion
October 25
Propositional Formulas
October 26
October 27 October 28
Semantic Implication
October 29 October 30
Propositional Formulas
October 31
Discussion
November 01
Natural Deduction for Propositional Logic
November 02
November 03 November 04
Natural Deduction for Propositional Logic
November 05 November 06
Natural Deduction for Propositional Logic
November 07
Discussion
November 08
Natural Deduction for Propositional Logic
November 09
November 10 November 11
Veterans Day
November 12 November 13
Catch up Review
November 14
Discussion
November 15
Midterm II
November 16
November 17 November 18
Predicate Formulas
November 19 November 20
Predicate Formulas
November 21
Discussion
November 22
Natural Deduction for Predicate Logic
November 23
November 24 November 25
Natural Deduction for Predicate Logic
November 26 November 27
Natural Deduction for Predicate Logic
November 28
Thanksgiving
November 29
Thanksgiving
November 30
December 01 December 02
Models of Theories
December 03 December 04
Models of Theories
December 05
Discussion
December 06
Catch up Review
December 07
December 08 December 09 December 10 December 11 December 12
Final Exam
December 13 December 14