CounterpediaExplore knowledge. Follow the sources.

Paris–Harrington theorem

Relationships observed in Wikidata. Connections do not establish verification or source support.

Release: sha256:f33228901a35b0683356002a46df9ceb11f399d05f17abb5c7c78256cbf38ba7

Provider: Wikidata · graph projection only.

OBSERVED · GRAPH-PROJECTION · NOT ADMITTED · NOT VERIFIED · NOT SUPPORT

Edge identity is the provider property id (for example P31). It is not a Counterpedia predicate.

Development requests are not available on this deployment. The observed entity and its graph links remain readable.

Relationships of Paris–Harrington theorem

Show relationship types (drawing only; the text lists are unaffected)
Relationship label not yet available (Observed provider relationships)Relationship label not yet available (Observed provider relationships)instance of (Observed provider relationships)part of (Observed provider relationships)named after (Observed provider relationships)named after (Observed provider relationships)Relationship label not yet available (Observed provider relationships)Paris–Harrington theorem — Wikidata entity (Q7137494)Paris–HarringtontheoremWIKIDATA ENTITYPeano arithmetic — Wikidata entity (Q49938)Peano arithmeticWIKIDATA ENTITYWikiProject Mathematics — Wikidata entity (Q8487137)WikiProjectMathematicsWIKIDATA ENTITYtheorem — Wikidata entity (Q65943)theoremWIKIDATA ENTITYlist of theorems — Wikidata entity (Q944443)list of theoremsWIKIDATA ENTITYLeo Harrington — Wikidata entity (Q1818602)Leo HarringtonWIKIDATA ENTITYJeff Paris — Wikidata entity (Q441137)Jeff ParisWIKIDATA ENTITY\binom{N}{n} = |\mathcal{P}_n(S)| \ge R(\,\underbrace{ m, m, \ldots , m }_k\,) — Literal value (wikidata:literal:6:\binom{N}{n} = |\mathcal{P}_n(S)| \ge R(\,\underbrace{ m, m, \ldots , m }_k\,))\binom{N}{n} =|\mathcal{P}_n(…LITERAL VALUE

Legend

  • Governed record relationships (solid)
  • Countergraph traversal (dashed)
  • Countergraph evidence (dotted)
  • Observed provider relationships (dash-dot)
  • Structurally derived (sparse dots)

Node shape identifies node kind only. Size, color, and position carry no meaning beyond hop distance from the root.

A line means a supported artifact carried an explicit structured relation. It does not mean the relation is true, admitted, verified, or authoritative.

Graph as text

Nodes (8)

  • Paris–Harrington theorem — Wikidata entity
    Technical details
    node_id
    wikidata:entity:Q7137494
    stable_ref
    Q7137494
    node_kind
    wikidata_entity
    plane
    provider_observed
    qid
    Q7137494
    provider
    wikidata
    entity_href
    /entries/wikidata/Q7137494
  • Peano arithmetic — Wikidata entity
    Technical details
    node_id
    wikidata:entity:Q49938
    stable_ref
    Q49938
    node_kind
    wikidata_entity
    plane
    provider_observed
    qid
    Q49938
    provider
    wikidata
    entity_href
    /entries/wikidata/Q49938
  • WikiProject Mathematics — Wikidata entity
    Technical details
    node_id
    wikidata:entity:Q8487137
    stable_ref
    Q8487137
    node_kind
    wikidata_entity
    plane
    provider_observed
    qid
    Q8487137
    provider
    wikidata
    entity_href
    /entries/wikidata/Q8487137
  • theorem — Wikidata entity
    Technical details
    node_id
    wikidata:entity:Q65943
    stable_ref
    Q65943
    node_kind
    wikidata_entity
    plane
    provider_observed
    qid
    Q65943
    provider
    wikidata
    entity_href
    /entries/wikidata/Q65943
  • list of theorems — Wikidata entity
    Technical details
    node_id
    wikidata:entity:Q944443
    stable_ref
    Q944443
    node_kind
    wikidata_entity
    plane
    provider_observed
    qid
    Q944443
    provider
    wikidata
    entity_href
    /entries/wikidata/Q944443
  • Leo Harrington — Wikidata entity
    Technical details
    node_id
    wikidata:entity:Q1818602
    stable_ref
    Q1818602
    node_kind
    wikidata_entity
    plane
    provider_observed
    qid
    Q1818602
    provider
    wikidata
    entity_href
    /entries/wikidata/Q1818602
  • Jeff Paris — Wikidata entity
    Technical details
    node_id
    wikidata:entity:Q441137
    stable_ref
    Q441137
    node_kind
    wikidata_entity
    plane
    provider_observed
    qid
    Q441137
    provider
    wikidata
    entity_href
    /entries/wikidata/Q441137
  • \binom{N}{n} = |\mathcal{P}_n(S)| \ge R(\,\underbrace{ m, m, \ldots , m }_k\,) — Literal value
    Technical details
    node_id
    wikidata:literal:6:\binom{N}{n} = |\mathcal{P}_n(S)| \ge R(\,\underbrace{ m, m, \ldots , m }_k\,)
    stable_ref
    wikidata:literal:6:\binom{N}{n} = |\mathcal{P}_n(S)| \ge R(\,\underbrace{ m, m, \ldots , m }_k\,)
    node_kind
    wikidata_literal
    plane
    provider_observed

Edges (7)

  • Paris–Harrington theorem — Relationship label not yet available → Peano arithmetic — Observed provider relationships
    Technical details
    machine_predicate
    P14434
    predicate_ref
    wikidata:property:P14434
    provider
    wikidata
    provider_direction
    outgoing
    plane
    provider_observed
    edge_id
    wikidata:relation:0:P14434
    release_ref
    sha256:f33228901a35b0683356002a46df9ceb11f399d05f17abb5c7c78256cbf38ba7
  • Paris–Harrington theorem — Relationship label not yet available → WikiProject Mathematics — Observed provider relationships
    Technical details
    machine_predicate
    P6104
    predicate_ref
    wikidata:property:P6104
    provider
    wikidata
    provider_direction
    outgoing
    plane
    provider_observed
    edge_id
    wikidata:relation:1:P6104
    release_ref
    sha256:f33228901a35b0683356002a46df9ceb11f399d05f17abb5c7c78256cbf38ba7
  • Paris–Harrington theorem — instance of → theorem — Observed provider relationships
    Technical details
    machine_predicate
    P31
    predicate_ref
    wikidata:property:P31
    provider
    wikidata
    provider_direction
    outgoing
    plane
    provider_observed
    edge_id
    wikidata:relation:2:P31
    release_ref
    sha256:f33228901a35b0683356002a46df9ceb11f399d05f17abb5c7c78256cbf38ba7
  • Paris–Harrington theorem — part of → list of theorems — Observed provider relationships
    Technical details
    machine_predicate
    P361
    predicate_ref
    wikidata:property:P361
    provider
    wikidata
    provider_direction
    outgoing
    plane
    provider_observed
    edge_id
    wikidata:relation:3:P361
    release_ref
    sha256:f33228901a35b0683356002a46df9ceb11f399d05f17abb5c7c78256cbf38ba7
  • Paris–Harrington theorem — named after → Leo Harrington — Observed provider relationships
    Technical details
    machine_predicate
    P138
    predicate_ref
    wikidata:property:P138
    provider
    wikidata
    provider_direction
    outgoing
    plane
    provider_observed
    edge_id
    wikidata:relation:4:P138
    release_ref
    sha256:f33228901a35b0683356002a46df9ceb11f399d05f17abb5c7c78256cbf38ba7
  • Paris–Harrington theorem — named after → Jeff Paris — Observed provider relationships
    Technical details
    machine_predicate
    P138
    predicate_ref
    wikidata:property:P138
    provider
    wikidata
    provider_direction
    outgoing
    plane
    provider_observed
    edge_id
    wikidata:relation:5:P138
    release_ref
    sha256:f33228901a35b0683356002a46df9ceb11f399d05f17abb5c7c78256cbf38ba7
  • Paris–Harrington theorem — Relationship label not yet available → \binom{N}{n} = |\mathcal{P}_n(S)| \ge R(\,\underbrace{ m, m, \ldots , m }_k\,) — Observed provider relationships
    Technical details
    machine_predicate
    P2534
    predicate_ref
    wikidata:property:P2534
    provider
    wikidata
    provider_direction
    outgoing
    plane
    provider_observed
    edge_id
    wikidata:relation:6:P2534
    release_ref
    sha256:f33228901a35b0683356002a46df9ceb11f399d05f17abb5c7c78256cbf38ba7

Reader shortcuts (not graph edges) (0)

    Unresolved references (0)

      Frontier (0)