Lax Lean Archive

FO(≤) ⊆ AC⁰

Lax895169.FirstOrderInACZero · concepts/Lax895169/FirstOrderInACZero.lean · lax-895169

proven

Loading review…

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

    Every FO(≤\le) definable problem is AC⁰ definable: a sentence over the order is read over the arithmetic vocabulary, whose ≤\le is the order.

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

    Each proof establishes this claim relative to its assumptions.

    Lean source view on GitHub

    1import Lax904597.Problems
    2import Lax904597.Classes
    3import Lax485149.Complement
    4import Lax485149.FirstOrderDefinability
    5import Lax485149.DeterministicTransitiveClosure
    6import Lax485149.ClassNL
    7import Lax485149.ClassL
    8import Lax535992.LeastFixedPoint
    9import Lax535992.InflationaryFixedPoint
    10import Lax535992.ClassPTIME
    11import Lax895169.BitPredicate
    12import Lax895169.ArithmeticLogic
    13import Lax895169.BitLogic
    14import Lax895169.LogTimeMachines
    15
    16/-!
    17---
    18title: FO(≤) ⊆ AC⁰
    19type: theorem
    20---
    21Every FO(≤\le) definable problem is AC⁰ definable: a sentence over the
    22order is read over the arithmetic vocabulary, whose ≤\le is the order.
    23-/
    24
    25namespace Lax895169.FirstOrderInACZero
    26
    27open FirstOrder FirstOrder.Language
    28open Lax904597.Problems Lax904597.Classes
    29open Lax485149.Complement Lax485149.FirstOrderDefinability Lax485149.DeterministicTransitiveClosure
    30open Lax485149.ClassNL Lax485149.ClassL
    31open Lax535992.LeastFixedPoint Lax535992.InflationaryFixedPoint Lax535992.ClassPTIME
    32open Lax895169.BitPredicate Lax895169.ArithmeticLogic Lax895169.BitLogic Lax895169.LogTimeMachines
    33
    34/-- Every FO(≤) definable problem is AC⁰ definable. -/
    35axiom foDefinable_ac0Definable : ∀ {L : Language.{0, 0}} [L.IsRelational] {P : DecisionProblem L},
    36 FODefinable P → AC0Definable P
    37
    38end Lax895169.FirstOrderInACZero
    39
    Show Proof
    Builds on
    Used by

    none

    From Mathlib

    none

    Discussion

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

    Loading discussion…