The Computational Complexity of Logical Theories

Descripción

This item is printed on demand - it takes 3-4 days longer - Neuware -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. 256 pp. Englisch. N° de ref. del artículo 9783540095019

Contactar al vendedor

Denunciar este artículo

Detalles bibliográficos

Acerca de