PHL 344k: Intermediate Symbolic Logic

Fall 2017, SZB 278, TTH 9:30–11:00

Professor
Jon Erling Litland
E-mail jon.litland@austin.utexas.edu
Office Hours: W 10:30-12:30, Wag 221
and by appointment
TA
Taylor-Grey Miller
taylorgrey.miller@gmail.com
TBA
and by appointment

Course Description: This is a course in metalogic. In introductory symbolic logic we learn to

use various logical formalisms. In metalogic we use mathematical techniques to study the prop-
erties of the logical formalisms themselves. At the end of the course we will have proved some
foundational results about both the powers—which are considerable—and the limitations—which
are remarkable—of formalization.
The course will take us through foundational results in three branches of modern logic: model
theory, computability theory, and proof theory. We begin with a summary of first-order predicate
logic, with a focus on model theory. We will prove Gödel’s completeness theorem, the compactness
theorem, and (simple versions of) the Löwenheim-Skolem theorems.
We then introduce some basic computability theory using Turing machines. The goal here is
to understand what makes a function “effectively computable”. We discuss Turing’s Thesis—the
claim that the effectively computable functions are exactly the Turing computable functions. We
prove the unsolvability of the Halting Problem and the existence of a universal Turing machine.
In the final part of the course, we prove Gödel’s famous first incompleteness theorem. This
theorem states, roughly, that any formal system that is strong enough to capture a reasonable
amount of basic arithmetic will contain sentences that they neither prove nor disprove. We end by
sketching the second incompleteness theorem which states, even more roughly, that no reasonably
strong, consistent theory can prove that it itself is consistent. We will take particular care to
understand exactly what these results state and any philosophical implications these results may
have.

Readings: The textbook for the course is Burgess, Boolos & Jeffrey, Computability and Logic, 5th
edition. Copies have been ordered to the UT bookstore, but feel free to order your copies from
Amazon.com or anywhere else.
Computability and Logic has been put on reserve at the Physics-Math-Astronomy Library in
RLM.
Supplementary materials and lectures notes will be available on the Canvas page for the course.
I have also put the following two books on model theory and incompleteness on reserve, for
those who want to read further.
• Shorter Model Theory, Wilfrid Hodges
• Aspects of Incompleteness, Per Lindström

The material that we will cover in this course is not easy. To prepare yourself for the class, I
encourage you to read the first chapter of the textbook and try your hand at some of the exercises
at the end of the chapter.
Structure of the course: To learn logic one has to do exercises—lots of them. There will
homework assignments almost every week. Sometimes—instead of lecturing—we will work through
problems together in class.

Assignments and grading Grades will be determined as follows. There will be 12 short assign-
ments counting for 5% each. We will drop the two worst scores. There will be a midterm counting
for 20 % and a final exam counting for 30 %.
Assignments will be given numerical grades 0–100. At the end of the course letters grades will
be determined as follows.

93-100% = A 90-92% = A-
87-89 % = B+ 83-86% = B 80-82 % = B-
77-79 % = C+ 73-76% = C 70-72 % = C-
67-69 % = D+ 63-66% = D 60-62 % =D-
≤ 59 = F

If the class scores are low enough, I reserve the right to curve the percent-to-letter conversion
so that a reasonable fraction of students get As, Bs, and so on. I will only curve to improve your
grades but the idea is to have no curve.

Lateness policy: Handing in the homework assignments late will lead to 20 percentage points
being deducted from the homework. Then another 20 percentage points will be deducted if the
homework is more than 24 hours late. And so on for every additional 24 hours.
To avoid a lateness penalty bring documentation of illness. Do not ask for an extension or
reprieve without bringing documentation. No exceptions will be made.

Electronic Devices: Laptops and tablets are allowed in class for note-taking. Cell-phones are to
be turned off in class.

Disabilities: “Students with disabilities may request appropriate academic accommodations from
the Division of Diversity and Community Engagement, Services for Students with Disabilities, 471-
6259.”

Collaboration and Plagiarism: Your solutions to the homeworks has to be your own work.
Copying somebody else’s work constitutes plagiarism. If you are caught plagiarizing you will auto-
matically fail the class and be reported to the dean.

Religious holidays: By UT Austin policy, you must notify me of your pending absence at least
fourteen days prior to the date of observance of a religious holy day. If you must miss a class, an
examination, a work assignment, or a project in order to observe a religious holy day, you will be
given an opportunity to complete the missed work within a reasonable time after the absence.
 Tentative Schedule
Date Chapters
Week 1, Aug 31 1
Week 2, Sep 5 & Sep 7 2, 9, 10
Assignment due: Sep 7
Week 3, Sep 12 & Sep 14 12, 13
Assignment due: Sep 14
Week 4, Sep 19 & Sep 21 13
Assignment due: Sep 21
Week 5, Sep 26 & Sep 28 13, 14
Assignment due: Sep 28
Week 6, Oct 3 & Oct 5 3
Assignment due: Oct 5
Week 7, Oct 10 & Oct 12 3, 4
Assignment due: Oct 12
Week 8, Oct 17 & Oct 19 5
No assignment: Midterm Oct 19
Week 9, Oct 24 & 26 5, 6, 7
Assignment due: Oct 26
Week 10, Oct 31 & Nov 2 7, 8, 11
Assignment due: Nov 2
Week 11, Nov 7 & Nov 9 15
Assignment due: Nov 9
Week 12, Nov 14 & Nov 16 16
Assignment due: Nov 16
Week 13, Nov 21 16, 17
No Assignment: Thanksgiving
Week 14, Nov 28 & Nov 30 17
Assignment due: Nov 30
Week 15, Dec 5, Dec 7 17, 18
Assignment due: Dec 7
Final Exam, TBD