Results 61 to 70 of about 84,544 (73)

Characterizing Equivalential and Algebraizable Logics by the Leibniz Operator

Studia Logica, 1997
In this paper the author characterizes the hierarchy of protoalgebraic, equivalential, finitely equivalential, possibly infinitely algebraizable and finitely algebraizable logics by properties of the Leibniz operator. The author gives a new short proof of the main result of \textit{W. J. Blok} and \textit{D. Pigozzi} [Algebraizable logics, Mem.
openaire   +2 more sources

A Non-finitary Sentential Logic that is Elementarily Algebraizable

Journal of Logic and Computation, 2008
Summary: We exhibit a non-finitary sentential logic that is algebraized by a quasivariety -- in fact by a finitely based variety of finite type. The algebraization process requires infinitely many defining equations. The existence of such a logic settles a question posed by \textit{J. Czelakowski} [Protoalgebraic logics.
openaire   +2 more sources

Categorical Abstract Algebraic Logic: Algebraizable Institutions

Applied Categorical Structures, 2002
The framework developed by W. J. Blok and D. Pigozzi for the algebraizability of deductive systems is extended to the algebraizability of multisignature logics with quantifiers.
openaire   +1 more source

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.
openaire   +2 more sources

Duality for Lattice-Ordered Algebras and for Normal Algebraizable Logics

Studia Logica, 1997
This paper consists of three parts. In Part I, a new topological representation for general lattices is presented, and this representation is extended to a full duality. In Part II, the Jónsson and Tarski representation results for Boolean algebras with operators are extended for lattice-ordered algebras (lattices with additional operators).
openaire   +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).
openaire   +2 more sources

Algebraizable logics

Memoirs of the American Mathematical Society, 1989
W. J. Blok, Don Pigozzi
openaire   +1 more source

Applications to protoalgebraic and algebraizable logics

1996
Josep Maria Font, Ramon Jansana
openaire   +1 more source

Löwenheim–Skolem theorems for non-classical first-order algebraizable logics: Table 1.

Logic Journal of the IGPL, 2016
Angel García-Cerdaña, Maria Pilar Dellunde, Carles Noguera   +2 more
exaly  

A Closer Look at Some Subintuitionistic Logics

Notre Dame Journal of Formal Logic, 2001
Sérgio A Celani, Ramon Jansana
exaly