Results 51 to 60 of about 155 (78)

On the Algebraizability of the Implicational Fragment of Abelian Logic

Studia Logica, 2013
In this paper we consider the implicational fragment of Abelian logic A→. We show that although the Abelian groups provide an semantics for the set of theorems of A→ they do not for the associated consequence relation. We then show that the consequence relation is not algebraizable in the sense of Blok and Pigozzi (Mem Am Math Soc 77, 1989).
Butchart, Sam, Rogerson, Susan
openaire   +4 more sources

Some of the next articles are maybe not open access.

Related searches:

Implicit connectives of algebraizable logics

Studia Logica, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xavier Caicedo, Caicedo Xavier
exaly   +2 more sources

Equivalential and algebraizable logics

Studia Logica, 1996
The author investigates the process of algebraization of the so-called equivalential and finitely equivalential logics. His approach is based on matrix semantics. In the paper, a logic need not be finitary (i.e., have only finitary rules). As to algebraizability, the author distinguishes between finitely algebraizable logics (i.e.
Burghard Herrmann
exaly   +3 more sources

An Approach to Glivenko’s Theorem in Algebraizable Logics

Studia Logica, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Antoni Torrens, Torrens Antoni
exaly   +2 more sources

Regularly Algebraizable Logics

Trends in Logic, 2001
A sentential logic (S, C) is regularly algebraizable (alias 1-algebraizable) if it possesses a non-empty system E(p, q) of equivalence sentences such that E(p, q) ⊆ C(p, q).
Janusz Czelakowski, Czelakowski Janusz
exaly   +2 more sources

Omitting types for algebraizable extensions of first order logic

Journal of Applied Non-Classical Logics, 2005
We prove an Omitting Types Theorem for certain algebraizable extensions of first order logic without equality studied in [SAI 00] and [SAY 04]. This is done by proving a representation theorem preserving given countable sets of infinite meets for certain reducts of ω- dimensional polyadic algebras, the so-called G polyadic algebras (Theorem 5).
Tarek Sayed Ahmed
exaly   +2 more sources

Categorical Abstract Algebraic Logic: Ordered Equational Logic and Algebraizable PoVarieties

Order, 2007
This paper contains the fourth (and final) installment on research concerning an extension of some of the results on partially ordered varieties and quasi-varieties of partially ordered universal algebras obtained by Palasińska and Pigozzi in the context of abstract algebraic logic and reported in \textit{D.
George Voutsadakis, Voutsadakis George
exaly   +2 more sources

Algebraizable logics with a strong conjunction and their semi-lattice based companions

Archive for Mathematical Logic, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ramon Jansana, Jansana Ramon
exaly   +2 more sources

A survey on categories of logics and algebraizable logics

Sao Paulo Journal of Mathematical Sciences, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly   +3 more sources

An Infinite Family of Finite-Valued Paraconsistent Algebraizable Logics

Studia Logica
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hugo Albuquerque, CARLOS Caleiro, Caleiro CARLOS   +2 more
exaly   +3 more sources