Results for 'Intuitionistic logic'

1000+ found
Order:
See also
  1. Truth-Maker Semantics for Intuitionistic Logic.Kit Fine - 2014 - Journal of Philosophical Logic 43 (2-3):549-577.
    I propose a new semantics for intuitionistic logic, which is a cross between the construction-oriented semantics of Brouwer-Heyting-Kolmogorov and the condition-oriented semantics of Kripke. The new semantics shows how there might be a common semantical underpinning for intuitionistic and classical logic and how intuitionistic logic might thereby be tied to a realist conception of the relationship between language and the world.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   75 citations  
  2.  78
    Dual Intuitionistic Logic and a Variety of Negations: The Logic of Scientific Research.Yaroslav Shramko - 2005 - Studia Logica 80 (2-3):347-367.
    We consider a logic which is semantically dual (in some precise sense of the term) to intuitionistic. This logic can be labeled as “falsification logic”: it embodies the Popperian methodology of scientific discovery. Whereas intuitionistic logic deals with constructive truth and non-constructive falsity, and Nelson's logic takes both truth and falsity as constructive notions, in the falsification logic truth is essentially non-constructive as opposed to falsity that is conceived constructively. We also briefly (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   30 citations  
  3.  31
    Semi-Intuitionistic Logic.Juan Manuel Cornejo - 2011 - Studia Logica 98 (1-2):9-25.
    The purpose of this paper is to define a new logic $${\mathcal {SI}}$$ called semi-intuitionistic logic such that the semi-Heyting algebras introduced in [ 4 ] by Sankappanavar are the semantics for $${\mathcal {SI}}$$ . Besides, the intuitionistic logic will be an axiomatic extension of $${\mathcal {SI}}$$.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  4.  24
    Intuitionistic Logic, Model Theory and Forcing.Melvin Chris Fitting - 1969 - Amsterdam: North-Holland Pub. Co..
  5.  38
    Intuitionistic Logic with Strong Negation.Yuri Gurevich - 1977 - Studia Logica 36 (1-2):49 - 59.
    This paper is a reaction to the following remark by grzegorczyk: "the compound sentences are not a product of experiment. they arise from reasoning. this concerns also negations; we see that the lemon is yellow, we do not see that it is not blue." generally, in science the truth is ascertained as indirectly as falsehood. an example: a litmus-paper is used to verify the sentence "the solution is acid." this approach gives rise to a (very intuitionistic indeed) conservative extension (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   36 citations  
  6.  20
    Inquisitive Intuitionistic Logic.Wesley H. Holliday - forthcoming - In Nicola Olivetti & Rineke Verbrugge (eds.), Advances in Modal Logic, Vol. 11. London: College Publications.
    Inquisitive logic is a research program seeking to expand the purview of logic beyond declarative sentences to include the logic of questions. To this end, inquisitive propositional logic extends classical propositional logic for declarative sentences with principles governing a new binary connective of inquisitive disjunction, which allows the formation of questions. Recently inquisitive logicians have considered what happens if the logic of declarative sentences is assumed to be intuitionistic rather than classical. In short, (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  7.  26
    Intuitionistic Logic and Modality Via Topology.Leo Esakia - 2004 - Annals of Pure and Applied Logic 127 (1-3):155-170.
    In the pioneering article and two papers, written jointly with McKinsey, Tarski developed the so-called algebraic and topological frameworks for the Intuitionistic Logic and the Lewis modal system. In this paper, we present an outline of modern systems with a topological tinge. We consider topological interpretation of basic systems GL and G of the provability logic in terms of the Cantor derivative and the Hausdorff residue.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   21 citations  
  8.  24
    Questions and Dependency in Intuitionistic Logic.Ivano Ciardelli, Rosalie Iemhoff & Fan Yang - 2020 - Notre Dame Journal of Formal Logic 61 (1):75-115.
    In recent years, the logic of questions and dependencies has been investigated in the closely related frameworks of inquisitive logic and dependence logic. These investigations have assumed classical logic as the background logic of statements, and added formulas expressing questions and dependencies to this classical core. In this paper, we broaden the scope of these investigations by studying questions and dependency in the context of intuitionistic logic. We propose an intuitionistic team semantics, (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  9.  31
    Dual-Intuitionistic Logic.Igor Urbas - 1996 - Notre Dame Journal of Formal Logic 37 (3):440-451.
    The sequent system LDJ is formulated using the same connectives as Gentzen's intuitionistic sequent system LJ, but is dual in the following sense: (i) whereas LJ is singular in the consequent, LDJ is singular in the antecedent; (ii) whereas LJ has the same sentential counter-theorems as classical LK but not the same theorems, LDJ has the same sentential theorems as LK but not the same counter-theorems. In particular, LDJ does not reject all contradictions and is accordingly paraconsistent. To obtain (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   38 citations  
  10.  61
    Bi-Simulating in Bi-Intuitionistic Logic.Guillermo Badia - 2016 - Studia Logica 104 (5):1037-1050.
    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 (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  11. Intuitionistic Logic.Dirk van Dalen - 2002 - In D. M. Gabbay & F. Guenthner (eds.), ¸ Itegabbay2002. Kluwer Academic Publishers. pp. 1-115.
     
    Export citation  
     
    Bookmark   50 citations  
  12.  22
    Semi-Intuitionistic Logic with Strong Negation.Juan Manuel Cornejo & Ignacio Viglizzo - 2018 - Studia Logica 106 (2):281-293.
    Motivated by the definition of semi-Nelson algebras, a propositional calculus called semi-intuitionistic logic with strong negation is introduced and proved to be complete with respect to that class of algebras. An axiomatic extension is proved to have as algebraic semantics the class of Nelson algebras.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  13.  49
    A Semantic Hierarchy for Intuitionistic Logic.Guram Bezhanishvili & Wesley H. Holliday - 2019 - Indagationes Mathematicae 30 (3):403-469.
    Brouwer's views on the foundations of mathematics have inspired the study of intuitionistic logic, including the study of the intuitionistic propositional calculus and its extensions. The theory of these systems has become an independent branch of logic with connections to lattice theory, topology, modal logic and other areas. This paper aims to present a modern account of semantics for intuitionistic propositional systems. The guiding idea is that of a hierarchy of semantics, organized by increasing (...)
    Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  14.  28
    Intuitionistic Logic According to Dijkstra's Calculus of Equational Deduction.Jaime Bohórquez V. - 2008 - Notre Dame Journal of Formal Logic 49 (4):361-384.
    Dijkstra and Scholten have proposed a formalization of classical predicate logic on a novel deductive system as an alternative to Hilbert's style of proof and Gentzen's deductive systems. In this context we call it CED (Calculus of Equational Deduction). This deductive method promotes logical equivalence over implication and shows that there are easy ways to prove predicate formulas without the introduction of hypotheses or metamathematical tools such as the deduction theorem. Moreover, syntactic considerations (in Dijkstra's words, "letting the symbols (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  15.  92
    Intuitionistic Logic and Elementary Rules.Lloyd Humberstone & David Makinson - 2011 - Mind 120 (480):1035-1051.
    The interplay of introduction and elimination rules for propositional connectives is often seen as suggesting a distinguished role for intuitionistic logic. We prove three formal results concerning intuitionistic propositional logic that bear on that perspective, and discuss their significance. First, for a range of connectives including both negation and the falsum, there are no classically or intuitionistically correct introduction rules. Second, irrespective of the choice of negation or the falsum as a primitive connective, classical and (...) consequence satisfy exactly the same structural, introduction, and elimination (briefly, elementary) rules. Third, for falsum as primitive only, intuitionistic consequence is the least consequence relation that satisfies all classically correct elementary rules. (shrink)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  16.  16
    On Some Semi-Intuitionistic Logics.Juan M. Cornejo & Ignacio D. Viglizzo - 2015 - Studia Logica 103 (2):303-344.
    Semi-intuitionistic logic is the logic counterpart to semi-Heyting algebras, which were defined by H. P. Sankappanavar as a generalization of Heyting algebras. We present a new, more streamlined set of axioms for semi-intuitionistic logic, which we prove translationally equivalent to the original one. We then study some formulas that define a semi-Heyting implication, and specialize this study to the case in which the formulas use only the lattice operators and the intuitionistic implication. We prove (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  17. Intuitionistic Logic as Epistemic Logic.Jaakko Hintikka - 2001 - Synthese 127 (1-2):7 - 19.
    In the present day and age, it seems that every constructivist philosopher of mathematics and her brother wants to be known as an intuitionist. In this paper, It will be shown that such a self-identification is in most cases mistaken. For one thing, not any old (or new) constructivism is intuitionism because not any old relevant construction is carried out mentally in intuition, as Brouwer envisaged. (edited).
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  18.  4
    Intuitionistic Logic Model Theory and Forcing.F. R. Drake - 1971 - Journal of Symbolic Logic 36 (1):166-167.
    Direct download  
     
    Export citation  
     
    Bookmark   32 citations  
  19. On an Intuitionistic Logic for Pragmatics.Gianluigi Bellin, Massimiliano Carrara & Daniele Chiffi - 2018 - Journal of Logic and Computation 50 (28):935–966..
    We reconsider the pragmatic interpretation of intuitionistic logic [21] regarded as a logic of assertions and their justi cations and its relations with classical logic. We recall an extension of this approach to a logic dealing with assertions and obligations, related by a notion of causal implication [14, 45]. We focus on the extension to co-intuitionistic logic, seen as a logic of hypotheses [8, 9, 13] and on polarized bi-intuitionistic logic (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  20. The Philosophical Basis of Intuitionistic Logic.Michael Dummett - 1975 - In Truth and Other Enigmas. Cambridge: Harvard UP. pp. 215--247.
    Direct download  
     
    Export citation  
     
    Bookmark   156 citations  
  21. Intuitionistic Logic and Elementary Rules.Ian Humberstone & David Makinson - 2011 - Mind 120:1035-1051.
    The interplay of introduction and elimination rules for propositional connectives is often seen as suggesting a distinguished role for intuitionistic logic. We prove three formal results about intuitionistic propositional logic that bear on that perspective, and discuss their significance.
     
    Export citation  
     
    Bookmark   2 citations  
  22. From Intuitionistic Logic to Dynamic Operational Quantum Logic.Sonja Smets - 2006 - Poznan Studies in the Philosophy of the Sciences and the Humanities 91 (1):257-275.
    Research within the operational approach to the logical foundations of physics has recently pointed out a new perspective in which quantum logic can be viewed as an intuitionistic logic with an additional operator to capture its essential, i.e., non-distributive, properties. In this paper we will offer an introduction to this approach. We will focus further on why quantum logic has an inherent dynamic nature which is captured in the meaning of "orthomodularity" and on how it motivates (...)
     
    Export citation  
     
    Bookmark   4 citations  
  23.  10
    Intuitionistic Logic and Implicit Definability.Larisa Maksimova - 2000 - Annals of Pure and Applied Logic 105 (1-3):83-102.
    It is proved that there are exactly 16 superintuitionistic propositional logics with the projective Beth property. These logics are finitely axiomatizable and have the finite model property. Simultaneously, all varieties of Heyting algebras with strong epimorphisms surjectivity are found.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   14 citations  
  24.  8
    A Short Introduction to Intuitionistic Logic.G. E. Mint͡s - 2000 - Kluwer Academic / Plenum Publishers.
    Intuitionistic logic is presented here as part of familiar classical logic which allows mechanical extraction of programs from proofs. to make the material more accessible, basic techniques are presented first for propositional logic; Part II contains extensions to predicate logic. This material provides an introduction and a safe background for reading research literature in logic and computer science as well as advanced monographs. Readers are assumed to be familiar with basic notions of first order (...)
    Direct download  
     
    Export citation  
     
    Bookmark   8 citations  
  25.  45
    New Intuitionistic Logical Constants and Novikov Completeness.Alexander Yashin - 1999 - Studia Logica 63 (2):151-180.
    Extending the language of the intuitionistic propositional logic Int with additional logical constants, we construct a wide family of extensions of Int with the following properties: (a) every member of this family is a maximal conservative extension of Int; (b) additional constants are independent in each of them.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  26.  12
    Intuitionistic Logic As Epistemic Logic.Jaakko Hintikka - 2001 - Synthese 127 (1):7-19.
  27. Semantical Analysis of Intuitionistic Logic I.Saul A. Kripke - 1963 - In Michael Dummett & J. N. Crossley (eds.), Formal Systems and Recursive Functions: Proceedings of the Eighth Logic Colloquium, Oxford July 1963. North Holland. pp. 92-130.
  28.  24
    A Note on Dual-Intuitionistic Logic.Norihiro Kamide - 2003 - Mathematical Logic Quarterly 49 (5):519.
    Dual-intuitionistic logics are logics proposed by Czermak , Goodman and Urbas . It is shown in this paper that there is a correspondence between Goodman's dual-intuitionistic logic and Nelson's constructive logic N−.
    Direct download  
     
    Export citation  
     
    Bookmark   8 citations  
  29.  23
    Multimodal and Intuitionistic Logics in Simple Type Theory.Christoph Benzmueller & Lawrence Paulson - 2010 - Logic Journal of the IGPL 18 (6):881-892.
    We study straightforward embeddings of propositional normal multimodal logic and propositional intuitionistic logic in simple type theory. The correctness of these embeddings is easily shown. We give examples to demonstrate that these embeddings provide an effective framework for computational investigations of various non-classical logics. We report some experiments using the higher-order automated theorem prover LEO-II.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  30.  70
    Natural Deduction for Dual-Intuitionistic Logic.Luca Tranchini - 2012 - Studia Logica 100 (3):631-648.
    We present a natural deduction system for dual-intuitionistic logic. Its distinctive feature is that it is a single-premise multiple-conclusions system. Its relationships with the natural deduction systems for intuitionistic and classical logic are discussed.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  31.  17
    Infinitary Intuitionistic Logic From a Classical Point of View.Mark E. Nadel - 1978 - Annals of Mathematical Logic 14 (2):159-191.
  32.  93
    The Information in Intuitionistic Logic.Johan Benthem - 2009 - Synthese 167 (2):251-270.
    Issues about information spring up wherever one scratches the surface of logic. Here is a case that raises delicate issues of 'factual' versus 'procedural' information, or 'statics' versus 'dynamics'. What does intuitionistic logic, perhaps the earliest source of informational and procedural thinking in contemporary logic, really tell us about information? How does its view relate to its 'cousin' epistemic logic? We discuss connections between intuitionistic models and recent protocol models for dynamic-epistemic logic, as (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  33.  78
    Syntactic Interpolation for Tense Logics and Bi-Intuitionistic Logic Via Nested Sequents.Tim Lyon, Alwen Tiu, Rajeev Gore & Ranald Clouston - 2020 - In Maribel Fernandez & Anca Muscholl (eds.), 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Dagstuhl, Germany: pp. 1-16.
    We provide a direct method for proving Craig interpolation for a range of modal and intuitionistic logics, including those containing a "converse" modality. We demonstrate this method for classical tense logic, its extensions with path axioms, and for bi-intuitionistic logic. These logics do not have straightforward formalisations in the traditional Gentzen-style sequent calculus, but have all been shown to have cut-free nested sequent calculi. The proof of the interpolation theorem uses these calculi and is purely syntactic, (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  34.  51
    Unification in Intuitionistic Logic.Silvio Ghilardi - 1999 - Journal of Symbolic Logic 64 (2):859-880.
    We show that the variety of Heyting algebras has finitary unification type. We also show that the subvariety obtained by adding it De Morgan law is the biggest variety of Heyting algebras having unitary unification type. Proofs make essential use of suitable characterizations (both from the semantic and the syntactic side) of finitely presented projective algebras.
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   54 citations  
  35.  26
    ∈ I : An Intuitionistic Logic Without Fregean Axiom and with Predicates for Truth and Falsity.Steffen Lewitzka - 2009 - Notre Dame Journal of Formal Logic 50 (3):275-301.
    We present $\in_I$-Logic (Epsilon-I-Logic), a non-Fregean intuitionistic logic with a truth predicate and a falsity predicate as intuitionistic negation. $\in_I$ is an extension and intuitionistic generalization of the classical logic $\in_T$ (without quantifiers) designed by Sträter as a theory of truth with propositional self-reference. The intensional semantics of $\in_T$ offers a new solution to semantic paradoxes. In the present paper we introduce an intuitionistic semantics and study some semantic notions in this broader (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  36.  14
    A Probabilistic Extension of Intuitionistic Logic.Z. Ognjanovic & Z. Markovic - 2003 - Mathematical Logic Quarterly 49 (4):415.
    We introduce a probabilistic extension of propositional intuitionistic logic. The logic allows making statements such as P≥sα, with the intended meaning “the probability of truthfulness of α is at least s”. We describe the corresponding class of models, which are Kripke models with a naturally arising notion of probability, and give a sound and complete infinitary axiomatic system. We prove that the logic is decidable.
    Direct download  
     
    Export citation  
     
    Bookmark   5 citations  
  37.  8
    Intuitionistic Logic According to Dijkstra's Calculus of Equational Deduction.Jaime Bohórquez - 2008 - Notre Dame Journal of Formal Logic 49 (4):361-384.
    Dijkstra and Scholten have proposed a formalization of classical predicate logic on a novel deductive system as an alternative to Hilbert's style of proof and Gentzen's deductive systems. In this context we call it CED . This deductive method promotes logical equivalence over implication and shows that there are easy ways to prove predicate formulas without the introduction of hypotheses or metamathematical tools such as the deduction theorem. Moreover, syntactic considerations have led to the "calculational style," an impressive array (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  38.  88
    Normalisation and Subformula Property for a System of Intuitionistic Logic with General Introduction and Elimination Rules.Nils Kürbis - 2021 - Synthese 199 (5-6):14223-14248.
    This paper studies a formalisation of intuitionistic logic by Negri and von Plato which has general introduction and elimination rules. The philosophical importance of the system is expounded. Definitions of ‘maximal formula’, ‘segment’ and ‘maximal segment’ suitable to the system are formulated and corresponding reduction procedures for maximal formulas and permutative reduction procedures for maximal segments given. Alternatives to the main method used are also considered. It is shown that deductions in the system convert into normal form and (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  39.  44
    Decidability of Quantified Propositional Intuitionistic Logic and S4 on Trees of Height and Arity ≤Ω.Richard Zach - 2004 - Journal of Philosophical Logic 33 (2):155-164.
    Quantified propositional intuitionistic logic is obtained from propositional intuitionistic logic by adding quantifiers ∀p, ∃p, where the propositional variables range over upward-closed subsets of the set of worlds in a Kripke structure. If the permitted accessibility relations are arbitrary partial orders, the resulting logic is known to be recursively isomorphic to full second-order logic (Kremer, 1997). It is shown that if the Kripke structures are restricted to trees of at height and width at most (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  40.  15
    Stable Formulas in Intuitionistic Logic.Nick Bezhanishvili & Dick de Jongh - 2018 - Notre Dame Journal of Formal Logic 59 (3):307-324.
    In 1995 Visser, van Benthem, de Jongh, and Renardel de Lavalette introduced NNIL-formulas, showing that these are exactly the formulas preserved under taking submodels of Kripke models. In this article we show that NNIL-formulas are up to frame equivalence the formulas preserved under taking subframes of frames, that NNIL-formulas are subframe formulas, and that subframe logics can be axiomatized by NNIL-formulas. We also define a new syntactic class of ONNILLI-formulas. We show that these are the formulas preserved in monotonic images (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  41.  65
    On the Correspondence Between Nested Calculi and Semantic Systems for Intuitionistic Logics.Tim Lyon - 2021 - Journal of Logic and Computation 31 (1):213-265.
    This paper studies the relationship between labelled and nested calculi for propositional intuitionistic logic, first-order intuitionistic logic with non-constant domains and first-order intuitionistic logic with constant domains. It is shown that Fitting’s nested calculi naturally arise from their corresponding labelled calculi—for each of the aforementioned logics—via the elimination of structural rules in labelled derivations. The translational correspondence between the two types of systems is leveraged to show that the nested calculi inherit proof-theoretic properties from (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  42.  27
    Intuitionistic Logic Freed of All Metarules.Giovanna Corsi & Gabriele Tassi - 2007 - Journal of Symbolic Logic 72 (4):1204 - 1218.
    In this paper we present two calculi for intuitionistic logic. The first one, IG, is characterized by the fact that every proof-search terminates and termination is reached without jeopardizing the subformula property. As to the second one, SIC, proof-search terminates, the subformula property is preserved and moreover proof-search is performed without any recourse to metarules, in particular there is no need to back-track. As a consequence, proof-search in the calculus SIC is accomplished by a single tree as in (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  43.  17
    An Intuitionistic Logic for Preference Relations.Paolo Maffezioli & Alberto Naibo - 2019 - Logic Journal of the IGPL 27 (4):434-450.
    We investigate in intuitionistic first-order logic various principles of preference relations alternative to the standard ones based on the transitivity and completeness of weak preference. In particular, we suggest two ways in which completeness can be formulated while remaining faithful to the spirit of constructive reasoning, and we prove that the cotransitivity of the strict preference relation is a valid intuitionistic alternative to the transitivity of weak preference. Along the way, we also show that the acyclicity axiom (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  44.  17
    Quantified Intuitionistic Logic Over Metrizable Spaces.Philip Kremer - 2019 - Review of Symbolic Logic 12 (3):405-425.
    In the topological semantics, quantified intuitionistic logic, QH, is known to be strongly complete not only for the class of all topological spaces but also for some particular topological spaces — for example, for the irrational line, ${\Bbb P}$, and for the rational line, ${\Bbb Q}$, in each case with a constant countable domain for the quantifiers. Each of ${\Bbb P}$ and ${\Bbb Q}$ is a separable zero-dimensional dense-in-itself metrizable space. The main result of the current article generalizes (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  45.  50
    Intuitionist Logic — Subsystem of, Extension of, or Rival to, Classical Logic?Richard Sylvan - 1988 - Philosophical Studies 53 (1):147 - 151.
    Strictly speaking, intuitionistic logic is not a modal logic. There are, after all, no modal operators in the language. It is a subsystem of classical logic, not [like modal logic] an extension of it. But... (thus Fitting, p. 437, trying to justify inclusion of a large chapter on intuitionist logic in a book that is largely about modal logics).
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  46.  38
    Maximal Weakly-Intuitionistic Logics.A. M. Sette & Walter A. Carnielli - 1995 - Studia Logica 55 (1):181 - 203.
    This article introduces the three-valuedweakly-intuitionistic logicI 1 as a counterpart of theparaconsistent calculusP 1 studied in [11].I 1 is shown to be complete with respect to certainthree-valued matrices. We also show that in the sense that any proper extension ofI 1 collapses to classical logic.The second part shows thatI 1 is algebraizable in the sense of Block and Pigozzi (cf. [2]) in a way very similar to the algebraization ofP 1 given in [8].
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   21 citations  
  47. Intuitionistic Logic and its Philosophy.Panu Raatikainen - 2013 - Al-Mukhatabat. A Trilingual Journal For Logic, Epistemology and Analytical Philosophy (6):114-127.
  48.  45
    Reference and Perspective in Intuitionistic Logics.John Nolt - 2006 - Journal of Logic, Language and Information 16 (1):91-115.
    What an intuitionist may refer to with respect to a given epistemic state depends not only on that epistemic state itself but on whether it is viewed concurrently from within, in the hindsight of some later state, or ideally from a standpoint “beyond” all epistemic states (though the latter perspective is no longer strictly intuitionistic). Each of these three perspectives has a different—and, in the last two cases, a novel—logic and semantics. This paper explains these logics and their (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  49.  6
    Note on the Intuitionistic Logic of False Belief.Tomasz Witczak - 2022 - Bulletin of the Section of Logic 51 (1):57-71.
    In this paper we analyse logic of false belief in the intuitionistic setting. This logic, studied in its classical version by Steinsvold, Fan, Gilbert and Venturi, describes the following situation: a formula $\varphi$ is not satisfied in a given world, but we still believe in it. Another interpretations are also possible: e.g. that we do not accept $\varphi$ but it is imposed on us by a kind of council or advisory board. From the mathematical point of view, (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  50. On Deriving Nested Calculi for Intuitionistic Logics From Semantic Systems.Tim Lyon - 2020 - In Sergei Artemov & Anil Nerode (eds.), Logical Foundations of Computer Science. Cham: pp. 177-194.
    This paper shows how to derive nested calculi from labelled calculi for propositional intuitionistic logic and first-order intuitionistic logic with constant domains, thus connecting the general results for labelled calculi with the more refined formalism of nested sequents. The extraction of nested calculi from labelled calculi obtains via considerations pertaining to the elimination of structural rules in labelled derivations. Each aspect of the extraction process is motivated and detailed, showing that each nested calculus inherits favorable proof-theoretic (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
1 — 50 / 1000