173:
This is a technical monograph, requiring its readers to have some familiarity with computability theory and Ramsey theory. Prior knowledge of reverse mathematics is not required. It is written in a somewhat informal style, and includes many exercises, making it usable as a graduate textbook or
174:
beginning work in reverse mathematics; reviewer François Dorais writes that it is an "excellent introduction to reverse mathematics and the computability theory of combinatorial principles" as well as a case study in the methods available for proving results in reverse mathematics.
185:. Nevertheless he recommends this book to anyone interested in reverse mathematics and Ramsey theory. And reviewer Benedict Eastaugh calls it "a welcome addition ... providing a fresh and accessible look at a central aspect of contemporary reverse mathematical research."
141:) are only the ones that are already provably in the weaker theory. Chapter eight summarizes the results so far in diagrammatic form. Chapter nine discusses ways to weaken Ramsey's theorem, and the final chapter discusses stronger theorems in combinatorics including the
19:
201:; it is centered around the big five subsystems and contains many more examples of results equivalent in strength to one of these five. Dorais suggests using the two books together as companion volumes.
137:
of theories, in which the statements of a powerful theory (such as one of the forms of second-order arithmetic) that are both provable in that theory and expressible in a weaker theory (such as
181:
complains about two missing topics, the work of Joe Mileti on the reverse mathematics of canonical versions of Ramsey's theorem, and the work of James
Schmerl on the reverse mathematics of
165:. An appendix provides a proof of a theorem of Jiayi Liu, part of the collection of results showing that the graph Ramsey theorem does not fall into the big five subsystems.
122:, and it turns out to be inequivalent to any one of the big five subsystems. The version for uniform hypergraphs of fixed order greater than two is equivalent to ACA
71:
into which many theorems of mathematics have been classified. These chapters also review some of the tools needed in this study, including
126:, and the version of the theorem stated for all numbers of colors and all orders of hypergraphs simultaneously is stronger than ACA
107:
44:
491:
43:
needed to prove combinatorial theorems. It was written by Denis R. Hirschfeldt, based on a course given by
Hirschfeldt at the
476:
198:
51:, as volume 28 of the Lecture Notes Series of the Institute for Mathematical Sciences, National University of Singapore.
466:
142:
486:
236:
146:
87:
28:
Slicing the Truth: On the
Computability Theoretic and Reverse Mathematical Analysis of Combinatorial Principles
63:, which has the goal of classifying mathematical theorems by the axiom schemes needed to prove them, and the
68:
481:
134:
471:
76:
425:
362:
72:
91:
64:
60:
32:
430:
328:
253:
150:
80:
420:
412:
320:
266:
245:
103:
48:
371:
367:
311:
295:
270:
178:
154:
182:
115:
299:
460:
403:
95:
36:
332:
257:
450:
434:
158:
138:
18:
208:
by
Rebecca Weber as a good source for the background needed to read this book.
416:
99:
324:
118:
originally proved, the version of the theorem for graphs is weaker than ACA
249:
262:
162:
86:
Chapter six, "the real heart of the book", applies this method to an
394:
453:, Hirschfeldt's web site, including a preprint version of the book.
40:
17:
102:, using finitely many colors, contains a monochromatic infinite
59:
The book begins with five chapters that discuss the field of
98:
of a countably infinite complete graph or complete uniform
193:
A "classic reference" in reverse mathematics is the book
110:, falling into one of the big five subsystems, ACA
145:on self-embedding of infinite linear orderings,
230:Hirst, Jeffry L. (September 2015), "Review of
106:. The standard proof of this theorem uses the
8:
388:
386:
384:
382:
380:
426:1983/1ed76e2d-9bc7-4529-b628-92791f631317
424:
290:
288:
286:
284:
282:
280:
278:
351:
349:
347:
345:
343:
341:
225:
223:
221:
217:
261:; see also Hirst's shorter review for
195:Subsystems of Second Order Arithmetic
7:
47:in 2010, and published in 2014 by
14:
393:Eastaugh, Benedict (July 2017),
356:Dorais, François G., "Review of
108:arithmetical comprehension axiom
45:National University of Singapore
204:Reviewer Jeffry Hirst suggests
1:
161:, and Hindman's theorem on
508:
237:Bulletin of Symbolic Logic
417:10.1007/s11225-017-9740-1
133:Chapter seven discusses
325:10.1145/2902945.2902952
135:conservative extensions
69:second-order arithmetic
492:2014 non-fiction books
169:Audience and reception
147:Kruskal's tree theorem
143:Dushnik–Miller theorem
23:
21:
477:Computability theory
363:Mathematical Reviews
206:Computability Theory
73:computability theory
250:10.1017/bsl.2015.18
65:big five subsystems
61:reverse mathematics
39:, the study of the
33:reverse mathematics
467:Mathematical logic
24:
487:Mathematics books
451:Slicing the Truth
397:Slicing the Truth
358:Slicing the Truth
302:Slicing the Truth
232:Slicing the Truth
81:low basis theorem
499:
438:
437:
428:
390:
375:
374:
353:
336:
335:
308:
296:Gasarch, William
292:
273:
260:
227:
139:Peano arithmetic
104:induced subgraph
92:Ramsey's theorem
49:World Scientific
507:
506:
502:
501:
500:
498:
497:
496:
457:
456:
447:
442:
441:
392:
391:
378:
355:
354:
339:
312:ACM SIGACT News
306:
294:
293:
276:
229:
228:
219:
214:
199:Stephen Simpson
191:
189:Related reading
179:William Gasarch
171:
155:order embedding
151:Laver's theorem
129:
125:
121:
113:
57:
12:
11:
5:
505:
503:
495:
494:
489:
484:
479:
474:
469:
459:
458:
455:
454:
446:
445:External links
443:
440:
439:
411:(4): 873–879,
376:
337:
298:(March 2016),
274:
244:(3): 338–339,
216:
215:
213:
210:
190:
187:
183:graph coloring
170:
167:
127:
123:
119:
116:David Seetapun
114:. However, as
111:
56:
53:
13:
10:
9:
6:
4:
3:
2:
504:
493:
490:
488:
485:
483:
482:Ramsey theory
480:
478:
475:
473:
470:
468:
465:
464:
462:
452:
449:
448:
444:
436:
432:
427:
422:
418:
414:
410:
406:
405:
404:Studia Logica
400:
398:
389:
387:
385:
383:
381:
377:
373:
369:
365:
364:
359:
352:
350:
348:
346:
344:
342:
338:
334:
330:
326:
322:
318:
314:
313:
305:
303:
297:
291:
289:
287:
285:
283:
281:
279:
275:
272:
268:
264:
259:
255:
251:
247:
243:
239:
238:
233:
226:
224:
222:
218:
211:
209:
207:
202:
200:
196:
188:
186:
184:
180:
175:
168:
166:
164:
160:
159:linear orders
157:of countable
156:
152:
148:
144:
140:
136:
131:
117:
109:
105:
101:
97:
96:edge coloring
93:
89:
84:
82:
78:
74:
70:
66:
62:
54:
52:
50:
46:
42:
38:
37:combinatorics
34:
31:is a book on
30:
29:
22:First edition
20:
16:
472:Proof theory
408:
402:
396:
361:
357:
319:(1): 21–24,
316:
310:
301:
241:
235:
231:
205:
203:
194:
192:
176:
172:
132:
85:
58:
27:
26:
25:
15:
395:"Review of
300:"Review of
461:Categories
271:1304.03001
212:References
197:(2009) by
100:hypergraph
88:infinitary
79:, and the
177:Reviewer
333:19457072
258:61188908
94:: every
90:form of
435:1667765
372:3244278
163:IP sets
77:forcing
433:
370:
331:
269:
263:zbMATH
256:
55:Topics
41:axioms
431:S2CID
329:S2CID
307:(PDF)
254:S2CID
421:hdl
413:doi
409:105
360:",
321:doi
267:Zbl
246:doi
234:",
153:on
67:of
35:in
463::
429:,
419:,
407:,
401:,
379:^
368:MR
366:,
340:^
327:,
317:47
315:,
309:,
277:^
265:,
252:,
242:21
240:,
220:^
149:,
130:.
83:.
75:,
423::
415::
399:"
323::
304:"
248::
128:0
124:0
120:0
112:0
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
