عنوان
پدید آورنده
موضوع
رده
QA267.7 B975 2004
QA267
.
7
B975
2004
کتابخانه
محل استقرار
0857293923
9780857293923
b556588
Logic and Complexity
[Book]
by Richard Lassaigne, Michel Rougemont.
London
Springer London
2004
(x, 361 pages)
Discrete mathematics and theoretical computer science.
Part 1: Basic Model Theory and Computability --;Propositional logic --;Deduction systems --;First order logic --;Completeness of first-order logic --;Models of computation --;Recursion and decidability --;Incompleteness of Peano Arithmetic --;Part 2: Descriptive Complexity --;Complexity: time and space --;First order definability --;Inductive definitions and second order logic --;Models of parallel computations --;Space complexity: the classes L, FL, NL, PSPACE --;Definability of optimisation and counting problems --;Part 3: Approximation and classes beyond NP --;Probabilistic classes --;Probabilistic verification --;Approximation --;Classes above NP.
Divided into three parts, it covers: - Model Theory and Recursive Functions - introducing the basic model theory of propositional, 1st order, inductive definitions and 2nd order logic.
Computational complexity.
Computer science.
Logic design.
QA267
.
7
B975
2004
by Richard Lassaigne, Michel Rougemont.
Michel Rougemont
Richard Lassaigne
مطالعه متن کتاب [Book]
Y
