Switch to: References

Add citations

You must login to add citations.
  1. Computability Issues for Adaptive Logics in Multi-Consequence Standard Format.Sergei P. Odintsov & Stanislav O. Speranski - 2013 - Studia Logica 101 (6):1237-1262.
    In a rather general setting, we prove a number of basic theorems concerning computational complexity of derivability in adaptive logics. For that setting, the so-called standard format of adaptive logics is suitably adopted, and the corresponding completeness results are established in a very uniform way.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Adaptive Fregean Set Theory.Diderik Batens - 2020 - Studia Logica 108 (5):903-939.
    This paper defines provably non-trivial theories that characterize Frege’s notion of a set, taking into account that the notion is inconsistent. By choosing an adaptive underlying logic, consistent sets behave classically notwithstanding the presence of inconsistent sets. Some of the theories have a full-blown presumably consistent set theory T as a subtheory, provided T is indeed consistent. An unexpected feature is the presence of classical negation within the language.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations