Skip to main content

Bifinite Chu Spaces

  • Conference paper
Algebraic Informatics (CAI 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4728))

Included in the following conference series:

  • 374 Accesses

Abstract

This paper studies colimits of sequences of finite Chu spaces and their ramifications. We consider three base categories of Chu spaces: the generic Chu spaces (C), the extensional Chu spaces (E), and the biextensional Chu spaces (B). The main results are

  • a characterization of monics in each of the three categories;

  • existence (or the lack thereof) of colimits and a characterization of finite objects in each of the corresponding categories using monomorphisms/injections (denoted as iC, iE, and iB, respectively);

  • a formulation of bifinite Chu spaces with respect to iC;

  • the existence of universal, homogeneous Chu spaces in this category.

Unanticipated results driving this development include the fact that:

  • in C, a morphism (f,g) is monic iff f is injective and g is surjective while for E and B, (f,g) is monic iff f is injective (but g is not necessarily surjective);

  • while colimits always exist in iE, it is not the case for iC and iB;

  • not all finite Chu spaces (considered set-theoretically) are finite objects in their categories.

Chu spaces are a general framework for studying the dualities of objects and properties; points and open sets; terms and types, under rich mathematical contexts, with important connections to several sub-disciplines in computer science and mathematics. Traditionally, the study on Chu spaces had a “non-constructive” flavor. There was no framework in which to study constructions on Chu spaces with respect to their behavior in permitting a transition from finite to infinite in a continuous way and to study which constructs are continuous functors in a corresponding algebroidal category. The work presented here provides a basis for a constructive analysis of Chu spaces and opens the door to a more systematic investigation of such an analysis in a variety of settings.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Droste, M., Zhang, G.-Q.: Bifinite Chu spaces. In: Proc. 2nd Conference on Algebra and Coalgebra in Computer Science. LNCS, vol. 4624, pp. 179–193. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  2. Plotkin, G.: A powerdomain construction. SIAM J. Comput. 5, 452–487 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  3. Pratt, V.: Chu spaces. School on Category Theory and Applications, Textos Mat. SCr. B 21, 39–100 (1999)

    MathSciNet  Google Scholar 

  4. Zhang, G.-Q.: Chu spaces, concept lattices, and domains. In: Proceedings of the 19th Conference on the Mathematical Foundations of Programming Semantics, Montreal, Canada, March 2003. Electronic Notes in Theoretical Computer Science, vol. 83, 17 pages (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Symeon Bozapalidis George Rahonis

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Droste, M., Zhang, GQ. (2007). Bifinite Chu Spaces. In: Bozapalidis, S., Rahonis, G. (eds) Algebraic Informatics. CAI 2007. Lecture Notes in Computer Science, vol 4728. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75414-5_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-75414-5_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-75413-8

  • Online ISBN: 978-3-540-75414-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics