Back to Search
Start Over
On generalizing free algebras for a functor
- Source :
- Journal of Logic and Computation, 23, 3, pp. 645-672, Journal of Logic and Computation, 23, 645-672
- Publication Year :
- 2013
-
Abstract
- In this article we introduce a new setting, based on partial algebras, for studying constructions of finitely generated free algebras. We give sufficient conditions under which the finitely generated free algebras for a variety V may be described as the colimit of a chain of finite partial algebras obtained by repeated application of a functor. In particular, our method encompasses the construction of finitely generated free algebras for varieties of algebras for a functor as in Bezhanishvili and Kurz (2007, LNCS, 143–157), Heyting algebras as in Bezhanishvili and Gehrke (2011, LMCS, 7, 1–24) and S4 algebras as in Ghilardi (2010, J. Appl. Non-classical, Logics, 20, 193–217).
- Subjects :
- Pure mathematics
Algebra and Topology
Functor
Logic
010102 general mathematics
Non-associative algebra
06 humanities and the arts
0603 philosophy, ethics and religion
01 natural sciences
Theoretical Computer Science
Cayley–Dickson construction
Interior algebra
Arts and Humanities (miscellaneous)
Hardware and Architecture
060302 philosophy
ComputingMethodologies_DOCUMENTANDTEXTPROCESSING
Free object
Finitely-generated abelian group
Nest algebra
0101 mathematics
Variety (universal algebra)
Algebra en Topologie
Software
Mathematics
Subjects
Details
- ISSN :
- 0955792X
- Volume :
- 23
- Database :
- OpenAIRE
- Journal :
- Journal of Logic and Computation
- Accession number :
- edsair.doi.dedup.....e858a294ac622a972ca6c5b0420c4fd5