Hillel Wayne announces supplementary chapters for his book 'Logic for Programmers', covering topics like concurrent processes, first-order logic, Liskov's history rule, and orders.
<p>So I said there wasn’t a proper newsletter this week, since I’m in Budapest prepping for a conference. But I still got a thing for y’all.</p>
<p>There’s a lot of interesting topics I wanted to cover for <em>Logic for Programmers</em>, but the book is dense enough as it is and many of these were too tangential or technical to fit in well. So I’ve been writing some supplements and uploading them <a target="_blank" rel="noopener noreferrer nofollow" href="https://github.com/logicforprogrammers/book-assets/tree/master/supplements">here</a>. I’ve got four so far:</p>
<ol><li><p>How we compute the number of orderings of multiple concurrent processes</p></li><li><p>How first-order logic can quantify over “a set of functions”, what a “set of functions” looks like, and how functions can be defined in terms of sets (plus a bit on currying and type theory)</p></li><li><p>Barbara Liskov’s “history rule” in subtyping</p></li><li><p>Total and partial orders on sets.</p></li></ol>
<p>Now I’m going to caveat that these were written off the cuff and haven’t gone through the obsessive editing of the book itself, so they may be rough and there might be errors in them. Still, it’s like 2-3000 words of math content, so hopefully covers not having a proper newsletter this time. Seeya next week!</p>
# Logic for Programmers extra credits
Source: [https://buttondown.com/hillelwayne/archive/logic-for-programmers-extra-credits](https://buttondown.com/hillelwayne/archive/logic-for-programmers-extra-credits)
So I said there wasn’t a proper newsletter this week, since I’m in Budapest prepping for a conference\. But I still got a thing for y’all\.
There’s a lot of interesting topics I wanted to cover for*Logic for Programmers*, but the book is dense enough as it is and many of these were too tangential or technical to fit in well\. So I’ve been writing some supplements and uploading them[here](https://github.com/logicforprogrammers/book-assets/tree/master/supplements)\. I’ve got four so far:
1. How we compute the number of orderings of multiple concurrent processes
2. How first\-order logic can quantify over “a set of functions”, what a “set of functions” looks like, and how functions can be defined in terms of sets \(plus a bit on currying and type theory\)
3. Barbara Liskov’s “history rule” in subtyping
4. Total and partial orders on sets\.
Now I’m going to caveat that these were written off the cuff and haven’t gone through the obsessive editing of the book itself, so they may be rough and there might be errors in them\. Still, it’s like 2\-3000 words of math content, so hopefully covers not having a proper newsletter this time\. Seeya next week\!
*If you're reading this on the web, you can subscribe[here](https://buttondown.com/hillelwayne)\. Updates are once a week\. My main website is[here](https://www.hillelwayne.com/)\.*
*My new book,*Logic for Programmers*, is now in early access\! Get it[here](https://leanpub.com/logic/)\.*
Hillel Wayne announces the v0.13 release of his book 'Logic for Programmers', with significant rewrites and new content, and outlines next steps toward a print edition.
Hillel Wayne announces version 0.15 release candidate of his book 'Logic for Programmers', and highlights a livecoding meetup featuring Strudel and CLAVIER-36 for music programming.
Hillel Wayne promotes a fundraiser for the Greater Chicago Food Depository with a discount on his book 'Logic for Programmers', and shares technical notes on structured concurrency and the history of goto statements.
Hillel Wayne announces version 0.14 of his book 'Logic for Programmers' and that he will join Antithesis as a developer educator, with plans to continue his newsletter but with a shifted focus and possibly lower frequency.
Hillel Wayne shares Z3 scripts he wrote, discussing challenges with logical properties and the concept of 'chaff' from his upcoming book Logic for Programmers.