: Public Note
Created: |
23.5.2022 18.05.06 |
Modified: |
1.8.2022 13.54.06 |
|
Project: |
|
Author: |
John Herring |
Version: |
1.0 |
Phase: |
1.0 |
Status: |
Proposed |
Complexity: |
Easy |
Difficulty: |
|
Priority: |
|
Multiplicity: |
|
Advanced: |
|
UUID: |
{419CEFBC-5517-4c84-B128-D59B3278E99C} |
Appears In: |
Context diagram: TransfiniteSet |
Computer languages often use "set" to indicate only finite sets. Mathematics makes no such restrictions. The "transfiniteSet" defined here is a potentially infinite set usually internally defined by a Boolean function (here called 'contains') which returns TRUE if and only if the tested item is an element of the set. <br/><br/>This interface can be used on any set including finite enumerated sets, or potentially infinite sets defined by a test for 'contains.'<br/>