Wellfoundedness proofs by means of non-monotonic inductive definitions I: Π₂⁰-operators

Journal of Symbolic Logic 69 (3):830-850 (2004)
Abstract In this paper, we prove the wellfoundedness of recursive notation systems for reflecting ordinals up to Π₃-reflection by relevant inductive definitions
Keywords No keywords specified (fix it)
Categories
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 5,679
External links
  •   Try with proxy.
  • Through your library Configure

    Similar books and articles

    Analytics

    Monthly downloads

    Sorry, there are not enough data points to plot this chart.

    Added to index

    2009-02-05

    Total downloads

    0

    Recent downloads (6 months)

    0

    How can I increase my downloads?


    My notes
    Sign in to use this feature


    Discussion
    Start a new thread
    Order:
    There  are no threads in this forum
    Nothing in this forum yet.

    Other forums