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
Unnamed Item, A computable expression of closure to efficient causation, Banach's fixed-point theorem as a base for data-type equations, Essential extensions of Hausdorff spaces, Unnamed Item, Continuous prequantale models of \(T_1\) topological semigroups, Characterizations of supercontinuous posets via Scott \(S\)-sets and the \(S\)-essential topology, A note on continuous partially ordered sets, The HASCASL prologue: Categorical syntax and semantics of the partial \(\lambda\)-calculus, Intersection types and lambda models, Parametrized fixed points and their applications to session types, Exponentiable Grothendieck categories in flat algebraic geometry, Fuzzy bases of fuzzy domains, The monad of probability measures over compact ordered spaces and its Eilenberg-Moore algebras, Fibrewise injectivity in order and topology, Unnamed Item, A concrete realization of the Hoare powerdomain, Unnamed Item, Borel measures in consonant spaces, When does the Fell topology on a hyperspace of closed sets coincide with the meet of the upper Kuratowski and the lower Vietoris topologies?, The connection between initial and unique solutions of domain equations in the partial order and metric approach, A type theoretic interpretation of constructive domain theory, Injective hulls of quantale-enriched multicategories, A novel framework for lim-inf convergence in posets, Pro-compactly finite MV-algebras, Limiting semantics of numerical programs, Fibrewise injectivity and Kock-Zöberlein monads, Totally distributive toposes, Fixed points and completeness in metric and generalized metric spaces, A model of guarded recursion via generalised equilogical spaces, Lattice-valued Scott topology on dcpos, On \(d\)-spaces, A note on injective spaces., Constructive metrisability in point-free topology., First-countability, sequentiality and tightness of the upper Kuratowski convergence, L-fuzzy Scott Topology and Scott Convergence of Stratified L-filters on Fuzzy Dcpos, Intersection types and domain operators, Behavioural inverse limit \(\lambda\)-models, Web spaces and worldwide web spaces: topological aspects of domain theory, How a Computer Should Think, A Useful Four-Valued Logic, Thompson aggregators, Scott continuous koopmans operators, and least fixed point theory, New representations of algebraic domains and algebraic L-domains via closure systems, Aggregation functions on \(n\)-dimensional ordered vectors equipped with an admissible order and an application in multi-criteria group decision-making, A categorical approach to the maximum theorem, Strongly semicontinuous lattices, Characterizations of various continuities of posets via approximated elements, Stability of efficient sets: continuity of mobile polarities, Projective sup-algebras: a general view, Non-Archimedean game theory: a numerical approach, Unnamed Item, Unnamed Item, Unnamed Item, Unifying theories of reactive design contracts, A stable programming language, Unnamed Item, PASCAL in LCF: Semantics and examples of proof, A global representation of the recursive functions in the \(\lambda\)- calculus, Unnamed Item, Categories of locally hypercompact spaces and quasicontinuous posets, Scott approach distance on metric spaces, Existence of well-filterifications of \(T_0\) topological spaces, Some results on fuzzy \(Z_{L}\)-continuous(algebraic) poset, Fixed-point constructions in order-enriched categories, Sobrification of partially ordered sets, A generalized setting for fixpoint theory, Kantorovich-Rubinstein quasi-metrics. II: Hyperspaces and powerdomains, The Vietoris monad and weak distributive laws, Algebraic specification of data types: A synthetic approach, Induction and recursion on the partial real line with applications to Real PCF, Inconsistency without contradiction, Self-similar sets as Tarski's fixed points, Continuously generated fixed points, Recursive domain equations for concrete data structure, Describing semantic domains with sprouts, Equational logic of circular data type specification, Fuzzy \(Z\)-continuous posets, Generalized filter models, Classifying categories for partial equational logic, On well-filtered reflections of \(T_0\) spaces, Precedence-inclusion patterns and relational learning, Properly injective spaces and function spaces, The way-below relation of function spaces over semantic domains, Topology, domain theory and theoretical computer science, From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models, Caratterizzazione dei reticoli continui per la teoria della computazione di Dana Scott, Cofibrantly generated lax orthogonal factorisation systems, Integration in Real PCF, The Bicategory-Theoretic Solution of Recursive Domain Equations, On envelopes and backward approximations, Fuzzy cores and their extensions, Type inference, abstract interpretation and strictness analysis, The genericity theorem and parametricity in the polymorphic \(\lambda\)- calculus, Set-theoretical and other elementary models of the \(\lambda\)-calculus, The comparison of a cpo-based semantics with a cms-based semantics for \(CSP\), Two Cartesian closed subcategories of fuzzy domains, Combining type disciplines, A categorical representation of algebraic domains based on variations of rough approximable concepts, Taut monads and \(T0\)-spaces., Function-space compactifications of function spaces, 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, Linear domains and linear maps, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Size-based termination of higher-order rewriting, Unnamed Item, Full abstraction and the Context Lemma (preliminary report), Bisimulation and propositional intuitionistic logic, Unnamed Item, A categorical isomorphism between injective balanced \(L\)-\(S_0\)-convex spaces and fuzzy frames, Algebraic representation of frame-valued continuous lattices via the open filter monad, Topological representations of Lawson compact algebraic L-domains and Scott domains, K-theory of large categories, Unnamed Item, Domain theory aspects of extensions of integral domains, DS-partial metric spaces and domain theory, Some further results on pointfree convex geometry, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Convergence and quantale-enriched categories, Towards Lambda Calculus Order-Incompleteness, Continuous Domains and their Information System Representation as Logical Systems, Intersection Types and Computational Rules, A \(\kappa\)-denotational semantics for map theory in ZFC+SI, Unnamed Item, Lax orthogonal factorisations in ordered structures, Intersection types for \(\lambda\)-trees, Two applications of analytic functors, On the construction of stable models of untyped \(\lambda\)-calculus, Lazy Lambda calculus: Theories, models and local structure characterization, Lower topological algebraic domain models of topological spaces, Unnamed Item, Unnamed Item, Extending set functors to generalised metric spaces, Unnamed Item, Unnamed Item, Unnamed Item, Topological semigroups and their prequantale models, A representation of continuous lattices based on closure spaces, Unnamed Item
