拡張型Eシステム (Extensible-E System; ExE) は、 Sbiis Saibian が現在作成中の配列表記である[1]。これはハイパーE表記拡張ハイパーE表記連鎖E表記拡張連鎖E表記、そして将来開発されるいかなる拡張をも含む総称である。

バードの配列表記を BAN、超階乗配列表記を HAN と呼ぶのに習って、ExE は、"SAN" (Saibian の配列表記) とも呼ばれる。

All notations in Extensible-E have a number of standardized traits. All notations can be expressed generically in the form:

Ea&a&a& ... &a&a

where the a's are all positive integer arguments, and the &'s are delimiters chosen from the delimiter set defined for the particular notation. Each notation also defines fundamental sequences for all decomposition delimiters.

Hyper-E only allows use of the single hyperion ( # ) as a delimiter.

Extended Hyper-E uses delimiters below #^#.

Cascading-E Notation uses delimiters below #^^#.

  • Its extension, Limit Extension Cascading-E Notation uses delimiters below #^^#>#.

Extended Cascading-E Notation uses delimiters below #{#}#.

  • Its extension, Hyper Extended Cascading-E Notation uses delimiters below {#,#,1,2}.

基本法則 編集

All ExE type notations follow 5 fundamental laws. These laws have priority, where the earlier the law, the higher priority it has. The priority of any given law only fails if it's conditions are not met, in which case one proceeds to the next law. The first law whose conditions are met is the one that is executed. Such a law is guaranteed to exist because the last law has no requirements other than the failure of all the previous laws. The 5 law are:

1. Base Case. If there is only a single argument: En = 10^n

2. Decomposition Case. If the last delimiter is decomposable: @m&n = @m&[n]m

3. Terminating Case. If the last argument = 1: @&1 = @

4. Expansion Case. If the last delimiter is not the proto-hyperion: @m&*#n = @m&m&*#(n-1)

5. Recursive Case. Otherwise: @m#n = @(@m#(n-1))

The laws are set up so many necessary conditions are implicit. For example, the decomposition case wouldn't apply unless there is more than one argument. This doesn't need to be explicitly stated because the decomposition case can only apply if the base case has already failed, which can only happen if there is more than one argument. Consequently although the last law has no conditions, in fact it can only apply if there is at least two arguments, the last argument is greater than one, and the last delimiter is the proto-hyperion.

For the lowest level notations, some of the rules may never apply. For example in xE#, there are no decomposable delimiters, so Rule 2 never applies. In E#, there is only the hyperion as a delimiter, so neither Rule 2 or Rule 4 ever applies.

出典 編集

  1. Saibian, Sbiis. Retrieved February 2014.