A Note on the Theory of Well Orders

Bulletin of Symbolic Logic 30 (4):538-542 (2024)
  Copy   BIBTEX

Abstract

We give a simple proof that the first-order theory of well orders is axiomatized by transfinite induction, and that it is decidable.

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 103,748

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Weak Well Orders and Fraïssé’s Conjecture.Anton Freund & Davide Manca - forthcoming - Journal of Symbolic Logic:1-16.
A One-Page Proof of a Theorem of Beleznay.Juan P. Aguilera & Martina Iannella - 2024 - Bulletin of Symbolic Logic 30 (4):536-537.
Variation on a theme of Schutte.D. Probst & G. Jager - 2004 - Mathematical Logic Quarterly 50 (3):258.
Decidable discrete linear orders.M. Moses - 1988 - Journal of Symbolic Logic 53 (2):531-539.
Well-orders in the transfinite Japaridze algebra.D. Fernandez-Duque & J. J. Joosten - 2014 - Logic Journal of the IGPL 22 (6):933-963.
A note on Bar Induction in Constructive Set Theory.Michael Rathjen - 2006 - Mathematical Logic Quarterly 52 (3):253-258.

Analytics

Added to PP
2025-03-05

Downloads
8 (#1,632,407)

6 months
8 (#482,871)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references