Predicate Logics of Constructive Arithmetical Theories

Journal of Symbolic Logic 71 (4):1311 - 1326 (2006)
Abstract In this paper, we show that the predicate logics of consistent extensions of Heyting's Arithmetic plus Church's Thesis with uniqueness condition are complete $\Pi _{2}^{0}$. Similarly, we show that the predicate logic of HA*, i.e. Heyting's Arithmetic plus the Completeness Principle (for HA*) is complete $\Pi _{2}^{0}$. These results extend the known results due to Valery Plisko. To prove the results we adapt Plisko's method to use Tennenbaum's Theorem to prove 'categoricity of interpretations' under certain assumptions
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,672
External links
  •   Try with proxy.
  • Through your library Configure

    Similar books and articles
    Reinhard Muskens (1999). On Partial and Paraconsistent Logics. Notre Dame Journal of Formal Logic 40 (3):352-374.
    D. C. McCarty (1996). Undecidability and Intuitionistic Incompleteness. Journal of Philosophical Logic 25 (5):559 - 565.

    Analytics

    Monthly downloads

    Added to index

    2010-08-24

    Total downloads

    4 ( #178,586 of 549,060 )

    Recent downloads (6 months)

    2 ( #37,252 of 549,060 )

    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