Class: Math::SetTheory::NumberSet
- Defined in:
- lib/ruuuby/math/set_theory/number_set.rb
Overview
number groupings
Direct Known Subclasses
GroupTheory::CircleGroup, AlgebraicNumbers, BooleanNumbers, ComplexNumbers, EmptySet, ImaginaryNumbers, IntegerNumbers, IrrationalNumbers, NaturalNumbers, NullSet, RationalNumbers, RealAlgebraicNumbers, RealNumbers, UniversalSet, WholeNumbers
Defined Under Namespace
Modules: AlephNumbers
Instance Attribute Summary collapse
-
#name ⇒ Object
readonly
Returns the value of attribute name.
-
#symbol ⇒ Object
readonly
Returns the value of attribute symbol.
-
#𝔠 ⇒ Object
readonly
Returns the value of attribute 𝔠.
Attributes inherited from Closure
Instance Method Summary collapse
- #countable? ⇒ Boolean
- #countably_infinite? ⇒ Boolean
- #finite? ⇒ Boolean
-
#initialize(symbol, cardinality, axioms = {}) ⇒ NumberSet
constructor
A new instance of NumberSet.
- #uncountable? ⇒ Boolean
-
#∋?(n) ⇒ Boolean
—————————————————————————————————————- _ __ _ __ __ __ __ _ __ __ |/| |__ |/| |__) |__ |__) /__` |__| | |__) / ‘ |__| |__ / ` |__/ /__` | | |_ | | |__) |_ | \ .__/ | | | | __, | | |_ __, | \ .__/ —————————————————————————————————————-.
- #∌?(n) ⇒ Boolean
-
#⊂?(s) ⇒ Boolean
proper subset?.
-
#⊃?(s) ⇒ Boolean
proper subset?.
-
#⊄?(s) ⇒ Boolean
not subset?.
-
#⊅?(s) ⇒ Boolean
not subset?.
-
#⊆?(s) ⇒ Boolean
subset?.
-
#⊇?(s) ⇒ Boolean
subset?.
Constructor Details
#initialize(symbol, cardinality, axioms = {}) ⇒ NumberSet
Returns a new instance of NumberSet.
37 38 39 40 41 42 43 44 45 |
# File 'lib/ruuuby/math/set_theory/number_set.rb', line 37 def initialize(symbol, cardinality, axioms={}) super(axioms) |
Instance Attribute Details
#name ⇒ Object (readonly)
Returns the value of attribute name.
14 15 16 |
# File 'lib/ruuuby/math/set_theory/number_set.rb', line 14 def name @name end |
#symbol ⇒ Object (readonly)
Returns the value of attribute symbol.
14 15 16 |
# File 'lib/ruuuby/math/set_theory/number_set.rb', line 14 def symbol @symbol end |
#𝔠 ⇒ Object (readonly)
Returns the value of attribute 𝔠.
14 15 16 |
# File 'lib/ruuuby/math/set_theory/number_set.rb', line 14 def |
Instance Method Details
#countable? ⇒ Boolean
153 |
# File 'lib/ruuuby/math/set_theory/number_set.rb', line 153 def countable?; (self.countably_infinite? || self.finite?); end |
#countably_infinite? ⇒ Boolean
156 |
# File 'lib/ruuuby/math/set_theory/number_set.rb', line 156 def countably_infinite?; @ |
#finite? ⇒ Boolean
150 |
# File 'lib/ruuuby/math/set_theory/number_set.rb', line 150 def finite?; (@ |
#uncountable? ⇒ Boolean
159 |
# File 'lib/ruuuby/math/set_theory/number_set.rb', line 159 def uncountable?; (@ |
#∋?(n) ⇒ Boolean
___ __ ___ __ __ __ __ ___ __ __
|\/| |__ |\/| |__) |__ |__) /__` |__| | |__) / ` |__| |__ / ` |__/ /__`
| | |___ | | |__) |___ | \ .__/ | | | | \__, | | |___ \__, | \ .__/
53 54 55 56 57 58 59 |
# File 'lib/ruuuby/math/set_theory/number_set.rb', line 53 def |
#∌?(n) ⇒ Boolean
61 |
# File 'lib/ruuuby/math/set_theory/number_set.rb', line 61 def |
#⊂?(s) ⇒ Boolean
proper subset?
74 75 76 77 78 79 80 81 |
# File 'lib/ruuuby/math/set_theory/number_set.rb', line 74 def |
#⊃?(s) ⇒ Boolean
proper subset?
102 103 104 105 106 107 108 109 110 111 |
# File 'lib/ruuuby/math/set_theory/number_set.rb', line 102 def |
#⊄?(s) ⇒ Boolean
not subset?
141 |
# File 'lib/ruuuby/math/set_theory/number_set.rb', line 141 def |
#⊅?(s) ⇒ Boolean
not subset?
134 |
# File 'lib/ruuuby/math/set_theory/number_set.rb', line 134 def |
#⊆?(s) ⇒ Boolean
subset?
88 89 90 91 92 93 94 95 |
# File 'lib/ruuuby/math/set_theory/number_set.rb', line 88 def |
#⊇?(s) ⇒ Boolean
subset?
118 119 120 121 122 123 124 125 126 127 |
# File 'lib/ruuuby/math/set_theory/number_set.rb', line 118 def |