The following pages link to (Q5649639):
Displaying 50 items.
- A characterization of Plotkin's order in powerdomains, and some of its properties (Q1069707) (← links)
- On a 'good' dense class of topological spaces (Q1085264) (← links)
- Some modifications of Scott's theorem on injective spaces (Q1088182) (← links)
- A characterization of F-complete type assignments (Q1089331) (← links)
- Retracts of the closure space of filters in the lattice of all subsets (Q1090957) (← links)
- Universal profinite domains (Q1093371) (← links)
- Implication and analysis in classical Frege structures (Q1095139) (← links)
- Recursively defined domains and their induction principles (Q1098615) (← links)
- Type theories, normal forms, and \(D_{\infty}\)-lambda-models (Q1102936) (← links)
- Recursion theorems and effective domains (Q1102949) (← links)
- \(\kappa\)-continuous lattices and comprehension principles for Frege structures (Q1104320) (← links)
- A mathematical theory of randomized computation. I (Q1111027) (← links)
- A guided tour of the mathematics of MetaSoft '88 (Q1111360) (← links)
- Generalization of Scott's formula for retractions from generalized Alexandroff's cube (Q1112360) (← links)
- On the uniqueness of fixed points of endofunctors in a category of complete metric spaces (Q1114959) (← 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)
- A type-free system extending (ZFC) (Q1121865) (← links)
- The contraction property is sufficient to guarantee the uniqueness of fixed points of endofunctors in a category of complete metric spaces (Q1123253) (← links)
- Enlargements of functional algebras for the lambda calculus (Q1129261) (← links)
- \(\mathbb{T}^\omega\) as a universal domain (Q1132085) (← links)
- Least fixed point of a functor (Q1134211) (← links)
- Continuous posets and adjoint sequences (Q1136787) (← links)
- Effectively given domains (Q1137572) (← links)
- The concept of a proposition in classical and quantum physics (Q1141649) (← links)
- Varieties of chain-complete algebras (Q1145208) (← links)
- Colimits of continuous lattices (Q1156821) (← links)
- Chain properties in Pomega (Q1157698) (← links)
- Recursion-closed algebraic theories (Q1157899) (← links)
- Computing with infinite objects (Q1158755) (← links)
- The IO- and OI-hierarchies (Q1161273) (← links)
- A lemma on flatness (Q1163641) (← links)
- Embedding metric spaces into CPO's (Q1164416) (← links)
- Graph grammars and operational semantics (Q1165029) (← links)
- Continuous categories and exponentiable toposes (Q1165305) (← links)
- A class of fuzzy theories (Q1170604) (← links)
- Sequential algorithms on concrete data structures (Q1170880) (← links)
- Towards a foundation for semantics in complete metric spaces (Q1173767) (← links)
- Recursion over realizability structures (Q1173956) (← links)
- Recursive types for Fun (Q1176245) (← links)
- Finite type structures within combinatory algebras (Q1182485) (← links)
- CABool is monadic over almost all categories (Q1184039) (← links)
- Quantitative domains and infinitary algebras (Q1185015) (← links)
- An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus (Q1198661) (← links)
- From algebra to operational semantics (Q1209325) (← links)
- On the cardinality of some lattices (Q1229708) (← links)
- Completeness results for the equivalence of recursive schemas (Q1232171) (← links)
- Computability concepts for programming language semantics (Q1235972) (← links)
- Irreducibility and generation in continuous lattices (Q1236555) (← links)
- The retracts in \(P\omega\) do not form a continuous lattice - a solution to Scott's problem (Q1241760) (← links)
- Categories of chain-complete posets (Q1241798) (← links)
