scientific article; zbMATH DE number 3379785
From MaRDI portal
Publication:5649639
zbMath0239.54006MaRDI QIDQ5649639
Publication date: 1972
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
Insertion of lattice-valued and hedgehog-valued functions ⋮ \textit{SI}-convergence in \(T_0\) spaces ⋮ Some corollaries of the correspondence between partial metrics and multivalued equalities ⋮ Relational graph models, Taylor expansion and extensionality ⋮ On a 'good' dense class of topological spaces ⋮ Some modifications of Scott's theorem on injective spaces ⋮ A characterization of F-complete type assignments ⋮ Retracts of the closure space of filters in the lattice of all subsets ⋮ Universal profinite domains ⋮ Implication and analysis in classical Frege structures ⋮ Lax orthogonal factorisation systems ⋮ Order-adjoint monads and injective objects ⋮ Recursively defined domains and their induction principles ⋮ Type theories, normal forms, and \(D_{\infty}\)-lambda-models ⋮ Recursion theorems and effective domains ⋮ Inconsistency and semantic unification ⋮ Two categories of effective continuous cpos ⋮ Towards a descriptive set theory for domain-like structures ⋮ \(\kappa\)-continuous lattices and comprehension principles for Frege structures ⋮ A mathematical theory of randomized computation. I ⋮ A guided tour of the mathematics of MetaSoft '88 ⋮ Generalization of Scott's formula for retractions from generalized Alexandroff's cube ⋮ On the uniqueness of fixed points of endofunctors in a category of complete metric spaces ⋮ On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory ⋮ A type-free system extending (ZFC) ⋮ Some new intrinsic topologies on complete lattices and the Cartesian closedness of the category of strongly continuous lattices ⋮ The contraction property is sufficient to guarantee the uniqueness of fixed points of endofunctors in a category of complete metric spaces ⋮ Enlargements of functional algebras for the lambda calculus ⋮ \(\mathbb{T}^\omega\) as a universal domain ⋮ Least fixed point of a functor ⋮ Approaching metric domains ⋮ Injective spaces via adjunction ⋮ Continuous posets and adjoint sequences ⋮ Insertion and extension theorems for lattice-valued functions on preordered topological spaces ⋮ Effectively given domains ⋮ On the order-theoretic properties of lower concept formula systems ⋮ The concept of a proposition in classical and quantum physics ⋮ Visible acyclic differential nets. I: Semantics ⋮ A representation of L-domains by information systems ⋮ Varieties of chain-complete algebras ⋮ Colimits of continuous lattices ⋮ Chain properties in Pomega ⋮ Recursion-closed algebraic theories ⋮ Computing with infinite objects ⋮ Non-deterministic information systems and their domains ⋮ The IO- and OI-hierarchies ⋮ Order-preserving reflectors and injectivity ⋮ A lemma on flatness ⋮ Embedding metric spaces into CPO's ⋮ Graph grammars and operational semantics ⋮ Continuous categories and exponentiable toposes ⋮ A class of fuzzy multisets with a fixed number of memberships ⋮ Fuzzy topology with respect to continuous lattices ⋮ Relatively terminal coalgebras ⋮ A class of fuzzy theories ⋮ Sequential algorithms on concrete data structures ⋮ Towards a foundation for semantics in complete metric spaces ⋮ Recursion over realizability structures ⋮ An irregular filter model ⋮ Computability and the morphological complexity of some dynamics on continuous domains ⋮ Recursive types for Fun ⋮ Finite type structures within combinatory algebras ⋮ CABool is monadic over almost all categories ⋮ Quantitative domains and infinitary algebras ⋮ Formal query systems on contexts and a representation of algebraic lattices ⋮ On Kan-injectivity of locales and spaces ⋮ Specification of topological spaces by algebraic systems of continuous functions ⋮ Monotone insertion of lattice-valued functions ⋮ I-categories as a framework for solving domain equations ⋮ Logical foundations for programming semantics ⋮ An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus ⋮ From algebra to operational semantics ⋮ Quantitative domains via fuzzy sets. I: Continuity of fuzzy directed complete posets ⋮ Quantitative domains via fuzzy sets. II: Fuzzy Scott topology on fuzzy directed-complete posets ⋮ On the cardinality of some lattices ⋮ Completeness results for the equivalence of recursive schemas ⋮ Computability in higher types, P\(\omega\) and the completeness of type assignment ⋮ Quotient-reflective and bireflective subcategories of the category of preordered sets ⋮ Convex powerdomains. I ⋮ Computability concepts for programming language semantics ⋮ Irreducibility and generation in continuous lattices ⋮ The retracts in \(P\omega\) do not form a continuous lattice - a solution to Scott's problem ⋮ Categories of chain-complete posets ⋮ Formal topological characterizations of various continuous domains ⋮ A general theory of fuzzy arithmetic ⋮ Solving reflexive domain equations in a category of complete metric spaces ⋮ Functorial polymorphism ⋮ Natural non-dcpo domains and f-spaces ⋮ Type inference with recursive types: Syntax and semantics ⋮ The largest Cartesian closed category of domains ⋮ Expressive power of typed and type-free programming languages ⋮ Domain semantics of possibility computations ⋮ Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms ⋮ Algebraic domain equations ⋮ A systematic study of models of abstract data types ⋮ \(T_ 0\)-spaces and pointwise convergence ⋮ Closure functions and general iterates as reflectors ⋮ A uniform approach to inductive posets and inductive closure ⋮ Admissible representations of effective cpo's ⋮ A characterization of Plotkin's order in powerdomains, and some of its properties
This page was built for publication:
