Compact Semantics on BC-Domains

Conference paper
Part of the Semantic Structures in Computation book series (SECO, volume 1)


In this paper continuity for abstract semantics defined for lattices is generalized to the case of bc-domains, an equivalent characterization for semantics being continuous is given. Relation between continuity and compactness is given. Finally, application to fuzzy logic is discussed.


domain abstract semantics compactness continuity 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. S. Abramsky and A. Jung, Domain Theory, In Handbook of Logic in Computer Science, Vol. 3, 1–168, Oxford University Press, 1996.Google Scholar
  2. 2.
    R. Engelking, General Topology, Warzawa, 1977.Google Scholar
  3. 3.
    G. Gerla, Fuzzy Logic, Preprint, University of Salerno, 1999Google Scholar
  4. 4.
    G. Gierz A Compendium of Continuous Lattices Springer-Verlag,1980.Google Scholar
  5. 5.
    J. A. Goguen, The Logic of Inexact ConceptsSynthese, 19(1968), 325–375.CrossRefGoogle Scholar
  6. 6.
    G. J. Wang, Theory of Granular lattices and itsapplications, Computers and Mathematics with applications, Vol. 39(12), 1–9.Google Scholar
  7. 7.
    L. A. Zadeh, Fuzzy Sets, Information and Control, 12(1965), 338–353.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2001

Authors and Affiliations

  1. 1.Department of MathematicsNingbo UniversityNingbo, ZhejiangChina
  2. 2.Department of MathematicsShaanxi Normal UniversityXi’anChina

Personalised recommendations