Adaptive logics using the minimal abnormality strategy are P 1 1 \pi^1_1 -complex

Synthese 167 (1):93 - 104 (2009)
  Copy   BIBTEX

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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 76,168

External links

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

Through your library

Analytics

Added to PP
2009-01-28

Downloads
95 (#131,445)

6 months
1 (#448,551)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Peter Verdee
Université Catholique de Louvain

References found in this work

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.

View all 6 references / Add more references