Logic from Computer Science

Logic from Computer Science

by Yiannis N. Moschovakis

Book 21 of Mathematical Sciences Research Institute Publications, 0940-4740 --

Join Readfeed freeFind clubs reading this
Rate this book:

Browse books you can read free on Readfeed

No club is reading this yet — be the first to start one

Start a club free
About
Topics of this proceedings volume will include Computability and Complexity of Higher Type Functions by Stephen Cook, Logics for Termination and Correctness of Functional Programs by Solomon Feferman, Reals and Forcing with Elementary Topos by the well known mathematician, Saunders MacLane and Ieke Moerdijk, and Concurrent Computation as Game Playing by Anil Nerode.

Discuss Logic from Computer Science with other readers

Join or start a book club for Logic from Computer Science on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.

Sign up freeBrowse book clubs

Frequently asked questions

How do I join a book club for Logic from Computer Science?

Sign up free on Readfeed, then browse public clubs or start your own club with Logic from Computer Science as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.

Can I discuss Logic from Computer Science with other readers online?

Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Logic from Computer Science with readers worldwide — whether your club is virtual, in-person, or hybrid.

Is Readfeed free?

Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.