Search

Residuated basic logic (RBL) is the logic of residuated basic algebras, which constitutes a conservative extension of basic propositional logic (BPL). The basic implication is a residual of a non-associative binary operator in RBL. The conservativity is shown by relational semantics. A Gentzen-style sequent calculus GRBL , which is an extension of the distributive full non-associative Lambek calculus, is established for residuated basic logic. The calculus GRBL admits the mix-elimination, subformula, and disjunction properties. Moreover, the class of all residuated basic algebras has the finite embeddability property. The consequence relation of GRBL is decidable. [ABSTRACT FROM AUTHOR]

This article aims at providing some extension of the modal square of opposition in the light of Ockham's account of modal operators. Moreover, we set forth some significant remarks on the de re–de dicto distinction and on the modal operator of contingency by means of a set-theoretic algebra called numbering semantics. This generalization starting from Ockham's account of modalities will allow us to take into consideration whether Ockham's account holds water or not, and in which case it should be changed. [ABSTRACT FROM AUTHOR]

The joint logic of problems and propositions QHC introduced by S. A. Melikhov, as well as intuitionistic modal logic QH4, is studied. An immersion of these logics into classical first-order predicate logic is considered. An analog of the Löwenheim–Skolem theorem on the existence of countable elementary submodels for QHC and QH4 is established. [ABSTRACT FROM AUTHOR]

I show that the logic $\textsf {TJK}^{d+}$ , one of the strongest logics currently known to support the naive theory of truth, is obtained from the Kripke semantics for constant domain intuitionistic logic by (i) dropping the requirement that the accessibility relation is reflexive and (ii) only allowing reflexive worlds to serve as counterexamples to logical consequence. In addition, I provide a simplified natural deduction system for $\textsf {TJK}^{d+}$ , in which a restricted form of conditional proof is used to establish conditionals. [ABSTRACT FROM AUTHOR]

The notion of a critical successor [5] in relational semantics has been central to most classic modal completeness proofs in interpretability logics. In this paper we shall work with a more general notion, that of an assuring successor. This will enable more concisely formulated completeness proofs, both with respect to ordinary and generalised Veltman semantics. Due to their interesting theoretical properties, we will devote some space to the study of a particular kind of assuring labels, the so‐called full labels and maximal labels. After a general treatment of assuringness, we shall apply it to obtain a completeness result for the modal logic ILP$\mathsf {ILP}$ w.r.t. generalised semantics for a restricted class of frames. [ABSTRACT FROM AUTHOR]

This paper deals with semilinear extensions of implicational tonoid and partial Galois logics. To this end, first the class of implicational tonoid prelinear logics is defined and it is verified that these logics are semilinear in an algebraic context, namely an implicational tonoid logic is semilinear if it is complete over linearly ordered matrices. Next, a relational semantics is introduced for finitary implicational tonoid prelinear logics and it is proved that these logics are complete on the semantics. Thirdly the term "semilinear" is generalized to a notion to be applied in a set-theoretic context and it is verified that finitary implicational tonoid prelinear logics are semilinear in this context. Finally some extensions satisfying abstract Galois, dual Galois properties are introduced together with similar relational semantics for them and it is shown that these logics are semilinear in both contexts. [ABSTRACT FROM AUTHOR]

This paper aims to show that intuitionistic Kripke models are a powerful tool for interpreting Kant's 'Critical Philosophy'. Part I reviews some old work of mine that applies these models to provide a reading of Kant's second antinomy about the divisibility of matter and to answer several attacks on Kant's antinomies. But it also points out three shortcomings of that original application. First, the reading fails to account for Kant's second antinomy claim that matter is divisible 'ad infinitum' and his first antinomy claim that empirical space extends only 'ad indefinitum'. Secondly, in conformity with the 'assertability' heuristics for Kripke models, it attributes an assertability semantics to Kant. In fact, it attributes a pair of assertability semantics to Kant, but neither of these accords with modern assertabilism. And finally, one must wonder the propriety of using contemporary assertability and contemporary formal logic to save an eighteenth-century text. Part II goes historical to solve the problems about assertability. It outlines the Descartes–Leibniz dialectic about the infinite/indefinite distinction and demonstrates how each position reflects larger philosophical positions. It then demonstrates that Kant's two versions of assertability and his version of the infinite/indefinite dichotomy emerge naturally from his attempts (pre-critical and then critical) to resolve a tension in Leibniz's philosophy. In light of this demonstration, Part III adapts the Kripke model interpretation so that it does reflect that dichotomy. It then refines the Kripke semantics in order to model some of Kant's signature critical doctrines, and it shows how Kant's critical version of the infinite/indefinite distinction differs from all those of his predecessors and from his own pre-critical version. It also addresses the question of using contemporary logical machinery to interpret Kant. Part IV turns the tables and uses what we have learned about Kant and modern semantics in order to address a pair of issues in the contemporary critical foundations of logic. [ABSTRACT FROM AUTHOR]

Implicational partial Galois logics and some of their semilinear extensions, such as semilinear extensions satisfying abstract Galois and dual Galois connection properties, have been introduced together with their relational semantics. However, similar extensions satisfying residuated, dual residuated connection properties have not. This paper fills the gaps by introducing those semilinear extensions and their relational semantics. To this end, the class of implicational (dual) residuated-connected prelinear gaggle logics is defined and it is verified that these logics are semilinear. In particular, associated with the contribution of this work, we note the following two: One is that implications can be introduced by residuated connection in semilinear logics. This shows that the residuated, dual residuated connection properties are important and so need to be investigated in semilinear logics. The other is that set-theoretic relational semantics can be provided for semilinear logics. Semilinear logics have been dealt with extensively in algebraic context, whereas they have not yet been performed in the set-theoretic one. [ABSTRACT FROM AUTHOR]

For each n ∈ N , we introduce the algebraic semantics for the minimum many-valued modal logic over the MV-chain with n elements. We prove that this quasivariety of algebras is generated by the complex algebras, obtaining as a consequence the completeness result of the logic with respect to the Kripke semantics. As a first step towards the study of this algebraic semantics, we study some congruences of the complex algebras. [ABSTRACT FROM AUTHOR]

Six interesting variants of the logics BN4 and E4--which can be considered as the 4-valued logics of the relevant conditional and (relevant) entailment, respectively--were previously developed in the literature. All these systems are related to the family of relevant logics and contain Routley and Meyer's basic logic B, which is well-known to be specifically associated with the ternary relational semantics. The aim of this paper is to develop reduced general Routley-Meyer semantics for them. Strong soundness and completeness theorems are proved for each one of the logics. [ABSTRACT FROM AUTHOR]

We develop a duality for (modal) lattices that need not be distributive, and use it to study positive (modal) logic beyond distributivity, which we call weak positive (modal) logic. This duality builds on the Hofmann, Mislove and Stralka duality for meet-semilattices. We introduce the notion of Π 1 -persistence and show that every weak positive modal logic is Π 1 -persistent. This approach leads to a new relational semantics for weak positive modal logic, for which we prove an analogue of Sahlqvist's correspondence result.1 [ABSTRACT FROM AUTHOR]

It is introduced an immune dynamic n-valued Łukasiewicz logic I D Ł n on the base of n-valued Łukasiewicz logic Ł n and corresponding to it immune dynamic M V n -algebra ( I D L n -algebra), 1 < n < ω , which are algebraic counterparts of the logic, that in turn represent two-sorted algebras (M , R , ◊) that combine the varieties of M V n -algebras M = (M , ⊕ , ⊙ , ∼ , 0 , 1) and regular algebras R = (R , ∪ , ; , ∗) into a single finitely axiomatized variety resembling R-module with "scalar" multiplication ◊ . Kripke semantics is developed for immune dynamic Łukasiewicz logic I D Ł n with application in immune system. [ABSTRACT FROM AUTHOR]

The basic quasi-Boolean negation (QB-negation) expansions of relevance logics included in Anderson and Belnap's relevance logic R are defined. We consider two types of QB-negation: H-negation and D-negation. The former one is of paraintuitionistic or superintuitionistic character, the latter one, of dual intuitionistic nature in some sense. Logics endowed with H-negation are paracomplete; logics with D-negation are paraconsistent. All logics defined in the paper are given a Routley-Meyer ternary relational semantics. [ABSTRACT FROM AUTHOR]

This paper introduces the logics of super-strict implications, where a super-strict implication is a strengthening of C.I. Lewis' strict implication that avoids not only the paradoxes of material implication but also those of strict implication. The semantics of super-strict implications is obtained by strengthening the (normal) relational semantics for strict implication. We consider all logics of super-strict implications that are based on relational frames for modal logics in the modal cube. it is shown that all logics of super-strict implications are connexive logics in that they validate Aristotle's Theses and (weak) Boethius's Theses. A proof-theoretic characterisation of logics of super-strict implications is given by means of G3-style labelled calculi, and it is proved that the structural rules of inference are admissible in these calculi. It is also shown that validity in the S5-based logic of super-strict implications is equivalent to validity in G. Priest's negation-as-cancellation-based logic. Hence, we also give a cut-free calculus for Priest's logic. [ABSTRACT FROM AUTHOR]

We investigate the relationship between M. De's empirical negation in Kripke and Beth Semantics. It turns out empirical negation, as well as co-negation, corresponds to different logics under different semantics. We then establish the relationship between logics related to these negations under unified syntax and semantics based on R. Sylvan's CCw. [ABSTRACT FROM AUTHOR]

We define Kripke semantics for propositional intuitionistic logic with Suszko's identity (ISCI). We propose sequent calculus for ISCI along with cut-elimination theorem. We sketch a constructive interpretation of Suszko's propositional iden- tity connective. [ABSTRACT FROM AUTHOR]

Despite the fact that call-by-value λ-calculus was defined by Plotkin in 1977, we believe that its theory of program approximation is still at the beginning. A problem that is often encountered when studying its operational semantics is that, during the reduction of a λ-term, some redexes remain stuck (waiting for a value). Recently, Carraro and Guerrieri proposed to endow this calculus with permutation rules, naturally arising in the context of linear logic proof-nets, that succeed in unblocking a certain number of such redexes. In the present paper we introduce a new class of models of call-by-value λ-calculus, arising from non-idempotent intersection type systems. Beside satisfying the usual properties as soundness and adequacy, these models validate the permutation rules mentioned above as well as some reductions obtained by contracting suitable λI-redexes. Thanks to these (perhaps unexpected) features, we are able to demonstrate that every model living in this class satisfies an Approximation Theorem with respect to a refined notion of syntactic approximant. While this kind of results often require impredicative techniques like reducibility candidates, the quantitative information carried by type derivations in our system allows us to provide a combinatorial proof. [ABSTRACT FROM AUTHOR]

We study a version of the Stone duality between the Alexandrov spaces and the completely distributive algebraic lattices. This enables us to present lattice-theoretical models of second-order intuitionistic propositional logic which correlates with the Kripke models introduced by Sobolev. This can be regarded as a second-order extension of the well-known correspondence between Heyting algebras and Kripke models in the semantics of intuitionistic propositional logic. [ABSTRACT FROM AUTHOR]

The paper studies completeness and incompleteness of modal predicate logics in Kripke semantics, especially for logics of the form Q Λ , minimal predicate extensions of modal propositional logics. We show that Q Λ is incomplete for a continual family of logics Λ above K + □ (□ p → p) , in particular for well-known K5 and K45. On the other hand, in some cases we find completions of Q Λ ; they are obtained by adding a single extra axiom. Completeness proofs use canonical models, with some modifications, and the case of QK5 is the most interesting from the technical side. We also introduce the "boxing" operation for modal predicate logics and prove transfer results for Kripke and Kripke sheaf completeness with respect to this operation. [ABSTRACT FROM AUTHOR]

In 'Kripke on epistemic and metaphysical possibility: two routes to the necessary a posteriori', Scott Soames identifies two arguments for the existence of necessary a posteriori truths in Naming and Necessity (NN). He argues that Kripke's second argument relies on either of two principles, each of which leads to contradiction. He also claims that it has led to 'two-dimensionalist' approaches to the necessary a posteriori which are fundamentally at odds with the insights about meaning and modality expressed in NN. I argue that the alleged second argument is not in NN. I identify the mistakes that lead to Soames' misinterpretation. [ABSTRACT FROM AUTHOR]

Let [ABSTRACT FROM AUTHOR]

Recently, algebraic Routley–Meyer-style semantics was introduced for basic substructural logics. This paper extends it to fuzzy logics. First, we recall the basic substructural core fuzzy logic MIAL (Mianorm logic) and its axiomatic extensions, together with their algebraic semantics. Next, we introduce two kinds of ternary relational semantics, called here linear Urquhart-style and Fine-style Routley–Meyer semantics, for them as algebraic Routley–Meyer-style semantics. [ABSTRACT FROM AUTHOR]

This essay revisits an important step in Michael Dummett's argument for intuitionistic logic: The move from a theory of meaning to an account of logical consequence. It offers an orientation for those who are not as acquainted with the semantics for intuitionstic logic to easily follow Dummett here. At the same time, it points out important questions that are still left open by him, and suggests how a combination of the BHK interpretation and the Kripke semantics for intuitionistic logic might turn out to best serve his aims. [ABSTRACT FROM AUTHOR]

Is presented as extension of classical propositional calculus, the deductive system LT: logic of the tautologies. In the LT system, the meta-logical notions of tautology, contradiction, refutable and contingency are formalized. The LT system, is characterized as a Kripke-style semantic, and can be seen as an extension of the modal logic system S5. [ABSTRACT FROM AUTHOR]

By introducing the intensional mappings and their properties, we establish a new semantical approach of characterizing intermediate logics. First prove that this new approach provides a general method of characterizing and comparing logics without changing the semantical interpretation of implication connective. Then show that it is adequate to characterize all Kripke_complete intermediate logics by showing that each of these logics is sound and complete with respect to its (unique) ‘weakest characterization property’ of intensional mappings. In particular, we show that classical logic has the weakest characterization property $$cl$$ , which is the strongest among all possible weakest characterization properties of intermediate logics. Finally, it follows from this result that a translation is an embedding of classical logic into intuitionistic logic, iff. its semantical counterpart has the property $$cl$$ . [ABSTRACT FROM AUTHOR]

Several philosophers—including C. S. Peirce, William James, Hilary Putnam and Crispin Wright—have proposed various versions of the notion that truth is an epistemic ideal. More specifically, they have held that a proposition is true if and only if it can be fixedly warranted by human inquirers, given certain ideal epistemic conditions. This paper offers a general critique of that idea, modeling conceptions of ideality and fixed warrant within the semantics that Kripke developed for intuitionistic logic. It is shown that each of the two plausible notions of fixed warrant faces difficulties and that, moreover, “truth” defined in terms of either of them is distressingly dependent upon one’s conception of idealized inquiry and perhaps also upon one’s standards of warrant. [ABSTRACT FROM AUTHOR]