Displaying similar documents to “'Abstract logics' and 'Classical abstract logics'”

Curry algebras N 1

Jair Minoro Abe (1996)

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

Similarity:

In [6] da Costa has introduced a new hierarchy N i , 1 i w of logics that are both paraconsistent and paracomplete. Such logics are now known as non-alethic logics. In this article we present an algebraic version of the logics N i and study some of their properties.

On the concreteness of quantum logics

Pavel Pták, John David Maitland Wright (1985)

Aplikace matematiky

Similarity:

It is shown that for any quantum logic L one can find a concrete logic K and a surjective homomorphism f from K onto L such that f maps the centre of K onto the centre of L . Moreover, one can ensure that each finite set of compatible elements in L is the image of a compatible subset of K . This result is “best possible” - let a logic L be the homomorphic image of a concrete logic under a homomorphism such that, if F is a finite subset of the pre-image of a compatible subset of L , then...

A Hanf number for saturation and omission

John T. Baldwin, Saharon Shelah (2011)

Fundamenta Mathematicae

Similarity:

Suppose t = (T,T₁,p) is a triple of two countable theories T ⊆ T₁ in vocabularies τ ⊂ τ₁ and a τ₁-type p over the empty set. We show that the Hanf number for the property ’there is a model M₁ of T₁ which omits p, but M₁ ↾ τ is saturated’ is essentially equal to the Löwenheim number of second order logic. In Section 4 we make exact computations of these Hanf numbers and note some distinctions between ’first order’ and ’second order quantification’. In particular, we show that if κ is...

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

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

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

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

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

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.