Countability constraints in order-theoretic approaches to computability

DOI10.1017/s0960129524000173MaRDI QIDQ6635153

Daniel A. Braun, Sebastian Gottwald, Pedro Hack

Publication date: 9 November 2024

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

zbMATH Keywords

domain theoryorder densitymulti-utilityuncountable computability

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Richter-Peleg multi-utility representations of preorders
• Utility representation of an incomplete preference relation
• Entropy as a fixed point
• A domain-theoretic approach to computability on the real line
• Topology, domain theory and theoretical computer science
• Computation on metric spaces via domain theory
• The physics and mathematics of the second law of thermodynamics
• Computable functionals of finite types
• Real number computability and domain theory
• Representing preorders with injective monotones
• On the multi-utility representation of preference relations
• Axiomatic thermodynamics and extensive measurement
• On computable numbers, with an application to the Entscheidungsproblem. A correction.
• On computable numbers, with an application to the Entscheidungsproblem.
• Reducibility of domain representations and Cantor–Weihrauch domain representations
• Existence of an order-preserving function on normally preordered spaces
• Inequalities: theory of majorization and its applications
• The classification of preordered spaces in terms of monotones: complexity and optimization

This page was built for publication: Countability constraints in order-theoretic approaches to computability