Varieties of ordered algebras
From MaRDI portal
Publication:1229897
DOI10.1016/S0022-0000(76)80030-XzbMath0337.06008OpenAlexW1972289972MaRDI QIDQ1229897
Publication date: 1976
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0022-0000(76)80030-x
Ordered rings, algebras, modules (06F25) Varieties (08B99) Computability and recursion theory (03D99)
Related Items
The Birkhoff variety theorem for continuous algebras, A connection between concurrency and language theory, Conditional rewriting logic: Deduction, models and concurrency, On square-increasing ordered monoids and idempotent semirings, Generalized varieties, Algebraic functions in varieties generated by lattice-primal algebras, Inductive \(^{*}\)-semirings, Unnamed Item, Nonfinite axiomatizability of the equational theory of shuffle, Closure operators on algebras, Testing equivalences for processes, A categorical view of varieties of ordered algebras, Algebraic solutions to recursion schemes, Polynomial closure and unambiguous product, Sup-algebra completions and injective hulls of ordered algebras, Fraser–Horn–Hu property for ordered algebras, Injective hulls for ordered algebras, Finitary monads on the category of posets, Polynomial closure and unambiguous product, Galois connection for multiple-output operations, Two algebraic approaches to variants of the concatenation product, Metric monads, Unnamed Item, A Reiterman theorem for pseudovarieties of finite first-order structures, Categorical abstract algebraic logic: Ordered equational logic and algebraizable povarieties, Axiomatizing shuffle and concatenation in languages, On epimorphisms of ordered algebras, Free shuffle algebras in language varieties extended abstract, Nonfinite axiomatizability of shuffle inequalities, Hamiltonian ordered algebras and congruence extension, Admissible subsets and completions of ordered algebras, Fuzzy inequational logic, Pseudovarieties of ordered completely regular semigroups, Unnamed Item, On the algebra of order, On the equational definition of the least prefixed point., Varieties of chain-complete algebras, Discrete equational theories, Varieties of ordered algebras as categories, Unnamed Item, Quasivarieties and varieties of ordered algebras: regularity and exactness, On saturated varieties of posemigroups, Factor varieties, Tree constructions of free continuous algebras, Graph grammars and operational semantics, Unnamed Item, Free shuffle algebras in language varieties, Conditional rewriting logic as a unified model of concurrency, Permutative varieties of posemigroups, Variety theorem for algebras with fuzzy orders, ω♯-Algebras, On congruence extension properties for ordered algebras, A note on regular congruences of ordered semigroups, Infinite trees in normal form and recursive equations having a unique solution, On Morita equivalence of partially ordered monoids, Freeness in classes without equality, Categorical abstract algebraic logic: Partially ordered algebraic systems, A topological shuttle between inequalities and pseudoinequalities, The lattice of subvarieties of semilattice ordered algebras., Profinite Monads, Profinite Equations, and Reiterman’s Theorem, On a question of A. Salomaa The equational theory of regular expressions over a singleton alphabet is not finitely based, Orders, reduction graphs and spectra, Epis, dominions and varieties of commutative posemigroups, Semantics for dual and symmetric combinatory calculi, Equational theories for automata, SUBHIERARCHIES OF THE SECOND LEVEL IN THE STRAUBING–THÉRIEN HIERARCHY, Varieties and pseudovarieties of ordered normal bands, On Mono- and Epimorphisms in Varieties of Ordered Algebras, On fixed points of the lower set operator, Recursion and iteration in continuous theories: the M-construction, Reduction graphs in the lambda calculus, P-varieties - a signature independent characterization of varieties of ordered algebras, On congruence n-distributivity of ordered algebras, Categorical Abstract Algebraic Logic: Subdirect Representation of Pofunctors, Positive varieties of tree languages, Some fundamental algebraic tools for the semantics of computation. I. Comma categories, colimits, signatures and theories, An effectively given initial semigroup, Unnamed Item, A uniform approach to inductive posets and inductive closure, On varieties of ordered semigroups., Axiomatizing the subsumption and subword preorders on finite and infinite partial words
Cites Work
