Skip to main content
SpringerLink
Log in

Mathematical Foundations of Computer Science

Sets, Relations, and Induction

  • Textbook
  • © 1991

Overview

Authors:
  1. Peter A. Fejer

    1. Department of Math and Computer Science, University of Massachussetts at Boston, Boston, USA

    View author publications

    You can also search for this author in PubMed   Google Scholar

  2. Dan A. Simovici

    1. Department of Math and Computer Science, University of Massachussetts at Boston, Boston, USA

    View author publications

    You can also search for this author in PubMed   Google Scholar

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

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

Access this book

Log in via an institution
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

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (5 chapters)

  1. Front Matter

    Pages i-x
    Download chapter PDF

  2. Elementary Set Theory

    • Peter A. Fejer, Dan A. Simovici
    Pages 1-22

  3. Relations and Functions

    • Peter A. Fejer, Dan A. Simovici
    Pages 23-125

  4. Partially Ordered Sets

    • Peter A. Fejer, Dan A. Simovici
    Pages 127-175

  5. Induction

    • Peter A. Fejer, Dan A. Simovici
    Pages 177-337

  6. Enumerability and Diagonalization

    • Peter A. Fejer, Dan A. Simovici
    Pages 339-416

  7. Back Matter

    Pages 417-428
    Download chapter PDF
Back to top

Keywords

About this book

Mathematical Foundations of Computer Science, Volume I is the first of two volumes presenting topics from mathematics (mostly discrete mathematics) which have proven relevant and useful to computer science. This volume treats basic topics, mostly of a set-theoretical nature (sets, functions and relations, partially ordered sets, induction, enumerability, and diagonalization) and illustrates the usefulness of mathematical ideas by presenting applications to computer science. Readers will find useful applications in algorithms, databases, semantics of programming languages, formal languages, theory of computation, and program verification. The material is treated in a straightforward, systematic, and rigorous manner. The volume is organized by mathematical area, making the material easily accessible to the upper-undergraduate students in mathematics as well as in computer science and each chapter contains a large number of exercises. The volume can be used as a textbook, but it will also be useful to researchers and professionals who want a thorough presentation of the mathematical tools they need in a single source. In addition, the book can be used effectively as supplementary reading material in computer science courses, particularly those courses which involve the semantics of programming languages, formal languages and automata, and logic programming.

Authors and Affiliations

  • Department of Math and Computer Science, University of Massachussetts at Boston, Boston, USA

    Peter A. Fejer, Dan A. Simovici

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation