Nominal sets. Names and symmetry in computer science (Q2849600)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Nominal sets. Names and symmetry in computer science |
scientific article; zbMATH DE number 6210247
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Nominal sets. Names and symmetry in computer science |
scientific article; zbMATH DE number 6210247 |
Statements
23 September 2013
0 references
names
0 references
abstract names
0 references
permutations
0 references
fresheness
0 references
name abstraction
0 references
orbit-finiteness
0 references
Nominal sets. Names and symmetry in computer science (English)
0 references
This book deals with the use of atomic (non-structured) names in computer science from a rigorous and systematic perspective. To this end, the theory of \(G\)-sets is developed in all its details, allowing to introduce the Boolean topos \(\mathrm{Nom}\) of nominal sets, where concepts such as freshness of a name, name abstraction and orbit-finiteness can find a natural and rigorous setting. A precise comparison is also made with other partial attempts in the same direction, that occurred during the years to make rigorous the concepts mentioned above when used in sophisticated situations, both in mathematics and in computer science. Here, the author is not afraid to use all the means provided by category/topos theory, aiming to set at the right degree of abstraction the concepts he is interested in. In this way several important topics, particularly in logic and in denotational semantics, are rethought and placed into a new perspective.
0 references