- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Adaptive logics using the minimal abnormality strategy are P 1 1 \pi^1_1 -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 strategyAuthor's Profile
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Majority merging by adaptive counting.Giuseppe Primiero & Joke Meheus - 2008 - Synthese 165 (2):203 - 223.
A universal logic approach to adaptive logics.Diderik Batens - 2007 - Logica Universalis 1 (1):221-242.
A generic framework for adaptive vague logics.Peter Verdée & Stephan der Waart van Gulivank - 2008 - Studia Logica 90 (3):385 - 405.
Adaptive fuzzy logics for contextual hedge interpretation.Stephan der Waart van Gulivank - 2009 - Journal of Logic, Language and Information 18 (3).
Completeness and decidability of tense logics closely related to logics above K.Frank Wolter - 1997 - Journal of Symbolic Logic 62 (1):131-158.
On the degree of complexity of sentential logics. A couple of examples.Jacek Hawranek & Jan Zygmunt - 1981 - Studia Logica 40 (2):141 - 153.
Analytics
Added to PP
2009-01-28
Downloads
103 (#166,263)
6 months
8 (#347,798)
2009-01-28
Downloads
103 (#166,263)
6 months
8 (#347,798)
Historical graph of downloads
Author's Profile
Citations of this work
A Methodological Shift in Favor of (Some) Paraconsistency in the Sciences.María del Rosario Martínez-Ordaz - 2022 - Logica Universalis 16 (1):335-354.
Strong, universal and provably non-trivial set theory by means of adaptive logic.P. Verdee - 2013 - Logic Journal of the IGPL 21 (1):108-125.
On the complexity of input/output logic.Xin Sun & Livio Robaldo - 2017 - Journal of Applied Logic 25:69-88.
A conditional logic for abduction.Mathieu Beirlaen & Atocha Aliseda - 2014 - Synthese 191 (15):3733-3758.
References found in this work
Theory of recursive functions and effective computability.Hartley Rogers - 1987 - Cambridge, Mass.: MIT Press.
Computability and Logic.George Boolos, John Burgess, Richard P. & C. Jeffrey - 1980 - New York: Cambridge University Press. Edited by John P. Burgess & Richard C. Jeffrey.
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.
The Undecidability of Propositional Adaptive Logic.Leon Horsten & Philip Welch - 2007 - Synthese 158 (1):41-60.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-7c76586df8-5tf24 uwo