Switch to: References

Add citations

You must login to add citations.
  1. Intensional Completeness in an Extension of Gödel/dummett Logic.Matt Fairtlough & Michael Mendler - 2003 - Studia Logica 73 (1):51-80.
    We enrich intuitionistic logic with a lax modal operator ○ and define a corresponding intensional enrichment of Kripke models M = (W, ⊑, V) by a function T giving an effort measure T(w, u) ∈ \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $${\mathbb{N}} \cup$$ \end{document} {∞} for each ⊑-related pair (w, u). We show that ○ embodies the abstraction involved in passing from “ϕ true up to bounded effort” to “ϕ true outright”. We then introduce a refined (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Inquisitive logic as an epistemic logic of knowing how.Haoyu Wang, Yanjing Wang & Yunsong Wang - 2022 - Annals of Pure and Applied Logic 173 (10):103145.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Proof-Theoretic Semantics and Inquisitive Logic.Will Stafford - 2021 - Journal of Philosophical Logic 50 (5):1199-1229.
    Prawitz conjectured that proof-theoretic validity offers a semantics for intuitionistic logic. This conjecture has recently been proven false by Piecha and Schroeder-Heister. This article resolves one of the questions left open by this recent result by showing the extensional alignment of proof-theoretic validity and general inquisitive logic. General inquisitive logic is a generalisation of inquisitive semantics, a uniform semantics for questions and assertions. The paper further defines a notion of quasi-proof-theoretic validity by restricting proof-theoretic validity to allow double negation elimination (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Some Modifications of Carnap’s Modal Logic.Vít Punčochář - 2012 - Studia Logica 100 (3):517-543.
    In this paper, Carnap's modal logic C is reconstructed. It is shown that the Carnapian approach enables us to create some epistemic logics in a relatively straightforward way. These epistemic modifications of C are axiomatized and one of them is compared with intuitionistic logic. At the end of the paper, some connections between this epistemic logic and Medvedev's logic of finite problems and inquisitive semantics are shortly discussed.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Inquisitive Heyting Algebras.Vít Punčochář - 2021 - Studia Logica 109 (5):995-1017.
    In this paper we introduce a class of inquisitive Heyting algebras as algebraic structures that are isomorphic to algebras of finite antichains of bounded implicative meet semilattices. It is argued that these structures are suitable for algebraic semantics of inquisitive superintuitionistic logics, i.e. logics of questions based on intuitionistic logic and its extensions. We explain how questions are represented in these structures and provide several alternative characterizations of these algebras. For instance, it is shown that a Heyting algebra is inquisitive (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • 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   9 citations  
  • Preface. In memoriam Pierangelo Miglioli (1946–1999).Mario Ornaghi - 2003 - Studia Logica 73 (1):5-19.
    Download  
     
    Export citation  
     
    Bookmark  
  • An infinite class of maximal intermediate propositional logics with the disjunction property.Pierangelo Miglioli - 1992 - Archive for Mathematical Logic 31 (6):415-432.
    Infinitely many intermediate propositional logics with the disjunction property are defined, each logic being characterized both in terms of a finite axiomatization and in terms of a Kripke semantics with the finite model property. The completeness theorems are used to prove that any two logics are constructively incompatible. As a consequence, one deduces that there are infinitely many maximal intermediate propositional logics with the disjunction property.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Nelson algebras, residuated lattices and rough sets: A survey.Jouni Järvinen, Sándor Radeleczki & Umberto Rivieccio - 2024 - Journal of Applied Non-Classical Logics 34 (2-3):368-428.
    Over the past 50 years, Nelson algebras have been extensively studied by distinguished scholars as the algebraic counterpart of Nelson's constructive logic with strong negation. Despite these studies, a comprehensive survey of the topic is currently lacking, and the theory of Nelson algebras remains largely unknown to most logicians. This paper aims to fill this gap by focussing on the essential developments in the field over the past two decades. Additionally, we explore generalisations of Nelson algebras, such as N4-lattices which (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Information Completeness in Nelson Algebras of Rough Sets Induced by Quasiorders.Jouni Järvinen, Piero Pagliani & Sándor Radeleczki - 2013 - Studia Logica 101 (5):1073-1092.
    In this paper, we give an algebraic completeness theorem for constructive logic with strong negation in terms of finite rough set-based Nelson algebras determined by quasiorders. We show how for a quasiorder R, its rough set-based Nelson algebra can be obtained by applying Sendlewski’s well-known construction. We prove that if the set of all R-closed elements, which may be viewed as the set of completely defined objects, is cofinal, then the rough set-based Nelson algebra determined by the quasiorder R forms (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Structural completeness in propositional logics of dependence.Rosalie Iemhoff & Fan Yang - 2016 - Archive for Mathematical Logic 55 (7-8):955-975.
    In this paper we prove that three of the main propositional logics of dependence, none of which is structural, are structurally complete with respect to a class of substitutions under which the logics are closed. We obtain an analogous result with respect to stable substitutions, for the negative variants of some well-known intermediate logics, which are intermediate theories that are closely related to inquisitive logic.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • European Summer Meeting of the Association for Symbolic Logic (Logic Colloquium'88), Padova, 1988.R. Ferro - 1990 - Journal of Symbolic Logic 55 (1):387-435.
    Download  
     
    Export citation  
     
    Bookmark  
  • A method to single out maximal propositional logics with the disjunction property I.Mauro Ferrari & Pierangelo Miglioli - 1995 - Annals of Pure and Applied Logic 76 (1):1-46.
    This is the first part of a paper concerning intermediate propositional logics with the disjunction property which cannot be properly extended into logics of the same kind, and are therefore called maximal. To deal with these logics, we use a method based on the search of suitable nonstandard logics, which has an heuristic content and has allowed us to discover a wide family of logics, as well as to get their maximality proofs in a uniform way. The present part illustrates (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • A method to single out maximal propositional logics with the disjunction property II.Mauro Ferrari & Pierangelo Miglioli - 1995 - Annals of Pure and Applied Logic 76 (2):117-168.
    This is the second part of a paper devoted to the study of the maximal intermediate propositional logics with the disjunction property , whose first part has appeared in this journal with the title “A method to single out maximal propositional logics with the disjunction property I”. In the first part we have explained the general results upon which a method to single out maximal constructive logics is based and have illustrated such a method by exhibiting the Kripke semantics of (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Intensional completeness in an extension of gödel/dummett logic.Matt Fairtlough & Michael Mendler - 2003 - Studia Logica 73 (1):51 - 80.
    We enrich intuitionistic logic with a lax modal operator and define a corresponding intensional enrichment of Kripke models M = (W, , V) by a function T giving an effort measure T(w, u) {} for each -related pair (w, u). We show that embodies the abstraction involved in passing from true up to bounded effort to true outright. We then introduce a refined notion of intensional validity M |= p : and present a corresponding intensional calculus iLC-h which gives a (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • 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  
  • The disjunction property of intermediate propositional logics.Alexander Chagrov & Michael Zakharyashchev - 1991 - Studia Logica 50 (2):189 - 216.
    This paper is a survey of results concerning the disjunction property, Halldén-completeness, and other related properties of intermediate prepositional logics and normal modal logics containing S4.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • An Algebraic Approach to Inquisitive and -Logics.Nick Bezhanishvili, Gianluca Grilletti & Davide Emilio Quadrellaro - 2022 - Review of Symbolic Logic 15 (4):950-990.
    This article provides an algebraic study of the propositional system $\mathtt {InqB}$ of inquisitive logic. We also investigate the wider class of $\mathtt {DNA}$ -logics, which are negative variants of intermediate logics, and the corresponding algebraic structures, $\mathtt {DNA}$ -varieties. We prove that the lattice of $\mathtt {DNA}$ -logics is dually isomorphic to the lattice of $\mathtt {DNA}$ -varieties. We characterise maximal and minimal intermediate logics with the same negative variant, and we prove a suitable version of Birkhoff’s classic variety (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • On maximal intermediate predicate constructive logics.Alessandro Avellone, Camillo Fiorentini, Paolo Mantovani & Pierangelo Miglioli - 1996 - Studia Logica 57 (2-3):373 - 408.
    We extend to the predicate frame a previous characterization of the maximal intermediate propositional constructive logics. This provides a technique to get maximal intermediate predicate constructive logics starting from suitable sets of classically valid predicate formulae we call maximal nonstandard predicate constructive logics. As an example of this technique, we exhibit two maximal intermediate predicate constructive logics, yet leaving open the problem of stating whether the two logics are distinct. Further properties of these logics will be also investigated.
    Download  
     
    Export citation  
     
    Bookmark   1 citation