Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Aether Catalog definitions — Pythagorean_Incompleteness

Definition
Pythagorean_Incompleteness

by raver1975 · Sep 15, 2026 · Mathlib c5ea003 (Lean v4.30.0)

aether-catalogpythagorean

Definition bundle for the Aether Catalog module Pythagorean.Incompleteness, transplanted by skeleton subtraction; supplies the types and constants the catalog's theorems import.

Definition code
-- Def bundle generated from Pythagorean/Incompleteness.lean by skeleton subtraction
import Mathlib

/-! # Abstract incompleteness

An *abstract formal system* is a type of sentences equipped with a negation, a provability
predicate, and a semantic truth predicate that is sound for provability and classical for
negation.  A **Gödel sentence** is a sentence asserting its own unprovability.

The theorem below is the abstract core of Gödel's first incompleteness theorem, stripped of
arithmetisation: *if a sound system has a Gödel sentence, that sentence is true and neither
it nor its negation is provable.*  Nothing about arithmetic, coding, or the diagonal lemma
is assumed — those are what produce the Gödel sentence in a concrete system; here its
existence is the hypothesis, and the conclusion is genuine undecidability.
-/

namespace ProofSpace

/-- An abstract formal system: sentences, negation, provability, and a sound truth
predicate. -/
structure FormalSystem where
  /-- The sentences of the system. -/
  Sentence : Type
  /-- Negation of a sentence. -/
  neg : Sentence → Sentence
  /-- The provability predicate. -/
  Provable : Sentence → Prop
  /-- The (semantic) truth predicate. -/
  True : Sentence → Prop
  /-- Soundness: everything provable is true. -/
  sound : ∀ s, Provable s → True s
  /-- Truth is classical for negation. -/
  true_neg : ∀ s, True (neg s) ↔ ¬ True s

namespace FormalSystem

variable (F : FormalSystem)

/-- A Gödel sentence: one that is true exactly when it is unprovable. -/
def IsGodelSentence (g : F.Sentence) : Prop := F.True g ↔ ¬ F.Provable g

/-- A sentence is undecidable when neither it nor its negation is provable. -/
def Undecidable (s : F.Sentence) : Prop := ¬ F.Provable s ∧ ¬ F.Provable (F.neg s)




end FormalSystem

end ProofSpace

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me