Skip navigation
The Australian National University

Program outline

Week 1

Fundamentals of Metalogic
John Slaney
  • Metatheory of classical first-order logic, including completeness theorem
  • Basics of proof theory
  • The Joy of Sets
Computability and Incompleteness
Michael Norrish
  • Computability, recursiveness, Turing machines
  • Diagonalisation
  • Peano Arithmetic and Gödel numbering
  • Undecidability of first-order logic
  • Incompleteness of Peano Arithmetic
Introduction to Modal and Temporal Logic
Rajeev Gore
  • Kripke models, Hilbert calculi, Frame correspondences
  • Tableaux-based decisions procedures
  • Propositional linear temporal logic
Constructive Logic and Realisability
Dirk Pattinson
  • Constructive Reasoning by Example
  • BHK interpretation
  • Natural Deduction for FOL
  • Goedel Gentzen
  • Heyting Arithmetic
  • Realisability Interpretation
  • Disjunction Theorem
  • Heyting Arithmetic in Higher Types
  • Modified Realisability

Week 2

Overview of Automated Reasoning
Peter Baumgartner
  • Automated propositional theorem proving
  • Automated first-order theorem proving
  • Reasoning with arithmetic constraints by quantifier elimination
Deviant Logic
John Slaney
  • Philosophical motivation
  • Routley-Meyer semantics
  • Paraconsistency and the γ rule
  • Deviant theories of arithmetic
Introduction to Proof Theory
Anupam Das
  • Propositional logic, semantics and proofs.
  • Soundness and completeness.
  • First-order logic and some formal theories.
  • The sequent calculus and cut-elimination.
  • Perspectives.
Tableaux metatheory for propositional and syllogistic logics
Tomasz Jarmużek
  • Tomasz Jarmużek"
  • TBA
  • TBA
  • TBA

Updated:  13 November 2018 / Responsible Officer:  JavaScript must be enabled to display this email address. / Page Contact:  JavaScript must be enabled to display this email address. / Powered by: Snorkel 1.4