Curriculum Vitae

A complete PDF is here.

Publications are also listed on the research page.

Richard Zach

Education

PhD, University of California, Berkeley, Logic and the Methodology of Science, 2001

  • “Thesis: Hilberts Finitism: Historical, Philosophical, and Metamathematical Perspectives. Supervisors: Paolo Mancosu, Jack H. Silver”

MA, University of California, Berkeley, Mathematics, 1997

CPhil, University of California, Berkeley, Logic and the Methodology of Science, 1997

Diplom-Ingenieur, Technische Universität Wien, Computational Logic, 1993

Appointments

University of Calgary, Department of Philosophy

Professor. 2009-.

Associate Professor. 2004-2009.

Assistant Professor. 2001-2004.

Technische Universität Wien, Department of Computer Science

Visiting Researcher. 2022-2022.

Erasmus Mundus Scholar. 2009-2009.

Lecturer. 1995-2000.

McGill University, Department of Philosophy

Visiting Professor. 2014-2015.

University of California, Irvine, Department of Logic and Philosophy

of Science

Visiting Associate Researcher. 2004-2004.

Stanford University, Department of Philosophy

Lecturer. 2001-2001.

University of California, Berkeley, Department of Philosophy

Graduate Student Instructor. 1996-2000.

Awards

Bulletin of Symbolic Logic 25th Anniversary Prize, Association for Symbolic Logic, 2021.

Annual Fellowship, Calgary Institute for the Humanities, 2013-2014.

Annual Fellowship, Calgary Institute for the Humanities, 2006-2007.

Visiting Fellowship, Department of Logic and Philosophy of Science, University of California, Irvine, 2004.

Canadian Hunter Young Innovator Award, University of Calgary, 2003.

Mabelle McLeod Lewis Memorial Fellowship, , 1999-2000.

The Berkeley Fellowship for Graduate Study, University of California, Berkeley, 1994-1999.

Kurt Gödel Fellowship for Study Abroad, Austrian Ministry of Science, 1994-1995.

Editor

Ergo, Area Editor. 2019-.

Philosophia Mathematica, Editor. 2019-.

Open Logic Project, Main Instigator. 2013-.

The Collected Works of Rudolf Carnap, Editor. 2006-.

Stanford Encyclopedia of Philosophy, Subject Editor, History of Logic. 2005-.

Hilbert-Bernays Project, Advisory Board Member. 2008-.

Paul Bernays Project, Editorial Board Member. 2000-.

Journal for the History of Analytic Philosophy, Founding Editor. 2010-2020.

The Review of Symbolic Logic, Founding Editor. 2007-2013.

Studia Logica, Associate Editor. 2006-2008.

Publications

  • Zach, Richard. 2022. “An Epimorphism Between Fine and Ferguson’s Matrices for Angell’s AC.” Logic and Logical Philosophy, forthcoming, 1–19. https://doi.org/10.12775/LLP.2022.025.
  • Baaz, Matthias, and Richard Zach. 2022. “Epsilon Theorems in Intermediate Logics.” The Journal of Symbolic Logic 87 (2): 682–720. https://doi.org/10.1017/jsl.2021.103.
  • Elkind, Landon D. C., and Richard Zach. 2022. “The Genealogy of ‘’.” The Review of Symbolic Logic, forthcoming, 1–38. https://doi.org/10.1017/S1755020321000587.
  • Mancosu, Paolo, Sergio Galvan, and Richard Zach. 2022. Introduction à la théorie de la démonstration: Élimination des coupures, normalisation et preuves de cohérence. Paris: Vrin.
  • Mancosu, Paolo, and Richard Zach. 2022. “Note introductive à Heinrich Behmann, ‘Problème de la décision et Algebre de la Logique’ (1921).” In Anthologie de la calculabilité: Naissance et développements de la théorie de la calculabilité des années 1920 à 1970, edited by Jean Mosconi and Michel Bourdeau, 108–15. Nouvelle bibliothèque mathématique 15. Paris: Cassini.
  • Zach, Richard. 2021a. “Cut Elimination and Normalization for Generalized Single and Multi-Conclusion Sequent and Natural Deduction Calculi.” The Review of Symbolic Logic 14 (3): 645–86. https://doi.org/10.1017/S1755020320000015.
  • ———. 2021b. “Learning Outcomes and Grade Specifications in a Formal Logic Course.” Poster presentation presented at the Mastery Grading University Conference 2021, Online, June 11. https://drive.google.com/file/d/1q6rAyXfrz2k79NtaHoMREQ9IDagnbvLN/view.
  • Burns, Samara, and Richard Zach. 2021. “Cut-Free Completeness for Modular Hypersequent Calculi for Modal Logics K, T, and D.” The Review of Symbolic Logic 14 (4): 910–29. https://doi.org/10.1017/S1755020320000180.
  • Magnus, P. D., Tim Button, J. Robert Loftis, Aaron Thomas-Bolduc, Robert Trueman, and Richard Zach. 2021. Forall x: Calgary. An Introduction to Formal Logic. F21 ed. Calgary: Open Logic Project. https://forallx.openlogicproject.org/.
  • Mancosu, Paolo, Sergio Galvan, and Richard Zach. 2021. An Introduction to Proof Theory: Normalization, Cut-Elimination, and Consistency Proofs. Oxford: Oxford University Press. https://doi.org/10.1093/oso/9780192895936.001.0001.
  • Avigad, Jeremy, and Richard Zach. 2020. “The Epsilon Calculus.” In Stanford Encyclopedia of Philosophy, edited by Edward N. Zalta, Fall 2020. https://plato.stanford.edu/archives/fall2020/entries/epsilon-calculus/.
  • Zach, Richard. 2020. “Frege’s and Russell’s Crisis.” In Frank Ramsey: A Sheer Excess of Powers, by Cheryl Misak, 67–68. Oxford: Oxford University Press.
  • Carnap, Rudolf. 2019a. Early Writings. Edited by A. W. Carus, Michael Friedman, Wolfgang Kienzler, Alan Richardson, and Sven Schlotter. The Collected Works of Rudolf Carnap 1. Oxford: Oxford University Press. https://books.google.com?id=2CaeDwAAQBAJ.
  • Zach, Richard. 2019a. Bussproofs-Extra: Extra Commands for Bussproofs.sty. CTAN Comprehensive TeX Archive Network. https://ctan.org/pkg/bussproofs-extra.
  • ———. 2019b. Keyindex: Index Entries by Key Lookup. CTAN Comprehensive TeX Archive Network. https://ctan.org/pkg/keyindex.
  • ———. 2019c. Ptolemaicastronomy: Diagrams of Sphere Models for Variably Strict Conditionals (Lewis Counterfactuals). CTAN Comprehensive TeX Archive Network. https://ctan.org/pkg/ptolemaicastronomy.
  • ———. 2019d. Ucalgmthesis: LaTeX Thesis Class for University of Calgary Faculty of Graduate Studies. CTAN Comprehensive TeX Archive Network. https://ctan.org/pkg/ucalgmthesis.
  • Carnap, Rudolf. 2019b. “On the Task of Physics and the Application of the Principle of Maximal Simplicity.” In Rudolf Carnap: Early Writings, edited by A. W. Carus, Michael Friedman, Wolfgang Kienzler, Alan Richardson, and Sven Schlotter, translated by Johannes Hafner, Paolo Mancosu, Christopher Pincock, Henning Treuper, Herbert Wilson, Richard Zach, A. W. Carus, and Michael Friedman, 209–45. The Collected Works of Rudolf Carnap 1. Oxford: Oxford University Press. https://books.google.com?id=2CaeDwAAQBAJ.
  • Zach, Richard. 2019e. Boxes and Diamonds. An Open Introduction to Modal Logic. Calgary: Open Logic Project. https://bd.openlogicproject.org/.
  • ———. 2019f. “Hilbert’s Program.” In Stanford Encyclopedia of Philosophy, edited by Edward N. Zalta, Fall 2019. https://plato.stanford.edu/archives/fall2019/entries/hilbert-program/.
  • ———. 2019g. Incompleteness and Computability. An Open Introduction to Gödel’s Theorems. Calgary: Open Logic Project. https://ic.openlogicproject.org/.
  • ———. 2019h. Sets, Logic, Computation: An Open Introduction to Metalogic. Calgary: Open Logic Project. https://slc.openlogicproject.org/.
  • ———. 2019i. “The Significance of the Curry-Howard Isomorphism.” In Philosophy of Logic and Mathematics. Proceedings of the 41st International Ludwig Wittgenstein Symposium, edited by Gabriele M. Mras, Paul Weingartner, and Bernhard Ritter, 313–25. Publications of the Austrian Ludwig Wittgenstein Society, New Series 26. Berlin: De Gruyter. https://doi.org/10.1515/9783110657883-018.
  • ———. 2018a. “Rumfitt on Truth-Grounds, Negation, and Vagueness.” Philosophical Studies 175 (8): 2079–89. https://doi.org/10.1007/s11098-018-1114-7.
  • Hosni, Hykel, and Richard Zach. 2018. “Interview with Richard Zach.” The Reasoner 12 (4): 26–28. https://blogs.kent.ac.uk/thereasoner/files/2015/01/TheReasoner-124.pdf.
  • Thomas-Bolduc, Aaron, and Richard Zach. 2018. OER: What, Why, When and How. Taylor Institute Learning Technologies. Calgary: Taylor Institute for Teaching and Learning. https://darcynorman.net/podcasts/TILT-002-IntroToOER.mp3.
  • Wyatt, Nicole, and Richard Zach. 2018. “The Open Logic Project.” Bulletin of Symbolic Logic 24 (2): 205.
  • Zach, Richard. 2018b. “Non-Analytic Tableaux for Chellas’s Conditional Logic CK and Lewis’s Logic of Counterfactuals VC.” Australasian Journal of Logic 15 (3): 609–28. https://doi.org/10.26686/ajl.v15i3.4780.
  • Thomas-Bolduc, Aaron, and Richard Zach. 2017. “Logic Courses for the 21st Century.” In. https://openlogicproject.org/wp-content/uploads/2017/10/issotl-poster.pdf.
  • Schiemer, Georg, Richard Zach, and Erich Reck. 2017. “Carnap’s Early Metatheory: Scope and Limits.” Synthese 194 (1): 33–65. https://doi.org/10.1007/s11229-015-0877-z.
  • Zach, Richard. 2017a. “General Natural Deduction Rules and General Lambda Calculi.” Bulletin of Symbolic Logic 23 (3): 371.
  • ———. 2017b. “Semantics and Proof Theory of the Epsilon Calculus.” In Logic and Its Applications. ICLA 2017, edited by Sujata Ghosh and Sanjiva Prasad, 27–47. LNCS 10119. Berlin: Springer. https://doi.org/10.1007/978-3-662-54069-5_4.
  • ———. 2016a. “Natural Deduction for the Sheffer Stroke and Peirce’s Arrow (and Any Other Truth-Functional Connective).” Journal of Philosophical Logic 45 (2): 183–97. https://doi.org/10.1007/s10992-015-9370-x.
  • Eiter, Thomas. 2016. “Helmut Veith (1971).” Translated by Richard Zach. Bulletin of the EATCS 119. http://bulletin.eatcs.org/index.php/beatcs/article/view/405.
  • Zach, Richard. 2016b. “Helmut Veith (1971).” Bulletin of the EATCS 119. http://bulletin.eatcs.org/index.php/beatcs/article/view/406.
  • Mancosu, Paolo, and Richard Zach. 2015. “Heinrich Behmann’s 1921 Lecture on the Decision Problem and the Algebra of Logic.” Bulletin of Symbolic Logic 21 (2): 164–87. https://doi.org/10.1017/bsl.2015.10.
  • Baaz, Matthias, and Richard Zach. 2014. “The Epsilon Calculus and Non-Classical Logics.” Bulletin of Symbolic Logic 19: 513.
  • Etchemendy, John, Dave Barker-Plummer, and Richard Zach. 2013. The Lplfitch Package (version 0.9). CTAN Comprehensive TeX Archive Network. https://ctan.org/pkg/lplfitch.
  • Bernays, Paul. 2012. “Axiomatic Investigations of the Propositional Calculus of Principia Mathematica.” In Universal Logic: An Anthology, edited by Jean-Yves Béziau, translated by Richard Zach, 43–58. New York and Basel: Springer.
  • Carnap, Rudolf, Hans Hahn, and Otto Neurath. 2012. “The Scientific World-Conception: The Vienna Circle.” In Wissenschaftliche Weltauffassung: Der Wiener Kreis, edited by Friedrich Stadler and Thomas Uebel, translated by Thomas Uebel and Richard Zach, 75–116. Vienna and New York: Springer.
  • Serchuk, Phil, Ian Hargreaves, and Richard Zach. 2011. “Vagueness, Logic and Use: Four Experimental Studies on Vagueness.” Mind and Language 26 (5): 540–73. https://doi.org/10.1111/j.1468-0017.2011.01430.x.
  • Mancosu, Paolo, Richard Zach, and Calixto Badesa. 2009. “The Development of Mathematical Logic from Russell to Tarski: 1900.” In The Development of Modern Logic, edited by Leila Haaparanta, 324–478. New York and Oxford: Oxford University Press. https://doi.org/10.1093/acprof:oso/9780195137316.003.0029.
  • Antonelli, Aldo, Alasdair Urquhart, and Richard Zach. 2008. “Editors’ Introduction. Mathematical Methods in Philosophy.” The Review of Symbolic Logic 1 (2): 143–45. https://doi.org/10.1017/S1755020308080131.
  • Baaz, Matthias, and Richard Zach. 2008. “Effective Finite-Valued Approximations of General Propositional Logics.” In Pillars of Computer Science: Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th Birthday, edited by Arnon Avron, Nachum Dershowitz, and Alexander Rabinovich, 107–29. LNCS 4800. Berlin: Springer. https://doi.org/10.1007/978-3-540-78127-1_7.
  • Zach, Richard. 2008. “Carnap’s Logic in the 1930s.” Bulletin of Symbolic Logic 14: 426.
  • Baaz, Matthias, Norbert Preining, and Richard Zach. 2007. “First-Order Gödel Logics.” Annals of Pure and Applied Logic 147 (1-2): 23–47. https://doi.org/10.1016/j.apal.2007.03.001.
  • Zach, Richard. 2007a. “Hilbert’s Program Then and Now.” In Philosophy of Logic, edited by Dale Jacquette, 5:411–47. Handbook of the Philosophy of Science. Amsterdam: North-Holland. https://doi.org/10.1016/B978-044451541-4/50014-2.
  • ———. 2007b. “The Decision Problem and Metalogic.” Bulletin of Symbolic Logic 13: 319.
  • Moser, Georg, and Richard Zach. 2006a. “The Epsilon Calculus and Herbrand Complexity.” Studia Logica 82 (1): 133–55. https://doi.org/10.1007/s11225-006-6610-7.
  • Baaz, Matthias, Norbert Preining, and Richard Zach. 2006. “Completeness of a Hypersequent Calculus for Some First-Order Gödel Logics with Delta.” In 36th International Symposium on Multiple-valued Logic. May 2006, Singapore. Proceedings, 9–14. Los Alamitos: IEEE Press. https://doi.org/10.1109/ISMVL.2006.16.
  • Moser, Georg, and Richard Zach. 2006b. “Complexity of Elimination Procedures in the Epsilon Calculus.” Bulletin of Symbolic Logic 12: 341–42.
  • Zach, Richard. 2006a. “Hilbert, Programma di.” In Enciclopedia Filosofica di Gallarate, 5285–91. Milan: Bompiani.
  • ———. 2006b. “Kurt Gödel and Computability Theory.” In Logical Approaches to Computational Barriers. Second Conference on Computability in Europe, CiE 2006, Swansea. Proceedings, edited by Arnold Beckmann, Ulrich Berger, Benedikt Löwe, and John V. Tucker, 575–83. LNCS 3988. Berlin: Springer. https://doi.org/10.1007/11780342_59.
  • ———. 2005a. “Review of *Gödel**’s* *Theorem**:* Its Use and Abuse, by Torkel Franzén (AK Peters, 2005).” History and Philosophy of Logic 26 (4): 369–71. https://doi.org/10.1080/01445340500259388.
  • ———. 2005b. “Kurt Gödel, Paper on the Incompleteness Theorems (1931).” In Landmark Writings in Mathematics, edited by Ivor Grattan-Guinness, 917–25. Amsterdam: Elsevier. https://doi.org/10.1016/B978-044450871-3/50152-2.
  • Arana, Andrew, Michael Glanzberg, Ted Sider, Brian Weatherson, and Richard Zach. 2005. “Panel Discussion: Logic Instruction and Philosophy Graduate Training.” The Bulletin of Symbolic Logic 11: 549–50.
  • Baaz, Matthias, Norbert Preining, and Richard Zach. 2005. “Axiomatizability of First-Order Gödel Logics.” Bulletin of Symbolic Logic 11: 267.
  • Zach, Richard. 2005c. “Gödel’s First Incompleteness Theorem and Detlefsen’s Hilbertian Instrumentalism.” Bulletin of Symbolic Logic 11: 301.
  • ———. 2005d. “Review of *Reason**’s* *Nearest Kin**: Philosophies* of Arithmetic From Kant to Carnap by Michael Potter (Oxford University Press, 2000).” Notre Dame Journal of Formal Logic 46 (4): 503–13. https://doi.org/10.1305/ndjfl/1134397665.
  • ———. 2004a. “Hilbert’s ‘Verunglückter Beweis,’ the First Epsilon Theorem, and Consistency Proofs.” History and Philosophy of Logic 25 (2): 79–94. https://doi.org/10.1080/01445340310001606930.
  • ———. 2004b. “Decidability of Quantified Propositional Intuitionistic Logic and S4 on Trees of Height and Arity  ≤ ω.” Journal of Philosophical Logic 33 (2): 155–64. https://doi.org/10.1023/B:LOGI.0000021744.10237.d0.
  • ———. 2004c. “Le quantificateur effini, la descente infinie et les preuves de consistance de Gauthier.” Philosophiques 31: 221–24. https://doi.org/10.7202/008942ar.
  • ———. 2003a. “The Practice of Finitism: Epsilon Calculus and Consistency Proofs in Hilbert’s Program.” Synthese 137 (1/2): 211–59. https://doi.org/10.1023/A:1026247421383.
  • Baaz, Matthias, Norbert Preining, and Richard Zach. 2003. “Characterization of the Axiomatizable Prenex Fragments of First-Order Gödel Logics.” In 33rd International Symposium on Multiple-valued Logic. May 2003, Tokyo, Japan. Proceedings, 175–80. Los Alamitos: IEEE Press. https://doi.org/10.1109/ISMVL.2003.1201403.
  • Moser, Georg, and Richard Zach. 2003. “The Epsilon Calculus.” In Kurt Gödel Colloquium. Computer Science Logic, 2003. Proceedings, 455. Berlin: Springer.
  • Zach, Richard. 2003b. “Review of Computability and Logic, 4th Edition, by George Boolos, John Burgess, and Richard Jeffrey (Cambridge, 2002).” Bulletin of Symbolic Logic 9 (4): 520–21. https://doi.org/10.1017/S1079898600004340.
  • Baaz, Matthias, and Richard Zach. 2002. “Das Vollständigkeitsproblem und der Vollständigkeitsbeweis.” In Kurt Gödel: Wahrheit und Beweisbarkeit. Volume 2: Kompendium zum Werk, edited by Bernd Buldt et al., 21–27. Vienna: hpt.
  • Zach, Richard. 2002a. “Hilbert’s ‘Verunglückter Beweis’ and the Epsilon Theorem.” Bulletin of Symbolic Logic 8: 449–50.
  • ———. 2002b. “Quantified Propositional Intuitionistic Logic on Trees Is Decidable.” Bulletin of Symbolic Logic 8: 163.
  • ———. 2002c. “Review of *Computability**.* *Computable Functions**,* *Logic**, and the* Foundations of Mathematics, 2nd Edition, by Richard L. Epstein and Walter A. Carnielli (Wadsworth, 2000).” History and Philosophy of Logic 23 (1): 67–70. https://doi.org/10.1080/01445340110067158.
  • ———. 2001a. “Hilbert’s Finitism: Historical, Philosophical, and Metamathematical Perspectives.” PhD thesis, University of California, Berkeley.
  • Fermüller, Christian G., Georg Moser, and Richard Zach. 2001. “Tableaux for Reasoning about Atomic Updates.” In Logic for Programming, Artificial Intelligence, and Reasoning, edited by Robert Nieuwenhuis and Andrei Voronkov, 639–53. LNCS 2250. Berlin: Springer. https://doi.org/10.1007/3-540-45653-8_44.
  • Zach, Richard. 2001b. “Hilbert’s ‘Ansatz’ for the ε-Substitution Method and Ackermann’s Dissertation.” Bulletin of Symbolic Logic 7: 417.
  • Baaz, Matthias, Agata Ciabattoni, and Richard Zach. 2000. “Quantified Propositional Gödel Logic.” In Logic for Programming and Automated Reasoning. 7th International Conference, LPAR 2000, edited by Andrei Voronkov and Michel Parigot, 240–56. LNCS 1955. Berlin: Springer. https://doi.org/10.1007/3-540-44404-1_16.
  • Baaz, Matthias, and Richard Zach. 2000. “Hypersequents and the Proof Theory of Intuitionistic Fuzzy Logic.” In Computer Science Logic. 14th International Workshop, CSL 2000, edited by Peter G. Clote and Helmut Schwichtenberg, 187–201. LNCS 1862. Berlin: Springer. https://doi.org/10.1007/3-540-44622-2_12.
  • Zach, Richard. 1999a. “Completeness Before Post: Bernays, Hilbert, and the Development of Propositional Logic.” The Bulletin of Symbolic Logic 5 (3): 331–66. https://doi.org/10.2307/421184.
  • ———. 1999b. “Hilbert, Bernays, and Some Fundamental Advances in Logic, 1918–1923,” Bulletin of Symbolic Logic 5: 481.
  • Baaz, Matthias, and Richard Zach. 1998a. “Note on Generalizing Theorems in Algebraically Closed Fields.” Archive for Mathematical Logic 37 (5): 297–307. https://doi.org/10.1007/s001530050100.
  • Baaz, Matthias, Christian G. Fermüller, Gernot Salzer, and Richard Zach. 1998. “Labeled Calculi and Finite-Valued Logics.” Studia Logica 61 (1): 7–33. https://doi.org/10.1023/A:1005022012721.
  • Baaz, Matthias, and Richard Zach. 1998b. “Compact Propositional Gödel Logics.” In 28th International Symposium on Multiple-valued Logic. May 1998, Fukuoka, Japan. Proceedings, 108–13. Los Alamitos: IEEE Press. https://doi.org/10.1109/ISMVL.1998.679315.
  • Zach, Richard. 1998. “Numbers and Functions in Hilbert’s Finitism.” Taiwanese Journal for Philosophy and History of Science 10: 33–60.
  • Baaz, Matthias, Alexander Leitsch, and Richard Zach. 1996a. “Completeness of a First-Order Temporal Logic with Time-Gaps.” Theoretical Computer Science 160 (1): 241–70. https://doi.org/10.1016/0304-3975(95)00107-7.
  • Baaz, Matthias, Christian G. Fermüller, Gernot Salzer, and Richard Zach. 1996. “MUltlog 1.0: Towards an Expert System for Many-Valued Logics.” In Automated Deduction. Cade-13: 13th International Conference on Automated Deduction. Proceedings, edited by M. A. McRobbie and J. K. Slaney, 226–30. Berlin, Heidelberg: Springer. https://doi.org/10.1007/3-540-61511-3_84.
  • Baaz, Matthias, Alexander Leitsch, and Richard Zach. 1996b. “Incompleteness of an Infinite-Valued First-Order Gödel Logic and of Some Temporal Logics of Programs.” In Computer Science Logic. CSL 1995. Selected Papers, edited by E. Börger, 1–15. LNCS 1092. Berlin: Springer. https://doi.org/10.1007/3-540-61377-3_28.
  • Baaz, Matthias, and Richard Zach. 1995a. “Generalizing Theorems in Real Closed Fields.” Annals of Pure and Applied Logic 75 (1): 3–23. https://doi.org/10.1016/0168-0072(94)00054-7.
  • Baaz, Matthias, Christian G. Fermüller, and Richard Zach. 1995. “Proof Theory of Finite-Valued Logics.” Bulletin of Symbolic Logic 1: 221–22.
  • Baaz, Matthias, and Richard Zach. 1995b. “Generalizing Theorems in Real Closed Fields.” Bulletin of Symbolic Logic 1: 361.
  • ———. 1994a. “Approximating Propositional Calculi by Finite-Valued Logics.” In 24th International Symposium on Multiple-valued Logic, 1994. Proceedings, 257–63. Los Alamitos: IEEE Press. https://doi.org/10.1109/ISMVL.1994.302193.
  • ———. 1994b. “Short Proofs of Tautologies Using the Schema of Equivalence.” In Computer Science Logic. 7th Workshop, CSL ’93, Swansea. Selected Papers, edited by Egon Börger, Yuri Gurevich, and Karl Meinke, 33–35. LNCS 832. Berlin: Springer. https://doi.org/10.1007/BFb0049322.
  • Hájek, Petr, and Richard Zach. 1994. “Review of Many-Valued Logics: 1. Theoretical Foundations, by Leonard Bolc and Piotr Borowik (Springer, Berlin, 1991).” Journal of Applied Non-Classical Logics 4: 215–20. https://doi.org/10.1080/11663081.1994.10510833.
  • Baaz, Matthias, Christian G. Fermüller, Arie Ovrutcki, and Richard Zach. 1993. “MULTLOG: A System for Axiomatizing Many-Valued Logics.” In Logic Programming and Automated Reasoning. Proceedings LPAR’93, edited by Andrei Voronkov, 345–47. LNCS 698. Berlin: Springer. https://doi.org/10.1007/3-540-56944-8_66.
  • Baaz, Matthias, Christian G. Fermüller, and Richard Zach. 1993a. “Dual Systems of Sequents and Tableaux for Many-Valued Logics.” Bulletin of the EATCS 51: 192–97. https://doi.org/10.11575/PRISM/38908.
  • ———. 1993b. “Elimination of Cuts in First-Order Finite-Valued Logics.” Journal of Information Processing and Cybernetics EIK 29 (6): 333–55. https://doi.org/10.11575/PRISM/38801.
  • ———. 1993c. “Systematic Construction of Natural Deduction Systems for Many-Valued Logics.” In 23rd International Symposium on Multiple-valued Logic. Proceedings, 208–13. Los Alamitos: IEEE Press. https://doi.org/10.1109/ISMVL.1993.289558.
  • ———. 1993d. “Systematic Construction of Natural Deduction Systems for Many-Valued Logics. Extended Report.” TUWBFZ.1. Vienna: Technische Universität Wien, Institut für Computersprachen E185.2. https://doi.org/10.11575/PRISM/39963.
  • Baaz, Matthias, and Richard Zach. 1993. “Algorithmic Structuring of Cut-Free Proofs.” In Computer Science Logic. CSL’92, San Miniato, Italy. Selected Papers, edited by Egon Börger, Gerhard Jäger, Hans Kleine Büning, Simone Martini, and Michael M. Richter, 29–42. LNCS 702. Berlin: Springer. https://doi.org/10.1007/3-540-56992-8_4.
  • Zach, Richard. 1993. “Proof Theory of Finite-Valued Logics.” Diplomarbeit, Vienna, Austria: Technische Universität Wien. https://doi.org/10.11575/PRISM/38803.
  • Baaz, Matthias, and Richard Zach. 1992. “Note on Calculi for a Three-Valued Logic for Logic Programming.” Bulletin of the EATCS 48: 157–64.
  • Zach, Richard, Gerhard Widmer, and Robert Trappl. 1990. “Art/Ificial Intelligence: A Short Bibliography on AI and the Arts.” TR-90-14. ÖFAI Report. Vienna: Austrian Research Institute for Artificial Intelligence. https://doi.org/10.11575/PRISM/39857.

Invited Talks

Prefixed Tableaux for Simply Dependent Multimodal Logics. Logic & Theory Group, Vienna University of Technology, 2022.

Hilbert’s Program and Infinity. Logic Café, University of Vienna, 2022.

Hilbert’s Program and Infinity. Séminaire «Infini mathématique», Université Paris I, 2022.

Semantics of First-order Logic: The Early Years. PHILMATH Seminar, Institut d’Histoire et Philosophie des Sciences et Techniques, CNRS/Université Paris I, 2022.

Semantics of First-order Logic: The Early Years. Logic Seminar, University of Connecticut, Storrs, 2021.

Logic and Computation in the 1920s and 30s. Philosophy of Computation and Statistics Workshop, University of Pennsylvania, 2021.

The Origins of Modern First-order Logic. Philosophy Colloquium, Carnegie Mellon University, 2017.

The Decision Problem and Logical Metatheory. SoMLaFS Colloquium, The Ohio State University, 2017.

Substitution, Consequence, and Proof, or: How Many Consequence Relations Can One Logic Have?. Department of Philosophy, University of British Columbia, Okanagan, 2016.

Derivation and Consequence. Philosophy Workshop, McGill University, 2015.

The Decision Problem and Logical Metatheory. Townsend Center Working Group in History and Philosophy of Logic, Mathematics, and Science, University of California, Berkeley, 2014.

Carnap and Logic in the 1920s and 1930s. Minnesota Center for Philosophy of Science, University of Minnesota, 2014.

The Decision Problem and Logical Metatheory. Foundations Interest Group, Department of Philosophy, University of Minnesota, 2014.

The Decision Problem and the Development of Metalogic. Logic and Philosophy of Science Group, University of Toronto, 2012.

Gödel’s First Incompleteness Theorem and Mathematical Instrumentalism. Keio University, Tokyo, 2011.

Proof Interpretations and the Constructive Content of Mathematical Theories. Kyoto University, 2011.

The Epsilon Calculus. Keio University, Tokyo, 2011.

The Decision Problem and the Development of Metalogic. Department of Philosophy, McGill University, 2009.

Proof Interpretations and the Constructive Content of Mathematical Theories. Wissenschaftstheoretisches Kolloquium, University of Vienna, Austria, 2009.

The Decision Problem and the Development of Metalogic. Department of Philosophy, Utrecht University, 2008.

Proof Construction, and Computation: Interactions between Philosophy of Mathematics and Mathematical Foundations. Scuola Normale Superiore, Pisa, 2008.

The Epsilon Calculus. Logic Group, University of Melbourne, 2006.

Logic and Cagueness. Department of Philosophy, University of Melbourne, 2006.

Gödel’s First Incompleteness Theorem and Mathematical Instrumentalism. Gödel Seminar, University of Notre Dame, 2006.

Algebraic Semantics for Logics of Vagueness. Kurt Gödel Society, University of Technology, Vienna, 2005.

What Should a Logic of Vagueness Be and Do?. Philosophy Department, Stanford University, 2005.

How to Argue for and against a Logic of Vagueness. Logic and Philosophy of Science Colloquium, University of California, Irvine, 2004.

Vagueness and Infinitely Many Truth Values. Townsend Center Working Group in History and Philosophy of Logic, Mathematics, and Science, University of California, Berkeley, 2004.

Gödel’s First Incompleteness Theorem and Mathematical Instrumentalism. Department of Philosophy, University of Lethbridge, 2004.

Completeness and Decidability in the Context of Hilbert’s Philosophy. Department of Philosophy, University of Alberta, 2003.

The Early History of the Epsilon Calculus. Townsend Center Working Group in History and Philosophy of Logic, Mathematics, and Science, University of California, Berkeley, 2002.

Logic and Metalogic in Hilbert’s School. Seminari de Lògica, Universitat de Barcelona, 2002.

The Epistemology of Mathematics and Hilbert’s Finitism. Department of Philosophy, University of Calgary, 2001.

Epsilon Calculus and Consistency Proofs in Hilbert’s Program. Mathematical Logic Seminar, Stanford University, 2001.

Instrumentalism in Mathematics. Department of Philosophy, University of South Florida, Tampa, 2001.

Epsilon Calculus and Consistency Proofs in Hilbert’s Program. Department of Logic and Philosophy of Science, University of California, Irvine, 2001.

Finitism and Mathematical Intuition. Department of Philosophy, Oxford University, 20008.

Finitism and Mathematical Intuition. Department of Philosophy, University of Chicago, 2000.

Finitism and Mathematical Intuition. Department of Philosophy, Stanford University, 2000.

Completeness before Post: Hilbert and Bernays on Propositional Logic, 1917–18. Logic Lunch, Stanford University, 1999.

The Debate between Kreisel and Tait on Finitism. Colloquium Logico-Philosophicum, Universität Erlangen-Nürnberg, 1998.

Finitism. Kurt Gödel Society, Vienna, 1997.

Generalization of Theorems and Proofs: Kreisel’s Conjecture for Algebraic Theories. Logic Lunch, Stanford University, 1997.

Axiomatizability Issues in Temporal and Infinite-Valued First-Order Logics. Equipe de Logique, Université Paris 7 Denis Diderot, 1995.

Adventures in Many-Valued Logic. Kurt Gödel Society, Vienna, 1995.

Proof Theory of Finite-Valued First-Order Logics. Institute of Computer Science, Academy of Sciences of the Czech Republic, Prague, 1994.

Keynotes

The Significance of the Curry-Howard Isomorphism. Eastern Division Meeting of the American Philosophical Association, New York, 2019.

Semantics and Proof Theory of the Epsilon Calculus. Indian Conference on Logic and its Applications, Indian Institute of Technology, Kanpur, 2017.

Carnap on Models. Spring Meeting of the Association for Symbolic Logic, Symposium on Metalogic and Early Analytic Philosophy, San Diego, 20147.

The Epsilon Calculus: An Undervalued Logical Formalism. Annual Meeting of the Society for Exact Philosophy, Montréal, 2013.

Carnap, Logic, and Analytic Philosophy. 200 Years of Analytic Philosophy, University of Latvia, Rīga, 2008.

The decision problem and the development of metalogic. Annual Meeting of the Association for Symbolic Logic, University of Florida, Gainesville, FL, 20072.

Kurt Gödel and computability theory. Computability in Europe CiE 2006: Logical Approaches to Computational Barriers, Swansea, Wales, 2006.

The Epsilon Calculus. Kurt Gödel Colloquium/Conference on Computer Science Logic CSL’03, University of Technology Vienna, 2003.

Invited Workshops

The Philosophical Significance of the Curry-Howard Isomorphism. 41st International Wittgenstein Symposium, Kirchberg am Wechsel, Austria, 2018.

The Open Logic Project. Spring Meeting of the Association for Symbolic Logic, Seattle, 2017.

General Rules for Sequent Calculus and Natural Deduction. OSU/UConn Workshop on Truth, The Ohio State University, 2017.

The Fruitfulness of Philosophy of Mathematics. Workshop on Mathematics and Culture, Indian Institute of Engineering Science and Technology, Shibpur, 2017.

Carnap as a Logician. Carnap on Logic Conference, Munich Center for Mathematical Philosophy, 2013.

Carnap and Logic. Workshop on Formal Epistemology and the Legacy of Logical Empiricism, University of Texas, Austin, 2013.

‘Principia Mathematica’ and the development of logic. PM@100, McMaster University, Hamilton, 20103.

Bernays and the Decision Problem in Hilbert’s School. Bernaysfest, Carnegie Mellon University, 2008.

Carnap’s Logic in the 1930s. Annual Meeting of the Association for Symbolic Logic, University of California, Irvine, 2008.

Analytic Systems for the ε-Calculus. Analytic Systems/LPAR 2007, Yerevan, Armenia, 2007.

The Decision Problem in the 1920s. Moscow-Vienna Workshop on Logic and Computation, Technical University Vienna, Vienna, Austria, 2007.

Algorithms and decision problems in Hilbert’s school. Hilbert Workshop, Kyoto University, 2006.

Vagueness and Fuzzy Logics. Uncertainty: Reasoning about Probability and Vagueness, Prague, 2006.

Gödel’s First Incompleteness Theorem and Mathematical Instrumentalism. Truth and Proof: Kurt Gödel and the Foundations of Mathematics, University of Edinburgh, 2006.

Semantics for Vagueness vs. Logics for Vagueness: The Case of Fuzzy Logics. The Challenge of Semantics (European Science Foundation Exploratory Workshop), Vienna, 2004.

Hilbert’s Epsilon Calculus and Epsilon-Substitution Method. Hilbert Workshop, Japanese Society for the Philosophy of Science, Keio University, Tokyo, 2002.

Hilbert’s Project of Consistency Proofs in the 1920s. Logic and the Foundations of the Exact Sciences: Hilbert’s Heritage, Berne, Switzerland, 2001.

Hilbert’s ‘Ansatz’ for the Epsilon-Substitution Method and Ackermann’s Dissertation. Spring Meeting of the Association for Symbolic Logic, Minneapolis, 2001.

Epsilon Calculus and Consistency Proofs in Hilbert’s Program. Philosophy of Mathematics Workshop, University of California, Los Angeles, 2001.

The Practice of Finitism. Hilbert Workshop, Institut d’Histoire et Philosophie des Sciences et Techniques, CNRS/Université Paris I, 2000.

The Practice of Finitism. History of Logic, University of Helsinki, 2000.

The Reach of Finitism. Collegium Logicum: Proof Theory, Vienna, 1999.

The Historical Significance of Consistency Proofs. The Development of the Foundations of Mathematics in the 1920s and 30s, Institute Vienna Circle, Vienna, 1999.

Bernays’ Early Contributions to Logic. The Development of Modern Logic, University of Helsinki, 1998.

Uniform Deduction Systems for Finite-valued First-Order Logics. Eighth European Summer School in Language, Logic, and Information, Prague, 1996.

A Software Package for Axiomatizing Finite-Valued First-Order Logics. Seventh European Summer School in Language, Logic, and Information, Barcelona, 1995.

Conference Talks

Steinhardt on Variables. Society for the Study of the History of Analytic Philosophy Annual Meeting, Denver, 2016.

The Decision Problem and the Model Theory of First-order Logic. Canadian Society for History and Philosophy of Mathematics, Calgary, 2016.

General Natural Deduction Rules and General Lambda Calculi. Annual Meeting of the Association for Symbolic Logic, University of Connecticut, Storrs, 2016.

Substitution, Consequence, and Proof. Society for Exact Philosophy, Hamilton, ON, 2015.

The Epsilon Calculus and Non-Classical Logics. Nonclassical Proofs: Theory, Applications, and Tools, Vienna, 2014.

The Place of Logic in Computer Science Education. Logic Colloquium, Vienna, 2014.

Carnap and Logic in the 1920s and 1930s. Society for the Study of the History of Analytic Philosophy Annual Meeting, Montréal, 2014.

The Epsilon Calculus and Non-Classical Logics. Winter Meeting of the Association for Symbolic Logic, New Orleans, 2013.

Carnap, Tolerance, and the Foundational Debate in Mathematics. International Congress on Logic, Philosophy, and Methodology of Science, Nancy, France, 2011.

Ayer and the Vienna Circle. Western Canadian Philosophy Association, University of Calgary, 2010.

Carnap between Logicism and Formalism. History of Philosophy of Science 2006, Paris, 2006.

Complexity of Elimination Procedures in the Epsilon Calculus. Logic Colloquium, Athens, Greece, 2005.

Algebraic Semantics for Logics of Vagueness. Society for Exact Philosophy, University of Toronto, 2005.

Logic Instruction and Philosophy Graduate Training. Spring Meeting of the Association for Symbolic Logic, San Francisco, 2005.

Gödel’s First Incompleteness Theorem and Detlefsen’s Hilbertian Instrumentalism. Logic Colloquium, Turin, Italy, 2004.

Axiomatizability of First-Order Gödel Logics. Logic Colloquium, Turin, Italy, 2004.

Finite-Valued Approximations of Propositional Logics. Foundational Methods in Computer Science, Kananaskis Field Station, University of Calgary, 2004.

Gödel’s First Incompleteness Theorem and Mathematical Instrumentalism. Midwest Philosophy of Mathematics Workshop, University of Notre Dame, 2003.

Characterization of the Axiomatizable Prenex Fragments of First-Order Gödel Logics. 33rd International Symposium on Multiple Valued Logic, Tokyo, 2003.

Hilbert’s `Verunglückter Beweis’ and the Epsilon Theorem. Spring Meeting of the Association for Symbolic Logic, Seattle, 2002.

Quantified Propositional Intuitionistic Logic on Trees is Decidable. Logic Colloquium, Vienna, 2001.

The Syntax-Semantics Distinction and Hilbert’s `No Ignorabimus’. History of Philosophy of Science, Vienna, 2000.

Hilbert, Bernays, and some Fundamental Advances in Logic, 1918–1923. Spring Meeting of the Association for Symbolic Logic, New Orleans, 1999.

Infinite-valued Gödel Logics. Annual Meeting of the Association for Symbolic Logic, Unversity of California, San Diego, 1999.

Hilbert’s Finitist Numbers. 1997 Stanford–Berkeley Philosophy Conference, Stanford University, 1997.

Generalizing Theorems in Real Closed Fields. Winter Meeting of the Association for Symbolic Logic, San Francisco, 1995.

Approximating Propositional Calculi by Finite-Valued Logics. 24th International Symposium on Multiple-Valued Logic, Boston, 1994.

Systematic Construction of Natural Deduction Systems for Many-Valued Logics. 23rd International Symposium on Multiple-Valued Logic, Sacramento, 1993.

Graduate Supervision

Supervisor

Husna Farooqui (MA), “The Curry-Howard Correspondence,” 2021

Joseph McDonald (MA), “A Categorical Extension of the Curry-Howard Isomorphism,” 2019

Aaron Thomas-Bolduc (PhD), “New Directions for Neologicism,” 2018

Samara Burns (MA), “Hypersequent Calculi for Modal Logics,” 2018

Teppei Hayashi (PhD), “The Continuum: History, Mathematics, and Philosophy,” 2017

Zahra Ahmadianhosseini (MA), “Logical Models of Fallible Knowledge,” 2017

Zesen Qian (Mitacs Summer Intern), “The Open Logic Project,” 2016

Andre Curtis-Trudel (BA Honours), “Explication, Open-Texture, and Church’s Thesis,” 2016

Eamon Darnell (BA Honours), “Gödel vs. Mechanism,” 2013

Gillman Payette (PhD), “A Study in the Logic of Institutions,” 2012

Teresa Kouri Kissel (MA), “Indiscernibility and Mathematical Structuralism,” 2010

Taylor Scobbie (BA Honours), “Contrast and Contrastivism: The Logic of Contrastive Knowledge,” 2010

Steve Coyne (BA Honours), “Belief-Theoretic Foundations for Conversation,” 2009

Rafał Urbaniak (PhD), “Leśniewski’s Systems of Logic and Mereology,” 2008

Julianne Chung (BA Honours), “The Paradox of Knowability,” 2007

Phil Serchuk (BA Honours), “Fuzzy Logic and Vagueness,” 2006

External Examiner

Nicola Bonatti (MPhil in Philosophy, University of St. Andrews), “The Meaning of Quantifiers and the Epsilon Calculus,” 2020

Long Chen (PhD in Philosophy, King’s College London), “Interpreting Gödel: Historical and Philosophical Perspectives,” 2017

Hassan Massoud (PhD in Philosophy, University of Alberta), “The Epistemology of Natural Deduction,” 2015

Toby Meadows (PhD in Philosophy, University of Melbourne), “Modality without Metaphysics,” 2011

Committee Member

Zain Rizvi (PhD in Computer Science, supervisor: Philip Fong), “The SUDO Framework for Data Organization And Efficient Query Authorization For NoSQL Databases,” 2020

Brent Odland (MA), “Peirce’s Triadic Logic: Continuity, Modality, and L,” 2020

Prashant Kumar (MSc in Computer Science, supervisor: Robin Cockett), “Implementation of Message Passing Language,” 2018

Chad Mitchell Nester (MSc in Computer Science, supervisor: Robin Cockett), “Turing Categories and Realizability,” 2017

Mohammad Jafari (PhD in Computer Science, supervisor: Reyhaneh Safavi-Naini), “Modelling and Enforcing Purpose in Privacy Policies,” 2013

Jayalakshmi Balasubramaniam (MSc in Computer Science, supervisor: Philip Fong), “A Novel Approach to White-Box Policy Analysis,” 2013

Joseph Windsor (MA in Linguistics, supervisor: Darin Flynn), “When Nothing Exists: The Role of Zero in the Prosodic Hierarchy,” 2012

Cheng Xu (MSc in Computer Science, supervisor: Philip Fong), “The Specification and Compilation of Obligation Policies for Program Monitoring,” 2011

Julia Zochodne (BA Honours, supervisor: Nicole Wyatt), “What do We do with a Logic that is Formal?,” 2009

Steven Yuen (MSc in Computer Science, supervisor: Lisa Higham), “Formal Models and Implementations of Distributed Shared Memory,” 2009

Jennifer Runke (PhD in Philosophy, supervisor: Marc Ereshefsky), “Towards an Adequate Theory of Scientific Metaphor,” 2008

Jillian Hartman (MA in Creative Writing, supervisors: Susan Rudy, Tom Wayman), “Scrabbalah,” 2005

Craig Pastro (MSc in Computer Science, supervisor: Robin Cockett), “ΣΠ-Polycategories, Linear Logic, and Process Semantics,” 2005

Min Zeng (MSc in Computer Science, supervisor: Robin Cockett), “An Implementation of Charity,” 2003

Clement Loo (BA Honours, supervisor: Marc Ereshefsky), “The Role of Evolution in Behavior,” 2003

Teaching Awards

Teaching Excellence Award, Honorable Mention, Student’s Union, University of Calgary, 2020.

Great Supervisor Award, Faculty of Graduate Studies, University of Calgary, 2019.