Skip to main content

Fixpunkttheorie

  • Chapter
  • 23 Accesses

Part of the book series: Leitfäden und Monographien der Informatik ((LMI))

Zusammenfassung

In diesem Kapitel werden Mengenabbildungen τ über einer Grundmenge M betrachtet, also τ: P(M)→P(M).

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   49.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   44.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliographische Schlussbemerkungen

  • A. Tarski, A Lattice-Theoretical Fixpoint Theorem and its Applications, Pacific J. Math. 5 (1955), S. 285–309.

    Article  MathSciNet  MATH  Google Scholar 

  • J. E. Stoy, Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory. MIT Press, 1977.

    Google Scholar 

Download references

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1988 B. G. Teubner Stuttgart

About this chapter

Cite this chapter

Engeler, E., Läuchli, P. (1988). Fixpunkttheorie. In: Berechnungstheorie für Informatiker. Leitfäden und Monographien der Informatik. Vieweg+Teubner Verlag, Wiesbaden. https://doi.org/10.1007/978-3-322-93085-9_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-322-93085-9_3

  • Publisher Name: Vieweg+Teubner Verlag, Wiesbaden

  • Print ISBN: 978-3-519-02258-9

  • Online ISBN: 978-3-322-93085-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics