Most Gentzen systems arising in logic contain few axiom schemata and many rule schemata. Hilbert systems, on the other hand, usually contain few proper inference rules and possibly many axioms. Because of this, the two notions tend to serve different purposes. It is common for a logic to be specified in the first instance by means of a Gentzen calculus, whereupon a Hilbert-style presentation ‘for’ the logic may be sought—or vice versa. Where this has occurred, the word ‘for’ has taken (...) on several different meanings, partly because the Gentzen separator ⇒ can be interpreted intuitively in a number of ways. Here ⇒ will be denoted less evocatively by ⊲.In this paper we aim to discuss some of the useful ways in which Gentzen and Hilbert systems may correspond to each other. Actually, we shall be concerned with thededucibility relationsof the formal systems, as it is these that are susceptible to transformation in useful ways. To avoid potential confusion, we shall speak of Hilbert and Gentzenrelations. By aHilbert relationwe mean any substitution-invariant consequence relation onformulas—this comes to the same thing as the deducibility relation of a set of Hilbert-style axioms and rules. By aGentzen relationwe mean the fully fledged generalization of this notion in whichsequentstake the place of single formulas. In the literature, Hilbert relations are often referred to assentential logics. Gentzen relations as defined here are their exactsequentialcounterparts. (shrink)

For (finitary) deductive systems, we formulate a signature‐independent abstraction of the weak excluded middle law (WEML), which strengthens the existing general notion of an inconsistency lemma (IL). Of special interest is the case where a quasivariety algebraizes a deductive system ⊢. We prove that, in this case, if ⊢ has a WEML (in the general sense) then every relatively subdirectly irreducible member of has a greatest proper ‐congruence; the converse holds if ⊢ has an inconsistency lemma. The result extends, in (...) a suitable form, to all protoalgebraic logics. A super‐intuitionistic logic possesses a WEML iff it extends. We characterize the IL and the WEML for normal modal logics and for relevance logics. A normal extension of has a global consequence relation with a WEML iff it extends, while every axiomatic extension of with an IL has a WEML. (shrink)

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. For uniqueness, the definition must be relativized, either syntactically or semantically. In sentential systems, for instance, the order algebraization process may be required to respect a given but arbitrary polarity on the signature. With every deductive filter of an algebra of the pertinent type, the polarity associates a reflexive and transitive relation (...) called a Leibniz order, analogous to the Leibniz congruence of abstract algebraic logic . Some core results of AAL are extended here to sentential systems with a polarity. In particular, such a system is order algebraizable if the Leibniz order operator has the following four independent properties: it is injective, it is isotonic, it commutes with the inverse image operator of any algebraic homomorphism, and it produces anti-symmetric orders when applied to filters that define reduced matrix models. Conversely, if a sentential system is order algebraizable in some way, then the order algebraization process naturally induces a polarity for which the Leibniz order operator has properties –. (shrink)

Willem Blok was one of the founders of the field Abstract Algebraic Logic. The paper describes his research in this field.

It was shown recently that epimorphisms need not be surjective in a variety K of Heyting algebras, but only one counter-example was exhibited in the literature until now. Here, a continuum of such examples is identified, viz. the variety generated by the Rieger-Nishimura lattice, and all of its (locally finite) subvarieties that contain the original counter-example K . It is known that, whenever a variety of Heyting algebras has finite depth, then it has surjective epimorphisms. In contrast, we show that (...) for every integer $n \geq 2$ , the variety of all Heyting algebras of width at most n has a non-surjective epimorphism. Within the so-called Kuznetsov-Gerčiu variety (i.e., the variety generated by finite linear sums of one-generated Heyting algebras), we describe exactly the subvarieties that have surjective epimorphisms. This yields new positive examples, and an alternative proof of epimorphism surjectivity for all varieties of Gödel algebras. The results settle natural questions about Beth-style definability for a range of intermediate logics. (shrink)

LetA≤Bbe structures, and${\cal K}$a class of structures. An elementb∈BisdominatedbyArelative to${\cal K}$if for all${\bf{C}} \in {\cal K}$and all homomorphismsg,g':B → Csuch thatgandg'agree onA, we havegb=g'b. Our main theorem states that if${\cal K}$is closed under ultraproducts, thenAdominatesbrelative to${\cal K}$if and only if there is a partial functionFdefinable by a primitive positive formula in${\cal K}$such thatFB(a1,…,an) =bfor somea1,…,an∈A. Applying this result we show that a quasivariety of algebras${\cal Q}$with ann-ary near-unanimity term has surjective epimorphisms if and only if$\mathbb{S}\mathbb{P}_n \mathbb{P}_u \left( {\mathcal{Q}_{{\text{RSI}}} } \right)$has (...) surjective epimorphisms. It follows that if${\cal F}$is a finite set of finite algebras with a common near-unanimity term, then it is decidable whether the (quasi)variety generated by${\cal F}$has surjective epimorphisms. (shrink)

A logic family is a bunch of logics that belong together in some way. First-order logic is one of the examples. Logics organized into a structure occur in abstract model theory, institution theory and in algebraic logic. Logic families play a role in adopting methods for investigating sentential logics to first-order like logics. We thoroughly discuss the notion of logic families as defined in the recent Universal Algebraic Logic book.

The Stone-Weierstrass Theorem for compact Hausdorff spaces is a basic result of functional analysis with far-reaching consequences. We introduce an equational logic ⊨Δ associated with an infinitary variety Δ and show that the Stone-Weierstrass Theorem is a consequence of the Beth definability property of ⊨Δ, stating that every implicit definition can be made explicit. Further, we define an infinitary propositional logic ⊢Δ by means of a Hilbert-style calculus and prove a strong completeness result whereby the semantic notion of consequence associated (...) with ⊢Δ coincides with ⊨Δ. (shrink)

We characterize, in syntactic terms, the ranges of epimorphisms in an arbitrary class of similar first-order structures. This allows us to strengthen a result of Bacsich, as follows: in any prevariety having at most \ non-logical symbols and an axiomatization requiring at most \ variables, if the epimorphisms into structures with at most \ elements are surjective, then so are all of the epimorphisms. Using these facts, we formulate and prove manageable ‘bridge theorems’, matching the surjectivity of all epimorphisms in (...) the algebraic counterpart of a logic \ with suitable infinitary definability properties of \, while not making the standard but awkward assumption that \ comes furnished with a proper class of variables. (shrink)