storiet v.2

theme

voice

language

sign in
Cover of Logic from Computer Science

a novel ·

Logic from Computer Science

by

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 …

start reading + shelf
  • ● 99% match for you
  • ● science & technology

the long version

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.

M

Margaret's verdict

"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 …"

— Margaret

highlights

what readers held onto

No highlights yet. Be the first.

discussion

what readers said

No reviews yet. Finish it; tell us what you found.