Continuous monoids and semirings

DOI10.1016/j.tcs.2004.01.020zbMath1068.68079OpenAlexW2087931010MaRDI QIDQ596031

Georg Karner

Publication date: 10 August 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.01.020

zbMATH Keywords

Scott topologyComplete partial ordersComplete semiringsContinuous semiringsDistributive \(\varSigma\)-algebrasDistributive multioperator monoids

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Semirings (16Y60) Ordered semigroups and monoids (06F05) Continuous lattices and posets, applications (06B35)

Related Items

THE CATEGORY OF SIMULATIONS FOR WEIGHTED TREE AUTOMATA ⋮ Simulations of Weighted Tree Automata ⋮ Equational theories for automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Monoides et semi-anneaux complets. (Complete monoids and semirings)
• Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
• Monoides et semi-anneaux continus. (Continuous monoids and semirings)
• Chain-complete posets and directed sets with applications
• Equational elements in additive algebras
• Formal series over sorted algebras
• Inductive \(^{*}\)-semirings

This page was built for publication: Continuous monoids and semirings