The inverse semigroup of a sum-ordered semiring
From MaRDI portal
Publication:800396
DOI10.1007/BF02572645zbMath0549.06014OpenAlexW1968129403MaRDI QIDQ800396
Publication date: 1985
Published in: Semigroup Forum (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/134742
Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35) Semirings (16Y60) General topics in the theory of software (68N01) Ordered rings, algebras, modules (06F25)
Related Items
An Algebraic Calculus of Database Preferences, Transitive Separation Logic, Unnamed Item, Exploring modal worlds, Program correctness and matricial iteration theories, An extension of a Y. C. Yang theorem, Circulations, Fuzzy Relations and Semirings, Generalized semigroup semirings which are zero-divisor-free or multiplicatively left-cancellative, Semantic models for total correctness and fairness, Join inverse categories and reversible recursion, Dedekind complete posets from sheaves on von Neumann algebras, A categorical analogue of the monoid semiring construction, 2-Absorbing Primary Subsemimodules Over Partial Semirings, Towards a geometry of recursion, Matrix representable so-rings, Semantic models for total correctness and fairness, Monoids with tests and the algebra of possibly non-halting programs, Unnamed Item, An algebra of hybrid systems, Join Inverse Categories as Models of Reversible Recursion, Bisimulation of automata, Modal algebra and Petri nets, Tensor product of partially-additive monoids, Extended transitive separation logic, An algebra of database preferences
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partially additive categories and flow-diagram semantics
- Amenably ordered inverse semigroups
- A class of fuzzy theories
- The Pattern-of-Calls Expansion Is the Canonical Fixpoint for Recursive Definitions
- Can programming be liberated from the von Neumann style?
