A Completness Theorem For One Class Of The Propositional Calculi
A first-order logic for multi-algebras.
A note on paracomplete logic
In questa nota gli Autori descrivono nuovi sistemi di logica (detta «paracompleta») connessi con la logica della vaghezza («fuzzy logic») e con le logiche paraconsistenti.
A possibility-free logic of descriptions.
Algebraic Approach to Algorithmic Logic
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 structure...
Algebraic de Morgan's laws for non-commutative rings
An intensional approach to questions
Annihilators in BCK-algebras
We introduce the concepts of an annihilator and a relative annihilator of a given subset of a BCK-algebra . We prove that annihilators of deductive systems of BCK-algebras are again deductive systems and moreover pseudocomplements in the lattice of all deductive systems on . Moreover, relative annihilators of with respect to are introduced and serve as relative pseudocomplements of w.r.t. in .
Grzegorczyk’s Logics. Part I
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 by...
Individualised normative logic
Inference in Action
Kripke models for intuitionistic theories with decidable atomic formulas.
La créativité des définitions dans les systèmes para-euclidiens
Cet article considère trois sortes de calcul propositionnel (mais surtout la troisième), à la fois d'un point de vue logique et d'un point de vue épistémologique : (1) les systèmes classiques qui ont les propriétés suivantes : (a) chaque axiome doit contenir seulement (ou doit être compris comme contenant seulement) des termes primitifs, (b) chaque définition est métalinguistique, (c) chaque définition est non créatrice ; (2) les systèmes de Leśnieswski qui satisfont (a) mais ni (b) ni (c), une...
Lògiques distributives i booleanes.
Continuing the study of different types of Abstract Logics [5], and following works by Brown-Bloom [1] and Brown-Suszko [2], we analyze in this paper some logics in which, if we identify equivalent formulae by means of the consequence operator, we obtain distributive lattices or Boolean algebras.
Modules over a quantale and models for the operator in linear logic
Negation And Contradiction.
Normal forms in partial modal logic
A "partial" generalization of Fine's definition [Fin] of normal forms in normal minimal modal logic is given. This means quick access to complete axiomatizations and decidability proofs for partial modal logic [Thi].
O dynamické logice
On guessing whether a sequence has a certain property.
On permutographs