Set Theory in Computer Science - A Gentle Introduction to Mathematical Modeling I

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

University of Illinois at Urbana-Champaign Urbana, IL 61801, USA, 2011. — 183 p.
Table of Contents:
Motivation.
Set Theory as an Axiomatic Theory.
The Empty Set, Extensionality, and Separation.
Pairing, Unions, Powersets, and Infinity.
Case Study: A Computable Model of Hereditarily Finite Sets.
Relations, Functions, and Function Sets.
Simple and Primitive Recursion, and the Peano Axioms.
Case Study: The Peano Language.
Binary Relations on a Set.
Case Study: Fixpoint Semantics of Recursive Functions and Lispy.
Sets Come in Different Sizes.
I-Indexed Sets.
From I-Indexed Sets to Sets, and the Axiom of Choice.
Well-Founded Relations, and Well-Founded Induction and Recursion.
Cardinal Numbers and Cardinal Arithmetic.
Classes, Intensional Relations and Functions, and Replacement.
Case Study: Dependent and Polymorphic Types in Maude.
Well Orders, Ordinals, Cardinals, and Transfinite Constructions.
Well-Founded Sets and The Axiom of Foundation.

Author(s): José Meseguer.

Language: English
Commentary: 1529183
Tags: Математика;Математическая логика;Теория множеств