24 search results - page 2 / 5 » Profinite Heyting Algebras |
JUCS
2002
13 years 6 months ago
2002
: By introducing a new operation, the exponentiation of formal languages, we can define Heyting algebras of formal languages. It turns out that some well known families of language...
MSCS
2010
13 years 4 months ago
2010
ORDER
2010
13 years 4 months ago
2010
CALCO
2009
Springer
14 years 27 days ago
2009
Springer
Abstract. We use coalgebraic methods to describe finitely generated free Heyting algebras. Heyting algebras are axiomatized by rank 0-1 axioms. In the process of constructing free...
CORR
2011
Springer
13 years 1 months ago
2011
Springer
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...