Hint

Swipe to navigate through the chapters of this book

2014 | OriginalPaper | Chapter

2. Mathematical Background

Author: Maribel Fernández

Publisher: Springer London

Published in: Programming Languages and Operational Semantics

» Get access to the full version

Abstract

We start this chapter with a summary of basic concepts and notations for sets and first-order logic formulas, which will be used in the rest of the book.

Please log in to get access to this content

To get access to this content you need the following product:

Computer Science Explorer

Purchase now

More formally, an inductive set is defined as the least fixed point of an operator, which, under certain conditions, is guaranteed to exist.

D. Makinson, Sets, Logic and Maths for Computing, 2nd edn., Undergraduate topics in computer science (Springer, Berlin, 2012)

R. Harper, Practical Foundations for Programming Languages (Cambridge University Press, Cambridge, 2013)

G. Winskel, The Formal Semantics of Programming Languages, Foundations of computing (MIT Press, Cambridge, 1993)

G. Dowek, Proofs and Algorithms—An Introduction to Logic and Computability, Undergraduate topics in computer science (Springer, Berlin, 2011)

Title

Mathematical Background

Book

Programming Languages and Operational Semantics

Print ISBN: 978-1-4471-6367-1

Electronic ISBN: 978-1-4471-6368-8

https://doi.org/10.1007/978-1-4471-6368-8

DOI

https://doi.org/10.1007/978-1-4471-6368-8_2

Author:

Maribel Fernández

Publisher

Springer London

Sequence number

Chapter number

Chapter 2