Sep 07, 2024  
Rensselaer Catalog 2022-2023 
    
Catalog Navigation
  Catalog Home
  Degrees Offered
  Academic Calendar
  Information Directory
  Rensselaer in Brief
  Core Curriculum
  Educational Programs and Resources
  Research Resources and Centers
  Student Life
  Financial Aid
  Admissions
  Tuition and Fees
  Academic Information and Regulations
  Interdisciplinary Studies
  Schools & Departments
  Schools
  Departments
  Programs
  Subject Codes
  Courses
  Administration
  Named Professorships
  The Faculty
  My Portfolio
HELP
Rensselaer Catalog 2022-2023 [Archived Catalog]

Add to Portfolio (opens a new window)

MATH 4030 - Computability and Logic

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.

Prerequisites/Corequisites: Prerequisite: PHIL 2140  or CSCI 2200 .

When Offered: Spring term odd-numbered years.



Cross Listed: Cross listed as PHIL 4420 . Students cannot obtain credit for both this course and PHIL 4420 .

Credit Hours: 4


Add to Portfolio (opens a new window)