Skip to main content
SpringerLink
Log in

Sets for Problem Solving

  • Chapter
Book cover Set Theory for Computing

Part of the book series: Monographs in Computer Science ((MCS))

  • 266 Accesses

Abstract

This chapter provides many examples of how set theory is used to specify problems and algorithms and to characterize precisely domains formed by mathematical entities (e.g., numeric fields) or formed by algorithmic data structures (e.g., by trees).

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

  1. Dipartimento di Matematica e Informatica, Università di Catania, I-95125, Catania, Italy

    Domenico Cantone

  2. Dipartimento di Matematica Pura e Applicata, Università di L’Aquila, I-67100, L’Aquila, Italy

    Eugenio Omodeo

  3. Dipartimento di Matematica e Informatica, Università degli Studi di Udine, I-33100, Udine, Italy

    Alberto Policriti

Authors
  1. Domenico Cantone
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Eugenio Omodeo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alberto Policriti
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer Science+Business Media New York

About this chapter

Cite this chapter

Cantone, D., Omodeo, E., Policriti, A. (2001). Sets for Problem Solving. In: Set Theory for Computing. Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-3452-2_5

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-3452-2_5

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4419-2905-1

  • Online ISBN: 978-1-4757-3452-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation