Results 1 to 10 of about 810,546 (73)
Combining Algebraizable Logics [PDF]
The general methodology of "algebraizing" logics (cf. [2], [4]) is used here for combining different logics. The combination of logics is represented as taking the colimit of the constituent logics in the category of algebraizable logics.
A. Jánossy +5 more
exaly +7 more sources
This paper develops an order-theoretic generalization of Blok and Pigozziʼs notion of an algebraizable logic. Unavoidably, the ordered model class of a logic, when it exists, is not unique.
J.G. Raftery, Raftery, J.G.
exaly +5 more sources
A survey on categories of logics and algebraizable logics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Darllan C. Pinto
exaly +6 more sources
Algebraizable weak logics [PDF]
We extend the framework of abstract algebraic logic to weak logics, namely, logical systems that are not necessarily closed under uniform substitution. We interpret weak logics by algebras expanded with an additional predicate, and we introduce a loose ...
Nakov, Georgi +1 more
core +5 more sources
Regularly Algebraizable Logics
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 +4 more sources
Löwenheim-Skolem theorems for non-classical first-order algebraizable logics [PDF]
This article is a contribution to the model theory of non-classical first-order predicate logics. In a wide framework of first-order systems based on algebraizable logics, we study several notions of homomorphisms between models and find suitable ...
García-Cerdaña, Àngel +3 more
core +10 more sources
Algebraizable logics and a functorial encoding of its morphisms [PDF]
arXiv admin note: text overlap with arXiv:1405 ...
Hugo Luiz Mariano
exaly +5 more sources
A henkin-style proof of completeness for first-order algebraizable logics
This paper considers Henkin’s proof of completeness of classical first-order logic and extends its scope to the realm of algebraizable logics in the sense of Blok and Pigozzi. Given a propositional logic L (for which we only need to assume that it has an
Cintula P., Noguera C.
core +6 more sources
On Semilattice-based Logics with an Algebraizable Assertional Companion [PDF]
This paper studies some properties of the so-called semilattice-based logics (which are defined in a standard way using only the order relation from a variety of algebras that have a semilattice reduct with maximum) under the assumption that its ...
Font, Josep Maria
core +3 more sources

