Title of article
Computing coproducts of finitely presented Gِdel algebras
Author/Authors
D’Antona، نويسنده , , Ottavio M. and Marra، نويسنده , , Vincenzo، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2006
Pages
10
From page
202
To page
211
Abstract
We obtain an algorithm to compute finite coproducts of finitely generated Gödel algebras, i.e. Heyting algebras satisfying the prelinearity axiom ( α → β ) ∨ ( β → α ) = 1 . (Since Gödel algebras are locally finite, ‘finitely generated’, ‘finitely presented’, and ‘finite’ have identical meaning in this paper.) We achieve this result using ordered partitions of finite sets as a key tool to investigate the category opposite to finitely generated Gödel algebras (forests and open order-preserving maps). We give two applications of our main result. We prove that finitely presented Gödel algebras have free products with amalgamation; and we easily obtain a recursive formula for the cardinality of the free Gödel algebra over a finite number of generators first established by A. Horn.
Keywords
Heyting algebras , Gِdel algebras , Coproducts , Open maps , trees , forests , Ordered partitions
Journal title
Annals of Pure and Applied Logic
Serial Year
2006
Journal title
Annals of Pure and Applied Logic
Record number
1443809
Link To Document