Induction On Well-ordered Sets

Induction On Well-Ordered Sets is a proof method in mathematical logic that generalizes mathematical induction to arbitrary well-ordered sets by asserting that if a property holds for all predecessors of an element then it holds for the element itself, thereby ensuring the property's universal validity across the well-ordering.

2

Publications

54

Citations

2

Authors

1

Institutions

Publications per year

2017–2026

0

Authors

2

  1. JA
    James Alexander

    Princeton University, United States

    1 publications · 27 citations

    1

    h-index

  2. TA
    Toshiyasu Arai

    Hiroshima University, Japan

    1 publications · 27 citations

    1

    h-index

1–2 of 2

Institutions

1

  1. Hiroshima University

    Hiroshima, Japan

    1 h-index

    1 publications

    27 citations

1–1 of 1

Venues

  1. Proceedings of the National Academy of Sciences

    PNAS · 1 publications · 27 citations

    1

    h-index

  2. Annals of Pure and Applied Logic

    1 publications · 27 citations

    1

    h-index

1–2