The max-plus algebra of the natural numbers has no finite equational basis
DOI10.1016/S0304-3975(02)00236-0zbMATH Open1021.08001OpenAlexW2080117016MaRDI QIDQ1870591FDOQ1870591
Authors: Luca Aceto, Anna Ingolfsdottir, Zoltán Ésik 
Publication date: 14 May 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00236-0
Recommendations
Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Algebraic theory of languages and automata (68Q70) Equational classes, universal algebra in model theory (03C05) Free algebras (08B20) Applications of universal algebra in computer science (08A70)
Cites Work
- Title not available (Why is that?)
- A field guide to equational logic
- Identical relations in finite groups
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bisimulation can't be traced
- Title not available (Why is that?)
- Bisimulation through probabilistic testing
- Title not available (Why is that?)
- TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE
- Nonfinite axiomatizability of the equational theory of shuffle
- Title not available (Why is that?)
- Identities in Two-Valued Calculi
- Title not available (Why is that?)
- Title not available (Why is that?)
- Equational Bases for Lattice Theories.
- A menagerie of non-finitely based process semantics over BPA* – from ready simulation to completed traces
- Title not available (Why is that?)
- The variety of Kleene algebras with conversion is not finitely based
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (10)
- Another Characterization of the Natural Numbers
- Equational theories of tropical semirings
- Bisimilarity is not finitely based over BPA with interrupt
- Which two-sorted algebras of Booleans and naturals have a finite basis?
- Nested semantics over finite trees are equationally hard
- Semiring identities of finite inverse semigroups
- Nonfinitely based ai-semirings with finitely based semigroup reducts
- The max-plus algebra of exponent matrices of tiled orders
- Semiring identities of the semigroup \(B_0\)
- Flat extensions of groups and limit varieties of additively idempotent semirings
This page was built for publication: The max-plus algebra of the natural numbers has no finite equational basis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1870591)
