The Computational Complexity Of Prefix Classes Of Logical Theories
Download The Computational Complexity Of Prefix Classes Of Logical Theories PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get The Computational Complexity Of Prefix Classes Of Logical Theories book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
The Classical Decision Problem
Author: Egon Börger
language: en
Publisher: Springer Science & Business Media
Release Date: 2001-08-28
This book offers a comprehensive treatment of the classical decision problem of mathematical logic and of the role of the classical decision problem in modern computer science. The text presents a revealing analysis of the natural order of decidable and undecidable cases and includes a number of simple proofs and exercises.