Factorisation systems on domains

DOI10.1023/A:1008644319842MaRDI QIDQ1306711zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• scientific article; zbMATH DE number 956831
• scientific article; zbMATH DE number 4083878
• The largest Cartesian closed category of domains
• scientific article; zbMATH DE number 1829710
• On stable domains

Cited in

(4)

• scientific article; zbMATH DE number 1559386 (Why is no real title available?)
• Continuous domains and their information system representation as logical systems
• scientific article; zbMATH DE number 1310565 (Why is no real title available?)
• scientific article; zbMATH DE number 2125649 (Why is no real title available?)

This page was built for publication: Factorisation systems on domains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1306711)