Logic for computer science: foundations of automatic theorem proving
โ Scribed by Jean H. Gallier
- Publisher
- Longman Higher Education
- Year
- 1986
- Tongue
- English
- Leaves
- 534
- Series
- Harper & Row computer science and technology series
- Category
- Library
No coin nor oath required. For personal study only.
โฆ Synopsis
"Logic for Computer Science" provides an introduction to mathematical logic, with emphasis on proof theory and procedures for constructing formal proofs of formulae algorithmically. It is designed primarily for students, computer scientists, and, more generally, for mathematically inclined readers interested in the formalization of proofs and the foundations of automatic theorem proving. Since the main emphasis of the text is on the study of proof systems and algorithmic methods for constructing proofs, it contains features rarely found in other texts on logic. Four of these are: the use of Gentzen systems; a justification of the resolution method via a translation from a Gentzen system; a presentation of SLD-resolution and a presentation of the foundations of PROLOG; fast decisions procedures based on congruence closures.
๐ SIMILAR VOLUMES
Logicism, as put forward by Bertrand Russell, was predicated on a belief that all of mathematics can be deduced from a very small number of fundamental logical principles. In <i>Logicism Renewed</i>, the author revisits this concept in light of advances in mathematical logic and the need for languag
Explores basic concepts of theoretical computer science and shows how they apply to current programming practice. Coverage ranges from classical topics, such as formal languages, automata, and compatibility, to formal semantics, models for concurrent computation, and program semantics.
Explores basic concepts of theoretical computer science and shows how they apply to current programming practice. Coverage ranges from classical topics, such as formal languages, automata, and compatibility, to formal semantics, models for concurrent computation, and program semantics.