Pages that link to "Item:Q1132085"
From MaRDI portal
The following pages link to \(\mathbb{T}^\omega\) as a universal domain (Q1132085):
Displaying 44 items.
- \(\mathbb T^\omega\) as a stable universal domain. (Q276416) (← links)
- Atomicity, coherence of information, and point-free structures (Q290637) (← links)
- Computability in higher types, P\(\omega\) and the completeness of type assignment (Q579245) (← links)
- Intrinsic approach spaces on domains (Q645198) (← links)
- On stable domains (Q685428) (← links)
- Realizability models refuting Ishihara's boundedness principle (Q714714) (← links)
- Stability and computability in coherent domains (Q752707) (← links)
- Completeness of type assignment in continuous lambda models (Q792995) (← links)
- Using information systems to solve recursive domain equations (Q808273) (← links)
- Configuration structures, event structures and Petri nets (Q843106) (← links)
- A category-theoretic characterization of functional completeness (Q912587) (← links)
- Algebraic domain equations (Q1054464) (← links)
- Admissible representations of effective cpo's (Q1068562) (← links)
- Universal profinite domains (Q1093371) (← links)
- On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory (Q1120558) (← links)
- Varieties of chain-complete algebras (Q1145208) (← links)
- Free upper regular bands (Q1158953) (← links)
- Universal homogeneous event structures and domains (Q1175945) (← links)
- Finite type structures within combinatory algebras (Q1182485) (← links)
- Coherence and consistency in domains (Q1262787) (← links)
- Induction and recursion on the partial real line with applications to Real PCF (Q1274810) (← links)
- Properly injective spaces and function spaces (Q1295213) (← links)
- General recursive functions in a very simply interpretable typed \(\lambda\)-calculus (Q1314352) (← links)
- Concrete domains (Q1314355) (← links)
- Set-theoretical and other elementary models of the \(\lambda\)-calculus (Q1314361) (← links)
- Limiting semantics of numerical programs (Q1392276) (← links)
- Continuously generated fixed points (Q1823004) (← links)
- On the semantics of polymorphism (Q1835664) (← links)
- Cartesian closed categories of separable Scott domains (Q2253174) (← links)
- The constructive maximal point space and partial metrizability (Q2575776) (← links)
- (Q2843631) (← links)
- A stable universal domain related to <i><sup>ω</sup></i> (Q2971120) (← links)
- Existence of strongly proper dyadic subbases (Q2980983) (← links)
- Universal domains and the amalgamation property (Q4279243) (← links)
- Trees from Functions as Processes (Q4585071) (← links)
- Properties of domain representations of spaces through dyadic subbases (Q4593246) (← links)
- Nonflatness and totality (Q4611200) (← links)
- What is a universal higher-order programming language? (Q4630303) (← links)
- Representations of Complete Uniform Spaces via Uniform Domains (Q4916193) (← links)
- Normal forms, linearity, and prime algebraicity over nonflat domains (Q5109211) (← links)
- Lazy Lambda calculus: Theories, models and local structure characterization (Q5204341) (← links)
- Almost Every Domain is Universal (Q5262933) (← links)
- On the ubiquity of certain total type structures (Q5430138) (← links)
- Domains via graphs (Q5956841) (← links)
