34 found

Year:

Forthcoming articles
  1.  3
    Roberto Cignoli & Antoni Torrens (forthcoming). Erratum To: Free Algebras in Varieties of Glivenko MTL-Algebras Satisfying the Equation $${2 = ^2}$$ 2 = 2. Studia Logica:1-2.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  2. A. M. Suardiaz A. Quantifier (forthcoming). M. Abad Varieties of Three-Valued. Studia Logica.
     
    Export citation  
     
    My bibliography  
  3. H. Arlo-Costa (forthcoming). 'First-Order Modal Logic', to Appear in V. Hendricks & SA Pedersen, Eds.,'40 Years of Possible Worlds', Special Issue Of. Studia Logica.
  4. Mike Behrisch, John K. Truss & Edith Vargas-García (forthcoming). Reconstructing the Topology on Monoids and Polymorphism Clones of the Rationals. Studia Logica:1-27.
    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  
  5.  1
    Stefano Bonzio, José Gil-Férez, Francesco Paoli & Luisa Peruzzi (forthcoming). On Paraconsistent Weak Kleene Logic: Axiomatisation and Algebraic Analysis. Studia Logica:1-45.
    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  
  6.  4
    Nils Bulling & Wiebe Hoek (forthcoming). Special Issue on Logical Aspects of Multi-Agent Systems. Studia Logica:1-3.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  7. D. Busneag & M. Ghita (forthcoming). Some Properties of Epimorphisms of Implicative Algebras. Studia Logica.
     
    Export citation  
     
    My bibliography  
  8.  1
    Pablo F. Castro (forthcoming). Tableau Systems for Deontic Action Logics Based on Finite Boolean Algebras, and Their Complexity. Studia Logica:1-23.
    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  
  9. A. V. Chagrov & M. V. Zakharyaschev (forthcoming). Modal Companions of Intermediate Logics: A Survey. Studia Logica.
     
    Export citation  
     
    My bibliography  
  10. Frank Wolter First Order Common (forthcoming). Knowledge Logics. Studia Logica.
     
    Export citation  
     
    My bibliography  
  11.  3
    Andreas Fjellstad (forthcoming). Non-Classical Elegance for Sequent Calculus Enthusiasts. Studia Logica:1-27.
    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  
  12. D. Gabbay & F. Pirri (forthcoming). Special Issue on Combining Logics, Volume 59 (1, 2) Of. Studia Logica.
     
    Export citation  
     
    My bibliography   1 citation  
  13. M. Garapa, E. Fermé & M. D. L. Reis (forthcoming). Studies on Brutal Contraction and Severe Withdrawal. Studia Logica:1-30.
    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  
  14. M. Garapa, E. Fermé & M. D. L. Reis (forthcoming). Studies on Brutal Contraction and Severe Withdrawal. Studia Logica:1-30.
    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  
  15. George Georgescu & Claudia Mureşan (forthcoming). Factor Congruence Lifting Property. Studia Logica:1-38.
    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  
  16.  22
    Dov Guido Boella, Leendert der Torre M. Gabbavany & Serena Villata (forthcoming). Meta-Argumentation Modelling I: Methodology and Techniques. Studia Logica.
    In this paper, we introduce the methodology and techniques of meta-argumentation to model argumentation. The methodology of meta-argumentation instantiates Dung’s abstract argumentation theory with an extended argumentation theory, and is thus based on a combination of the methodology of instantiating abstract arguments, and the methodology of extending Dung’s basic argumentation frameworks with other relations among abstract arguments. The technique of meta-argumentation applies Dung’s theory of abstract argumentation to itself, by instantiating Dung’s abstract arguments with meta-arguments using a technique called flattening. (...)
    Translate
      Direct download  
     
    Export citation  
     
    My bibliography  
  17. Wesley H. Holliday (forthcoming). On the Modal Logic of Subset and Superset: Tense Logic Over Medvedev Frames. Studia Logica:1-23.
    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  
  18.  18
    Simon M. Huttegger & Brian Skyrms (forthcoming). Learning to Transfer Information. Studia Logica.
  19. Thomas Icard (forthcoming). Exclusion and Containment in Natural Language. Studia Logica.
     
    Export citation  
     
    My bibliography  
  20.  2
    Bjørn Kjos-Hanssen (forthcoming). A Conflict Between Some Semantic Conditions of Carmo and Jones for Contrary-to-Duty Obligations. Studia Logica:1-6.
    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  
  21. Jarmo Kontinen (forthcoming). Coherence and Complexity of Quantifier-Free Dependence Logic Formulas. Studia Logica.
     
    Export citation  
     
    My bibliography  
  22.  3
    Zofia Kostrzycka & Yutaka Miyazaki (forthcoming). Normal Modal Logics Determined by Aligned Clusters. Studia Logica: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  
  23.  1
    Arun Kumar & Mohua Banerjee (forthcoming). Kleene Algebras and Logic: Boolean and Rough Set Representations, 3-Valued, Rough Set and Perp Semantics. Studia Logica:1-31.
    A structural theorem for Kleene algebras is proved, showing that an element of a Kleene algebra can be looked upon as an ordered pair of sets, and that negation with the Kleene property is describable by the set-theoretic complement. The propositional logic \ of Kleene algebras is shown to be sound and complete with respect to a 3-valued and a rough set semantics. It is also established that Kleene negation can be considered as a modal operator, due to a perp (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  24. AgneS Kurucz & Arrow Logic (forthcoming). Infinite Counting. Studia Logica.
     
    Export citation  
     
    My bibliography   1 citation  
  25. Arthur Paul Pedersen (forthcoming). An Extension Theorem and a Numerical Representation Theorem for Qualitative Comparative Expectations. Studia Logica.
     
    Export citation  
     
    My bibliography  
  26.  2
    Dana Piciu & A. Jeflea (forthcoming). Localization of MTL-Algebras. Studia Logica.
    Direct download  
     
    Export citation  
     
    My bibliography  
  27.  3
    Soroush Rafiee Rad (forthcoming). Equivocation Axiom on First Order Languages. Studia Logica:1-32.
    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  
  28.  6
    Michael Schippers & Gerhard Schurz (forthcoming). Genuine Coherence as Mutual Confirmation Between Content Elements. Studia Logica:1-31.
    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  
  29. F. Sebastiani (forthcoming). A Fully Model-Theoretic Semantics for Model-Preference Default Systems', Istituto di Elaborazione dell'Informazione, Pisa. Studia Logica.
     
    Export citation  
     
    My bibliography  
  30.  2
    Stanislav O. Speranski (forthcoming). Notes on the Computational Aspects of Kripke’s Theory of Truth. Studia Logica:1-23.
    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  
  31. L. Tatjana & I. Boris (forthcoming). In Databases* T. Studia Logica.
     
    Export citation  
     
    My bibliography  
  32.  5
    Dustin Tucker (forthcoming). Montagovian Paradoxes and Hyperintensional Content. Studia Logica:1-19.
    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  
  33. Y. Venema (forthcoming). Meeting Strength in Substructural Logics'. UU Logic Preprint. Studia Logica.
     
    Export citation  
     
    My bibliography  
  34.  7
    Li Zhang (forthcoming). Believability Relations for Select-Direct Sentential Revision. Studia Logica:1-27.
    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