7 found
Order:
  1.  9
    The Lattice of Belnapian Modal Logics: Special Extensions and Counterparts.Sergei P. Odintsov & Stanislav O. Speranski - 2016 - Logic and Logical Philosophy 25 (1):3-33.
    Let K be the least normal modal logic and BK its Belnapian version, which enriches K with ‘strong negation’. We carry out a systematic study of the lattice of logics containing BK based on: • introducing the classes of so-called explosive, complete and classical Belnapian modal logics; • assigning to every normal modal logic three special conservative extensions in these classes; • associating with every Belnapian modal logic its explosive, complete and classical counterparts. We investigate the relationships between special extensions (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  2.  17
    Belnap–Dunn Modal Logics: Truth Constants Vs. Truth Values.Sergei P. Odintsov & Stanislav O. Speranski - 2020 - Review of Symbolic Logic 13 (2):416-435.
    We shall be concerned with the modal logic BK—which is based on the Belnap–Dunn four-valued matrix, and can be viewed as being obtained from the least normal modal logic K by adding ‘strong negation’. Though all four values ‘truth’, ‘falsity’, ‘neither’ and ‘both’ are employed in its Kripke semantics, only the first two are expressible as terms. We show that expanding the original language of BK to include constants for ‘neither’ or/and ‘both’ leads to quite unexpected results. To be more (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  3. 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  
  4.  35
    Reasoning About Arbitrary Natural Numbers From a Carnapian Perspective.Leon Horsten & Stanislav O. Speranski - 2019 - Journal of Philosophical Logic 48 (4):685-707.
    Inspired by Kit Fine’s theory of arbitrary objects, we explore some ways in which the generic structure of the natural numbers can be presented. Following a suggestion of Saul Kripke’s, we discuss how basic facts and questions about this generic structure can be expressed in the framework of Carnapian quantified modal logic.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  5.  16
    Hintikka’s Independence-Friendly Logic Meets Nelson’s Realizability.Sergei P. Odintsov, Stanislav O. Speranski & Igor Yu Shevchenko - 2018 - Studia Logica 106 (3):637-670.
    Inspired by Hintikka’s ideas on constructivism, we are going to ‘effectivize’ the game-theoretic semantics for independence-friendly first-order logic, but in a somewhat different way than he did in the monograph ‘The Principles of Mathematics Revisited’. First we show that Nelson’s realizability interpretation—which extends the famous Kleene’s realizability interpretation by adding ‘strong negation’—restricted to the implication-free first-order formulas can be viewed as an effective version of GTS for FOL. Then we propose a realizability interpretation for IF-FOL, inspired by the so-called ‘trump (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  6.  32
    A Note on Definability in Fragments of Arithmetic with Free Unary Predicates.Stanislav O. Speranski - 2013 - Archive for Mathematical Logic 52 (5-6):507-516.
    We carry out a study of definability issues in the standard models of Presburger and Skolem arithmetics (henceforth referred to simply as Presburger and Skolem arithmetics, for short, because we only deal with these models, not the theories, thus there is no risk of confusion) supplied with free unary predicates—which are strongly related to definability in the monadic SOA (second-order arithmetic) without × or + , respectively. As a consequence, we obtain a very direct proof for ${\Pi^1_1}$ -completeness of Presburger, (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  7.  21
    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