In this paper we find an algebraic equivalent of the Hallden property in modal logics, namely, we prove that the Hallden-completeness in any normal modal logic is equivalent to the so-called super-embedding property of a suitable class of modal algebras. The joint embedding property of a class of algebras is equivalent to the Pseudo-Relevance Property. We consider connections of the above-mentioned properties with interpolation and amalgamation. Also an algebraic equivalent of of the principle of variable separation in superintuitionistic logics will (...) be found. (shrink)

All extensions of the modal Grzegorczyk logic Grz possessing projective Beth's property PB2 are described. It is proved that there are exactly 13 logics over Grz with PB2. All of them are finitely axiomatizable and have the finite model property. It is shown that PB2 is strongly decidable over Grz, i.e. there is an algorithm which, for any finite system Rul of additional axiom schemes and rules of inference, decides if the calculus Grz+Rul has the projective Beth property.

In a previous paper [ 21 ] all extensions of Johansson’s minimal logic J with the weak interpolation property WIP were described. It was proved that WIP is decidable over J. It turned out that the weak interpolation problem in extensions of J is reducible to the same problem over a logic Gl, which arises from J by adding tertium non datur. In this paper we consider extensions of the logic Gl. We prove that only finitely many logics over Gl (...) have the Craig interpolation property CIP, the restricted interpolation property IPR or the projective Beth property PBP. The full list of Gl-logics with the mentioned properties is found, and their description is given. We note that IPR and PBP are equivalent over Gl. It is proved that CIP, IPR and PBP are decidable over the logic Gl. (shrink)

Algebraic approach to study of classical and non-classical logical calculi was developed and systematically presented by Helena Rasiowa in [48], [47]. It is very fruitful in investigation of non-classical logics because it makes possible to study large families of logics in an uniform way. In such research one can replace logics with suitable classes of algebras and apply powerful machinery of universal algebra. In this paper we present an overview of results on interpolation and definability in modal and positive logics,and (...) also in extensions of Johansson's minimal logic. All these logics are strongly complete under algebraic semantics. It allows to combine syntactic methods with studying varieties of algebras and to flnd algebraic equivalents for interpolation and related properties. Moreover, we give exhaustive solution to interpolation and some related problems for many families of propositional logics and calculi. (shrink)

Let $\scr{T}$ be the first order theory of diagonalizable algebras. We define a bijection φ from the atomic formulas of $\scr{T}$ (identities) to the open formulas of $\scr{T}$ . φ is an algebraic analogous of $\vDash $ . We prove that φ, $\phi ^{-1}$ preserve the validity.

LetL be one of the intuitionistic modal logics considered in [7] (or one of its extensions) and letM L be the “algebraic semantics” ofL. In this paper we will extend toL the equivalence, proved in the classical case (see [6]), among he weak Craig interpolation theorem, the Robinson theorem and the amalgamation property of varietyM L. We will also prove the equivalence between the Craig interpolation theorem and the super-amalgamation property of varietyM L. Then we obtain the Craig interpolation theorem (...) and Robinson theorem for two intuitionistic modal logics, one ofS 4-type and the other one ofS 5-type, showing the super-amalgamation property of the corresponding algebraic semantics. (shrink)

The aim of this paper is to present the method of Socratic proofs for seven modal propositional logics: K5, S4.2, S4.3, S4M, S4F, S4R and G. This work is an extension of [10] where the method was presented for the most common modal propositional logics: K, D, T, KB, K4, S4 and S5.

This paper presents Rasiowa–Sikorski deduction systems for logics \, \, \ and \. For each of the logics two systems are developed: an R–S system that can be supplemented with admissible cut rule, and a \-version of R–S system in which the non-admissible rule of cut is the only branching rule. The systems are presented in a Smullyan-like uniform notation, extended and adjusted to the aims of this paper. Completeness is proved by the use of abstract refutability properties which are (...) dual to consistency properties used by Fitting. Also the notion of admissibility of a rule in an R–S-system is analysed. (shrink)

This article introduces, studies, and applies a new system of logic which is called ‘HYPE’. In HYPE, formulas are evaluated at states that may exhibit truth value gaps and truth value gluts. Simple and natural semantic rules for negation and the conditional operator are formulated based on an incompatibility relation and a partial fusion operation on states. The semantics is worked out in formal and philosophical detail, and a sound and complete axiomatization is provided both for the propositional and the (...) predicate logic of the system. The propositional logic of HYPE is shown to contain first-degree entailment, to have the Finite Model Property, to be decidable, to have the Disjunction Property, and to extend intuitionistic propositional logic conservatively when intuitionistic negation is defined appropriately by HYPE’s logical connectives. Furthermore, HYPE’s first-order logic is a conservative extension of intuitionistic logic with the Constant Domain Axiom, when intuitionistic negation is again defined appropriately. The system allows for simple model constructions and intuitive Euler-Venn-like diagrams, and its logical structure matches structures well-known from ordinary mathematics, such as from optimization theory, combinatorics, and graph theory. HYPE may also be used as a general logical framework in which different systems of logic can be studied, compared, and combined. In particular, HYPE is found to relate in interesting ways to classical logic and various systems of relevance and paraconsistent logic, many-valued logic, and truthmaker semantics. On the philosophical side, if used as a logic for theories of type-free truth, HYPE is shown to address semantic paradoxes such as the Liar Paradox by extending non-classical fixed-point interpretations of truth by a conditional as well-behaved as that of intuitionistic logic. Finally, HYPE may be used as a background system for modal operators that create hyperintensional contexts, though the details of this application need to be left to follow-up work. (shrink)

We prove completeness of the propositional modal logic S 4 for the measure algebra based on the Lebesgue-measurable subsets of the unit interval, [0, 1]. In recent talks, Dana Scott introduced a new measure-based semantics for the standard propositional modal language with Boolean connectives and necessity and possibility operators, and . Propositional modal formulae are assigned to Lebesgue-measurable subsets of the real interval [0, 1], modulo sets of measure zero. Equivalence classes of Lebesgue-measurable subsets form a measure algebra, , and (...) we add to this a non-trivial interior operator constructed from the frame of ‘open’ elements—elements in with an open representative. We prove completeness of the modal logic S 4 for the algebra . A corollary to the main result is that non-theorems of S 4 can be falsified at each point in a subset of the real interval [0, 1] of measure arbitrarily close to 1. A second corollary is that Intuitionistic propositional logic (IPC) is complete for the frame of open elements in. (shrink)

This paper explores some variants and aspects of multi-quantificational criteria of existence, examining these in the context of the debate between monism and pluralism in analytical philosophy. Assuming familiarity with the findings to date, we seek to apply to these the newly introduced concepts of “substitution” and “substitutional model”. Possible applications of formal theories involving multiple types of existential quantifier are highlighted, together with their methods of construction. These considerations then lead to a thesis asserting the irrelevance of both multi-quantificational (...) criteria and assumptions involving quantificational ontology to the debate between monism and pluralism in ontology. Many quantifiers cannot properly distinguish different modes of existence–as we aim to show by furnishing a general method for constructing counter-examples to any theory that assumes that different types of existential quantifier correspond to different modes of existence. (shrink)

We analyse the proposition that the spacetime structure is modified at short distances or at high energies due to weakening of classical logic. The logic assigned to the regions of spacetime is intuitionistic logic of some topoi. Several cases of special topoi are considered. The quantum mechanical effects can be generated by such semi-classical spacetimes. The issues of: background independence and general relativity covariance, field theoretic renormalization of divergent expressions, the existence and definition of path integral measures, are briefly discussed (...) in the proposal. The connection with some problems in foundations of mathematics and differential topology are also discussed. (shrink)

The simplest bimodal combination of unimodal logics \ and \ is their fusion, \, axiomatized by the theorems of \ for \ and of \ for \, and the rules of modus ponens, necessitation for \ and for \, and substitution. Shehtman introduced the frame product \, as the logic of the products of certain Kripke frames: these logics are two-dimensional as well as bimodal. Van Benthem, Bezhanishvili, ten Cate and Sarenac transposed Shehtman’s idea to the topological semantics and introduced (...) the topological product \, as the logic of the products of certain topological spaces. For almost all well-studies logics, we have \, for example, \. Van Benthem et al. show, by contrast, that \. It is straightforward to define the product of a topological space and a frame: the result is a topologized frame, i.e., a set together with a topology and a binary relation. In this paper, we introduce topological-frame products \ of modal logics, providing a complete axiomatization of \, whenever \ is a Kripke complete Horn axiomatizable extension of the modal logic D: these extensions include \ and \, but not \ or \. We leave open the problem of axiomatizing \, \, and other related logics. When \, our result confirms a conjecture of van Benthem et al. concerning the logic of products of Alexandrov spaces with arbitrary topological spaces. (shrink)

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 (...) extensively studied, but much less is known about topological products. The goal of the current paper is to give necessary and sufficient conditions for the topological product to match the frame product, for Kripke complete extensions of \. (shrink)

We study the sequent system mentioned in the author's work as CyInFL with ‘intuitionistic’ sequents. We explore the connection between this system and symmetric constructive logic of Zaslavsky and develop an algebraic semantics for both of them. In contrast to the previous work, we prove the strong completeness theorem for CyInFL with ‘intuitionistic’ sequents and all of its basic variants, including variants with contraction. We also show how the defined classes of structures are related to cyclic involutive FL‐algebras and Nelson (...) FLew‐algebras. In particular, we prove the definitional equivalence of symmetric constructive FLewc‐algebras (algebraic models of symmetric constructive logic) and Nelson FLew‐algebras (algebras introduced by Spinks and Veroff, as the termwise equivalent definition of Nelson algebras). Because of the strong completeness theorem that covers all basic variants of CyInFL with ‘intuitionistic’ sequents, we rename this sequent system to symmetric constructive full Lambek calculus (). We verify the decidability of this system and its basic variants, as we did in the case of their distributive cousins. As a consequence we obtain that the corresponding theories of (distributive and nondistributive) symmetric constructive FL‐algebras are decidable. (shrink)

In this paper we provide frame definability results for weak versions of classical modal axioms that can be expressed in Fitting's many-valued modal languages. These languages were introduced by M. Fitting in the early '90s and are built on Heyting algebras which serve as the space of truth values. The possible-worlds frames interpreting these languages are directed graphs whose edges are labelled with an element of the underlying Heyting algebra, providing us a form of many-valued accessibility relation. Weak axioms of (...) the form we treat here have been examined from the completeness perspective and further explored for applications in non-monotonic reasoning. Here, we introduce more weak many-valued modal axioms and prove a frame correspondence result for all of them. The classes of corresponding labelled frames possess algebraic properties which are strongly reminiscent of many classical ones, such as the Church-Rosser property, reflexivity, transitivity, partial functionality, etc. (shrink)

A formal language of two-valued logic is developed, whose terms are formulas of the language of Kleene's three-valued logic. The atomic formulas of the former language are pairs of formulas of the latter language joined by consequence operators. These operators correspond to the three sensible types of consequence (strong-strong, strong-weak and weak-weak) in Kleene's logic in analogous way as the implication connective in the classical logic corresponds to the classical consequence relation. The composed formulas of the considered language are built (...) from the atomic ones by means of the classical connectives and quantifiers.A deduction system for the developed language is given, consisting of a set of decomposition rules for sequences of formulas. It is shown that the deduction system is sound and complete. (shrink)

The paper discusses a four-valued propositional logic FOUR≤, similar to Belnap's logic, which can be used to describe incomplete or inconsistent knowledge. In addition to the two classical logical values tt, ff, FOUR≤ features also two nonclassical values: ⊥, representing incomplete information, and ⊤, representing inconsistency. The nonclassical values are incomparable, and together with the classical ones they form a diamond-shaped lattice L4 known from Belnap's logic, which underlies the semantics of FOUR≤. The set of connectives contains those of Belnap's (...) logic, together with an additional operator representing the lattice order, which decisively increases the expressive power of the logic. In the paper we develop a complete decompositional deduction system in Rasiowa-Sikorski style for FOUR≤. (shrink)

In this paper we investigate some basic semantic and syntactic conditions characterizing the equivalence connective. In particular we define three basic classes of algebras: the class of weak equivalential algebras, the class of equivalential algebras and the class of regular equivalential algebras.Weak equivalential algebras can be used to study purely equivalential fragments of relevant logics and strict equivalential fragments of some modal logics. Equivalential algebras are suitable to study purely equivalential fragment of BCI and BCK logic. A subclass of the (...) class of regular equivalential algebras is suitable to study equivalential fragments of ukasiewicz logics. Some subvarieties of the class of regular equivalential algebras provide natural semantics for equivalential fragments of the intuitionistic prepositional logic and various intermediate logics. (shrink)

We survey the theory of Mucnik and Medvedev degrees of subsets of $^{\omega}{\omega}$with particular attention to the degrees of $\Pi_{1}^{0}$ subsets of $^{\omega}2$. Sections 1-6 present the major definitions and results in a uniform notation. Sections 7-6 present proofs, some more complete than others, of the major results of the subject together with much of the required background material.

We present two proof systems for first-order logic with identity and without function symbols. The first one is an extension of the Rasiowa-Sikorski system with the rules for identity. This system is a validity checker. The rules of this system preserve and reflect validity of disjunctions of their premises and conclusions. The other is a Tableau system, which is an unsatisfiability checker. Its rules preserve and reflect unsatisfiability of conjunctions of their premises and conclusions. We show that the two systems (...) are dual to each other. The duality is expressed in a formal way which enables us to define a transformation of proofs in one of the systems into the proofs of the other. (shrink)

We present relational proof systems for the four groups of theories of spatial reasoning: contact relation algebras, Boolean algebras with a contact relation, lattice-based spatial theories, spatial theories based on a proximity relation.

The non-Fregean logic SCI is obtained from the classical sentential calculus by adding a new identity connective = and axioms which say ?a = ß' means ?a is identical to ß'. We present complete and sound proof system for SCI in the style of Rasiowa-Sikorski. It provides a natural deduction-style method of reasoning for the non-Fregean sentential logic SCI.

Interval temporal logics provide both an insight into a nature of time and a framework for temporal reasoning in various areas of computer science. In this paper we present sound and complete relational proof systems in the style of dual tableaux for relational logics associated with modal logics of temporal intervals and we prove that the systems enable us to verify validity and entailment of these temporal logics. We show how to incorporate in the systems various relations between intervals and/or (...) various time orderings. (shrink)

Pour le philosophe intéressé aux structures et aux fondements du savoir théorétique, à la constitution d'une « méta-théorétique «, θεωρíα., qui, mieux que les « Wissenschaftslehre » fichtéenne ou husserlienne et par-delà les débris de la métaphysique, veut dans une intention nouvelle faire la synthèse du « théorétique », la logique mathématique se révèle un objet privilégié.

ABSTRACT In the paper we present a survey of some approaches to the semantics of many-valued propositional systems. These approaches are inspired on one hand by classical problems in the investigations of logical aspects of epistemic activity: knowledge and truth, contradictions, beliefs, reliability of data, etc. On the other hand they reflect contemporary concerns of researchers in Artificial Intelligence (and Cognitive Science in general) with inferences drawn from imperfect information, even from total ignorance. We treat the mathematical apparatus that has (...) emerged recently: algebraic structures related to the new logical systems in the same way Boolean algebras correspond to classical logic. (shrink)

We describe a relational framework that uniformly supports formalization and automated reasoning in varied propositional modal logics. The proof system we propose is a relational variant of the classical Rasiowa-Sikorski proof system. We introduce a compact graph-based representation of formulae and proofs supporting an efficient implementation of the basic inference engine, as well as of a number of refinements. Completeness and soundness results are shown and a Prolog implementation is described.

We implement a recent characterization of metaphysical indeterminacy in the context of orthodox quantum theory, developing the syntax and semantics of two propositional logics equipped with determinacy and indeterminacy operators. These logics, which extend a novel semantics for standard quantum logic that accounts for Hilbert spaces with superselection sectors, preserve different desirable features of quantum logic and logics of indeterminacy. In addition to comparing the relative advantages of the two, we also explain how each logic answers Williamson’s challenge to any (...) substantive account of determinacy: For any proposition p, what could the difference between “p” and “it’s determinate that p” ever amount to? (shrink)

Can quantum theory provide examples of metaphysical indeterminacy, indeterminacy that obtains in the world itself, independently of how one represents the world in language or thought? We provide a positive answer assuming just one constraint of orthodox quantum theory: the eigenstate-eigenvalue link. Our account adds a modal condition to preclude spurious indeterminacy in the presence of superselection sectors. No other extant account of metaphysical indeterminacy in quantum theory meets these demands.

A theorem on the extendability of certain subsets of a Boolean algebra to ultrafilters which preserve countably many infinite meets (generalizing Rasiowa-Sikorski) is used to pinpoint the mechanism of the Barwise proof in a way which bypasses the set theoretical elaborations.