Relation Formulas for Protoalgebraic Equality Free Quasivarieties; Pałasińska’s Theorem Revisited

Studia Logica 101 (4):827-847 (2013)
  Copy   BIBTEX

Abstract

We provide a new proof of the following Pałasińska's theorem: Every finitely generated protoalgebraic relation distributive equality free quasivariety is finitely axiomatizable. The main tool we use are ${\mathcal{Q}}$ Q -relation formulas for a protoalgebraic equality free quasivariety ${\mathcal{Q}}$ Q . They are the counterparts of the congruence formulas used for describing the generation of congruences in algebras. Having this tool in hand, we prove a finite axiomatization theorem for ${\mathcal{Q}}$ Q when it has definable principal ${\mathcal{Q}}$ Q -subrelations. This is a property obtained by carrying over the definability of principal subcongruences, invented by Baker and Wang for varieties, and which holds for finitely generated protoalgebraic relation distributive equality free quasivarieties

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,532

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2013-07-19

Downloads
30 (#528,775)

6 months
10 (#261,125)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

A survey of abstract algebraic logic.J. M. Font, R. Jansana & D. Pigozzi - 2003 - Studia Logica 74 (1-2):13 - 97.
Protoalgebraic logics.W. J. Blok & Don Pigozzi - 1986 - Studia Logica 45 (4):337 - 369.
Equivalential logics.Janusz Czelakowski - 1981 - Studia Logica 40 (3):227-236.
Equivalential logics (I).Janusz Czelakowski - 1981 - Studia Logica 40 (3):227 - 236.

View all 15 references / Add more references