Logic and Complexity
Year: 2004
Type: book
Source: Springer eBooks
Authors: Richard Lassaigne, Michel de Rougemont
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: mathematical logic, computational complexity, decidability, incompleteness, NP-completeness, randomness, approximation algorithms, model theory, recursive functions, Turing computability, descriptive complexity, optimization problems, counting problems, first-order logic, second-order logic, inductive definitions, propositional logic, database query languages, program verification
Open Access status: closed
OpenAlex ID: W592101228
