Adaptive logics using the minimal abnormality strategy are 1 \Pi^11 -complex

Synthese 167 (1):93 - 104 (2009)
Abstract In this article complexity results for adaptive logics using the minimal abnormality strategy are presented. It is proven here that the consequence set of some recursive premise sets is $\Pi _1^1 - complete$ . So, the complexity results in (Horsten and Welch, Synthese 158:41–60,2007) are mistaken for adaptive logics using the minimal abnormality strategy
Keywords No keywords specified (fix it)
Categories No categories specified (fix it)
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,631
External links
  • Through your library Configure

    Similar books and articles

    Analytics

    Monthly downloads

    Added to index

    2009-01-28

    Total downloads

    7 ( #133,305 of 548,973 )

    Recent downloads (6 months)

    1 ( #63,511 of 548,973 )

    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