Papers by Michael Mislove
Theoretical Computer Science, 2004
Electronic Notes in Theoretical Computer Science
Universal algebra is often known within computer science in the guise of algebraic specification ... more Universal algebra is often known within computer science in the guise of algebraic specification or equational logic. In 1963, it was given a category theoretic characterisation in terms of what are now called Lawvere theories. Unlike operations and ...
ABSTRACT In Chapter I we encountered the rich lattice-theoretic structure of continuous lattices.... more ABSTRACT In Chapter I we encountered the rich lattice-theoretic structure of continuous lattices. Perhaps even more typical for these lattices is their wealth of topological structure. The aim or the present chapter is to introduce topology into the study—a program to be continued in Chapter III.
ABSTRACT The first topologies defined on a lattice directly from the lattice ordering (that is, B... more ABSTRACT The first topologies defined on a lattice directly from the lattice ordering (that is, Birkhoffs order topology and Frink’s interval topology) involved “symmetrical” definitions—the topologies assigned to L and to Lop were identical. The guiding example was always the unit interval of real numbers in its natural order, which is of course a highly symmetrical lattice. The initial interest was in such questions as which lattices became compact and/or Hausdorff in these topologies. The Scott topology stands in strong contrast to such an approach. Indeed it is a “one-way” topology, since, for example, all the open sets are always upper sets; thus, for nontrivial lattices, the T0-separation axiom is the strongest it satisfies. Nevertheless, we saw in Chapter II that the Scott topology provides many links between continuous lattices and general topology in such classical areas as the theory of semicontinuous functions and in the study of lattices of closed (compact, convex) sets (ideals) in many familiar structures.
This report documents the program and the outcomes of Dagstuhl Seminar 12352 "Information Flow an... more This report documents the program and the outcomes of Dagstuhl Seminar 12352 "Information Flow and Its Applications". This seminar brought together mathematicians, computer scientists, physicists and researchers from related disciplines such as computational biology who are working on problems concerning information and information flow.
A Compendium of Continuous Lattices, 1980
An academic directory and search engine.
A Compendium of Continuous Lattices, 1980
A Compendium of Continuous Lattices, 1980
An academic directory and search engine.
Theoretical Computer Science - TCS, 2001
Theoretical Computer Science, 1995
Uploads
Papers by Michael Mislove