printer friendly pagePHIL 150: Mathematical Logic (PHIL 250)
An introduction to the concepts and techniques used in mathematical logic, focusing on propositional, modal, and predicate logic. Highlights connections with philosophy, mathematics, computer science, linguistics, and neighboring fields.
Terms: Aut
| Units: 4
| UG Reqs: GER:DB-Math, WAY-FR
PHIL 150E: Logic in Action: A New Introduction to Logic
A new introduction to logic, covering propositional, modal, and first-order logic, with special attention to major applications in describing information and information-driven action. Highlights connections with philosophy, mathematics, computer science, linguistics, and neighboring fields. Based on the open source course 'Logic in Action,' available online at
http://www.logicinaction.org/.nFulfills the undergraduate philosophy logic requirement.
Last offered: Spring 2014
| UG Reqs: GER:DB-Math, WAY-FR
PHIL 151: Metalogic (PHIL 251)
(Formerly 160A.) The syntax and semantics of sentential and first-order logic. Concepts of model theory. Gödel's completeness theorem and its consequences: the Löwenheim-Skolem theorem and the compactness theorem. Prerequisite: 150 or consent of instructor.
Terms: Win
| Units: 4
| UG Reqs: GER:DB-Math, WAY-FR
PHIL 151A: Recursion Theory (PHIL 251A)
Computable functions, Turing degrees, generalized computability and definability. "What does it mean for a function from the natural numbers to themselves to be computable?" and "How can noncomputable functions be classified into a hierarchy based on their level of noncomputability?". Theory of relative computability, reducibility notions and degree structures. Prerequisite is
PHIL 150, or
PHIL 151 or
CS 103.
Last offered: Winter 2013
| UG Reqs: GER:DB-Math, WAY-FR
PHIL 152: Computability and Logic (PHIL 252)
Approaches to effective computation: recursive functions, register machines, and Turing machines. Proof of their equivalence, discussion of Church's thesis. Elementary recursion theory. These techniques used to prove Gödel's incompleteness theorem for arithmetic, whose technical and philosophical repercussions are surveyed. Prerequisite: 151.
Terms: Spr
| Units: 4
| UG Reqs: GER:DB-Math
Instructors:
Sommer, R. (PI)
PHIL 153: Feminist Theories and Methods Across the Disciplines (FEMGEN 103, FEMGEN 203, PHIL 253)
(Graduate Students register for
PHIL 253 or
FEMGEN 203) Concepts and questions distinctive of feminist and LGBT scholarship and how they shape research: gender, intersectionality, disciplinarity and interdisciplinarity, standpoint, "queering," postmodern critiques, postcolonial critiques.nPrerequisites: Feminist Studies 101 or equivalent with consent of instructor.
Terms: Win
| Units: 2-5
| UG Reqs: GER:EC-Gender, WAY-A-II, WAY-EDP
Instructors:
Longino, H. (PI)
PHIL 154: Modal Logic (PHIL 254)
(Graduate students register for 254.) Syntax and semantics of modal logic, and technical topics like completeness and correspondence theory, including both classical and recent developments. Applications to topics in philosophy, computer science, and other fields. Prerequisite: 150 or preferably 151.
Terms: Spr
| Units: 4
| UG Reqs: GER:DB-Math, WAY-FR
Instructors:
Wang, Y. (PI)
;
van Benthem, J. (PI)
PHIL 162: Philosophy of Mathematics (MATH 162, PHIL 262)
(Graduate students register for
PHIL 262.) General survey of the philosophy of mathematics, focusing on epistemological issues. Includes survey of some basic concepts (proof, axiom, definition, number, set); mind-bending theorems about the limits of our current mathematical knowledge, such as Gödel's Incompleteness Theorems, and the independence of the continuum hypothesis from the current axioms of set theory; major philosophical accounts of mathematics: Logicism, Intuitionism, Hilbert's program, Quine's empiricism, Field's program, Structuralism; concluding with a discussion of Eugene Wigner's `The Unreasonable Effectiveness of Mathematics in the Natural Sciences'. Students won't be expected to prove theorems or complete mathematical exercises. However, includes some material of a technical nature. Prerequisite: PHIL150 or consent of instructor.
Terms: Win
| Units: 4
| UG Reqs: GER:DB-Math
Instructors:
Donaldson, T. (PI)
PHIL 164: Central Topics in the Philosophy of Science: Theory and Evidence (PHIL 264)
(Graduate students register for 264.) Is reductionism opposed to emergence? Are they compatible? If so, how or in what sense? We consider methodological, epistemological, logical and metaphysical dimensions of contemporary discussions of reductionism and emergence in physics, in the ¿sciences of complexity¿, and in philosophy of mind.
Last offered: Spring 2014
| UG Reqs: GER:DB-Hum, WAY-A-II
| Repeatable
for credit
PHIL 165: Philosophy of Physics (PHIL 265)
Graduate students register for 265.) Central topic alternates annually between space-time theories and philosophical issues in quantum mechanics; the latter in Winter 2013-14. Conceptual problems regarding the uncertainty principle, wave-particle duality, quantum measurement, spin, and their treatment within the 'Copenhagen interpretation' of quantum mechanics, and the related doctrine of complementarity. The issue of quantum entanglement as raised by Einstein and Schrödinger in the 1930s and the famous EPR (Einstein-Podolsky-Rosen) paper of 1935. Examination of EPR-type experimental set-ups and a result due to Bell in the 1960s, according to which no "hidden variables" theory satisfying a certain locality condition (apparently assumed by EPR) can reproduce all the predictions of quantum mechanics. Survey of several live interpretive options for standard quantum mechanics: Bohmian mechanics (a.k.a. 'pilot wave theory'), 'spontaneous collapse' theories, and Everett¿s relative-state interpretation. Critical scrutiny of the ¿decoherence¿ program that seeks to explain the classical-to-quantum transition, i.e., the emergence of the world of classical physics and macroscopic objects from quantum physics. May be repeated for credit if content is different.
Terms: Win
| Units: 4
| UG Reqs: GER:DB-Hum, WAY-A-II
| Repeatable
for credit
Instructors:
Ryckman, T. (PI)
Filter Results: