Computer Science – Logic in Computer Science
Scientific paper
2011-02-14
LMCS 7 (2:9) 2011
Computer Science
Logic in Computer Science
Scientific paper
10.2168/LMCS-7(2:9)2011
Algebras axiomatized entirely by rank 1 axioms are algebras for a functor and thus the free algebras can be obtained by a direct limit process. Dually, the final coalgebras can be obtained by an inverse limit process. In order to explore the limits of this method we look at Heyting algebras which have mixed rank 0-1 axiomatizations. We will see that Heyting algebras are special in that they are almost rank 1 axiomatized and can be handled by a slight variant of the rank 1 coalgebraic methods.
Bezhanishvili Nick
Gehrke Mai
No associations
LandOfFree
Finitely generated free Heyting algebras via Birkhoff duality and coalgebra does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Finitely generated free Heyting algebras via Birkhoff duality and coalgebra, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finitely generated free Heyting algebras via Birkhoff duality and coalgebra will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-216632