While this submission is a draft, it cannot be used by other submissions.

Recognition induction for pure second-order logic

Lax369799.SetLogicRecognition · concepts/Lax369799/SetLogicRecognition.lean · lax-369799

proven

Loading review…

Sign in with ORCID

Community review

Flags

Each flag is tied to a public ORCID identity and explains why this concept may be incorrect.

No flags have been submitted.

    Community review

    Flag this concept

    State precisely what appears incorrect. This explanation will be public under your ORCID name.

    No source line selected.

    Natural Language Statement

    Theorem

    Free set variables are recorded as extra vertex marks. The atomic languages have finite recognizing algebras. Boolean closure and existential projection then give recognition for every formula. The induction is also stated separately with explicit atomic-language hypotheses.

    Concept map
    13 concepts
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A
    Evidence

    This concept declares 3 statements. Each proof establishes one of them relative to its assumptions.

    Lean source view on GitHub

    1import Lax369799.SetLogicTranslation
    2import Lax369799.RecognitionProjection
    3import Lax369799.TransitionEncoding
    4
    5/-!
    6---
    7title: Recognition induction for pure second-order logic
    8type: theorem
    9---
    10Free set variables are recorded as extra vertex marks. The atomic
    11languages have finite recognizing algebras. Boolean closure and existential
    12projection then give recognition for every formula. The induction is
    13also stated separately with explicit atomic-language hypotheses.
    14-/
    15namespace Lax369799.SetLogicRecognition
    16open RankedSystems Algebras SetLogic TransitionEncoding
    17
    18abbrev Alphabet (P X : Type) : RankedSet := fun _ => Set P × Set X
    19
    20noncomputable def language {P X : Type} (φ : Formula P X) : Language (Alphabet P X) :=
    21 {S | φ.eval (decode (relabelSystem (fun _ a => a.1) S))
    22 (fun x v => x ∈ (S.val.graph.label v).2.2)}
    23
    24structure AtomicRecognizable (P : Type) : Prop where
    25 subset : ∀ (X : Type) [Finite X] (x y : X), Recognizable (language (Formula.subset (P := P) x y))
    26 initial : ∀ (X : Type) [Finite X] (x : X), Recognizable (language (Formula.initial (P := P) x))
    27 proposition : ∀ (X : Type) [Finite X] (p : P) (x : X), Recognizable (language (Formula.proposition p x))
    28 edge : ∀ (X : Type) [Finite X] (x y : X), Recognizable (language (Formula.edge (P := P) x y))
    29
    30axiom atomic_recognizable (P : Type) : AtomicRecognizable P
    31
    32axiom initial_recognizable {P X : Type} (x : X) :
    33 Recognizable (language (Formula.initial (P := P) x))
    34
    35axiom recognizable {P X : Type} [Finite X] (h : AtomicRecognizable P) (φ : Formula P X) :
    36 Recognizable (language φ)
    37
    38end Lax369799.SetLogicRecognition
    39
    Show ProofShow ProofShow Proof

    Discussion

    Ask a question or add context. Endorsements and structured flags are kept in the review panel above.

    Loading discussion…