The following pages link to (Q5649639):
Displayed 50 items.
- Some corollaries of the correspondence between partial metrics and multivalued equalities (Q277333) (← links)
- Relational graph models, Taylor expansion and extensionality (Q283769) (← links)
- Lax orthogonal factorisation systems (Q317326) (← links)
- Some new intrinsic topologies on complete lattices and the Cartesian closedness of the category of strongly continuous lattices (Q370336) (← links)
- Approaching metric domains (Q395665) (← links)
- Visible acyclic differential nets. I: Semantics (Q409321) (← links)
- A class of fuzzy multisets with a fixed number of memberships (Q454972) (← links)
- Relatively terminal coalgebras (Q456862) (← links)
- Formal query systems on contexts and a representation of algebraic lattices (Q497110) (← links)
- On Kan-injectivity of locales and spaces (Q513908) (← links)
- Quantitative domains via fuzzy sets. II: Fuzzy Scott topology on fuzzy directed-complete posets (Q549318) (← links)
- Computability in higher types, P\(\omega\) and the completeness of type assignment (Q579245) (← links)
- Convex powerdomains. I (Q581432) (← links)
- Injective spaces via adjunction (Q615891) (← links)
- Insertion and extension theorems for lattice-valued functions on preordered topological spaces (Q616943) (← links)
- Order-preserving reflectors and injectivity (Q645206) (← links)
- Specification of topological spaces by algebraic systems of continuous functions (Q684548) (← links)
- I-categories as a framework for solving domain equations (Q685401) (← links)
- Logical foundations for programming semantics (Q685420) (← links)
- Quotient-reflective and bireflective subcategories of the category of preordered sets (Q719745) (← links)
- A general theory of fuzzy arithmetic (Q751657) (← links)
- Solving reflexive domain equations in a category of complete metric spaces (Q753944) (← links)
- Functorial polymorphism (Q753948) (← links)
- Type inference with recursive types: Syntax and semantics (Q756435) (← links)
- The largest Cartesian closed category of domains (Q761042) (← links)
- Expressive power of typed and type-free programming languages (Q761790) (← links)
- A systematic study of models of abstract data types (Q801667) (← links)
- Closure functions and general iterates as reflectors (Q808275) (← links)
- A uniform approach to inductive posets and inductive closure (Q809105) (← links)
- Insertion of lattice-valued and hedgehog-valued functions (Q820101) (← links)
- \textit{SI}-convergence in \(T_0\) spaces (Q820681) (← links)
- Order-adjoint monads and injective objects (Q847677) (← links)
- Inconsistency and semantic unification (Q853424) (← links)
- Two categories of effective continuous cpos (Q854182) (← links)
- Towards a descriptive set theory for domain-like structures (Q854185) (← links)
- On the order-theoretic properties of lower concept formula systems (Q891194) (← links)
- A representation of L-domains by information systems (Q896923) (← links)
- Non-deterministic information systems and their domains (Q914401) (← links)
- Fuzzy topology with respect to continuous lattices (Q919643) (← links)
- An irregular filter model (Q930872) (← links)
- Computability and the morphological complexity of some dynamics on continuous domains (Q930875) (← links)
- Monotone insertion of lattice-valued functions (Q955179) (← links)
- Quantitative domains via fuzzy sets. I: Continuity of fuzzy directed complete posets (Q968936) (← links)
- Formal topological characterizations of various continuous domains (Q1004687) (← links)
- Natural non-dcpo domains and f-spaces (Q1023300) (← links)
- Domain semantics of possibility computations (Q1031684) (← links)
- Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms (Q1050334) (← links)
- Algebraic domain equations (Q1054464) (← links)
- \(T_ 0\)-spaces and pointwise convergence (Q1064563) (← links)
- Admissible representations of effective cpo's (Q1068562) (← links)