| Articolul precedent |
| Articolul urmator |
 |
 746 3 |
| Ultima descărcare din IBN: 2023-02-16 17:23 |
 SM ISO690:2012ALEXANDRU, Andrei, ANDRIES, Alexandru, CIOBANU, Gabriel. Countable Sets in Finitely Supported Mathematics. In: Conference on Mathematical Foundations of Informatics, Ed. 2016, 25-30 iulie 2016, Chișinău. Chișinău, Republica Moldova: "VALINEX" SRL, 2016, pp. 125-143. ISBN 978‐9975‐4237‐4‐8. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
| Conference on Mathematical Foundations of Informatics 2016 | ||||||
|
Conferința "Conference on Mathematical Foundations of Informatics" 2016, Chișinău, Moldova, 25-30 iulie 2016 | ||||||
|
||||||
| Pag. 125-143 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
This paper presents the notion of countable set in a recently developed framework, named Finitely Supported Mathematics. This new framework actually represents a reformulation of Zermelo-Fraenkel mathematics in the world of invariant or finitely supported structures. It was introduced in order to characterize infinite objects by using their finite supports. We prove some algebraic properties of the countable sets, and establish several relationships between countable union theorems and countable choice principles in Finitely Supported Mathematics. |
||||||
| Cuvinte-cheie countable sets, invariant sets, countable choice principles, countable union theorems, finitely supported structures |
||||||
|
|
|
|
