This paper investigates partitions of lattices of modal logics based on superintuitionistic logics which are defined by forming, for each superintuitionistic logic L and classical modal logic , the set L[] of L-companions of . Here L[] consists of those modal logics whose non-modal fragments coincide with L and which axiomatize if the law of excluded middle p V p is added. Questions addressed are, for instance, whether there exist logics with the disjunction property in L[], whether L[] contains a (...) smallest element, and whether L[] contains lower covers of . Positive solutions as concerns the last question show that there are (uncountably many) superclean modal logics based on intuitionistic logic in the sense of Vakarelov [28]. Thus a number of problems stated in [28] are solved. As a technical tool the paper develops the splitting technique for lattices of modal logics based on superintuitionistic logics and ap plies duality theory from [34]. (shrink)

This paper investigates (modal) extensions of Heyting-Brouwer logic, i.e., the logic which results when the dual of implication (alias coimplication) is added to the language of intuitionistic logic. We first develop matrix as well as Kripke style semantics for those logics. Then, by extending the Gö;del-embedding of intuitionistic logic into S4, it is shown that all (modal) extensions of Heyting-Brouwer logic can be embedded into tense logics (with additional modal operators). An extension of the Blok-Esakia-Theorem is proved for this embedding.

We present three examples of topological semantics for intuitionistic modal logic with one modal operator □. We show that it is possible to treat neighborhood models, introduced earlier, as topological or multi-topological. From the neighborhood point of view, our method is based on differences between properties of minimal and maximal neighborhoods. Also we propose transformation of multitopological spaces into the neighborhood structures.

This is the first paper on constructive concurrent dynamic logic . For the first time, either for concurrent or sequential dynamic logic, we give a satisfactory treatment of what statements are forced to be true by partial information about the underlying computer. Dynamic logic was developed by Pratt [V. Pratt, Semantical considerations on Floyd–Hoare logic, in: 17th Annual IEEE Symp. on Found. Comp. Sci., New York, 1976, pp. 109–121, V. Pratt, Applications of modal logic to programming, Studia Logica 39 257–274] (...) for nondeterministic sequential programs, and by Peleg [D. Peleg, Concurrent dynamic logic, Journal of the Association for Computing Machinery 34 , D. Peleg, Communication in concurrent dynamic logic, Journal of Computer and System Sciences 35 ] for concurrent programs, for the purpose of proving properties of programs such as correctness. Here we define what it means for a dynamic logic formula to be forced to be true knowing only partial information about the results of assignments and tests. This informal CCDL semantics is formalized by intuitionistic Kripke frames modeling this partial information, and each such frame is interpreted as an idealized concurrent machine . In CCDL, proofs and deductions are ω-height, ω-branching, well-founded labeled subtrees of ωω. These are a generalization of the signed tableaux of Nerode [A. Nerode, Some lectures in modal logic, Technical Report, M.S.I. Cornell University, 1989, CIME Logic and Computer Science Montecatini Volume, Springer-Verlag Lecture Notes, 1990, A. Nerode, Some lectures in intuitionistic logic, Technical Report, M.S.I. Cornell University, 1988, Marktoberdorf Logic and Computation NATO Summer School Volume, NATO Science Series, 1990 ] stemming from the prefix tableaux of Fitting [M.C. Fitting, Proof Methods for Modal and Intuitionistic Logic, Reidel, 1983]. We demonstrate the correctness of our tableau proofs, define consistency properties, prove that consistency properties yield models, construct systematic tableaux, prove that systematic tableaux yield a consistency property, and conclude that CCDL is complete. This infinitary semantics and proof procedure will be the primary guide for defining, in a sequel, the correct finitary CCDL based on induction principles. FCCDL is suitable for implementation in constructive logic software systems such as Constable’s NUPRL or Huet-Coquand’s CONSTRUCTIONS. Our goal is to develop a constructive logic programming tool for specification and modular verification of programs in any imperative concurrent language, and for the extraction of concurrent programs from constructive proofs. Subsequent papers will introduce analogous logics for declarative and functional concurrent languages. (shrink)

We often have to draw conclusions about states of machines in computer science and about states of knowledge and belief in artificial intelligence based on partial information. Nerode suggested using constructive logic as the language to express such deductions and also suggested designing appropriate intuitionistic Kripke frames to express the partial information. Following this program, Nerode and Wijesekera developed syntax, semantics and completeness for a system of intuitionistic dynamic logic for proving properties of concurrent programs. Like all dynamics logics, this (...) was a logic of many modalities, each expressing a program, but in intuitionistic rather than in classical logic. In that logic, both box and diamond are needed, but these two are not intuitionistically interdefinable and, worse, diamond does not distribute over ‘or’, except for sequential programs. This also happens in other contemplated computer science and AI applications, and leads outside the class of constructive logics investigated in the literature. The present paper fills this gap. We provide intuitionistic logics with independent box and diamond without assuming distribution of diamond over ‘or’. The completeness theorem is based on intuitionistic Kripke frames , but equipped with an additional, quite separate accessibility relation between worlds. In the interpretation of Nerode and Wijesekera , worlds under the partial order represent states of partial knowledge, the accessibility represents change in state of partial knowledge resulting from executing a specific program. But there are many other computer science interpretations. This formalism covers all computer science applications of which we are aware. We also give a cut elimination theorem and algebraic and topological formulations, since these present some new difficulties. Finally, these results were obtained prior to those in Nerode and Wijesekera. (shrink)

Conditional logics have traditionally been intended to formalize various intuitively correct modes of reasoning involving conditional expressions in natural language. Although conditional logics have by now been thoroughly studied in a classical context, they have yet to be systematically examined in an intuitionistic context, despite compelling philosophical and technical reasons to do so. This paper addresses this gap by thoroughly examining the basic intuitionistic conditional logic ICK, the intuitionistic counterpart of Chellas’ important classical system CK. I give ICK both worlds (...) semantics and algebraic semantics, and prove that these are equivalent. I give a Gödel-type embedding of ICK into CK and a Glivenko-type embedding of CK into ICK. I axiomatize ICK and prove soundness, completeness, and decidability results. Finally, I discuss extending ICK. (shrink)

The knowability paradox is an instance of a remarkable reasoning pattern (actually, a pair of such patterns), in the course of which an occurrence of the possibility operator, the diamond, disappears. In the present paper, it is pointed out how the unwanted disappearance of the diamond may be escaped. The emphasis is not laid on a discussion of the contentious premise of the knowability paradox, namely that all truths are possibly known, but on how from this assumption the conclusion is (...) derived that all truths are, in fact, known. Nevertheless, the solution offered is in the spirit of the constructivist attitude usually maintained by defenders of the anti-realist premise. In order to avoid the paradoxical reasoning, a paraconsistent constructive relevant modal epistemic logic with strong negation is defined semantically. The system is axiomatized and shown to be complete. (shrink)

There appears to be few, if any, limits on what sorts of logical connectives can be added to a given logic. One source of potential limitations is the motivating ideology associated with a logic. While extraneous to the logic, the motivating ideology is often important for the development of formal and philosophical work on that logic, as is the case with intuitionistic logic. One family of logics for which the philosophical ideology is important is the family of relevant logics. In (...) this paper, I explore the limits of what a relevant connective is, showing how some basic criteria motivated by the ideology of relevant logicians provide robust limits on potential connectives. These criteria provide some plausible necessary conditions on being a relevant connective. (shrink)

The paper provides a new semantics for positive modal logic using Kripke frames having a quasi ordering on the set of possible worlds and an accessibility relation connected to the quasi ordering by the conditions (1) that the composition of with is included in the composition of with and (2) the analogous for the inverse of and . This semantics has an advantage over the one used by Dunn in "Positive modal logic," Studia Logica (1995) and works fine for extensions (...) of the minimal system of normal positive modal logic. (shrink)

Combining non-classical (or sub-classical) logics is not easy, but it is very interesting. In this paper, we combine nonclassical logics of negation and possibility (in the presence of conjunction and disjunction), and then we combine the resulting systems with intuitionistic logic. We will find that Kracht's results on the undecidability of classical modal logics generalise to a non-classical setting. We will also see conditions under which intuitionistic logic can be combined with a non-intuitionistic negation without corrupting the intuitionistic fragment of (...) the logic. (shrink)

The present work is motivated by two questions. (1) What should an intuitionistic epistemic logic look like? (2) How should one interpret the knowledge operator in a Kripke-model for it? In what follows we outline an answer to (2) and give a model-theoretic definition of the operator K. This will shed some light also on (1), since it turns out that K, defined as we do, fulfills the properties of a necessity operator for a normal modal logic. The interest of (...) our construction also lies in a better insight into the intuitionistic solution to Fitch's paradox, which is discussed in the third section. In particular we examine, in the light of our definition, De Vidi and Solomon's proposal of formulating the verification thesis as Φ → ¬¬KΦ. We show, as our main result, that this definition excapes the paradox, though it is validated only under restrictive conditions on the models. (shrink)

In 1928 Ivan Orlov published a remarkable paper which contains the first formulation of a relevant logic. The paper remained largely unknown to English-speakers until this discovery of relevant log...

Anti-realist epistemic conceptions of truth imply what is called the knowability principle: All truths are possibly known. The principle can be formalized in a bimodal propositional logic, with an alethic modality ${\diamondsuit}$ and an epistemic modality ${\mathcal{K}}$, by the axiom scheme ${A \supset \diamondsuit \mathcal{K} A}$. The use of classical logic and minimal assumptions about the two modalities lead to the paradoxical conclusion that all truths are known, ${A \supset \mathcal{K} A}$. A Gentzen-style reconstruction of the Church–Fitch paradox is presented (...) following a labelled approach to sequent calculi. First, a cut-free system for classical bimodal logic is introduced as the logical basis for the Church–Fitch paradox and the relationships between ${\mathcal {K}}$ and ${\diamondsuit}$ are taken into account. Afterwards, by exploiting the structural properties of the system, in particular cut elimination, the semantic frame conditions that correspond to KP are determined and added in the form of a block of nonlogical inference rules. Within this new system for classical and intuitionistic “knowability logic”, it is possible to give a satisfactory cut-free reconstruction of the Church–Fitch derivation and to confirm that OP is only classically derivable, but neither intuitionistically derivable nor intuitionistically admissible. Finally, it is shown that in classical knowability logic, the Church–Fitch derivation is nothing else but a fallacy and does not represent a real threat for anti-realism. (shrink)

Intuitionistic modal logics are extensions of intuitionistic propositional logic with modal axioms. We treat with two modal languages ${\mathscr{L}}_\Diamond $ and $\mathscr{L}_{\Diamond,\Box }$ which extend the intuitionistic propositional language with $\Diamond $ and $\Diamond,\Box $, respectively. Gentzen sequent calculi are established for several intuitionistic modal logics. In particular, we introduce a Gentzen sequent calculus for the well-known intuitionistic modal logic $\textsf{MIPC}$. These sequent calculi admit cut elimination and subformula property. They are decidable.

A cut-free Gentzen sequent calculus for Ewald’s intuitionistic tense logic \ is established. By the proof-theoretic method, we prove that, for every set of strictly positive implications S, the classical tense logic \ is embedded into its intuitionistic analogue \ via Kolmogorov, Gödel–Genzten and Kuroda translations respectively. A sufficient and necessary condition for Glivenko type theorem in tense logics is established.

The abstract status of Kant's account of his ‘general logic’ is explained in comparison with Gödel's general definition of a formal logical system and reflections on ‘abstract’ (‘absolute’) concepts. Thereafter, an informal reconstruction of Kant's general logic is given from the aspect of the principles of contradiction, of sufficient reason, and of excluded middle. It is shown that Kant's composition of logic consists in a gradual strengthening of logical principles, starting from a weak principle of contradiction that tolerates a sort (...) of contradictions in predication, and then proceeding to the (constructive) principle of sufficient reason, and to a classical-like logic, which includes the principle of excluded middle. A first-order formalisation is applied to this reconstruction, which reveals implicit modalities in Kant's account of logic, and confirms the implementability of Kant's logic into a sound and complete formal system. (shrink)

This is Part 1 of a paper on fibred semantics and combination of logics. It aims to present a methodology for combining arbitrary logical systems L i , i ∈ I, to form a new system L I . The methodology `fibres' the semantics K i of L i into a semantics for L I , and `weaves' the proof theory (axiomatics) of L i into a proof system of L I . There are various ways of doing this, we (...) distinguish by different names such as `fibring', `dovetailing' etc, yielding different systems, denoted by L F I , L D I etc. Once the logics are `weaved', further `interaction' axioms can be geometrically motivated and added, and then systematically studied. The methodology is general and is applied to modal and intuitionistic logics as well as to general algebraic logics. We obtain general results on bulk, in the sense that we develop standard combining techniques and refinements which can be applied to any family of initial logics to obtain further combined logics. The main results of this paper is a construction for combining arbitrary, (possibly not normal) modal or intermediate logics, each complete for a class of (not necessarily frame) Kripke models. We show transfer of recursive axiomatisability, decidability and finite model property. Some results on combining logics (normal modal extensions of K) have recently been introduced by Kracht and Wolter, Goranko and Passy and by Fine and Schurz as well as a multitude of special combined systems existing in the literature of the past 20-30 years. We hope our methodology will help organise the field systematically. (shrink)

The object of this paper is to make a study of four systems of modal logic (S4, S5, and their intuitionistic analogues IM4 and IM5) with the techniques of the theory of abstract logics set up by Suszko, Bloom, Brown, Verdú and others. The abstract concepts corresponding to such systems are defined as generalizations of the logics naturally associated to their algebraic models (topological Boolean or Heyting algebras, general or semisimple). By considering new suitably defined connectives and by distinguishing between (...) having the rule of necessitation only for theorems or as a full inference rule (which amounts to dealing with all filters or with open filters of the algebras) we are able to reduce the study of a modal (abstract) logic L to that of two nonmodal logics L - and L + associated with L. We find that L is "of IM4 type" if and only if L - and L + are both intuitionistic and have the same theorems, and logics of type S4, IM5 or S5 are obtained from those of type IM4 simply by making classical L -, L + or both. We compare this situation with that found in recent approaches to intuitionistic modal logic using birelational models or using higher-level sequent-systems. The treatment of modal systems with abstract logics is rather new, and in our way to it we find several general constructions and results which can also be applied to other modal systems weaker than those we study in detail. (shrink)

We develop a general theory of FDE-based modal logics. Our framework takes into account the four-valued nature of FDE by considering four partially defined modal operators corresponding to conditions for verifying and falsifying modal necessity and possibility operators. The theory comes with a uniform characterization for all obtained systems in terms of FDE-style formula-formula sequents. We also develop some correspondence theory and show how Hilbert-style axiom systems can be obtained in appropriate cases. Finally, we outline how different systems from the (...) literature can be expressed in our framework. (shrink)

This paper, a sequel to Models for normal intuitionistic modal logics by M. Boi and the author, which dealt with intuitionistic analogues of the modal system K, deals similarly with intuitionistic analogues of systems stronger than K, and, in particular, analogues of S4 and S5. For these prepositional logics Kripke-style models with two accessibility relations, one intuitionistic and the other modal, are given, and soundness and completeness are proved with respect to these models. It is shown how the holding of (...) formulae characteristic for particular logics is equivalent to conditions for the relations of the models. Modalities in these logics are also investigated. (shrink)

A Hilbert algebra with supremum is a Hilbert algebra where the associated order is a join-semilattice. This class of algebras is a variety and was studied in Celani and Montangie . In this paper we shall introduce and study the variety of $${H_{\Diamond}^{\vee}}$$ H ◊ ∨ -algebras, which are Hilbert algebras with supremum endowed with a modal operator $${\Diamond}$$ ◊ . We give a topological representation for these algebras using the topological spectral-like representation for Hilbert algebras with supremum given in (...) Celani and Montangie . We will consider some particular varieties of $${H_{\Diamond}^{\vee}}$$ H ◊ ∨ -algebras. These varieties are the algebraic counterpart of extensions of the implicative fragment of the intuitionistic modal logic $${\mathbf{IntK}_{\Diamond}}$$ IntK ◊ . We also determine the congruences of $${H_{\Diamond}^{\vee}}$$ H ◊ ∨ -algebras in terms of certain closed subsets of the associated space, and in terms of a particular class of deductive systems. These results enable us to characterize the simple and subdirectly irreducible $${H_{\Diamond}^{\vee }}$$ H ◊ ∨ -algebras. (shrink)

We prove strong completeness of the □-version and the ◊-version of a Gödel modal logic based on Kripke models where propositions at each world and the accessibility relation are both infinitely valued in the standard Gödel algebra [0,1]. Some asymmetries are revealed: validity in the first logic is reducible to the class of frames having two-valued accessibility relation and this logic does not enjoy the finite model property, while validity in the second logic requires truly fuzzy accessibility relations and this (...) logic has the finite model property. Analogues of the classical modal systems D, T, S4 and S5 are considered also, and the completeness results are extended to languages enriched with a discrete well ordered set of truth constants. (shrink)

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 well as more general issues that emerge.

Justification Logic provides an axiomatic description of justifications and delegates the question of their nature to semantics. In this note, we address the conceptual issue of the logical type of justifications: we argue that justifications in the logical setting are naturally interpreted as sets of formulas which leads to a class of epistemic models that we call modular models . We show that Fitting models for Justification Logic naturally encode modular models and can be regarded as convenient pre-models of the (...) former. (shrink)

This book explores the interplay between logic and science, describing new trends, new issues and potential research developments.

It is a classic result in lattice theory that a poset is a complete lattice iff it can be realized as fixpoints of a closure operator on a powerset. Dragalin [9,10] observed that a poset is a locale (complete Heyting algebra) iff it can be realized as fixpoints of a nucleus on the locale of upsets of a poset. He also showed how to generate a nucleus on upsets by adding a structure of “paths” to a poset, forming what we (...) call a Dragalin frame. This allowed Dragalin to introduce a semantics for intuitionistic logic that generalizes Beth and Kripke semantics. He proved that every spatial locale (locale of open sets of a topological space) can be realized as fixpoints of the nucleus generated by a Dragalin frame. In this paper, we strengthen Dragalin’s result and prove that every locale—not only spatial locales—can be realized as fixpoints of the nucleus generated by a Dragalin frame. In fact, we prove the stronger result that for every nucleus on the upsets of a poset, there is a Dragalin frame based on that poset that generates the given nucleus. We then compare Dragalin’s approach to generating nuclei with the relational approach of Fairtlough and Mendler [11], based on what we call FM-frames. Surprisingly, every Dragalin frame can be turned into an equivalent FM-frame, albeit on a different poset. Thus, every locale can be realized as fixpoints of the nucleus generated by an FM-frame. Finally, we consider the relational approach of Goldblatt [13] and characterize the locales that can be realized using Goldblatt frames. (shrink)