Logic - Advanced

* Course in Preparation *
Syllabus

  • Office: Griffin Floyd, 307
  • Email: belic@ufl.edu
  • Text: Boolos, Burgess and Jeffrey. 2007. Computability and Logic, 5th Edition.
  • Prerequisites: an introductory course in logic or equivalent.

Day TopicLectureHomework
Introduction  
Review: Naive and Axiomatic Set Theory
Review: First Order Logic  
Ch. 1 - Enumeration  
Ch. 2 - Diagonalization  
Ch. 3 - Turing Machines  
Ch. 4 - Uncomputability   
Ch. 6 - Recursive Functions  
Ch. 7 - Recursive Sets and Relations  
10 Ch. 8 - Equivalent Definition of Computability  
11 Ch. 9 - First Order Logic: Syntax  
12 Ch. 10 - First Order Logic: Semantics  
13 Ch. 11 - Undecidability of First Order Logic   
14 Ch. 12 - Models  
15 Ch. 14 - Proofs and Completeness  
16 Ch. 15 - Arithmetization  
17 Ch. 16 - Representability   
18 Ch. 17 - First Incompleteness Theorem   
19 Ch. 18 - Second Incompleteness Theorem   
21 Ch. 27 - Modal Logic