Basic proof theory / Troelstra, A.

Public ISBD Titre : Basic proof theory Type de document : texte imprimé Auteurs : Troelstra, A. ; Schwichtenberg, H. Mention d'édition : 2nd ed. Editeur : Cambridge : Cambridge University Press Année de publication : 2000 Collection : Cambridge Tracts in Computer Sciences num. 43 Importance : xii - 417 p. ISBN/ISSN/EAN : 978-0-521-77911-1 Langues : Anglais Catégories : 03-XX Mathematical logic and foundations:03-01 Instructional exposition (textbooks, tutorial papers, etc.) 03-XX Mathematical logic and foundations:03-02 Research exposition (monographs, survey articles) 03-XX Mathematical logic and foundations:03BXX General logic:03B40 Combinatory logic and lambda-calculus 03-XX Mathematical logic and foundations:03BXX General logic:03B45 Modal logic 03-XX Mathematical logic and foundations:03BXX General logic:03B70 Logic in computer science 03-XX Mathematical logic and foundations:03FXX Proof theory and constructive mathematics:03F03 Proof theory, general 03-XX Mathematical logic and foundations:03FXX Proof theory and constructive mathematics:03F05 Cut-elimination and normal-form theorems 03-XX Mathematical logic and foundations:03FXX Proof theory and constructive mathematics:03F30 First-order arithmetic and fragments 03-XX Mathematical logic and foundations:03FXX Proof theory and constructive mathematics:03F35 Second- and higher-order arithmetic and fragments 03-XX Mathematical logic and foundations:03GXX Algebraic logic:03G30 Categorical logic, topoi 68-XX Computer science :68NXX Software:68N17 Logic programming Mots-clés : apartness  e-logic  multi-succedent intuitionistic sequent calculus  kleene-style sequent calculus  logic programming  connections with computer science  first-order arithmetic  modal logic  hilbert-style system  resolution  second-order heyting arithmetic  linear logic  coherence theorem  categorical logic  formulas-as-types relation  combinatory logic  type theory  interpolation  strong normalization  cut elimination  gentzen type system  sequent calculus  natural deduction system  intuitionistic logic  classical logic  minimal logic  proof theory Index. décimale : 03C Monographie Basic proof theory [texte imprimé] / Troelstra, A. ; Schwichtenberg, H.  . -  2nd ed. . - Cambridge : Cambridge University Press, 2000 . - xii - 417 p.. - (Cambridge Tracts in Computer Sciences; 43) . ISBN : 978-0-521-77911-1 Langues : Anglais Catégories : 03-XX Mathematical logic and foundations:03-01 Instructional exposition (textbooks, tutorial papers, etc.) 03-XX Mathematical logic and foundations:03-02 Research exposition (monographs, survey articles) 03-XX Mathematical logic and foundations:03BXX General logic:03B40 Combinatory logic and lambda-calculus 03-XX Mathematical logic and foundations:03BXX General logic:03B45 Modal logic 03-XX Mathematical logic and foundations:03BXX General logic:03B70 Logic in computer science 03-XX Mathematical logic and foundations:03FXX Proof theory and constructive mathematics:03F03 Proof theory, general 03-XX Mathematical logic and foundations:03FXX Proof theory and constructive mathematics:03F05 Cut-elimination and normal-form theorems 03-XX Mathematical logic and foundations:03FXX Proof theory and constructive mathematics:03F30 First-order arithmetic and fragments 03-XX Mathematical logic and foundations:03FXX Proof theory and constructive mathematics:03F35 Second- and higher-order arithmetic and fragments 03-XX Mathematical logic and foundations:03GXX Algebraic logic:03G30 Categorical logic, topoi 68-XX Computer science :68NXX Software:68N17 Logic programming Mots-clés : apartness  e-logic  multi-succedent intuitionistic sequent calculus  kleene-style sequent calculus  logic programming  connections with computer science  first-order arithmetic  modal logic  hilbert-style system  resolution  second-order heyting arithmetic  linear logic  coherence theorem  categorical logic  formulas-as-types relation  combinatory logic  type theory  interpolation  strong normalization  cut elimination  gentzen type system  sequent calculus  natural deduction system  intuitionistic logic  classical logic  minimal logic  proof theory Index. décimale : 03C Monographie

Exemplaires

Code-barres	Cote	Support	Localisation	Section	Disponibilité
13412	03C02	imprimé / autre	CRDM	03/MATHEMATICAL LOGIC AND FOUNDATIONS	Disponible

Bounded arithmetic, propositional logic, and complexity theory / Jan Krajicek

Public ISBD Titre : Bounded arithmetic, propositional logic, and complexity theory Type de document : texte imprimé Auteurs : Jan Krajicek Editeur : Cambridge : Cambridge University Press Année de publication : 1995 Collection : Encyclopedia of Mathematics and Its Applications num. 60 Importance : xiv, 343 p. Format : 24 cm ISBN/ISSN/EAN : 978-0-521-45205-2 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 fragments Mots-clés : bounded arithmetic  complexity of propositional logic  independence proofs  lower bound proofs  propositional proof systems  witnessing Index. décimale : 03C Monographie Bounded arithmetic, propositional logic, and complexity theory [texte imprimé] / Jan Krajicek . - Cambridge : Cambridge University Press, 1995 . - xiv, 343 p. ; 24 cm. - (Encyclopedia of Mathematics and Its Applications; 60) . ISBN : 978-0-521-45205-2 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 fragments Mots-clés : bounded arithmetic  complexity of propositional logic  independence proofs  lower bound proofs  propositional proof systems  witnessing Index. décimale : 03C Monographie

Exemplaires

Code-barres	Cote	Support	Localisation	Section	Disponibilité
18520	03C175	imprimé / autre	CRDM	03/MATHEMATICAL LOGIC AND FOUNDATIONS	Disponible

Gödel's incompleteness theorems / Raymond M. Smullyan

Public ISBD Titre : Gödel's incompleteness theorems Type de document : texte imprimé Auteurs : Raymond M. Smullyan Editeur : Oxford University Press Année de publication : 1992 Collection : Oxford Logic Guides num. 19 Importance : xiii, 139 p. Format : 23 cm. - ISBN/ISSN/EAN : 978-0-19-504672-4 Langues : Anglais Catégories : 03-XX Mathematical logic and foundations:03-01 Instructional exposition (textbooks, tutorial papers, etc.) 03-XX Mathematical logic and foundations:03-02 Research exposition (monographs, survey articles) 03-XX Mathematical logic and foundations:03FXX Proof theory and constructive mathematics:03F30 First-order arithmetic and fragments Mots-clés : Gödel's incompleteness theorems  Tarski truth set  axiomatic arithmetic based on plus, times and power  Peano arithmetic  Montague-Kalish axiomatization for first-order logic  original Gödel proof Index. décimale : 03C Monographie Gödel's incompleteness theorems [texte imprimé] / Raymond M. Smullyan . - [S.l.] : Oxford University Press, 1992 . - xiii, 139 p. ; 23 cm. -. - (Oxford Logic Guides; 19) . ISBN : 978-0-19-504672-4 Langues : Anglais Catégories : 03-XX Mathematical logic and foundations:03-01 Instructional exposition (textbooks, tutorial papers, etc.) 03-XX Mathematical logic and foundations:03-02 Research exposition (monographs, survey articles) 03-XX Mathematical logic and foundations:03FXX Proof theory and constructive mathematics:03F30 First-order arithmetic and fragments Mots-clés : Gödel's incompleteness theorems  Tarski truth set  axiomatic arithmetic based on plus, times and power  Peano arithmetic  Montague-Kalish axiomatization for first-order logic  original Gödel proof Index. décimale : 03C Monographie

Exemplaires

Code-barres	Cote	Support	Localisation	Section	Disponibilité
18290	03C172	imprimé / autre	CRDM	03/MATHEMATICAL LOGIC AND FOUNDATIONS	Disponible

Metamathematics of first-order arithmetic / Hajek, Petr

Public ISBD 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 fragments Mots-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 fragments Mots-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

---

page 1/1