## Abstract In this paper we address our efforts to extend the well‐known connection in equational logic between equational theories and fully invariant congruences to other–possibly infinitary–logics. In the special case of algebras, this problem has been formerly treated by H. J. Hoehnke [10] and
Algebraic semantics for the (↔, ¬¬)-fragment of IPC
✍ Scribed by Katarzyna Słomczyńska
- Publisher
- John Wiley and Sons
- Year
- 2011
- Tongue
- English
- Weight
- 151 KB
- Volume
- 58
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
We show that the variety of equivalential algebras with regularization gives the algebraic semantics for the (↔, ¬¬)‐fragment of intuitionistic propositional logic. We also prove that this fragment is hereditarily structurally complete.
📜 SIMILAR VOLUMES
Despite the frequent comment that there is no general agreement on the semantics of logic programs, this paper shows that a number of independently proposed extensions to the stable model semantics coincide: the regular model semantics proposed by You and Yuan, the partial stable model semantics by
We present a labelled version of Lambek Calculus without unit, and we use it to prove a completeness theorem for Lambek Calculus with respect to some relational semantics.