42 found

Year:

Forthcoming articles
  1.  15
    Guillermo Badia (forthcoming). Bi-Simulating in Bi-Intuitionistic Logic. Studia Logica:1-14.
    Bi-intuitionistic logic is the result of adding the dual of intuitionistic implication to intuitionistic logic. In this note, we characterize the expressive power of this logic by showing that the first order formulas equivalent to translations of bi-intuitionistic propositional formulas are exactly those preserved under bi-intuitionistic directed bisimulations. The proof technique is originally due to Lindstrom and, in contrast to the most common proofs of this kind of result, it does not use the machinery of neither saturated models nor elementary (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  2.  4
    Francesca Poggiolesi (forthcoming). Natural Deduction Calculi and Sequent Calculi for Counterfactual Logics. Studia Logica:1-34.
    In this paper we present labelled sequent calculi and labelled natural deduction calculi for the counterfactual logics CK + {ID, MP}. As for the sequent calculi we prove, in a semantic manner, that the cut-rule is admissible. As for the natural deduction calculi we prove, in a purely syntactic way, the normalization theorem. Finally, we demonstrate that both calculi are sound and complete with respect to Nute semantics [12] and that the natural deduction calculi can be effectively transformed into the (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  3.  1
    Aldo Figallo Orellano (forthcoming). A Preliminary Study of MV-Algebras with Two Quantifiers Which Commute. Studia Logica:1-26.
    In this paper we investigate the class of MV-algebras equipped with two quantifiers which commute as a natural generalization of diagonal-free two-dimensional cylindric algebras. In the 40s, Tarski first introduced cylindric algebras in order to provide an algebraic apparatus for the study of classical predicate calculus. The diagonal–free two-dimensional cylindric algebras are special cylindric algebras. The treatment here of MV-algebras is done in terms of implication and negation. This allows us to simplify some results due to Di Nola and Grigolia (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  4. A. M. Suardiaz A. Quantifier (forthcoming). M. Abad Varieties of Three-Valued. Studia Logica.
     
    Export citation  
     
    My bibliography  
  5.  3
    T. Ågotnes, H. Van Ditmarsch & T. French (forthcoming). The Undecidability of Quantified Announcements. Studia Logica:1-44.
    This paper demonstrates the undecidability of a number of logics with quantification over public announcements: arbitrary public announcement logic, group announcement logic, and coalition announcement logic. In APAL we consider the informative consequences of any announcement, in GAL we consider the informative consequences of a group of agents all of which are simultaneously making known announcements. So this is more restrictive than APAL. Finally, CAL is as GAL except that we now quantify over anything the agents not in that group (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  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.  1
    Nikolay Bazhenov (forthcoming). Categoricity Spectra for Polymodal Algebras. Studia Logica:1-15.
    We investigate effective categoricity for polymodal algebras. We prove that the class of polymodal algebras is complete with respect to degree spectra of nontrivial structures, effective dimensions, expansion by constants, and degree spectra of relations. In particular, this implies that every categoricity spectrum is the categoricity spectrum of a polymodal algebra.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  8. Vaishak Belle & Hector J. Levesque (forthcoming). A Logical Theory of Localization. Studia Logica:1-32.
    A central problem in applying logical knowledge representation formalisms to traditional robotics is that the treatment of belief change is categorical in the former, while probabilistic in the latter. A typical example is the fundamental capability of localization where a robot uses its noisy sensors to situate itself in a dynamic world. Domain designers are then left with the rather unfortunate task of abstracting probabilistic sensors in terms of categorical ones, or more drastically, completely abandoning the inner workings of sensors (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  9. 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  
  10.  1
    Nils Bulling & Wiebe van der Hoek (forthcoming). Special Issue on Logical Aspects of Multi-Agent Systems. Studia Logica:1-3.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  11. D. Busneag & M. Ghita (forthcoming). Some Properties of Epimorphisms of Implicative Algebras. Studia Logica.
     
    Export citation  
     
    My bibliography  
  12.  2
    L. M. Cabrer & H. A. Priestley (forthcoming). Natural Dualities Through Product Representations: Bilattices and Beyond. Studia Logica:1-26.
    This paper focuses on natural dualities for varieties of bilattice-based algebras. Such varieties have been widely studied as semantic models in situations where information is incomplete or inconsistent. The most popular tool for studying bilattices-based algebras is product representation. The authors recently set up a widely applicable algebraic framework which enabled product representations over a base variety to be derived in a uniform and categorical manner. By combining this methodology with that of natural duality theory, we demonstrate how to build (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  13. A. V. Chagrov & M. V. Zakharyaschev (forthcoming). Modal Companions of Intermediate Logics: A Survey. Studia Logica.
     
    Export citation  
     
    My bibliography  
  14.  22
    Taolue Chen, Giuseppe Primiero, Franco Raimondi & Neha Rungta (forthcoming). A Computationally Grounded, Weighted Doxastic Logic. Studia Logica:1-25.
    Modelling, reasoning and verifying complex situations involving a system of agents is crucial in all phases of the development of a number of safety-critical systems. In particular, it is of fundamental importance to have tools and techniques to reason about the doxastic and epistemic states of agents, to make sure that the agents behave as intended. In this paper we introduce a computationally grounded logic called COGWED and we present two types of semantics that support a range of practical situations. (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  15. Frank Wolter First Order Common (forthcoming). Knowledge Logics. Studia Logica.
     
    Export citation  
     
    My bibliography  
  16. Juan M. Cornejo & Hanamantagouda P. Sankappanavar (forthcoming). Order in Implication Zroupoids. Studia Logica:1-37.
    The variety \ of implication zroupoids and a constant 0) was defined and investigated by Sankappanavar :21–50, 2012), as a generalization of De Morgan algebras. Also, in Sankappanavar :21–50, 2012), several subvarieties of \ were introduced, including the subvariety \, defined by the identity: \, which plays a crucial role in this paper. Some more new subvarieties of \ are studied in Cornejo and Sankappanavar that includes the subvariety \ of semilattices with a least element 0. An explicit description of (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  17. Giuseppe De Giacomo, Yves Lespérance, Fabio Patrizi & Stavros Vassos (forthcoming). Progression and Verification of Situation Calculus Agents with Bounded Beliefs. Studia Logica:1-35.
    We investigate agents that have incomplete information and make decisions based on their beliefs expressed as situation calculus bounded action theories. Such theories have an infinite object domain, but the number of objects that belong to fluents at each time point is bounded by a given constant. Recently, it has been shown that verifying temporal properties over such theories is decidable. We take a first-person view and use the theory to capture what the agent believes about the domain of interest (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  18. D. Gabbay & F. Pirri (forthcoming). Special Issue on Combining Logics, Volume 59 (1, 2) Of. Studia Logica.
     
    Export citation  
     
    My bibliography   1 citation  
  19.  19
    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  
  20. C. Hampson, S. Kikot & A. Kurucz (forthcoming). The Decision Problem of Modal Product Logics with a Diagonal, and Faulty Counter Machines. Studia Logica:1-32.
    In the propositional modal treatment of two-variable first-order logic equality is modelled by a ‘diagonal’ constant, interpreted in square products of universal frames as the identity relation. Here we study the decision problem of products of two arbitrary modal logics equipped with such a diagonal. As the presence or absence of equality in two-variable first-order logic does not influence the complexity of its satisfiability problem, one might expect that adding a diagonal to product logics in general is similarly harmless. We (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  21.  3
    Paul Harrenstein, Paolo Turrini & Michael Wooldridge (forthcoming). Hard and Soft Preparation Sets in Boolean Games. Studia Logica:1-35.
    A fundamental problem in game theory is the possibility of reaching equilibrium outcomes with undesirable properties, e.g., inefficiency. The economics literature abounds with models that attempt to modify games in order to avoid such undesirable properties, for example through the use of subsidies and taxation, or by allowing players to undergo a bargaining phase before their decision. In this paper, we consider the effect of such transformations in Boolean games with costs, where players control propositional variables that they can set (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  22.  14
    Simon M. Huttegger & Brian Skyrms (forthcoming). Learning to Transfer Information. Studia Logica.
  23. Thomas Icard (forthcoming). Exclusion and Containment in Natural Language. Studia Logica.
     
    Export citation  
     
    My bibliography  
  24. Ramon Jansana (forthcoming). On the Deductive System of the Order of an Equationally Orderable Quasivariety. Studia Logica:1-20.
    We consider the equationally orderable quasivarieties and associate with them deductive systems defined using the order. The method of definition of these deductive systems encompasses the definition of logics preserving degrees of truth we find in the research areas of substructural logics and mathematical fuzzy logic. We prove several general results, for example that the deductive systems so defined are finitary and that the ones associated with equationally orderable varieties are congruential.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  25.  2
    Michael Kaminski & Nissim Francez (forthcoming). The Lambek Calculus Extended with Intuitionistic Propositional Logic. Studia Logica:1-32.
    We present sound and complete semantics and a sequent calculus for the Lambek calculus extended with intuitionistic propositional logic.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  26. Jarmo Kontinen (forthcoming). Coherence and Complexity of Quantifier-Free Dependence Logic Formulas. Studia Logica.
     
    Export citation  
     
    My bibliography  
  27.  22
    Philip Kremer (forthcoming). Matching Topological and Frame Products of Modal Logics. Studia Logica:1-16.
    The simplest combination of unimodal logics \ into a bimodal logic is their fusion, \, axiomatized by the theorems of \. Shehtman introduced combinations that are not only bimodal, but two-dimensional: he defined 2-d Cartesian products of 1-d Kripke frames, using these Cartesian products to define the frame product \. Van Benthem, Bezhanishvili, ten Cate and Sarenac generalized Shehtman’s idea and introduced the topological product \, using Cartesian products of topological spaces rather than of Kripke frames. Frame products have been (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  28. AgneS Kurucz & Arrow Logic (forthcoming). Infinite Counting. Studia Logica.
     
    Export citation  
     
    My bibliography   1 citation  
  29.  2
    Emiliano Lorini & Giovanni Sartor (forthcoming). A STIT Logic for Reasoning About Social Influence. Studia Logica:1-40.
    In this paper we propose a method for modeling social influence within the STIT approach to action. Our proposal consists in extending the STIT language with special operators that allow us to represent the consequences of an agent’s choices over the rational choices of another agent.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  30. Arthur Paul Pedersen (forthcoming). An Extension Theorem and a Numerical Representation Theorem for Qualitative Comparative Expectations. Studia Logica.
     
    Export citation  
     
    My bibliography  
  31. Dana Piciu & A. Jeflea (forthcoming). Localization of MTL-Algebras. Studia Logica.
    Direct download  
     
    Export citation  
     
    My bibliography  
  32.  1
    Adam Přenosil (forthcoming). Reductio Ad Contradictionem: An Algebraic Perspective. Studia Logica:1-27.
    We introduce a novel expansion of the four-valued Belnap–Dunn logic by a unary operator representing reductio ad contradictionem and study its algebraic semantics. This expansion thus contains both the direct, non-inferential negation of the Belnap–Dunn logic and an inferential negation akin to the negation of Johansson’s minimal logic. We formulate a sequent calculus for this logic and introduce the variety of reductio algebras as an algebraic semantics for this calculus. We then investigate some basic algebraic properties of this variety, in (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  33.  3
    J. G. Raftery & K. Świrydowicz (forthcoming). Structural Completeness in Relevance Logics. Studia Logica:1-7.
    It is proved that the relevance logic \ has no structurally complete consistent axiomatic extension, except for classical propositional logic. In fact, no other such extension is even passively structurally complete.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  34. 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  
  35.  3
    Christian Straßer, Mathieu Beirlaen & Frederik Van De Putte (forthcoming). Adaptive Logic Characterizations of Input/Output Logic. Studia Logica:1-48.
    We translate unconstrained and constrained input/output logics as introduced by Makinson and van der Torre to modal logics, using adaptive logics for the constrained case. The resulting reformulation has some additional benefits. First, we obtain a proof-theoretic characterization of input/output logics. Second, we demonstrate that our framework naturally gives rise to useful variants and allows to express important notions that go beyond the expressive means of input/output logics, such as violations and sanctions.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  36.  1
    Mitio Takano (forthcoming). Gentzenization of Trilattice Logics. Studia Logica:1-13.
    Sequent calculi for trilattice logics, including those that are determined by the truth entailment, the falsity entailment and their intersection, are given. This partly answers the problems in Shramko-Wansing.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  37. L. Tatjana & I. Boris (forthcoming). In Databases* T. Studia Logica.
     
    Export citation  
     
    My bibliography  
  38. Antoni Torrens (forthcoming). Semisimples in Varieties of Commutative Integral Bounded Residuated Lattices. Studia Logica:1-19.
    In any variety of bounded integral residuated lattice-ordered commutative monoids the class of its semisimple members is closed under isomorphic images, subalgebras and products, but it is not closed under homomorphic images, and so it is not a variety. In this paper we study varieties of bounded residuated lattices whose semisimple members form a variety, and we give an equational presentation for them. We also study locally representable varieties whose semisimple members form a variety. Finally, we analyze the relationship with (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  39.  2
    Paweł Urzyczyn (forthcoming). Intuitionistic Games: Determinacy, Completeness, and Normalization. Studia Logica:1-45.
    We investigate a simple game paradigm for intuitionistic logic, inspired by Wajsberg’s implicit inhabitation algorithm and Beth tableaux. The principal idea is that one player, ∃ros, is trying to construct a proof in normal form while his opponent, ∀phrodite, attempts to build a counter-model. The determinacy of the game implies therefore both completeness and semantic cut-elimination.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  40. Y. Venema (forthcoming). Meeting Strength in Substructural Logics'. UU Logic Preprint. Studia Logica.
     
    Export citation  
     
    My bibliography  
  41.  7
    Stefan Wintein (forthcoming). On All Strong Kleene Generalizations of Classical Logic. Studia Logica:1-43.
    By using the notions of exact truth and exact falsity, one can give 16 distinct definitions of classical consequence. This paper studies the class of relations that results from these definitions in settings that are paracomplete, paraconsistent or both and that are governed by the Strong Kleene schema. Besides familiar logics such as Strong Kleene logic, the Logic of Paradox and First Degree Entailment, the resulting class of all Strong Kleene generalizations of classical logic also contains a host of unfamiliar (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  42. Bożena Woźna-Szcześniak & Andrzej Zbrzezny (forthcoming). Checking EMTLK Properties of Timed Interpreted Systems Via Bounded Model Checking. Studia Logica:1-38.
    We investigate a SAT-based bounded model checking method for EMTLK that is interpreted over timed models generated by timed interpreted systems. In particular, we translate the existential model checking problem for EMTLK to the existential model checking problem for a variant of linear temporal logic, and we provide a SAT-based BMC technique for HLTLK. We evaluated the performance of our BMC by means of a variant of a timed generic pipeline paradigm scenario and a timed train controller system.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
 Previous issues
  
Next issues