Switch to: Citations

Add references

You must login to add references.
  1. An Algebraic Approach to Canonical Formulas: Modal Case.Guram Bezhanishvili & Nick Bezhanishvili - 2011 - Studia Logica 99 (1-3):93-125.
    We introduce relativized modal algebra homomorphisms and show that the category of modal algebras and relativized modal algebra homomorphisms is dually equivalent to the category of modal spaces and partial continuous p-morphisms, thus extending the standard duality between the category of modal algebras and modal algebra homomorphisms and the category of modal spaces and continuous p-morphisms. In the transitive case, this yields an algebraic characterization of Zakharyaschev’s subreductions, cofinal subreductions, dense subreductions, and the closed domain condition. As a consequence, we (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • An ascending chain of S4 logics.Kit Fine - 1974 - Theoria 40 (2):110-116.
    Download  
     
    Export citation  
     
    Bookmark   57 citations  
  • On the period of sequences (an(p)) in intuitionistic propositional calculus.Wim Ruitenburg - 1984 - Journal of Symbolic Logic 49 (3):892 - 899.
    In classical propositional calculus for each proposition A(p) the following holds: $\vdash A(p) \leftrightarrow A^3(p)$ . In this paper we consider what remains of this in the intuitionistic case. It turns out that for each proposition A(p) the following holds: there is an n ∈ N such that $\vdash A^n(p) \leftrightarrow A^{n + 2}(p)$ . As a byproduct of the proof we give some theorems which may be useful elsewhere in propositional calculus.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • On maximal intermediate logics with the disjunction property.Larisa L. Maksimova - 1986 - Studia Logica 45 (1):69 - 75.
    For intermediate logics, there is obtained in the paper an algebraic equivalent of the disjunction propertyDP. It is proved that the logic of finite binary trees is not maximal among intermediate logics withDP. Introduced is a logicND, which has the only maximal extension withDP, namely, the logicML of finite problems.
    Download  
     
    Export citation  
     
    Bookmark   34 citations  
  • Semantic analysis of wh-complements.Jeroen Groenendijk & Martin Stokhof - 1982 - Linguistics and Philosophy 5 (2):175 - 233.
    This paper presents an analysis of wh-complements in Montague Grammar. We will be concerned primarily with semantics, though some remarks on syntax are made in Section 4. Questions and wh-comple ments in Montague Grammar have been studied in Hamblin (1976), Bennett (1979), Karttunen (1977) and Hauser (1978) among others. These proposals will not be discussed explicitly, but some differences with Karttunen's analysis will be pointed out along the way.
    Download  
     
    Export citation  
     
    Bookmark   103 citations  
  • Substructural inquisitive logics.Vít Punčochář - 2019 - Review of Symbolic Logic 12 (2):296-330.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Inquisitive Logic.Ivano Ciardelli & Floris Roelofsen - 2011 - Journal of Philosophical Logic 40 (1):55-94.
    This paper investigates a generalized version of inquisitive semantics. A complete axiomatization of the associated logic is established, the connection with intuitionistic logic and several intermediate logics is explored, and the generalized version of inquisitive semantics is argued to have certain advantages over the system that was originally proposed by Groenendijk (2009) and Mascarenhas (2009).
    Download  
     
    Export citation  
     
    Bookmark   62 citations  
  • Weak Negation in Inquisitive Semantics.Vít Punčochář - 2015 - Journal of Logic, Language and Information 24 (3):323-355.
    This paper introduces and explores a conservative extension of inquisitive logic. In particular, weak negation is added to the standard propositional language of inquisitive semantics, and it is shown that, although we lose some general semantic properties of the original framework, such an enrichment enables us to model some previously inexpressible speech acts such as weak denial and ‘might’-assertions. As a result, a new modal logic emerges. For this logic, a Fitch-style system of natural deduction is formulated. The main result (...)
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Some results on intermediate constructive logics.Pierangelo Miglioli, Ugo Moscato, Mario Ornaghi, Silvia Quazza & Gabriele Usberti - 1989 - Notre Dame Journal of Formal Logic 30 (4):543-562.
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • From if to bi.Samson Abramsky & Jouko Väänänen - 2009 - Synthese 167 (2):207 - 230.
    We take a fresh look at the logics of informational dependence and independence of Hintikka and Sandu and Väänänen, and their compositional semantics due to Hodges. We show how Hodges’ semantics can be seen as a special case of a general construction, which provides a context for a useful completeness theorem with respect to a wider class of models. We shed some new light on each aspect of the logic. We show that the natural propositional logic carried by the semantics (...)
    Download  
     
    Export citation  
     
    Bookmark   31 citations  
  • (1 other version)Modal Logic.Patrick Blackburn, Maarten de Rijke & Yde Venema - 2001 - Studia Logica 76 (1):142-148.
    Download  
     
    Export citation  
     
    Bookmark   392 citations  
  • Algebraic foundations for the semantic treatment of inquisitive content.Floris Roelofsen - 2013 - Synthese 190:79-102.
    In classical logic, the proposition expressed by a sentence is construed as a set of possible worlds, capturing the informative content of the sentence. However, sentences in natural language are not only used to provide information, but also to request information. Thus, natural language semantics requires a logical framework whose notion of meaning does not only embody informative content, but also inquisitive content. This paper develops the algebraic foundations for such a framework. We argue that propositions, in order to embody (...)
    Download  
     
    Export citation  
     
    Bookmark   41 citations  
  • A Generalization of Inquisitive Semantics.Vít Punčochář - 2016 - Journal of Philosophical Logic 45 (4):399-428.
    This paper introduces a generalized version of inquisitive semantics, denoted as GIS, and concentrates especially on the role of disjunction in this general framework. Two alternative semantic conditions for disjunction are compared: the first one corresponds to the so-called tensor operator of dependence logic, and the second one is the standard condition for inquisitive disjunction. It is shown that GIS is intimately related to intuitionistic logic and its Kripke semantics. Using this framework, it is shown that the main results concerning (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Heyting Algebras: Duality Theory.Leo Esakia - 2019 - Cham, Switzerland: Springer Verlag.
    This book presents an English translation of a classic Russian text on duality theory for Heyting algebras. Written by Georgian mathematician Leo Esakia, the text proved popular among Russian-speaking logicians. This translation helps make the ideas accessible to a wider audience and pays tribute to an influential mind in mathematical logic. The book discusses the theory of Heyting algebras and closure algebras, as well as the corresponding intuitionistic and modal logics. The author introduces the key notion of a hybrid that (...)
    Download  
     
    Export citation  
     
    Bookmark   27 citations  
  • An Algebraic Approach to Canonical Formulas: Intuitionistic Case.Guram Bezhanishvili - 2009 - Review of Symbolic Logic 2 (3):517.
    We introduce partial Esakia morphisms, well partial Esakia morphisms, and strong partial Esakia morphisms between Esakia spaces and show that they provide the dual description of (∧, →) homomorphisms, (∧, →, 0) homomorphisms, and (∧, →, ∨) homomorphisms between Heyting algebras, thus establishing a generalization of Esakia duality. This yields an algebraic characterization of Zakharyaschev’s subreductions, cofinal subreductions, dense subreductions, and the closed domain condition. As a consequence, we obtain a new simplified proof (which is algebraic in nature) of Zakharyaschev’s (...)
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Propositional logics of dependence.Fan Yang & Jouko Väänänen - 2016 - Annals of Pure and Applied Logic 167 (7):557-589.
    Download  
     
    Export citation  
     
    Bookmark   21 citations