43 found

Year:

Forthcoming articles
  1. Michael Schippers (forthcoming). Towards a Grammar of Bayesian Coherentism. Studia Logica:1-30.
    One of the integral parts of Bayesian coherentism is the view that the relation of ‘being no less coherent than’ is fully determined by the probabilistic features of the sets of propositions to be ordered. In the last one and a half decades, a variety of probabilistic measures of coherence have been put forward. However, there is large disagreement as to which of these measures best captures the pre-theoretic notion of coherence. This paper contributes to the debate on coherence measures (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  2. Michael De & Hitoshi Omori (forthcoming). Classical Negation and Expansions of Belnap–Dunn Logic. Studia Logica:1-27.
    We investigate the notion of classical negation from a non-classical perspective. In particular, one aim is to determine what classical negation amounts to in a paracomplete and paraconsistent four-valued setting. We first give a general semantic characterization of classical negation and then consider an axiomatic expansion BD+ of four-valued Belnap–Dunn logic by classical negation. We show the expansion complete and maximal. Finally, we compare BD+ to some related systems found in the literature, specifically a four-valued modal logic of Béziau and (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  3. A. M. Suardiaz A. Quantifier (forthcoming). M. Abad Varieties of Three-Valued. Studia Logica.
     
    My bibliography  
     
    Export citation  
  4. Peter Aczel, Benno van den Berg, Johan Granström & Peter Schuster (forthcoming). Are There Enough Injective Sets? Studia Logica.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  5. Albert J. J. Anglberger & Jonathan Lukic (forthcoming). Hilbert-Style Axiom Systems for the Matrix-Based Logics RMQ − and RMQ. Studia Logica:1-19.
    This paper deals with the axiomatizability problem for the matrix-based logics RMQ − and RMQ *. We present a Hilbert-style axiom system for RMQ −, and a quasi-axiomatization based on it for RMQ *. We further compare these logics to different well-known modal logics, and assess its status as relevance logics.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  6. 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.
  7. Guillaume Aucher (forthcoming). Intricate Axioms as Interaction Axioms. Studia Logica:1-28.
    In epistemic logic, some axioms dealing with the notion of knowledge are rather convoluted and difficult to interpret intuitively, even though some of them, such as the axioms .2 and .3, are considered to be key axioms by some epistemic logicians. We show that they can be characterized in terms of understandable interaction axioms relating knowledge and belief or knowledge and conditional belief. In order to show it, we first sketch a theory dealing with the characterization of axioms in terms (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  8. Luciana Benotti (forthcoming). Book Review: Jonathan Ginzburg, The Interactive Stance: Meaning in Conversation. [REVIEW] Studia Logica:1-6.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  9. Jort M. Bergfeld, Kohei Kishida, Joshua Sack & Shengyang Zhong (forthcoming). Duality for the Logic of Quantum Actions. Studia Logica:1-25.
    In this paper we show a duality between two approaches to represent quantum structures abstractly and to model the logic and dynamics therein. One approach puts forward a “quantum dynamic frame” :2267–2282, 2005), a labelled transition system whose transition relations are intended to represent projections and unitaries on a Hilbert space. The other approach considers a “Piron lattice” , which characterizes the algebra of closed linear subspaces of a Hilbert space. We define categories of these two sorts of structures and (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  10. Matteo Bianchi & Franco Montagna (forthcoming). Trakhtenbrot Theorem and First-Order Axiomatic Extensions of MTL. Studia Logica:1-19.
    In 1950, B.A. Trakhtenbrot showed that the set of first-order tautologies associated to finite models is not recursively enumerable. In 1999, P. Hájek generalized this result to the first-order versions of Łukasiewicz, Gödel and Product logics, w.r.t. their standard algebras. In this paper we extend the analysis to the first-order versions of axiomatic extensions of MTL. Our main result is the following. Let \ be a class of MTL-chains. Then the set of all first-order tautologies associated to the finite models (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  11. D. Busneag & M. Ghita (forthcoming). Some Properties of Epimorphisms of Implicative Algebras. Studia Logica.
     
    My bibliography  
     
    Export citation  
  12. Massimiliano Carrara & Enrico Martino (forthcoming). Grounding Megethology on Plural Reference. Studia Logica:1-15.
    In Mathematics is megethology Lewis reconstructs set theory combining mereology with plural quantification. He introduces megethology, a powerful framework in which one can formulate strong assumptions about the size of the universe of individuals. Within this framework, Lewis develops a structuralist class theory, in which the role of classes is played by individuals. Thus, if mereology and plural quantification are ontologically innocent, as Lewis maintains, he achieves an ontological reduction of classes to individuals. Lewis’work is very attractive. However, the alleged (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  13. Sergio A. Celani (forthcoming). Properties of Saturation in Monotonic Neighbourhood Models and Some Applications. Studia Logica:1-23.
    In this paper we shall discuss properties of saturation in monotonic neighbourhood models and study some applications, like a characterization of compact and modally saturated monotonic models and a characterization of the maximal Hennessy-Milner classes. We shall also show that our notion of modal saturation for monotonic models naturally extends the notion of modal saturation for Kripke models.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  14. A. V. Chagrov & M. V. Zakharyaschev (forthcoming). Modal Companions of Intermediate Logics: A Survey. Studia Logica.
     
    My bibliography  
     
    Export citation  
  15. Szymon Chlebowski & Dorota Leszczyńska-Jasion (forthcoming). Dual Erotetic Calculi and the Minimal {Mathsf{LFI}}. Studia Logica:1-34.
    An erotetic calculus for a given logic constitutes a sequent-style proof-theoretical formalization of the logic grounded in Inferential Erotetic Logic ). In this paper, a new erotetic calculus for Classical Propositional Logic ), dual with respect to the existing ones, is given. We modify the calculus to obtain complete proof systems for the propositional part of paraconsistent logic \ and its extensions \ and \. The method is based on dual resolution. Moreover, the resolution rule is non-clausal. According to the (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  16. Petr Cintula & Carles Noguera (forthcoming). A Note on Natural Extensions in Abstract Algebraic Logic. Studia Logica:1-9.
    Transfer theorems are central results in abstract algebraic logic that allow to generalize properties of the lattice of theories of a logic to any algebraic model and its lattice of filters. Their proofs sometimes require the existence of a natural extension of the logic to a bigger set of variables. Constructions of such extensions have been proposed in particular settings in the literature. In this paper we show that these constructions need not always work and propose a wider setting in (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  17. Frank Wolter First Order Common (forthcoming). Knowledge Logics. Studia Logica.
     
    My bibliography  
     
    Export citation  
  18. Juan Manuel Cornejo (forthcoming). The Semi Heyting–Brouwer Logic. Studia Logica:1-23.
    In this paper we introduce a logic that we name semi Heyting–Brouwer logic, \ , in such a way that the variety of double semi-Heyting algebras is its algebraic counterpart. We prove that, up to equivalences by translations, the Heyting–Brouwer logic \ is an axiomatic extension of \ and that the propositional calculi of intuitionistic logic \ and semi-intuitionistic logic \ turn out to be fragments of \.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  19. Eduardo J. Dubuc & Y. A. Poveda (forthcoming). On the Equivalence Between MV-Algebras and L-Groups with Strong Unit. Studia Logica:1-8.
    In “A new proof of the completeness of the Lukasiewicz axioms” Chang proved that any totally ordered MV-algebra A was isomorphic to the segment \}\) of a totally ordered l-group with strong unit A *. This was done by the simple intuitive idea of putting denumerable copies of A on top of each other . Moreover, he also show that any such group G can be recovered from its segment since \^*}\) , establishing an equivalence of categories. In “Interpretation of (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  20. Fernando Ferreira & Gilda Ferreira (forthcoming). The Faithfulness of Fat: A Proof-Theoretic Proof. Studia Logica:1-9.
    It is known that there is a sound and faithful translation of the full intuitionistic propositional calculus into the atomic polymorphic system F at, a predicative calculus with only two connectives: the conditional and the second-order universal quantifier. The faithfulness of the embedding was established quite recently via a model-theoretic argument based in Kripke structures. In this paper we present a purely proof-theoretic proof of faithfulness. As an application, we give a purely proof-theoretic proof of the disjunction property of the (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  21. Ken-Etsu Fujita, Ryo Kashima, Yuichi Komori & Naosuke Matsuda (forthcoming). Reduction Rules for Intuitionistic {{Lambda}{Rho}}-Calculus. Studia Logica:1-20.
    The third author gave a natural deduction style proof system called the \-calculus for implicational fragment of classical logic in . In -calculus, 2015, Post-proceedings of the RIMS Workshop “Proof Theory, Computability Theory and Related Issues”, to appear), the fourth author gave a natural subsystem “intuitionistic \-calculus” of the \-calculus, and showed the system corresponds to intuitionistic logic. The proof is given with tree sequent calculus , but is complicated. In this paper, we introduce some reduction rules for the \-calculus, (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  22. D. Gabbay & F. Pirri (forthcoming). Special Issue on Combining Logics, Volume 59 (1, 2) Of. Studia Logica.
     
    My bibliography  
     
    Export citation  
  23. Anna Glenszczyk (forthcoming). Negational Fragment of Intuitionistic Control Logic. Studia Logica:1-21.
    We investigate properties of monadic purely negational fragment of Intuitionistic Control Logic ). This logic arises from Intuitionistic Propositional Logic ) by extending language of \ by additional new constant for falsum. Having two different falsum constants enables to define two forms of negation. We analyse implicational relations between negational monadic formulae and present a poset of non equivalent formulae of this fragment of \.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  24. 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 to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  25. Sven Ove Hansson (forthcoming). A Monoselective Presentation of AGM Revision. Studia Logica:1-15.
    A new equivalent presentation of AGM revision is introduced, in which a preference-based choice function directly selects one among the potential outcomes of the operation. This model differs from the usual presentations of AGM revision in which the choice function instead delivers a collection of sets whose intersection is the outcome. The new presentation confirms the versatility of AGM revision, but it also lends credibility to the more general model of direct choice among outcomes of which AGM revision is shown (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  26. Simon M. Huttegger & Brian Skyrms (forthcoming). Learning to Transfer Information. Studia Logica.
  27. Thomas Icard (forthcoming). Exclusion and Containment in Natural Language. Studia Logica.
     
    My bibliography  
     
    Export citation  
  28. Stanislav Kikot (forthcoming). A Dichotomy for Some Elementarily Generated Modal Logics. Studia Logica:1-31.
    In this paper we consider the normal modal logics of elementary classes defined by first-order formulas of the form \. We prove that many properties of these logics, such as finite axiomatisability, elementarity, axiomatisability by a set of canonical formulas or by a single generalised Sahlqvist formula, together with modal definability of the initial formula, either simultaneously hold or simultaneously do not hold.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  29. Jarmo Kontinen (forthcoming). Coherence and Complexity of Quantifier-Free Dependence Logic Formulas. Studia Logica.
     
    My bibliography  
     
    Export citation  
  30. AgneS Kurucz & Arrow Logic (forthcoming). Infinite Counting. Studia Logica.
     
    My bibliography  
     
    Export citation  
  31. Rutger Kuyper (forthcoming). First-Order Logic in the Medvedev Lattice. Studia Logica:1-40.
    Kolmogorov introduced an informal calculus of problems in an attempt to provide a classical semantics for intuitionistic logic. This was later formalised by Medvedev and Muchnik as what has come to be called the Medvedev and Muchnik lattices. However, they only formalised this for propositional logic, while Kolmogorov also discussed the universal quantifier. We extend the work of Medvedev to first-order logic, using the notion of a first-order hyperdoctrine from categorical logic, to a structure which we will call the hyperdoctrine (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  32. Hitoshi Omori & Katsuhiko Sano (forthcoming). Generalizing Functional Completeness in Belnap-Dunn Logic. Studia Logica:1-35.
    One of the problems we face in many-valued logic is the difficulty of capturing the intuitive meaning of the connectives introduced through truth tables. At the same time, however, some logics have nice ways to capture the intended meaning of connectives easily, such as four-valued logic studied by Belnap and Dunn. Inspired by Dunn’s discovery, we first describe a mechanical procedure, in expansions of Belnap-Dunn logic, to obtain truth conditions in terms of the behavior of the Truth and the False, (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  33. Arthur Paul Pedersen (forthcoming). An Extension Theorem and a Numerical Representation Theorem for Qualitative Comparative Expectations. Studia Logica.
     
    My bibliography  
     
    Export citation  
  34. Dana Piciu & A. Jeflea (forthcoming). Localization of MTL-Algebras. Studia Logica.
    Direct download  
     
    My bibliography  
     
    Export citation  
  35. Edoardo Rivello (forthcoming). Periodicity and Reflexivity in Revision Sequences. Studia Logica:1-24.
    Revision sequences were introduced in 1982 by Herzberger and Gupta as a mathematical tool in formalising their respective theories of truth. Since then, revision has developed in a method of analysis of theoretical concepts with several applications in other areas of logic and philosophy. Revision sequences are usually formalised as ordinal-length sequences of objects of some sort. A common idea of revision process is shared by all revision theories but specific proposals can differ in the so-called limit rule, namely the (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  36. David Michael Roberts (forthcoming). The Weak Choice Principle WISC May Fail in the Category of Sets. Studia Logica:1-13.
    The set-theoretic axiom WISC states that for every set there is a set of surjections to it cofinal in all such surjections. By constructing an unbounded topos over the category of sets and using an extension of the internal logic of a topos due to Shulman, we show that WISC is independent of the rest of the axioms of the set theory given by a well-pointed topos. This also gives an example of a topos that is not a predicative topos (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  37. F. Sebastiani (forthcoming). A Fully Model-Theoretic Semantics for Model-Preference Default Systems', Istituto di Elaborazione dell'Informazione, Pisa. Studia Logica.
     
    My bibliography  
     
    Export citation  
  38. Ryo Takemura (forthcoming). Counter-Example Construction with Euler Diagrams. Studia Logica:1-28.
    One of the traditional applications of Euler diagrams is as a representation or counterpart of the usual set-theoretical models of given sentences. However, Euler diagrams have recently been investigated as the counterparts of logical formulas, which constitute formal proofs. Euler diagrams are rigorously defined as syntactic objects, and their inference systems, which are equivalent to some symbolic logical systems, are formalized. Based on this observation, we investigate both counter-model construction and proof-construction in the framework of Euler diagrams. We introduce the (...)
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  39. L. Tatjana & I. Boris (forthcoming). In Databases* T. Studia Logica.
     
    My bibliography  
     
    Export citation  
  40. Hans van Ditmarsch (forthcoming). Johan van Benthem, Modal Logic for Open Minds, CSLI Lecture Notes, Stanford University, 2010, Pp. 350. ISBN: 9781575865997 (Hardcover) US 70.00,ISBN:9781575865980(Paperback)US 30.00. [REVIEW] Studia Logica.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  41. Y. Venema (forthcoming). Meeting Strength in Substructural Logics'. UU Logic Preprint. Studia Logica.
     
    My bibliography  
     
    Export citation  
  42. Xue-Ping Wang & Lei-Bo Wang (forthcoming). Congruences and Kernel Ideals on a Subclass of Ockham Algebras. Studia Logica:1-19.
    In this note, it is shown that the set of kernel ideals of a K n, 0-algebra L is a complete Heyting algebra, and the largest congruence on L such that the given kernel ideal as its congruence class is derived and finally, the necessary and sufficient conditions that such a congruence is pro-boolean are given.
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  43. Yan Zhang & Kai Li (forthcoming). Decidability of Logics Based on an Indeterministic Metric Tense Logic. Studia Logica:1-40.
    This paper presents two general results of decidability concerning logics based on an indeterministic metric tense logic, which can be applied to, among others, logics combining knowledge, time and agency. We provide a general Kripke semantics based on a variation of the notion of synchronized Ockhamist frames. Our proof of the decidability is by way of the finite frame property, applying subframe transformations and a variant of the filtration technique.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
 Previous issues
  
Next issues