A uniform approach to inductive posets and inductive closure

DOI10.1016/0304-3975(78)90040-3zbMath0732.06001OpenAlexW3022736722WikidataQ128111596 ScholiaQ128111596MaRDI QIDQ809105

Eric G. Wagner, Jesse B. Wright, James W. Thatcher

Publication date: 1978

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

Full work available at URL: https://doi.org/10.1016/0304-3975(78)90040-3

zbMATH Keywords

fixed-point semantics for programming languagesinductive closureinductive posetsZ-completenessZ-continuityZ-set

Mathematics Subject Classification ID

Partial orders, general (06A06) Adjoint functors (universal constructions, reflective subcategories, Kan extensions, etc.) (18A40) Semantics in the theory of computing (68Q55) Galois correspondences, closure operators (in relation to ordered sets) (06A15)

Related Items (48)

The Birkhoff variety theorem for continuous algebras ⋮ Transporting continuity properties from a poset to its subposets ⋮ Some open problems on well-filtered spaces and sober spaces ⋮ On semicontinuous lattices and their distributive reflections ⋮ Characterising E-projectives via co-monads ⋮ The duality theory of general \(\mathcal{Z}\)-continuous posets ⋮ Equivalences and transformations of regular systems - applications to recursive program schemes and grammars ⋮ ORDER EXTENSIONS AS ADJOINT FUNCTORS ⋮ \({\mathbf Z}\)-continuous posets ⋮ Cartesian closed categories of \(F\mathcal Z\)-domains ⋮ A Denotational Semantic Theory of Concurrent Systems ⋮ A novel framework for lim-inf convergence in posets ⋮ \((\mathcal Z_1,\mathcal Z_2)\)-complete partially ordered sets and their representations by \(\mathcal Q\)-spaces. ⋮ On naturally continuous non-dcpo domains ⋮ On the algebra of order ⋮ A uniform approach to completions of posets ⋮ Varieties of chain-complete algebras ⋮ The glueing construction and lax limits ⋮ Quasicontinuous spaces ⋮ Combining data type and recursive process specifications using projection algebras ⋮ Characterising E-projectives via Comonads ⋮ Unnamed Item ⋮ Tree constructions of free continuous algebras ⋮ A dual problem to least fixed points ⋮ Embedding metric spaces into CPO's ⋮ Unnamed Item ⋮ Unnamed Item ⋮ General Stone duality. ⋮ On H-sober spaces and H-sobrifications of \(T_0\) spaces ⋮ Uniformly constructive monads ⋮ Bigeneration in complete lattices and principal separation in ordered sets ⋮ The categorical equivalence between algebraic domains and F-augmented closure spaces. ⋮ Infinite trees in normal form and recursive equations having a unique solution ⋮ Monotone Relations, Fixed Points and Recursive Definitions ⋮ A generalization of the Dedekind-MacNeille completion ⋮ Ideals in ordered sets, a unifying approach ⋮ Some results on fuzzy \(Z_{L}\)-continuous(algebraic) poset ⋮ The \(R\)-completion of closure spaces ⋮ Completions for partially ordered semigroups ⋮ Fuzzy \(Z\)-continuous posets ⋮ Completion of Boolean algebras in MSet ⋮ Quasi-Atoms and Complete Distributivity ⋮ A unified method for completions of posets and closure spaces ⋮ Fundamental properties of infinite trees ⋮ Order completion monads ⋮ The category of Z-continuous posets ⋮ Posets isomorphic to their extensions ⋮ Closure spaces and completions of posets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Varieties of ordered algebras
• Computability concepts for programming language semantics
• Bases for Chain-complete Posets
• Initial Algebra Semantics and Continuous Algebras

This page was built for publication: A uniform approach to inductive posets and inductive closure