|
Search: id:A101273
|
|
|
| A101273 |
|
Theorems from propositional calculus, translated into decimal digits. |
|
+0
4
|
|
| 171, 181, 272, 282, 1531, 1631, 2532, 2632, 3151, 3161, 3252, 3262, 11711, 11811, 12712, 12812, 14171, 14181, 14271, 14272, 15171, 15172, 16171, 17141, 17161, 17162, 17261, 17331, 17910, 18141, 18161, 18331, 18910, 21721, 21821
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Blocks of 1s and 2s are variables: A = 1, B = 2, C = 11, D = 12, E = 21, ... Not = 3; And = 4; Xor = 5; Or = 6; Implies = 7; Equiv = 8; Left Parenthesis = 9; Right Parenthesis = 0.
Operator binding strength is in numerical order, Not > And > ... > Equiv.
The non-associative "Implies" is evaluated from Left to Right; A->B->C = is interpreted (A->B)->C. Redundant parentheses are permitted.
This is a decimal Goedelization of theorems from a particular axiomatization of propositional calculus. This should be linked to the subsequences of true theorems and false theorems. - Jonathan Vos Post (jvospost3(AT)gmail.com), Dec 19 2004 [How can a theorem not be true? - njas]
Warning: there may be errors - see comment in A100200.
|
|
REFERENCES
|
Davis, M., Computability and Unsolvability. New York: Dover 1982.
Hofstadter, D. R., Goedel, Escher, Bach: An Eternal Golden Braid. New York: Vintage Books, p. 18, 1989.
Kleene S. C., Mathematical Logic. New York: Dover, 2002.
|
|
LINKS
|
Eric Weisstein et al., "Goedel Number."
|
|
FORMULA
|
It appears that the n-th term is very roughly n^c, for some c>1.
|
|
EXAMPLE
|
Example: 17162 is the theorem A->AvB.
|
|
CROSSREFS
|
Sequence in context: A015975 A045149 A031511 this_sequence A136365 A031900 A120819
Adjacent sequences: A101270 A101271 A101272 this_sequence A101274 A101275 A101276
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Richard Schroeppel (rschroe(AT)sandia.gov), Dec 19 2004
|
|
|
Search completed in 0.002 seconds
|
