Concept

Many valued logic

A logic whose sentences can take more than the two values true and false, such as a third value or a whole interval of degrees. Its laws are those that hold under every assignment of values, and which classical laws survive depends on the tables chosen.

Named by 4 essays across one field — each of them below, with the objects they name alongside it.

Which chains of truth values validate Gödel's disjunctions. A grid of Gödel's pigeonhole formulas in m letters against chains of n truth values, marking which chains validate which formula, forming a staircase where m exceeds n.

No table of truth values is enough

Two truth values decide classical logic. Gödel asked in 1932 whether some longer list of values could decide the constructive system, and answered with a pigeonhole: with n values, some two of n + 1 statements must share one, so a formula saying exactly that holds in every n-valued table and is not a theorem. The chains of truth values then descend forever, and what they share is a logic of its own — the logic of the real interval.

logic · Non classical logic
Six formulas on the interval of truth values. Graphs on [0, 1] of six one-variable formulas of Łukasiewicz logic, each a zigzag of whole-number slopes with values 0 or 1 at the ends.

The zigzags a formula can draw

Let truth be any number from 0 to 1, and Łukasiewicz's connectives turn every formula in one variable into a graph. Every graph that appears is a zigzag of straight pieces with whole-number slopes, ending at 0 or 1 — and McNaughton proved in 1951 that every such zigzag appears. A logic of degrees of truth turns out to be a theory of piecewise-linear functions with integer coefficients.

logic · Non classical logic
Three truth values, two of which count as holding. Truth tables of negation, conjunction and disjunction in the logic of paradox, with the values that count as holding — both and true — shaded.

A contradiction that stays where it is

In classical logic one contradiction proves everything: from p and not-p, any q at all. Add a third truth value — both true and false — and count it as holding, and the explosion stops. The classical laws all survive as laws; what goes is exactly the reasoning that carries a contradiction somewhere it was not. Run the other way, the same three tables make a logic of gaps instead of gluts.

logic · Non classical logic
Nine bases that cannot each have one true direction. Eighteen vectors (0, 0, 0, 1) (0, 0, 1, 0) (1, 1, 0, 0) (1, −1, 0, 0) (0, 1, 0, 0) (1, 0, 1, 0) (1, 0, −1, 0) (1, −1, 1, −1) (1, −1, −1, 1) (0, 0, 1, 1) (1, 1, 1, 1) (0, 1, 0, −1) (1, 0, 0, 1) (1, 0, 0, −1) (0, 1, −1, 0) (1, 1, −1, 1) (1, 1, 1, −1) (1, −1, −1, −1); vector i joins bases 1–2, 1–5, 1–3, 1–7, 2–5, 2–8, 2–4, 3–4, 3–6, 3–7, 4–6, 4–8, 5–9, 5–6, 6–9, 7–8, 7–9, 8–9; near-solution true: 2, 6, 10, 11, basis B9 empty.

No way to hand out true and false

Birkhoff and von Neumann read the propositions of quantum mechanics as subspaces, with "and" the intersection and "or" the span. Three lines in a plane already break the distributive law. Kochen and Specker proved something stronger: the propositions cannot be called true and false at all, if every complete measurement is to have exactly one true outcome. Cabello's eighteen directions in four dimensions show why in one line of arithmetic — nine bases, each direction in two of them, and nine is odd — and a search of all 262,144 assignments confirms it.

logic · Non classical logic

Named alongside it

The objects these essays reach for when they reach for this one.

Exhaustive searchTruth tableTruth functionAlgebraChainCharacterisationCompletenessConsistencyCounterexampleDisjunction propertyDualityExcluded middle

All concepts