Name
Abstract | ||
|---|---|---|
We provide a set of "natural" requirements for well-orderings of(binary) list structures. We show that the resultant order-type is thesuccessor of the first critical epsilon number.The checker has to verify that the process comes to an end. Hereagain he should be assisted by the programmer giving a furtherdefinite assertion to be verified. This may take the form of a quantitywhich is asserted to decrease continually and vanish when themachine stops. To the pure mathematician it is... |
Year | Venue | Keywords |
|---|---|---|
1992 | LFCS | list structures,ordinal arithmetic |
Field | DocType | ISBN |
Integer,Discrete mathematics,Combinatorics,Programmer,Ordinal number,Successor cardinal,Assertion,Turing,Ordinal arithmetic,Mathematics,Binary number | Conference | 3-540-55707-5 |
Citations | PageRank | References |
3 | 0.46 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nachum Dershowitz | 1 | 2818 | 473.00 |
| Edward M. Reingold | 2 | 2214 | 563.65 |