# Computability and Logic

## CSCI-4420

This course covers basic concepts and results in mathematical logic and computability theory, including decision procedures, automated theorem proving techniques for truth-functional and first-order logic, axiomatizations of set theory and arithmetic, Turing Machines, Abacus Machines, recursive functions, the Church-Turing Thesis, the halting problem, undecidability of first-order logic, undecidability of arithmetic, and Godel's incompleteness results.

4 credits
Cross-listed with:
MATH-4030 Computability and Logic PHIL-4420 Computability and Logic
Prereqs:
one of:
PHIL-2140 Introduction to Logic CSCI-2200 Foundations of Computer Science

# Past Term Data
Offered
Not Offered
Offered as Cross-Listing Only
No Term Data
Simple View
Detailed View

| Spring | Summer | Fall
--- | --- | --- | ---
| (Session 1) | (Session 2) |
2023 | Computability And Logic (4c) Bram Van Heuveln Seats Taken: 14/30 |  |
2022 |  |  |
2021 | Computability And Logic (4c) Bram Van Heuveln Seats Taken: 10/20 |  |
2020 |  |  |
2019 |  |  |
2018 |  |  |
2017 |  |  |
2016 |  |  |
2015 |  |  |
2014 |  |  |
2013 |  |  |
2012 |  |  |
2011 |  |  |
2010 |  |  |
2009 |  |  |
2008 |  |  |
2007 |  |  |
2006 |  |  |
2005 |  |  |
2004 |  |  |
2003 |  |  |
2002 |  |  |
2001 |  |  |
2000 |  |  |
1999 |  |  |
1998 |  |  |