Many Logics

Table of Contents

1. What is logic?

1.1. Notes

2. Logical notation: a brief refresher

2.1. Notes

  • Notation helps us express ourselves clearly and concisely. Gatekeeping isn't the point.

3. Hilbert systems

  • : “from , we can conclude
  • : “ is provable”

3.1. Notes

  • We're going to talk a little bit about formal proof systems. Specifically, we're going to talk about the kind of proof system that laypeople tend to be most familiar with, and why it's not very good. And then we'll introduce a better kind of system.
  • But first, a bit of notation.
  • The first item here is a sort of meta-notation. The idea is that, above the line, I have a list of premises, and below the line I have a conclusion that follows from the premises.
  • The second item is a notation specifically for formal proof systems. When I put a little tack in front of a formula, I'm saying that that formula is provable.

4. Hilbert systems

4.1. Notes

  • Here we have one possible set of axioms for a Hilbert system.

5. Natural deduction

  • : “ is provable under the assumptions

5.1. Notes

  • In the Hilbert-style system, we had a small number of axioms and a single rule of inference.

6. Natural deduction

Judgments: Rules:

7. The rules of natural deduction

8. Natural deduction in practice

Proof of :

9. Aristotle's logic

For two thousand years, Aristotle was considered to be the final word in the study of logic.

But Aristotle's logic looks very different from what we in the biz use now.

Aristotle analyzes arguments into

10. The intuitionists

Intuitionism:
The view of mathematics as the construction of mental objects.

Non-constructive rules of inference (only need one):

10.1. Notes

  • One of the oldest known mathematical proofs is the classical proof that there are infinitely many primes, usually attributed to Euclid.
  • This proof can be read as an algorithm that takes as input a set of prime numbers and yields a prime not in that set.
  • Similarly, each proof in Euclid's Elements is a procedure that shows how to construct an object with some property.
  • Until the late 19th century, all mathematics had this essentially “constructive” character.
  • This changed with Cantor's theory of infinite sets and the first formalizations of real numbers and related concepts.

11. Modal logics

Nothing is more arbitrary than a modal logic: “I am done with this logic, may I have another one?” seems to be the motto of modal logicians. —Jean-Yves Girard

Mode
Sense in which a proposition might be true (or false).
Modal logic
A logic that admits multiple modes (senses) of truth.

: “ is -true.”

11.1. Notes

  • “Mode” and “modality” are just fancy words that mean “sense in which a proposition might be true”.
  • A “modal logic”, then, is a logic that admits multiple senses of truth.
  • Modes are often denoted typographically by shapes; e.g., means “ is true in the sense.”

12. The classical mode

Let mean “ is classically true.” Then we should be able to prove the following:

12.1. Notes:

  • People only passingly familiar with modal logic mostly know the modes of possibility and necessity.
  • We'll talk about those in a bit, but I wanted to start with something slightly less well known, to get people thinking about modes in general.
  • So suppose that we like intuitionistic logic, but we still want to be able to talk about things that are true “in the classical sense.” We could do this with a “classical mode”.
  • What theorems involving this mode should we be able to prove? (Wait for answers, then advance.)
  • It's not obvious how we should do this. Just asserting as axioms all the things we want to be true is usually not the right approach.
  • But it turns out we don't need any creativity here.

13. Excluded middle in the classical mode

The law of excluded middle is intuitionistically valid in the classical modality.

We need to prove ; that is, we need to show that leads to a contradiction. So suppose ; then it suffices to show . I assert that, in particular, is true. To show this, we need to show that leads to contradiction, so suppose . Now, if is true, then is true, contradicting the supposition .

14. Formal proof

15. Double negation in the classical mode

We need to prove . Seeking a contradiction, suppose ; I assert . Assume ; we will demonstrate a contradiction. In particular, I assert that holds, contradicting the assumption . To see this, assume . But then the implication is trivially true, contradicting the earlier assumption .

16. Alethic modalities

Necessity
Possibility

What theorems should we be able to prove about these operators?

16.1. Notes:

  • The best-known modalities are the modalities of necessity and possibility.
  • I'm not sure why these modalities are so significant.
  • I know that formal modal logic was originally devised to study them, but I don't know why they were considered so important as to motivate that.
  • I also know that Aristotle provided an account of these modalities, but I don't know much about it other than that it has long been considered unsatisfactory.

17. Structural rules

In short:

18. Affine and linear logic

If traditional logic is about truth, then linear logic is about food. —Philip Wadler

18.1. Notes

Roughly: affine logic omits the rule of contraction; linear logic goes further and omits the rule of weakening.

19. Relevance logic

20. So many logics

Things I left out:

  • Exotic proof systems (e.g., Gentzen's sequent calculus)
  • Proof-relevant systems (e.g., dependent type theory)
  • Program logics (Hoare logic, separation logic)
  • Probabilistic logic
  • Paraconsistent logic and many-valued logic
  • Subjective logic

21. The elephant in the room

  • Q: Couldn't we just do all this in first-order logic?
  • A: Sort of.

22. But…

Would we have discovered Kripke semantics without a corresponding syntax?

Author: Nicholas Coltharp

Created: 2026-01-19 Mon 00:00

Validate