Class: Math::SetTheory::NumberSet

Inherits:
Closure show all
Defined in:
lib/ruuuby/math/set_theory/number_set.rb

Overview

number groupings

Defined Under Namespace

Modules: AlephNumbers

Instance Attribute Summary collapse

Attributes inherited from Closure

#axioms

Instance Method Summary collapse

Constructor Details

#initialize(symbol, cardinality, axioms = {}) ⇒ NumberSet

Returns a new instance of NumberSet.

Parameters:



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

#nameObject (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

#symbolObject (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

Returns:

  • (Boolean)


153
# File 'lib/ruuuby/math/set_theory/number_set.rb', line 153

def countable?; (self.countably_infinite? || self.finite?); end

#countably_infinite?Boolean

Returns:

  • (Boolean)


156
# File 'lib/ruuuby/math/set_theory/number_set.rb', line 156

def countably_infinite?; @

#finite?Boolean

Returns:

  • (Boolean)


150
# File 'lib/ruuuby/math/set_theory/number_set.rb', line 150

def finite?; (@

#uncountable?Boolean

Returns:

  • (Boolean)


159
# File 'lib/ruuuby/math/set_theory/number_set.rb', line 159

def uncountable?; (@

#∋?(n) ⇒ Boolean


      ___        __   ___  __   __          __      __        ___  __        __
|\/| |__   |\/| |__) |__  |__) /__` |__| | |__)    /  ` |__| |__  /  ` |__/ /__`
|  | |___  |  | |__) |___ |  \ .__/ |  | | |       \__, |  | |___ \__, |  \ .__/

Returns:

  • (Boolean)


53
54
55
56
57
58
59
# File 'lib/ruuuby/math/set_theory/number_set.rb', line 53

def 

#∌?(n) ⇒ Boolean

Returns:

  • (Boolean)


61
# File 'lib/ruuuby/math/set_theory/number_set.rb', line 61

def 

#⊂?(s) ⇒ Boolean

proper subset?

Parameters:

  • (*)

Returns:

  • (Boolean)


74
75
76
77
78
79
80
81
# File 'lib/ruuuby/math/set_theory/number_set.rb', line 74

def 

#⊃?(s) ⇒ Boolean

proper subset?

Parameters:

  • (*)

Returns:

  • (Boolean)


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?

Parameters:

  • (*)

Returns:

  • (Boolean)


141
# File 'lib/ruuuby/math/set_theory/number_set.rb', line 141

def 

#⊅?(s) ⇒ Boolean

not subset?

Parameters:

  • (*)

Returns:

  • (Boolean)


134
# File 'lib/ruuuby/math/set_theory/number_set.rb', line 134

def 

#⊆?(s) ⇒ Boolean

subset?

Parameters:

  • (*)

Returns:

  • (Boolean)


88
89
90
91
92
93
94
95
# File 'lib/ruuuby/math/set_theory/number_set.rb', line 88

def 

#⊇?(s) ⇒ Boolean

subset?

Parameters:

  • (*)

Returns:

  • (Boolean)


118
119
120
121
122
123
124
125
126
127
# File 'lib/ruuuby/math/set_theory/number_set.rb', line 118

def