Categorical abstract algebraic logic: The criterion for deductive equivalence
✍ Scribed by George Voutsadakis
- Publisher
- John Wiley and Sons
- Year
- 2003
- Tongue
- English
- Weight
- 112 KB
- Volume
- 49
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
Equivalent deductive systems were introduced in [4] with the goal of treating 1‐deductive systems and algebraic 2‐deductive systems in a uniform way. Results of [3], appropriately translated and strengthened, show that two deductive systems over the same language type are equivalent if and only if their lattices of theories are isomorphic via an isomorphism that commutes with substitutions. Deductive equivalence of π‐institutions [14, 15] generalizes the notion of equivalence of deductive systems. In [15, Theorem 10.26] this criterion for the equivalence of deductive systems was generalized to a criterion for the deductive equivalence of term π‐institutions, forming a subclass of all π‐institutions that contains those π‐institutions directly corresponding to deductive systems. This criterion is generalized here to cover the case of arbitrary π‐institutions.
📜 SIMILAR VOLUMES
## Abstract Czelakowski introduced the Suszko operator as a basis for the development of a hierarchy of non‐protoalgebraic logics, paralleling the well‐known abstract algebraic hierarchy of protoalgebraic logics based on the Leibniz operator of Blok and Pigozzi. The scope of the theory of the Leibn
Given a π-institution I, a hierarchy of π-institutions I (n) is constructed, for n ≥ 1. We call I (n) the n-th order counterpart of I. The second-order counterpart of a deductive π-institution is a Gentzen π-institution, i. e. a π-institution associated with a structural Gentzen system in a canonica
## Abstract The study of structure systems, an abstraction of the concept of first‐order structures, is continued. Structure systems have algebraic systems as their algebraic reducts and their relational component consists of a collection of relation systems on the underlying functors. An analog of
## Abstract In this note, it is shown that, given a __π__ ‐institution ℐ = 〈**Sign**, SEN, __C__ 〉, with __N__ a category of natural transformations on SEN, every theory family __T__ of ℐ includes a unique largest theory system $ \overleftarrow T $ of ℐ. $ \overleftarrow T $ satisfies the important