2 résultat(s) recherche sur le mot-clé 'first-order arithmetic'

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

Initial segments of degrees below 0 / Epstein, Richard L.

Public ISBD Titre : Initial segments of degrees below 0 Type de document : texte imprimé Auteurs : Epstein, Richard L. Editeur : Providence, R.I. : American Mathematical Society Année de publication : 1981 Collection : Memoirs of the American Mathematical Society, ISSN 0065-9266 num. 241 Importance : vi - 102 p. Langues : Anglais Catégories : 03-XX Mathematical logic and foundations:03DXX Computability and recursion theory:03D30 Other degrees and reducibilities 03-XX Mathematical logic and foundations:03DXX Computability and recursion theory:03D35 Undecidability and degrees of sets of sentences Mots-clés : first-order arithmetic  high degree  embedding results  non recursive recursively enumerable degree Index. décimale : Mem Initial segments of degrees below 0 [texte imprimé] / Epstein, Richard L. . - Providence, R.I. : American Mathematical Society, 1981 . - vi - 102 p.. - (Memoirs of the American Mathematical Society, ISSN 0065-9266; 241) . Langues : Anglais Catégories : 03-XX Mathematical logic and foundations:03DXX Computability and recursion theory:03D30 Other degrees and reducibilities 03-XX Mathematical logic and foundations:03DXX Computability and recursion theory:03D35 Undecidability and degrees of sets of sentences Mots-clés : first-order arithmetic  high degree  embedding results  non recursive recursively enumerable degree Index. décimale : Mem

Exemplaires

Code-barres	Cote	Support	Localisation	Section	Disponibilité
15233	Mem/241	imprimé / autre	CRDM	Mem/MEMOIRS AMS	Disponible