Switch to: Citations

Add references

You must login to add references.
  1. A Universal Logic Approach to Adaptive Logics.Diderik Batens - 2007 - Logica Universalis 1 (1):221-242.
    . In this paper, adaptive logics are studied from the viewpoint of universal logic (in the sense of the study of common structures of logics). The common structure of a large set of adaptive logics is described. It is shown that this structure determines the proof theory as well as the semantics of the adaptive logics, and moreover that most properties of the logics can be proved by relying solely on the structure, viz. without invoking any specific properties of the (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   61 citations  
  • Theory of Recursive Functions and Effective Computability.H. Rogers - 1987 - MIT Press.
  • Computability Theory.S. Barry Cooper - 2004 - Chapman & Hall.
  • On Algorithmic Properties of Propositional Inconsistency-Adaptive Logics.Sergei P. Odintsov & Stanislav O. Speranski - 2012 - Logic and Logical Philosophy 21 (3):209-228.
    The present paper is devoted to computational aspects of propositional inconsistency-adaptive logics. In particular, we prove (relativized versions of) some principal results on computational complexity of derivability in such logics, namely in cases of CLuN r and CLuN m , i.e., CLuN supplied with the reliability strategy and the minimal abnormality strategy, respectively.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • A General Characterization of Adaptive Logics.Diderik Batens - 2001 - Logique Et Analyse 173 (175):45-68.
  • Three Formats of Prioritized Adaptive Logics: A Comparative Study.F. Van De Putte & C. Strasser - 2012 - Logic Journal of the IGPL 21 (2):127-159.
  • The Undecidability of Propositional Adaptive Logic.Leon Horsten & Philip Welch - 2007 - Synthese 158 (1):41-60.
    We investigate and classify the notion of final derivability of two basic inconsistency-adaptive logics. Specifically, the maximal complexity of the set of final consequences of decidable sets of premises formulated in the language of propositional logic is described. Our results show that taking the consequences of a decidable propositional theory is a complicated operation. The set of final consequences according to either the Reliability Calculus or the Minimal Abnormality Calculus of a decidable propositional premise set is in general undecidable, and (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  • Adaptive Logics Using the Minimal Abnormality Strategy Are P 1 1 \pi^1_1 -Complex.Peter Verdée - 2009 - Synthese 167 (1):93 - 104.
    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.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  • Metamathematics of First-Order Arithmetic.P. Hájek & P. Pudlák - 2000 - Studia Logica 64 (3):429-430.
     
    Export citation  
     
    Bookmark   57 citations  
  • Inconsistency-Adaptive Logics.Diderik Batens - 1999 - In Logic at Work. Essays Dedicated to the Memory of Helena Rasiowa. Springer. pp. 445-472.