Logical Methods in Computer Science Vol. 2 (5:, pp. 1–31 www.lmcs-online.org Submitted Published

First Page		Document Content
Date: 2008-02-05 14:26:41 Algebra Mathematics Abstract algebra Category theory Universal algebra Boolean algebra Mathematical logic Adjoint functors F-algebra Variety Monad Sigma-algebra		Logical Methods in Computer Science Vol. 2 (5:, pp. 1–31 www.lmcs-online.org Submitted Published Add to Reading List Source URL: arxiv.org Download Document from Source Website File Size: 354,88 KB Share Document on Facebook

	UNIVERSAL IDENTITIES, II: ⊗ AND ∧ KEITH CONRAD 1. Introduction We will describe how algebraic identities involving operations of multilinear algebra – the tensor product and exterior powers – can be proved by the DocID: 1vs1s - View Document
	New York Journal of Mathematics New York J. Math–524. The co-universal C ∗-algebra of a row-finite graph Aidan Sims DocID: 1tER8 - View Document
	New York Journal of Mathematics New York J. Math–524. The co-universal C ∗-algebra of a row-finite graph Aidan Sims DocID: 1tC2w - View Document
	Algorithms for the universal decomposition algebra Romain Lebreton Éric Schost Équipe MAX DocID: 1s6Z5 - View Document
	Mineral resources English version – SOSI standard 4.0 Mineral resources English version – SOSI standard 4.0 DocID: 1rtCO - View Document