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

EVEN is not first-order definable, even with an order

Lax945089.EvenNotFirstOrder · concepts/Lax945089/EvenNotFirstOrder.lean · lax-945089

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

    EVEN is not order-free first-order definable, bare sets of different parities being equivalent for any number of rounds once they are large enough; and it is not FO(≤\le) definable either, by Ehrenfeucht's theorem on linear orders. An order-free definition is in particular an ordered one.

    Concept map
    27 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.

    1 even_not_foDefinable proven

    2 even_not_foDefinableFree proven

    3 foDefinableFree_foDefinable proven

    Lean source view on GitHub

    1import Mathlib.ModelTheory.Order
    2import Mathlib.Order.Defs.LinearOrder
    3import Lax904597.Problems
    4import Lax904597.Interpretations
    5import Lax904597.Relativized
    6import Lax904597.SecondOrder
    7import Lax904597.Classes
    8import Lax485149.Problems
    9import Lax485149.FirstOrderDefinability
    10import Lax485149.TransitiveClosure
    11import Lax485149.DeterministicTransitiveClosure
    12import Lax485149.ClassNL
    13import Lax485149.ClassL
    14import Lax535992.InflationaryFixedPoint
    15import Lax535992.ClassPTIME
    16import Lax134656.PartialFixedPoint
    17import Lax895169.ArithmeticLogic
    18import Lax945089.OrderFreeFirstOrder
    19import Lax945089.EhrenfeuchtGames
    20import Lax945089.PebbleGames
    21import Lax945089.Even
    22import Lax945089.Parity
    23import Lax945089.TransitiveClosureReductions
    24
    25/-!
    26---
    27title: EVEN is not first-order definable, even with an order
    28type: theorem
    29---
    30EVEN is not order-free first-order definable, bare sets of different
    31parities being equivalent for any number of rounds once they are large
    32enough; and it is not FO(≤\le) definable either, by Ehrenfeucht's theorem
    33on linear orders. An order-free definition is in particular an ordered
    34one.
    35-/
    36
    37namespace Lax945089.EvenNotFirstOrder
    38
    39open FirstOrder FirstOrder.Language
    40open Lax904597.Problems Lax904597.Interpretations Lax904597.Relativized Lax904597.SecondOrder
    41open Lax904597.Classes
    42open Lax485149.Problems Lax485149.FirstOrderDefinability Lax485149.TransitiveClosure
    43open Lax485149.DeterministicTransitiveClosure Lax485149.ClassNL Lax485149.ClassL
    44open Lax535992.InflationaryFixedPoint Lax535992.ClassPTIME
    45open Lax134656.PartialFixedPoint Lax895169.ArithmeticLogic
    46open Lax945089.OrderFreeFirstOrder Lax945089.EhrenfeuchtGames Lax945089.PebbleGames
    47open Lax945089.Even Lax945089.Parity
    48open Lax945089.TransitiveClosureReductions
    49
    50/-- Every order-free first-order definable problem is FO(≤) definable. -/
    51axiom foDefinableFree_foDefinable :
    52 ∀ {L : Language.{0, 0}} [L.IsRelational] {P : DecisionProblem L},
    53 FODefinableFree P → FODefinable P
    54
    55/-- EVEN is not order-free first-order definable. -/
    56axiom even_not_foDefinableFree : ¬FODefinableFree EVEN
    57
    58/-- EVEN is not FO(≤) definable. -/
    59axiom even_not_foDefinable : ¬FODefinable EVEN
    60
    61end Lax945089.EvenNotFirstOrder
    62
    Show ProofShow ProofShow Proof

    Discussion

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

    Loading discussion…