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 Adaptive logics  Minimal abnormality  Complexity  Dynamic proofs
Categories (categorize this paper)
DOI 10.1007/s11229-007-9291-5
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
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 26,146
Through your library
References found in this work BETA
A Universal Logic Approach to Adaptive Logics.Diderik Batens - 2007 - Logica Universalis 1 (1):221-242.
The Need for Adaptative Logics in Epistemology.Diderik Batens - 2004 - In Shadid Rahman, John Symons, Dov Gabbay & Jean Bendegem (eds.), Logic, Epistemology, and the Unity of Science. Kluwer Academic Publishers. pp. 459-485.

Add more references

Citations of this work BETA

Add more citations

Similar books and articles

Monthly downloads

Added to index

2009-01-28

Total downloads

30 ( #166,834 of 2,151,553 )

Recent downloads (6 months)

11 ( #59,438 of 2,151,553 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Order:
There  are no threads in this forum
Nothing in this forum yet.

Other forums