Logic from Computer Science
2.5 hrs read
Rate this book:
About This Book
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.
Buy This Book
Amazon
→
Bookshop.org
Supports indie bookshops
→
Apple Books
Ebook
→
Open Library
Borrow
Free to borrow
→
As an Amazon Associate and Bookshop.org affiliate, BookOrb earns from qualifying purchases.
Write a Review
Sign in to write a review.