Chain properties in Pomega

DOI10.1016/0304-3975(79)90023-9MaRDI QIDQ1157698zbMATH OpenOpenAlexFDO

Authors S. H. Smith

Publication date 1979

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

Full work available at URL https://doi.org/10.1016/0304-3975(79)90023-9

zbMATH Keywords

chain-complete subsetscontinuous latticescpoeffective setslattice embedding mapsprogram verificationsemantics of programming languagesuniversal domain for data types

Mathematics Subject Classification ID

Lattices (06B99) General topics in the theory of software (68N01) Data structures (68P05) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites work

• Computability theory in admissible domains
• Data Types as Lattices
• scientific article; zbMATH DE number 3490449 (Why is no real title available?)
• scientific article; zbMATH DE number 3550181 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3316891 (Why is no real title available?)
• scientific article; zbMATH DE number 3379785 (Why is no real title available?)

Cited in

(5)

• Borel ideals vs. Borel sets of countable relations and trees
• A Wadge hierarchy for second countable spaces
• Wadge hardness in Scott spaces and its effectivization
• Towards a descriptive set theory for domain-like structures
• Fine hierarchies and m-reducibilities in theoretical computer science

This page was built for publication: Chain properties in Pomega

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