A partir de cette page vous pouvez :
Retourner au premier écran avec les dernières notices... |
Résultat de la recherche
3 résultat(s) recherche sur le mot-clé 'bounded arithmetic'
Affiner la recherche Générer le flux rss de la recherche
Bounded arithmetic, propositional logic, and complexity theory / Jan Krajicek
Exemplaires
Code-barres Cote Support Localisation Section Disponibilité 18520 03C175 imprimé / autre CRDM 03/MATHEMATICAL LOGIC AND FOUNDATIONS Disponible Metamathematics of first-order arithmetic / Hajek, Petr
Titre : Metamathematics of first-order arithmetic Type de document : texte imprimé Auteurs : Hajek, Petr ; Pudlak, Pavel Mention d'édition : 2nd ed. Editeur : Springer-Verlag Année de publication : 1998 Collection : Perspectives in Mathematical Logic Importance : xiv - 460 p. ISBN/ISSN/EAN : 978-3-540-63648-9 Langues : Anglais Catégories : 03-XX Mathematical logic and foundations:03-02 Research exposition (monographs, survey articles)
03-XX Mathematical logic and foundations:03DXX Computability and recursion theory:03D15 Complexity of computation
03-XX Mathematical logic and foundations:03FXX Proof theory and constructive mathematics:03F30 First-order arithmetic and fragmentsMots-clés : consistency interpretability witnessing functions provability bounded arithmetic model theory indicators conservativity definable cuts reflexive theories self-reference incompleteness combinatorics in fragments recursion theory partial truth definitions fragments of arithmetic foundations of arithmetic of natural numbers Index. décimale : 03C Monographie Metamathematics of first-order arithmetic [texte imprimé] / Hajek, Petr ; Pudlak, Pavel . - 2nd ed. . - [S.l.] : Springer-Verlag, 1998 . - xiv - 460 p.. - (Perspectives in Mathematical Logic) .
ISBN : 978-3-540-63648-9
Langues : Anglais
Catégories : 03-XX Mathematical logic and foundations:03-02 Research exposition (monographs, survey articles)
03-XX Mathematical logic and foundations:03DXX Computability and recursion theory:03D15 Complexity of computation
03-XX Mathematical logic and foundations:03FXX Proof theory and constructive mathematics:03F30 First-order arithmetic and fragmentsMots-clés : consistency interpretability witnessing functions provability bounded arithmetic model theory indicators conservativity definable cuts reflexive theories self-reference incompleteness combinatorics in fragments recursion theory partial truth definitions fragments of arithmetic foundations of arithmetic of natural numbers Index. décimale : 03C Monographie Exemplaires
Code-barres Cote Support Localisation Section Disponibilité 13032 03C07 imprimé / autre CRDM 03/MATHEMATICAL LOGIC AND FOUNDATIONS Disponible Forcing with random variables and proof complexity / Jan Krajicek
Titre : Forcing with random variables and proof complexity Type de document : texte imprimé Auteurs : Jan Krajicek, Auteur Editeur : Cambridge University Press Année de publication : 2011 Collection : London Mathematical Society Lecture Note Series. num. 382 Importance : xvi - 247 p. Format : 23 cm ISBN/ISSN/EAN : 978-0-521-15433-8 Langues : Anglais Catégories : 03-XX Mathematical logic and foundations:03-02 Research exposition (monographs, survey articles)
03-XX Mathematical logic and foundations:03CXX Model theory:03C62 Models of arithmetic and set theory
03-XX Mathematical logic and foundations:03FXX Proof theory and constructive mathematics:03F20 Complexity of proofsMots-clés : Bounded arithmetic propositional proof complexity Boolean-valued models Loeb's measure decision tree Index. décimale : 03C Monographie Forcing with random variables and proof complexity [texte imprimé] / Jan Krajicek, Auteur . - [S.l.] : Cambridge University Press, 2011 . - xvi - 247 p. ; 23 cm. - (London Mathematical Society Lecture Note Series.; 382) .
ISBN : 978-0-521-15433-8
Langues : Anglais
Catégories : 03-XX Mathematical logic and foundations:03-02 Research exposition (monographs, survey articles)
03-XX Mathematical logic and foundations:03CXX Model theory:03C62 Models of arithmetic and set theory
03-XX Mathematical logic and foundations:03FXX Proof theory and constructive mathematics:03F20 Complexity of proofsMots-clés : Bounded arithmetic propositional proof complexity Boolean-valued models Loeb's measure decision tree Index. décimale : 03C Monographie Exemplaires
Code-barres Cote Support Localisation Section Disponibilité 22219 03C191 imprimé / autre CRDM 03/MATHEMATICAL LOGIC AND FOUNDATIONS Disponible 22220 03C191 imprimé / autre CRDM 03/MATHEMATICAL LOGIC AND FOUNDATIONS Disponible