The Computational Complexity of Logical Theories (Lecture Notes in Mathematics, 718, Band 718) - Softcover

Ferrante, Jeanne

 
9783540095019: The Computational Complexity of Logical Theories (Lecture Notes in Mathematics, 718, Band 718)

Inhaltsangabe

and background.- Ehrenfeucht games and decision procedures.- Integer addition - An example of an Ehrenfeucht game decision procedure.- Some additional upper bounds.- Direct products of theories.- Lower bound preliminaries.- A technique for writing short formulas defining complicated properties.- A lower bound on the theories of pairing functions.- Some additional lower bounds.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.