David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Cambridge University Press (1987)
Logic and Computation is concerned with techniques for formal theorem-proving, with particular reference to Cambridge LCF (Logic for Computable Functions). Cambridge LCF is a computer program for reasoning about computation. It combines methods of mathematical logic with domain theory, the basis of the denotational approach to specifying the meaning of statements in a programming language. This book consists of two parts. Part I outlines the mathematical preliminaries: elementary logic and domain theory. They are explained at an intuitive level, giving references to more advanced reading. Part II provides enough detail to serve as a reference manual for Cambridge LCF. It will also be a useful guide for implementors of other programs based on the LCF approach.
|Keywords||Cambridge LCF (Computer system Computable functions Data processing|
|Categories||categorize this paper)|
|Buy the book||$1.83 used (99% off) $66.88 new (11% off) $74.99 direct from Amazon Amazon page|
|Call number||QA9.59.P38 1987|
|ISBN(s)||0521346320 0521395607 9780521395601|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
No references found.
Citations of this work BETA
Javier Leach & Susana Nieva (1993). Foundations of a Theorem Prover for Functional and Mathematical Uses. Journal of Applied Non-Classical Logics 3 (1):7-38.
Similar books and articles
William M. Farmer & Joshua D. Guttman (2000). A Set Theory with Support for Partial Functions. Studia Logica 66 (1):59-78.
Richard Bornat (2005). Proof and Disproof in Formal Logic: An Introduction for Programmers. New Yorkoxford University Press.
Howard H. Harriott (1996). Essay Review. History and Philosophy of Logic 17 (1-2):223-240.
Nigel Cutland (1980). Computability, an Introduction to Recursive Function Theory. Cambridge University Press.
Martin Davis (ed.) (1965/2004). The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems, and Computable Functions. Dover Publication.
S. B. Cooper & Andrea Sorbi (eds.) (2011). Computability in Context: Computation and Logic in the Real World. World Scientific.
Arto Salomaa (1985). Computation and Automata. Cambridge University Press.
Added to index2009-01-28
Total downloads12 ( #200,924 of 1,725,834 )
Recent downloads (6 months)1 ( #348,700 of 1,725,834 )
How can I increase my downloads?