Cargando…

Computer Mathematics

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Prudhomme, Gerard
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Ashland : Arcler Press, 2019.
Temas:
Acceso en línea:Texto completo

MARC

LEADER 00000cam a2200000Mu 4500
001 EBSCO_on1085219852
003 OCoLC
005 20231017213018.0
006 m o d
007 cr |n|---|||||
008 190209s2019 xx o 000 0 eng d
040 |a EBLCP  |b eng  |e pn  |c EBLCP  |d YDX  |d OCLCQ  |d UKAHL  |d N$T  |d OCLCO  |d N$T  |d OCLCF  |d OCLCO  |d K6U  |d OCLCQ  |d OCLCO 
019 |a 1084502391  |a 1084694062  |a 1284938266 
020 |a 1773615971 
020 |a 9781773615974  |q (electronic bk.) 
035 |a (OCoLC)1085219852  |z (OCoLC)1084502391  |z (OCoLC)1084694062  |z (OCoLC)1284938266 
050 4 |a QA76.9.M35 
082 0 4 |a 004.0151  |2 23 
049 |a UAMI 
100 1 |a Prudhomme, Gerard. 
245 1 0 |a Computer Mathematics 
260 |a Ashland :  |b Arcler Press,  |c 2019. 
300 |a 1 online resource (268 pages) 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
588 0 |a Print version record. 
505 0 |a Cover; Half Title Page; Title Page; Copyright Page; About the Author; Table of Contents; List of Figures; Preface; Chapter 1 Preparatory Mathematical and Computer Science Studies; Chapter 2 Predictable Phenomena; 2.1. Intensive Preliminary Courses of Logic; Chapter 3 Theory of Models and of Groups; Chapter 4 Programming Models; Chapter 5 Introduction to Formal Computer-Aided Proof; Chapter 6 Theory of the Demonstration; 6.1. Calculability And Incompleteness; Chapter 7 Working Group on Core Courses; 7.1. Verifications; 7.2. Complexity; Chapter 8 Finite Model Theory 
505 8 |a Chapter 9 Calculability and IncompletenessChapter 10 Programming Models; Chapter 11 Combinators; Chapter 12 Mathematical Logic; Chapter 13 Foundations of Computing; Chapter 14 Formal Arithmetic; Chapter 15 Database Object Component; Chapter 16 Arithmetization of Logic; Chapter 17 Computability and Complexity; Chapter 18 Polarization and Classical Logic; Chapter 19 Syntax and Semantics; Chapter 20 Proofs and Types; Chapter 21 Foundations for Programming Languages; 21.1. Basic Set Theory; Chapter 22 Descriptive Set Theory; 22.1. Structures And Techniques 
505 8 |a Chapter 23 Semantics of Programming LanguagesChapter 24 Stable Groups; Chapter 25 General Theory of Algorithms; Chapter 26 Recursive Functions; 26.1. Machine-Calculable Functions; Chapter 27 Logical Characterization of Computable Functions; Chapter 28 Notions of Reduction and Undecidable Problems; Chapter 29 Introduction to Complexity; Chapter 30 Theory of Finite Models and Applications; Chapter 31 Approximate Verification and Complexity; Chapter 32 Working on Fundamental Courses; Chapter 33 Preliminary Intensive Logic; Chapter 34 Classic Tools 
505 8 |a Chapter 35 An Introduction to Contemporary Mathematical LogicChapter 36 A Course in Model Theory; Chapter 37 Classes and Completeness; Chapter 38 Axioms; Chapter 39 The Incompleteness Theorems; Chapter 40 Conceptual Perspectives; Chapter 41 Programming Perspectives; Chapter 42 Advances in Linear Logic; Chapter 43 Symbolic Logic; Bibliography; Index 
590 |a eBooks on EBSCOhost  |b EBSCO eBook Subscription Academic Collection - Worldwide 
650 0 |a Computer science  |x Mathematics. 
650 6 |a Informatique  |x Mathématiques. 
650 7 |a Computer science  |x Mathematics  |2 fast 
776 0 8 |i Print version:  |a Prudhomme, Gerard.  |t Computer Mathematics.  |d Ashland : Arcler Press, ©2019 
856 4 0 |u https://ebsco.uam.elogim.com/login.aspx?direct=true&scope=site&db=nlebk&AN=2013901  |z Texto completo 
938 |a Askews and Holts Library Services  |b ASKH  |n BDZ0044473341 
938 |a ProQuest Ebook Central  |b EBLB  |n EBL5655507 
938 |a EBSCOhost  |b EBSC  |n 2013901 
938 |a YBP Library Services  |b YANK  |n 16023320 
994 |a 92  |b IZTAP