University of Calgary
RSS
Facebook
Twitter
Jump to Headline
Jump to Navigation
Jump to Content
UofC Navigation
Home
Future Students
Current Students
Alumni
Community
Faculty & Staff
Search UofC:
IT
HR
My U of C
Contacts
Richard Zach
Navigation
Main menu
Home
Research
History of Logic
Kurt Gödel and computability theory
The practice of finitism: Epsilon calculus and consistency proofs in Hilbert's Program
Hilbert's "Verunglückter Beweis," the first epsilon theorem, and consistency proofs
The Development of Mathematical Logic from Russell to Tarski: 1900-1935
Completeness before Post: Bernays, Hilbert, and the development of propositional logic
Kurt Gödel, paper on the incompleteness theorems (1931)
Carnap's Early Metatheory: Scope and Limits
Heinrich Behmann's 1921 lecture on the decision problem
Theory of Proofs
The epsilon calculus and Herbrand complexity
Generalizing theorems in real closed fields
Note on generalizing theorems in algebraically closed fields
Short proofs of tautologies using the schema of equivalence
Algorithmic structuring of cut-free proofs
Natural Deduction for the Sheffer Stroke
Philosophy of Mathematics
Hilbert's program then and now
Critical study of Michael Potter's Reason's Nearest Kin
Gödel's first incompleteness theorem and mathematical instrumentalism
Numbers and functions in Hilbert's finitism
Hilbert's Finitism: Historical, Philosophical, and Metamathematical Perspectives
Gödel Logics
Characterization of the axiomatizable prenex fragments of first-order Gödel logics
Compact propositional Gödel logics
First-order Gödel logics
Hypersequents and the proof theory of intuitionistic fuzzy logic
Incompleteness of an infinite-valued first-order Gödel logic and of some temporal logics of programs
Quantified propositional Gödel logics
Finite-valued Logic
Approximating propositional calculi by finite-valued logics
Dual systems of sequents and tableaux for many-valued logics
Labeled calculi and finite-valued logics
Elimination of cuts in first-order many-valued logics
Systematic construction of natural deduction systems for many-valued logics
Proof Theory of Finite-Valued Logics
Other Logic
Effective Finite-Valued Approximations of General Propositional Logics
Decidability of quantified propositional intuitionistic logic and S4 on trees of height and arity ≤ ω
Tableaux for reasoning about atomic updates
A complete first-order temporal logic of time with gaps
Other Writings
Vagueness, Logic and Use: Four Experimental Studies on Vagueness
Teaching
Logic I
Frequently Asked Questions about Logic I (Phil 279)
How to write logical symbols in email or on BlackBoard
Who are Boole, Fitch, and Tarski?
Logic II
Logic III
Paradoxes
Modal Logic
Proof Theory
19th and 20th Century Analytic Philosophy
Logical Positivism
Carnap
Philosophy of Language
Philosophy of Mathematics
Evidence
Using Spreadsheets to Keep Track of Students' Grades
CV
LogBlog
Research
»
Philosophy of Mathematics
Gödel's first incompleteness theorem and mathematical instrumentalism
WORK IN PROGRESS! Comments welcome!
Search
Search
UofC Links
Philosophy @ Calgary
History and Philosophy of Science @ Calgary
Logic @ Calgary
Other Links
@RrrichardZach on Twitter
Richard's Logic Blog
PhilPapers profile
Google Scholar profile
Academia.edu profile
Papers on arXiv
GitHub profile
Mathematics Genealogy entry