The initial meadows
| Autor: | Inge Bethke, Piet Rodenburg |
|---|---|
| Přispěvatelé: | Theory of Computer Science (IVI, FNWI) |
| Jazyk: | angličtina |
| Rok vydání: | 2010 |
| Předmět: |
word problem
Symmetric algebra Pure mathematics Data structures Logic Polynomial ring Subalgebra Mathematics::Rings and Algebras decidability Mathematics - Rings and Algebras Commutative ring Superalgebra Philosophy Rings and Algebras (math.RA) Incidence algebra Computer Science::Logic in Computer Science Associative algebra computable algebras normal forms FOS: Mathematics initial algebra semantics Word problem (mathematics) specification languages Computer Science::Formal Languages and Automata Theory Mathematics |
| Zdroj: | Journal of Symbolic Logic, 75(3), 888-895. Cambridge University Press J. Symbolic Logic 75, iss. 3 (2010), 888-895 |
| ISSN: | 0022-4812 |
| DOI: | 10.2178/jsl/1278682205 |
| Popis: | A \emph{meadow} is a commutative ring with an inverse operator satisfying $0^{-1}=0$. We determine the initial algebra of the meadows of characteristic 0 and show that its word problem is decidable. Comment: 11 pages |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|