Stark

Beyond True and False

The Limits of Logic

Every system of reasoning has a breaking point. From Aristotle's bedrock to paradoxes that shatter it, from logics that accept contradiction to frameworks where identity itself fails. This is what happens at the edge.

I

Classical Logic

Two truth values. Three laws. The foundation of Western reasoning for over two thousand years.

Classical logic runs on a strict binary: every well-formed proposition is either true or false, never both, never neither. From Aristotle's syllogisms to the transistors in your phone, the same three laws hold the whole structure together.

A = A Identity
¬(P ∧ ¬P) Non-Contradiction
P ∨ ¬P Excluded Middle

Everything in classical logic follows from these. Modus ponens, contraposition, proof by contradiction, De Morgan's laws, all built on the same bedrock. It works, beautifully and reliably, until it doesn't.

Logic Playground

Build a proposition with P, Q, and logical connectives. Hit Evaluate to see its truth table.

|
II

The Cracks

Classical logic is powerful. It is also incomplete, and in places, self-undermining.

Gödel's Incompleteness

In 1931, Kurt Gödel proved that any formal system strong enough to do basic arithmetic will contain true statements it cannot prove. The first theorem shattered the dream of a complete mathematics. The second went further: such a system cannot even prove its own consistency.

This isn't a failure of ingenuity. Gödel showed it's structural. No matter how many axioms you add, new unprovable truths appear. Logic has built-in blind spots, not because we haven't looked hard enough, but because no system powerful enough to describe itself can fully know itself.

The Liar Paradox

"This statement is false." If it's true, then what it claims holds, it's false. If it's false, then its claim fails, it's true. The evaluation never settles. It oscillates forever, a logical perpetual motion machine that has haunted philosophy since Eubulides of Miletus stated it around 400 BCE.

"This statement is false"
TRUE

Russell's Paradox

In 1901, Bertrand Russell asked a question that nearly derailed the foundations of mathematics. Consider the set of all sets that don't contain themselves. Call it R.

R = { x | x ∉ x }
Does R ∈ R?
If yes → by definition, R ∉ R
If no → by definition, R ∈ R

Naive set theory allows you to form this set. The paradox forced a complete rebuild of the foundations. Zermelo-Fraenkel set theory, type theory, and Russell's own Principia Mathematica were all responses to this single question.

Paradox Generator

Type a statement. The analyzer checks for self-reference, negation loops, and paradoxical structure.

III

Paraconsistent Worlds

What if, instead of running from contradictions, we let some through?

True Contradictions

Graham Priest, the most prominent advocate of dialetheism, argues that some statements are genuinely both true and false. The Liar Paradox isn't a bug, it's a window into the actual structure of truth. In Priest's logic LP, a contradiction doesn't destroy the system. The key insight: reject the explosion principle.

Defusing Explosion

In classical logic, a single contradiction lets you prove anything. This is the principle of explosion: ex contradictione quodlibet. Paraconsistent logic blocks the deduction at step 4, keeping contradictions contained.

Classical (Explosion)

1. P ∧ ¬P    (assume)
2. P    (from 1)
3. P ∨ Q    (from 2)
4. ¬P    (from 1)
5. Q    (from 3, 4, anything follows)

Paraconsistent

1. P ∧ ¬P    (assume)
2. P    (from 1)
3. P ∨ Q    (from 2)
4. ¬P    (from 1)
5. –   (disjunctive syllogism blocked)

The Catuṣkoṭi

Buddhist logicians arrived here two millennia before Priest. The Catuṣkoṭi (four corners), central to Nāgārjuna's Mūlamadhyamakakārikā, holds that a proposition admits four positions. Western logic collapses them to two.

True The statement holds
False The statement fails
Both True and false together
Neither Transcends the categories

The Extremes

Trivialism takes paraconsistency to its logical endpoint: everything is true. Every proposition, every contradiction, every absurdity. It's the singularity of logic, a system where inference collapses because there's nothing left to distinguish.

Ultra-intuitionism runs the other way. Alexander Yessenin-Volpin argued that even standard arithmetic outruns meaningful reasoning. There's a largest number we can actually reach, and beyond it mathematics is empty formalism. Where trivialism says everything is true, ultra-intuitionism says almost nothing is.

IV

Substructural Collapse

What if the problem isn't truth values at all, but the rules of inference themselves?

Classical and even paraconsistent logics keep three structural rules that most people never question. Substructural logics ask: what happens if we drop them?

Break the Rules

Toggle structural rules on and off. Watch how the landscape of valid reasoning changes.

Reflexivity
A ⊢ A
Contraction
A, A ⊢ B ⇒ A ⊢ B
Weakening
A ⊢ B ⇒ A, C ⊢ B

Schrödinger Logic

When reflexivity fails, a thing is no longer necessarily identical to itself. This isn't metaphor. Erwin Schrödinger observed that quantum particles genuinely lack self-identity, two electrons in the same state aren't "two things that happen to be alike" but literally indistinguishable in a way classical logic can't express. Non-reflexive logics formalize this: A ⊬ A becomes a feature, not a bug.

Linear Logic

Jean-Yves Girard's linear logic (1987) treats propositions as resources. You can't copy a premise or throw one away; each must be used exactly once. This turns logic into something like a conservation law. It has deep connections to concurrency in computer science, quantum computing, and game semantics. Where classical logic asks "is this true?", linear logic asks "can this be done with what we have?"

V

What Logic Are You?

Five questions. Four possible logics. Find out where your reasoning lives.