论文信息 - Logic, complexity, and games

Logic, complexity, and games

In this talk, I will discuss an approach to the P = NP question via the correspondence between logic and complexity. The focus will be on the possible use of Ehrenfeucht-Fraisse games.

Ronald Fagin

[1] A. Ehrenfeucht. An application of games to the completeness problem for formalized theories , 1961 .

[2] P. Dedecker. Review: Roland Fraisse, Sur Quelques Classifications des Systemes de Relations , 1957 .

[3] Neil Immerman,et al. Descriptive and Computational Complexity , 1989, FCT.

[4] Ronald Fagin. Generalized first-order spectra, and polynomial. time recognizable sets , 1974 .