| EWD number |
Size (KB) |
Title |
|
| 1000 |
267 |
Twenty-eight years |
|
| 1001 |
640 |
The calculus of boolean structures (Part 0) |
|
| 1002 |
272 |
The calculus of boolean structures (Part 1) |
|
| 1003 |
173 |
Graphs of modest diameter and degrees |
|
| 1004 |
40 |
A methodological remark on mathematical induction |
|
| 1005 |
21 |
A supplement to EWD1002 |
|
| 1006 |
138 |
Trip report E.W.Dijkstra, Stanford/Palo Alto, 26–29 March l987 |
|
| 1007 |
39 |
Addendum to EWD969 |
|
| 1008 |
145 |
What computing science is about |
|
| 1009 |
106 |
On a somewhat disappointing correspondence |
|
| 1010 |
64 |
A much neglected mathematical object |
|
| 1011 |
146 |
Introducing my fall 1987 course on Mathematical Methodology |
|
| 1012 |
290 |
“Real mathematicians don’t prove” |
|
| 1013 |
144 |
Position paper on “fairness” |
|
| 1014 |
56 |
A monotonicity argument revisited |
|
| 1015 |
151 |
On a problem transmitted by Doug McIlroy |
|
| 1016 |
339 |
A computing scientist’s approach to a once-deep theorem of Sylvester’s |
|
| 1017 |
496 |
Fillers at a YoP-institute |
|
| 1018 |
182 |
To the members of the Budget Council |
|
| 1019 |
91 |
Another filler of the YoP Institute |
|
| 1020 |
361 |
The derivation of a proof by J.C.S.P. van der Woude |
|
| 1021 |
179 |
A symmetry in the sorting task |
|
| 1022 |
98 |
A bagatelle on implication’s transitivity |
|
| 1023 |
95 |
On triangles being nondegenerate |
|
| 1024 |
455 |
A new science, from birth to maturity |
|
| 1025 |
57 |
Ulrich Berger’s solution to the rectangle problem |
|
| 1026 |
268 |
Trip report E.W.Dijkstra, Marktoberdorf 1988 |
|
| 1027 |
75 |
My methodological blunder with grid polygons |
|
| 1028 |
121 |
Euclid, Netty, and the prime numbers |
|
| 1029 |
316 |
The linear search revisited (with W.H.J.Feijen) |
|
| 1031 |
142 |
Ascending functions and The Welfare Crook |
|
| 1032 |
152 |
Decomposing an integer as sum of two squares |
|
| 1033 |
178 |
Trip report E.W.Dijkstra, Zürich, 15–20 Oct. 1988 |
|
| 1034 |
132 |
Equivalence versus mutual implication; junctivity and monotonicity |
|
| 1035 |
954 |
On long-range planning for the CS department |
|
| 1036 |
891 |
On the cruelty of really teaching computing science |
|
| 1037 |
478 |
Exploring the lexical coupling |
|
| 1038 |
91 |
A bagatelle on total orders |
|
| 1039 |
180 |
Seemingly on a problem transmitted by Bengt Jonsson |
|
| 1040 |
126 |
The majority vote according to J. Gutknecht |
|
| 1041 |
448 |
By way of introduction |
|
| 1041a |
23 |
Factorizing the factorial |
|
| 1042 |
74 |
Once more the bichrome 3 x 7 grid (See EWD764) |
|
| 1043 |
151 |
A few comments on “Computing as a discipline” |
|
| 1044 |
120 |
To hell with “meaningful identifiers”! |
|
| 1045 |
92 |
The problem of the difficult dartboard |
|
| 1046 |
300 |
A tale of two winters |
|
| 1047 |
438 |
A relational summary |
|
| 1048 |
112 |
ATAC’s proof of Scholten’s theorem |
|
| 1049 |
120 |
A somewhat open letter to Uri Leron |
|
| 1050 |
253 |
On the design of a simple proof for Morley’s Theorem |
|
| 1051 |
374 |
The next forty years |
|
| 1052 |
107 |
From the Hungarian Eotvos Competition, 1911 |
|
| 1053 |
63 |
Monochrome pairs in the three-coloured plane |
|
| 1054 |
106 |
On hygiene, intellectual and otherwise |
|
| 1055 |
125 |
On the problem of the calissons |
|
| 1055A |
41 |
untitled (advice to a young scientist) |
|
| 1055c |
127 |
On covering a figure with diamonds |
|
| 1056 |
197 |
Hoe onbelangrijk het is of duikboten kunnen zwemmen |
|
| 1057 |
91 |
Andrei P. Ershov in Nuenen |
|
| 1058 |
162 |
In reply to comments |
|
| 1059 |
437 |
0 Preface (Mathematical Methodology) |
|
| 1060 |
73 |
“Predicate Calculus and Program Semantics”, fall 1989 |
|
| 1061 |
108 |
Composition, lambda-calculus, and some more |
|
| 1062 |
45 |
On an exercise of Tony Hoare’s |
|
| 1063 |
281 |
An introductory example (Mathematical Methodology) |
|
| 1064 |
82 |
On the selection of dummies: a notational freedom |
|
| 1065 |
64 |
An example of how to lengthen formal proofs |
|
| 1066 |
110 |
Hungry? Have a byte .... |
|
| 1067 |
109 |
A very first introductory example (Mathematical Methodology) |
|
| 1068 |
193 |
On the quality criteria for mathematical writing (Mathematical Methodology) |
|
| 1069 |
78 |
Fair gambling with a biased coin |
|
| 1070 |
297 |
For brevity’s sake (Mathematical Methodology) |
|
| 1071 |
68 |
Making a fair roulette from a possibly biased coin |
|
| 1071a |
70 |
Making a fair roulette from a possibly biased coin |
|
| 1072 |
75 |
On covering a figure with diamonds |
|
| 1073 |
506 |
How Computing Science created a new mathematical style |
|
| 1074 |
153 |
A generalization of R.S. Bird’s problem |
|
| 1075 |
178 |
Constructing the proof of Vizing’s Theorem (with J.R. Rao) |
|
| 1076 |
76 |
From “Discrete Mathematics with Applications” by Susanna S. Epp |
|
| 1077 |
102 |
Fibonacci and the greatest common divisor |
|
| 1078 |
202 |
Leibniz’s Principle (Mathematical Methodology) |
|
| 1079 |
145 |
Well-foundedness and the transitive closure (with A.J.M. van Gasteren) |
|
| 1080 |
98 |
Well-foundedness and lexical coupling (with A.J.M. van Gasteren) |
|
| 1081 |
39 |
Mathematical induction and universal quantification |
|
| 1082 |
2560 |
Designing the proof of Vizing’s Theorem (with J.R. Rao) |
|
| 1082a |
409 |
Designing the proof of Vizing’s Theorem (with J.R. Rao) |
|
| 1083 |
114 |
The balance and the coins |
|
| 1084 |
59 |
A logician’s anomaly or: Leibniz vindicated |
|
| 1085 |
38 |
Proving the theorem of Menelaos |
|
| 1086 |
218 |
The everywhere operator once more |
|
| 1087 |
153 |
A conversion routine revisited |
|
| 1088 |
73 |
A theorem communicated by Ken Calvert |
|
| 1089 |
47 |
An Oxford sequel to EWD1047 |
|
| 1090 |
197 |
The design of a proof of equality (Mathematical Methodology) |
|
| 1091 |
272 |
More equality proofs with instantiated definitions (Mathematical Methodology) |
|
| 1092 |
66 |
Two ways of determining an expectation value |
|
| 1093 |
65 |
Proving the equality of infinite sequences |
|
| 1094 |
265 |
The undeserved status of the pigeon-hole principle (Mathematical Methodology) |
|
| 1095 |
186 |
Are “systems people” really necessary? |
|
| 1096 |
22 |
Potter’s proof of disjunction’s symmetry |
|
| 1097 |
34 |
The majority vote among three |
|
| 1098 |
87 |
Guided by necessity |
|
| 1099 |
63 |
Inspired by Peter Auer’s proof |
|