Mathematical Logic

CT Score

1500

#0 of 0 in MATH

Difficulty

—/10

Workload

—h/wk

Median grade

—

from grade distribution

Would take again

—

n = 0 verified

Grade distribution

No distribution published for this course.

By professor: same course, different game

PROFESSORSCOREGRADEHRS/WKTERMS

Professor ratings →

Sections

No section data for this term yet.

In the tree

Model theory of propositional and predicate logic, the Soundness Theorem, the Compactness Theorem, the Goedel-Henkin Completeness Theorem, the Incompleteness Theorem, computability theory. As time permits: modal and temporal logic, set theory (the continuum hypothesis). Emphasis on the relationship between `provable' and `true' and the relationship between `computable' and `definable'. Offered odd-numbered years. (Typically Offered: Fall)→MATH 6010→unlocks 0 courses

No mapped courses require this one yet. See on the map →

Study groups

0 active

🔒 Verified-only writes. You post as “sophomore, lecture section”: real enough to trust, anonymous enough to be honest.