國立虎尾科技大學 |

Finitely Supported Mathematics = An Introduction /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Finitely Supported Mathematics/ by Andrei Alexandru, Gabriel Ciobanu.
Reminder of title:	An Introduction /
Author:	Alexandru, Andrei.
other author:	Ciobanu, Gabriel.
Description:	VII, 185 p.online resource. :
Contained By:	Springer Nature eBook
Subject:	Computers. -
Online resource:	https://doi.org/10.1007/978-3-319-42282-4
ISBN:	9783319422824

Finitely Supported Mathematics = An Introduction /
Alexandru, Andrei.

Finitely Supported MathematicsAn Introduction /[electronic resource] :by Andrei Alexandru, Gabriel Ciobanu. - 1st ed. 2016. - VII, 185 p.online resource.

Introduction -- Fraenkel-Mostowski Set Theory: A Framework for Finitely Supported Mathematics -- Algebraic Structures in Finitely Supported Mathematics -- Extended Fraenkel-Mostowski Set Theory -- Process Calculi in Finitely Supported Mathematics -- References. .

In this book the authors present an alternative set theory dealing with a more relaxed notion of infiniteness, called finitely supported mathematics (FSM). It has strong connections to the Fraenkel-Mostowski (FM) permutative model of Zermelo-Fraenkel (ZF) set theory with atoms and to the theory of (generalized) nominal sets. More exactly, FSM is ZF mathematics rephrased in terms of finitely supported structures, where the set of atoms is infinite (not necessarily countable as for nominal sets). In FSM, 'sets' are replaced either by `invariant sets' (sets endowed with some group actions satisfying a finite support requirement) or by `finitely supported sets' (finitely supported elements in the powerset of an invariant set). It is a theory of `invariant algebraic structures' in which infinite algebraic structures are characterized by using their finite supports. After explaining the motivation for using invariant sets in the experimental sciences as well as the connections with the nominal approach, admissible sets and Gandy machines (Chapter 1), the authors present in Chapter 2 the basics of invariant sets and show that the principles of constructing FSM have historical roots both in the definition of Tarski `logical notions' and in the Erlangen Program of Klein for the classification of various geometries according to invariants under suitable groups of transformations. Furthermore, the consistency of various choice principles is analyzed in FSM. Chapter 3 examines whether it is possible to obtain valid results by replacing the notion of infinite sets with the notion of invariant sets in the classical ZF results. The authors present techniques for reformulating ZF properties of algebraic structures in FSM. In Chapter 4 they generalize FM set theory by providing a new set of axioms inspired by the theory of amorphous sets, and so defining the extended Fraenkel-Mostowski (EFM) set theory. In Chapter 5 they define FSM semantics for certain process calculi (e.g., fusion calculus), and emphasize the links to the nominal techniques used in computer science. They demonstrate a complete equivalence between the new FSM semantics (defined by using binding operators instead of side conditions for presenting the transition rules) and the known semantics of these process calculi. The book is useful for researchers and graduate students in computer science and mathematics, particularly those engaged with logic and set theory.

ISBN: 9783319422824

Standard No.: 10.1007/978-3-319-42282-4doiSubjects--Topical Terms:

565115
Computers.

LC Class. No.: QA75.5-76.95

Dewey Class. No.: 004.0151

Finitely Supported Mathematics = An Introduction /
LDR:04098nam a22004215i 4500 001 980016
003 DE-He213
005 20200630003918.0
007 cr nn 008mamaa
008 201211s2016 gw | s |||| 0|eng d
020 $a 9783319422824 $9 978-3-319-42282-4
024 7 $a 10.1007/978-3-319-42282-4 $2 doi
035 $a 978-3-319-42282-4
050 4 $a QA75.5-76.95
050 4 $a QA76.63
072 7 $a UY $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a UY $2 thema
072 7 $a UYA $2 thema
082 0 4 $a 004.0151 $2 23
100 1 $a Alexandru, Andrei. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1111272
245 1 0 $a Finitely Supported Mathematics $h [electronic resource] : $b An Introduction / $c by Andrei Alexandru, Gabriel Ciobanu.
250 $a 1st ed. 2016.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2016.
300 $a VII, 185 p. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
505 0 $a Introduction -- Fraenkel-Mostowski Set Theory: A Framework for Finitely Supported Mathematics -- Algebraic Structures in Finitely Supported Mathematics -- Extended Fraenkel-Mostowski Set Theory -- Process Calculi in Finitely Supported Mathematics -- References. .
520 $a In this book the authors present an alternative set theory dealing with a more relaxed notion of infiniteness, called finitely supported mathematics (FSM). It has strong connections to the Fraenkel-Mostowski (FM) permutative model of Zermelo-Fraenkel (ZF) set theory with atoms and to the theory of (generalized) nominal sets. More exactly, FSM is ZF mathematics rephrased in terms of finitely supported structures, where the set of atoms is infinite (not necessarily countable as for nominal sets). In FSM, 'sets' are replaced either by `invariant sets' (sets endowed with some group actions satisfying a finite support requirement) or by `finitely supported sets' (finitely supported elements in the powerset of an invariant set). It is a theory of `invariant algebraic structures' in which infinite algebraic structures are characterized by using their finite supports. After explaining the motivation for using invariant sets in the experimental sciences as well as the connections with the nominal approach, admissible sets and Gandy machines (Chapter 1), the authors present in Chapter 2 the basics of invariant sets and show that the principles of constructing FSM have historical roots both in the definition of Tarski `logical notions' and in the Erlangen Program of Klein for the classification of various geometries according to invariants under suitable groups of transformations. Furthermore, the consistency of various choice principles is analyzed in FSM. Chapter 3 examines whether it is possible to obtain valid results by replacing the notion of infinite sets with the notion of invariant sets in the classical ZF results. The authors present techniques for reformulating ZF properties of algebraic structures in FSM. In Chapter 4 they generalize FM set theory by providing a new set of axioms inspired by the theory of amorphous sets, and so defining the extended Fraenkel-Mostowski (EFM) set theory. In Chapter 5 they define FSM semantics for certain process calculi (e.g., fusion calculus), and emphasize the links to the nominal techniques used in computer science. They demonstrate a complete equivalence between the new FSM semantics (defined by using binding operators instead of side conditions for presenting the transition rules) and the known semantics of these process calculi. The book is useful for researchers and graduate students in computer science and mathematics, particularly those engaged with logic and set theory.
650 0 $a Computers. $3 565115
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Mathematical logic. $2 bicssc $3 810627
650 0 $a Algebra. $2 gtt $3 579870
650 1 4 $a Theory of Computation. $3 669322
650 2 4 $a Mathematics of Computing. $3 669457
650 2 4 $a Mathematical Logic and Foundations. $3 669393
700 1 $a Ciobanu, Gabriel. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 815308
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783319422817
776 0 8 $i Printed edition: $z 9783319422831
776 0 8 $i Printed edition: $z 9783319825458
856 4 0 $u https://doi.org/10.1007/978-3-319-42282-4
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)