Factorisation systems on domains

DOI10.1023/A:1008644319842zbMath0951.06007OpenAlexW1540684660MaRDI QIDQ1306711

Mathias Kegelmann

Publication date: 18 December 2000

Published in: Applied Categorical Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008644319842

zbMATH Keywords

Cartesian closed categoriesdomain theorycontinuous domainsstable domainsbilimitsfactorisation systems

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Continuous lattices and posets, applications (06B35) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Continuous Domains and their Information System Representation as Logical Systems

This page was built for publication: Factorisation systems on domains