16 found

Year:

  1.  2
    On Paraconsistent Weak Kleene Logic: Axiomatisation and Algebraic Analysis.Stefano Bonzio, José Gil-Férez, Francesco Paoli & Luisa Peruzzi - 2017 - Studia Logica 105 (2):253-297.
    Paraconsistent Weak Kleene logic is the 3-valued logic with two designated values defined through the weak Kleene tables. This paper is a first attempt to investigate PWK within the perspective and methods of abstract algebraic logic. We give a Hilbert-style system for PWK and prove a normal form theorem. We examine some algebraic structures for PWK, called involutive bisemilattices, showing that they are distributive as bisemilattices and that they form a variety, \, generated by the 3-element algebra WK; we also (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  2.  1
    Tableau Systems for Deontic Action Logics Based on Finite Boolean Algebras, and Their Complexity.Pablo F. Castro - 2017 - Studia Logica 105 (2):229-251.
    We introduce a family of tableau calculi for deontic action logics based on finite boolean algebras, these logics provide deontic operators which are applied to a finite number of actions ; furthermore, in these formalisms, actions can be combined by means of boolean operators, this provides an expressive algebra of actions. We define a tableau calculus for the basic logic and then we extend this calculus to cope with extant variations of this formalism; we prove the soundness and completeness of (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  3. Studies on Brutal Contraction and Severe Withdrawal.M. Garapa, E. Fermé & M. D. L. Reis - 2017 - Studia Logica 105 (2):331-360.
    In this paper we present an axiomatic characterization for brutal contractions. Then we consider the particular case of the brutal contractions that are based on a bounded ensconcement and also the class of severe withdrawals which are based on bounded epistemic entrenchment relations that are defined by means of bounded ensconcements. We present axiomatic characterizations for each one of those classes of functions and investigate the interrelation among them.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  4.  6
    Dov Gabbay, Reactive Kripke Semantics.Valentin Goranko - 2017 - Studia Logica 105 (2):431-437.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  5.  8
    Genuine Coherence as Mutual Confirmation Between Content Elements.Michael Schippers & Gerhard Schurz - 2017 - Studia Logica 105 (2):299-329.
    The concepts of coherence and confirmation are closely intertwined: according to a prominent proposal coherence is nothing but mutual confirmation. Accordingly, it should come as no surprise that both are confronted with similar problems. As regards Bayesian confirmation measures these are illustrated by the problem of tacking by conjunction. On the other hand, Bayesian coherence measures face the problem of belief individuation. In this paper we want to outline the benefit of an approach to coherence and confirmation based on content (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  6.  3
    Notes on the Computational Aspects of Kripke’s Theory of Truth.Stanislav O. Speranski - 2017 - Studia Logica 105 (2):407-429.
    The paper contains a survey on the complexity of various truth hierarchies arising in Kripke’s theory. I present some new arguments, and use them to obtain a number of interesting generalisations of known results. These arguments are both relatively simple, involving only the basic machinery of constructive ordinals, and very general.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  7.  3
    Reconstructing the Topology on Monoids and Polymorphism Clones of the Rationals.Mike Behrisch, John K. Truss & Edith Vargas-García - 2017 - Studia Logica 105 (1):65-91.
    We show how to reconstruct the topology on the monoid of endomorphisms of the rational numbers under the strict or reflexive order relation, and the polymorphism clone of the rational numbers under the reflexive relation. In addition we show how automatic homeomorphicity results can be lifted to polymorphism clones generated by monoids.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  8.  3
    Erratum To: Free Algebras in Varieties of Glivenko MTL-Algebras Satisfying the Equation {2 = ^2}.Roberto Cignoli & Antoni Torrens - 2017 - Studia Logica 105 (1):227-228.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  9.  5
    Non-Classical Elegance for Sequent Calculus Enthusiasts.Andreas Fjellstad - 2017 - Studia Logica 105 (1):93-119.
    In this paper we develop what we can describe as a “dual two-sided” cut-free sequent calculus system for the non-classical logics of truth lp, k3, stt and a non-reflexive logic ts which is, arguably, more elegant than the three-sided sequent calculus developed by Ripley for the same logics. Its elegance stems from how it employs more or less the standard sequent calculus rules for the various connectives and truth, and the fact that it offers a rather neat connection between derivable (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  10.  1
    Factor Congruence Lifting Property.George Georgescu & Claudia Mureşan - 2017 - Studia Logica 105 (1):179-216.
    In previous work, we have introduced and studied a lifting property in congruence–distributive universal algebras which we have defined based on the Boolean congruences of such algebras, and which we have called the Congruence Boolean Lifting Property. In a similar way, a lifting property based on factor congruences can be defined in congruence–distributive algebras; in this paper we introduce and study this property, which we have called the Factor Congruence Lifting Property. We also define the Boolean Lifting Property in varieties (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  11.  1
    On the Modal Logic of Subset and Superset: Tense Logic Over Medvedev Frames.Wesley H. Holliday - 2017 - Studia Logica 105 (1):13-35.
    Viewing the language of modal logic as a language for describing directed graphs, a natural type of directed graph to study modally is one where the nodes are sets and the edge relation is the subset or superset relation. A well-known example from the literature on intuitionistic logic is the class of Medvedev frames\ where W is the set of nonempty subsets of some nonempty finite set S, and xRy iff \, or more liberally, where \ is isomorphic as a (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  12.  3
    A Conflict Between Some Semantic Conditions of Carmo and Jones for Contrary-to-Duty Obligations.Bjørn Kjos-Hanssen - 2017 - Studia Logica 105 (1):173-178.
    We show that Carmo and Jones’ condition 5 conflicts with the other conditions on their models for contrary-to-duty obligations. We then propose a resolution to the conflict.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  13.  3
    Normal Modal Logics Determined by Aligned Clusters.Zofia Kostrzycka & Yutaka Miyazaki - 2017 - Studia Logica 105 (1):1-11.
    We consider the family of logics from NExt which are determined by linear frames with reflexive and symmetric relation of accessibility. The condition of linearity in such frames was first defined in the paper [9]. We prove that the cardinality of the logics under consideration is uncountably infinite.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  14.  3
    Equivocation Axiom on First Order Languages.Soroush Rafiee Rad - 2017 - Studia Logica 105 (1):121-152.
    In this paper we investigate some mathematical consequences of the Equivocation Principle, and the Maximum Entropy models arising from that, for first order languages. We study the existence of Maximum Entropy models for these theories in terms of the quantifier complexity of the theory and will investigate some invariance and structural properties of such models.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  15.  8
    Montagovian Paradoxes and Hyperintensional Content.Dustin Tucker - 2017 - Studia Logica 105 (1):153-171.
    A number of authors have taken a family of paradoxes, whose members trace back to theorems due either in whole or in part to Richard Montague, to pose a serious, possibly fatal challenge to theories of fine-grained, hyperintensional content. These paradoxes all assume that we can represent attitudes such as knowledge and belief with sentential predicates, and this assumption is at the heart of the purported challenge: the thought is that we must reject such predicates to avoid the paradoxes, and (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  16.  7
    Believability Relations for Select-Direct Sentential Revision.Li Zhang - 2017 - Studia Logica 105 (1):37-63.
    A set of sentential revision operations can be generated in a select-direct way within a new framework for belief change named descriptor revision firstly introduced in Hansson [8]. In this paper, we adopt another constructive approach to these operations, based on a relation \ on sentences named believability relation. Intuitively, \ means that the subject is at least as prone to believe or accept \ as to believe or accept \. We demonstrate that so called H-believability relations and basic believability (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
 Previous issues
  
Next issues