A uniform approach to inductive posets and inductive closure
DOI10.1016/0304-3975(78)90040-3zbMATH Open0732.06001OpenAlexW3022736722WikidataQ128111596 ScholiaQ128111596MaRDI QIDQ809105FDOQ809105
Authors: Jesse B. Wright, Eric G. Wagner, 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
Recommendations
fixed-point semantics for programming languagesinductive closureinductive posetsZ-completenessZ-continuityZ-set
Partial orders, general (06A06) Galois correspondences, closure operators (in relation to ordered sets) (06A15) Adjoint functors (universal constructions, reflective subcategories, Kan extensions, etc.) (18A40) Semantics in the theory of computing (68Q55)
Cites Work
Cited In (53)
- Cancel culture. The search for universally cancellable exponents of posets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some open problems on well-filtered spaces and sober spaces
- \((\mathcal Z_1,\mathcal Z_2)\)-complete partially ordered sets and their representations by \(\mathcal Q\)-spaces.
- Title not available (Why is that?)
- The glueing construction and lax limits
- Embedding metric spaces into CPO's
- A denotational semantic theory of concurrent systems
- On semicontinuous lattices and their distributive reflections
- Characterising E-projectives via co-monads
- \({\mathbf Z}\)-continuous posets
- Completion of Boolean algebras in MSet
- The duality theory of general \(\mathcal{Z}\)-continuous posets
- A generalization of the Dedekind-MacNeille completion
- Proving open properties by induction
- Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
- On H-sober spaces and H-sobrifications of \(T_0\) spaces
- Bigeneration in complete lattices and principal separation in ordered sets
- The categorical equivalence between algebraic domains and F-augmented closure spaces.
- Transporting continuity properties from a poset to its subposets
- Varieties of chain-complete algebras
- A uniform approach to completions of posets
- Fundamental properties of infinite trees
- General Stone duality.
- Tree constructions of free continuous algebras
- Title not available (Why is that?)
- Quasicontinuous spaces
- A dual problem to least fixed points
- A novel framework for lim-inf convergence in posets
- Characterising E-projectives via Comonads
- Completions for partially ordered semigroups
- Uniformly constructive monads
- Infinite trees in normal form and recursive equations having a unique solution
- The category of Z-continuous posets
- Ideals in ordered sets, a unifying approach
- Some results on fuzzy \(Z_{L}\)-continuous(algebraic) poset
- Closure spaces and completions of posets
- A unified method for completions of posets and closure spaces
- ORDER EXTENSIONS AS ADJOINT FUNCTORS
- Order completion monads
- On the algebra of order
- Posets isomorphic to their extensions
- The \(R\)-completion of closure spaces
- The Birkhoff variety theorem for continuous algebras
- Title not available (Why is that?)
- Cartesian closed categories of \(F\mathcal Z\)-domains
- Monotone Relations, Fixed Points and Recursive Definitions
- Quasi-Atoms and Complete Distributivity
- On naturally continuous non-dcpo domains
- Fuzzy \(Z\)-continuous posets
- Combining data type and recursive process specifications using projection algebras
- Title not available (Why is that?)
This page was built for publication: A uniform approach to inductive posets and inductive closure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q809105)
