Code (set theory): Revision history

Filter revisionsshowhide

To date:

Tag filter:

Invert selection

External tools:

For any version listed below, click on its date to view it. For more help, see Help:Page history and Help:Edit summary. (cur) = difference from current version, (prev) = difference from preceding version, m = minor edit, → = section edit, ← = automatic edit summary

curprev 01:0301:03, 25 June 2024 David Eppstein talk contribs 2,645 bytes +526 inline the reference and clean up math but we still need more refs undo

curprev 00:2000:20, 21 January 2024 BD2412 talk contribs m 2,095 bytes +5 →References: clean up spacing around commas and other punctuation fixes, replaced: ,D → , D, ,N → , N, ,V → , V, ,p → , p undo Tag: AWB

curprev 11:0411:04, 1 August 2010 JRSpriggs talk contribs 2,018 bytes +82 italicize variables; standardize appearance of formulas; some rewording; link "pairing function" undo

curprev 18:4918:49, 20 November 2008 Giftlite talk contribs 1,936 bytes −32 →See also: -wlink already included in the main article undo

curprev 07:2107:21, 16 May 2006 JRSpriggs talk contribs 1,974 bytes +699 A code includes that information identifying x and also information about the particular injection from X into ω which was used to create E. undo
curprev 07:0607:06, 16 May 2006 JRSpriggs talk contribs 1,275 bytes −1 Cantor set is easier to understand than continued fractions undo

curprev 02:3802:38, 15 May 2006 JRSpriggs talk contribs 1,276 bytes +124 If X is finite (with cardinality n), then use (n,E) instead of (ω,E). undo
curprev 02:3202:32, 15 May 2006 JRSpriggs talk contribs 1,152 bytes +71 Codes are useful in constructing mice. undo
curprev 02:2702:27, 15 May 2006 JRSpriggs talk contribs 1,081 bytes +588 add more explanatory material -- relate to real numbers undo