The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Variable Sharing in Substructural Logics: an Algebraic Characterization”

Algebraic Approach to Algorithmic Logic

Grzegorz Bancerek (2014)

Formalized Mathematics

Similarity:

We introduce algorithmic logic - an algebraic approach according to [25]. It is done in three stages: propositional calculus, quantifier calculus with equality, and finally proper algorithmic logic. For each stage appropriate signature and theory are defined. Propositional calculus and quantifier calculus with equality are explored according to [24]. A language is introduced with language signature including free variables, substitution, and equality. Algorithmic logic requires a bialgebra...

On the Leibniz congruences

Josep Font (1993)

Banach Center Publications

Similarity:

The aim of this paper is to discuss the motivation for a new general algebraic semantics for deductive systems, to introduce it, and to present an outline of its main features. Some tools from the theory of abstract logics are also introduced, and two classifications of deductive systems are analysed: one is based on the behaviour of the Leibniz congruence (the maximum congruence of a logical matrix) and the other on the behaviour of the Frege operator (which associates to every theory...

Categorical Abstract Logic: Hidden Multi-Sorted Logics as Multi-Term π-Institutions

George Voutsadakis (2016)

Bulletin of the Section of Logic

Similarity:

Babenyshev and Martins proved that two hidden multi-sorted deductive systems are deductively equivalent if and only if there exists an isomorphism between their corresponding lattices of theories that commutes with substitutions. We show that the π-institutions corresponding to the hidden multi-sorted deductive systems studied by Babenyshev and Martins satisfy the multi-term condition of Gil-F´erez. This provides a proof of the result of Babenyshev and Martins by appealing to the general...

Grzegorczyk’s Logics. Part I

Taneli Huuskonen (2015)

Formalized Mathematics

Similarity:

This article is the second in a series formalizing some results in my joint work with Prof. Joanna Golinska-Pilarek ([9] and [10]) concerning a logic proposed by Prof. Andrzej Grzegorczyk ([11]). This part presents the syntax and axioms of Grzegorczyk’s Logic of Descriptions (LD) as originally proposed by him, as well as some theorems not depending on any semantic constructions. There are both some clear similarities and fundamental differences between LD and the non-Fregean logics introduced...

Logics that are both paraconsistent and paracomplete

Newton C.A. da Costa (1989)

Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti

Similarity:

The Author describes new systems of logic (called "nonalethic") which are both paraconsistent and paracomplete. These systems are connected with the logic of vagueness and with certain philosophical problems (e.g. with some aspects of Hegel's logic).

Logics that are both paraconsistent and paracomplete

Newton C.A. da Costa (1989)

Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti Lincei. Matematica e Applicazioni

Similarity:

The Author describes new systems of logic (called "nonalethic") which are both paraconsistent and paracomplete. These systems are connected with the logic of vagueness and with certain philosophical problems (e.g. with some aspects of Hegel's logic).

Interrelation of algebraic, semantical and logical properties for superintuitionistic and modal logics

Larisa Maksimova (1999)

Banach Center Publications

Similarity:

We consider the families 𝓛 of propositional superintuitionistic logics (s.i.l.) and NE(K) of normal modal logics (n.m.l.). It is well known that there is a duality between 𝓛 and the lattice of varieties of pseudo-boolean algebras (or Heyting algebras), and also NE(K) is dually isomorphic to the lattice of varieties of modal algebras. Many important properties of logics, for instance, Craig's interpolation property (CIP), the disjunction property (DP), the Beth property (BP), Hallden-completeness...

Deontic Paradoxes and Tableau System for Kalinowski’s Deontic Logic K1

Janusz Ciuciura (2017)

Bulletin of the Section of Logic

Similarity:

In 1953, Jerzy Kalinowski published his paper on the logic of normative sentences. The paper is recognized as one of the first publications on the formal system of deontic logic. The aim of this paper is to present a tableau system for Kalinowski’s deontic logic and to discuss some of the topics related to the paradoxes of deontic logic.

On Theses Without Iterated Modalities of Modal Logics Between C1 and S5. Part 1

Andrzej Pietruszczak (2017)

Bulletin of the Section of Logic

Similarity:

This is the first, out of two papers, in which we identify all logics between C1 and S5 having the same theses without iterated modalities. All these logics canbe divided into certain groups. Each such group depends only on which of thefollowing formulas are theses of all logics from this group: (N), (T), (D), ⌜(T)∨ ☐q⌝,and for any n > 0 a formula ⌜(T) ∨ (altn)⌝, where (T) has not the atom ‘q’, and(T) and (altn) have no common atom. We generalize Pollack’s result from [12],where he...

On Theses without Iterated Modalities of Modal Logics Between C1 and S5. Part 2

Andrzej Pietruszczak (2017)

Bulletin of the Section of Logic

Similarity:

This is the second, out of two papers, in which we identify all logics between C1 and S5 having the same theses without iterated modalities. All these logics can be divided into certain groups. Each such group depends only on which of the following formulas are theses of all logics from this group: (N), (T), (D), ⌜(T)∨☐q⌝, and for any n > 0 a formula ⌜(T) ∨ (altn)⌝, where (T) has not the atom ‘q’, and (T) and (altn) have no common atom. We generalize Pollack’s result from [1], where...

Super-strict Implications

Guido Gherardi, Eugenio Orlandelli (2021)

Bulletin of the Section of Logic

Similarity:

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...

New Modification of the Subformula Property for a Modal Logic

Mitio Takano (2020)

Bulletin of the Section of Logic

Similarity:

A modified subformula property for the modal logic KD with the additionalaxiom □ ◊(A ∨ B) ⊃ □ ◊ A ∨ □ ◊B is shown. A new modification of the notion of subformula is proposed for this purpose. This modification forms a natural extension of our former one on which modified subformula property for the modal logics K5, K5D and S4.2 has been shown ([2] and [4]). The finite model property as well as decidability for the logic follows from this.

Identity, equality, nameability and completeness. Part II

María Manzano, Manuel Crescencio Moreno (2018)

Bulletin of the Section of Logic

Similarity:

This article is a continuation of our promenade along the winding roads of identity, equality, nameability and completeness. We continue looking for a place where all these concepts converge. We assume that identity is a binary relation between objects while equality is a symbolic relation between terms. Identity plays a central role in logic and we have looked at it from two different points of view. In one case, identity is a notion which has to be defined and, in the other case, identity...

Axiomatization of a Basic Logic of Logical Bilattices

Mitio Takano (2016)

Bulletin of the Section of Logic

Similarity:

A sequential axiomatization is given for the 16-valued logic that has been proposed by Shramko-Wansing (J Philos Logic 34:121–153, 2005) as a candidate for the basic logic of logical bilattices.