Bounded arithmetic, propositional logic, and complexity theory /
This book presents an up-to-date, unified treatment of research in bounded arithmetic and complexity of propositional logic, with emphasis on independence proofs and lower bound proofs. The author discusses the deep connections between logic and complexity theory and lists a number of intriguing ope...
Cote: | Libro Electrónico |
---|---|
Auteur principal: | Krajíček, Jan |
Collectivité auteur: | Cambridge University Press |
Format: | Électronique eBook |
Langue: | Inglés |
Publié: |
Cambridge [England] ; New York, N.Y. :
Cambridge University Press,
1995.
|
Collection: | Encyclopedia of mathematics and its applications ;
v. 60. |
Sujets: | |
Accès en ligne: | Texto completo |
Documents similaires
-
New thinking about propositions /
par: King, Jeffrey C., et autres
Publié: (2014) -
Classical and Nonclassical Logics : An Introduction to the Mathematics of Propositions.
par: Schechter, Eric
Publié: (2005) -
Propositions : semantic and ontological issues /
Publié: (2006) -
Paul of Venice, 'Logica Magna' : The Treatise on Insolubles: Edited with an Introduction, English Translation, and Commentary.
par: Bartocci, B.
Publié: (2022) -
Computability, complexity, logic /
par: B�orger, E. (Egon), 1946-
Publié: (1989)