Logic from Computer Science
por
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 …
- ● 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.
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 …"
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.