| 000 | 03458nam a22004815i 4500 | ||
|---|---|---|---|
| 001 | 978-1-4419-1221-3 | ||
| 003 | DE-He213 | ||
| 005 | 20140220084505.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 100701s2010 xxu| s |||| 0|eng d | ||
| 020 |
_a9781441912213 _9978-1-4419-1221-3 |
||
| 024 | 7 |
_a10.1007/978-1-4419-1221-3 _2doi |
|
| 050 | 4 | _aQA8.9-10.3 | |
| 072 | 7 |
_aPBC _2bicssc |
|
| 072 | 7 |
_aPBCD _2bicssc |
|
| 072 | 7 |
_aMAT018000 _2bisacsh |
|
| 082 | 0 | 4 |
_a511.3 _223 |
| 100 | 1 |
_aRautenberg, Wolfgang. _eauthor. |
|
| 245 | 1 | 2 |
_aA Concise Introduction to Mathematical Logic _h[electronic resource] / _cby Wolfgang Rautenberg. |
| 250 | _a3. | ||
| 264 | 1 |
_aNew York, NY : _bSpringer New York, _c2010. |
|
| 300 |
_aXXI, 319p. 25 illus. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 | _aUniversitext | |
| 505 | 0 | _aPropositional Logic -- First-Order Logic -- Complete logical Calculi -- Foundations of Logic Programming -- Elements of Model Theory -- Incompleteness and Undecidability -- On the Theory of Self-Reference. | |
| 520 | _aTraditional logic as a part of philosophy is one of the oldest scientific disciplines and can be traced back to the Stoics and to Aristotle. Mathematical logic, however, is a relatively young discipline and arose from the endeavors of Peano, Frege, and others to create a logistic foundation for mathematics. It steadily developed during the twentieth century into a broad discipline with several sub-areas and numerous applications in mathematics, informatics, linguistics and philosophy. This book treats the most important material in a concise and streamlined fashion. The third edition is a thorough and expanded revision of the former. Although the book is intended for use as a graduate text, the first three chapters can easily be read by undergraduates interested in mathematical logic. These initial chapters cover the material for an introductory course on mathematical logic, combined with applications of formalization techniques to set theory. Chapter 3 is partly of descriptive nature, providing a view towards algorithmic decision problems, automated theorem proving, non-standard models including non-standard analysis, and related topics. The remaining chapters contain basic material on logic programming for logicians and computer scientists, model theory, recursion theory, Gödel’s Incompleteness Theorems, and applications of mathematical logic. Philosophical and foundational problems of mathematics are discussed throughout the text. Each section of the seven chapters ends with exercises some of which of importance for the text itself. There are hints to most of the exercises in a separate file Solution Hints to the Exercises which is not part of the book but is available from the author’s website. | ||
| 650 | 0 | _aMathematics. | |
| 650 | 0 | _aComputer science. | |
| 650 | 0 | _aLogic, Symbolic and mathematical. | |
| 650 | 1 | 4 | _aMathematics. |
| 650 | 2 | 4 | _aMathematical Logic and Foundations. |
| 650 | 2 | 4 | _aComputational Science and Engineering. |
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer eBooks | |
| 776 | 0 | 8 |
_iPrinted edition: _z9781441912206 |
| 830 | 0 | _aUniversitext | |
| 856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-1-4419-1221-3 |
| 912 | _aZDB-2-SMA | ||
| 999 |
_c110346 _d110346 |
||