# Set Theory and Algebra in Computer Science A Gentle Introduction to Mathematical Modeling

@inproceedings{Meseguer2013SetTA, title={Set Theory and Algebra in Computer Science A Gentle Introduction to Mathematical Modeling}, author={Jos{\'e} Meseguer}, year={2013} }

Algebra greatly broadened the very notion of algebra in two ways. First, the traditional numerical domains such as Z, Q R, and C, were now seen as instances of more general concepts of equationally-defined algebraic structure, which did not depend on any particular representation for their elements, but only on abstract sets of elements, operations on such elements, and equational properties satisfied by such operations. In this way, the integers Z were seen as an instance of the ring algebraic…

## Figures from this paper

## References

SHOWING 1-10 OF 46 REFERENCES

The Category of Categories as a Foundation for Mathematics

- Philosophy
- 1966

In the mathematical development of recent decades one sees clearly the rise of the conviction that the relevant properties of mathematical objects are those which can be stated in terms of their…

Order-Sorted Algebra I: Equational Deduction for Multiple Inheritance, Overloading, Exceptions and Partial Operations

- Mathematics, Computer ScienceTheor. Comput. Sci.
- 1992

Termination Modulo Combinations of Equational Theories

- Computer ScienceFroCoS
- 2009

This work proposes a modular termination proof method based on semantics- and termination-preserving transformations that can reduce the proof oftermination of rules R modulo E to an equivalent proof of termination of the transformed rules modulo a typically much simpler set B of axioms.

Toward a mathematical semantics for computer languages

- Computer Science
- 1971

The purpose of a mathematical semantics is to give a correct and meaningful correspondence between programs and mathematical entities in a way that is entirely independent of an implementation.

Membership algebra as a logical framework for equational specification

- PhilosophyWADT
- 1997

The paper presents the basic properties of the logic and its models, and discusses in detail how many total and partial equational specification formalisms can be represented in it, as well as the practical benefits in terms of tool reusability that this opens up for other languages, including CASL.

Institutions: abstract model theory for specification and programming

- Computer ScienceJACM
- 1992

This paper says that any institution such that signatures can be glued together, also allows gluing together theories (which are just collections of sentences over a fixed signature), and shows how to define institutions that allow sentences and constraints from two or more institutions.

From Frege to Gödel: A Source Book in Mathematical Logic, 1879-1931

- Philosophy
- 1967

The fundamental texts of the great classical period in modern logic, some of them never before available in English translation, are here gathered together for the first time. Modern logic, heralded…