001445186 000__ 03854cam\a2200613Ia\4500
001445186 001__ 1445186
001445186 003__ OCoLC
001445186 005__ 20230310003817.0
001445186 006__ m\\\\\o\\d\\\\\\\\
001445186 007__ cr\un\nnnunnun
001445186 008__ 220317s2022\\\\sz\\\\\\o\\\\\001\0\eng\d
001445186 019__ $$a1304243484$$a1304341115$$a1304400488$$a1305841673$$a1306064038$$a1306168111
001445186 020__ $$a9783030790103$$q(electronic bk.)
001445186 020__ $$a303079010X$$q(electronic bk.)
001445186 020__ $$a9783030790110
001445186 020__ $$a3030790118
001445186 020__ $$a9783030790127
001445186 020__ $$a3030790126
001445186 020__ $$z3030790096
001445186 020__ $$z9783030790097
001445186 0247_ $$a10.1007/978-3-030-79010-3$$2doi
001445186 035__ $$aSP(OCoLC)1303892600
001445186 040__ $$aYDX$$beng$$cYDX$$dGW5XE$$dFIE$$dEBLCP$$dOCLCO$$dOCLCF$$dN$T$$dSFB$$dOCL$$dOCLCQ
001445186 049__ $$aISEA
001445186 050_4 $$aQA9
001445186 08204 $$a511.3$$223
001445186 1001_ $$aCsirmaz, László,$$eauthor.
001445186 24510 $$aMathematical logic :$$bexercises and solutions /$$cLaszlo Csirmaz, Zalán Gyenis.
001445186 260__ $$aCham, Switzerland :$$bSpringer,$$c2022.
001445186 300__ $$a1 online resource
001445186 336__ $$atext$$btxt$$2rdacontent
001445186 337__ $$acomputer$$bc$$2rdamedia
001445186 338__ $$aonline resource$$bcr$$2rdacarrier
001445186 4901_ $$aProblem Books in Mathematics,$$x2197-8506
001445186 500__ $$aIncludes index.
001445186 5050_ $$aChapter 1 - Special Set Systems -- Chapter 2 - Games and Voting -- Chapter 3 - Formal languages and automata -- Chapter 4 - Recursion Theory -- Chapter 5 - Propositional Calculus -- Chapter 6 - First-order logic -- Chapter 7 - Fundamental Theorems -- Chapter 8 - Elementary Equivalence -- Chapter 9 - Ultraproducts -- Chapter 10 - Arithmetic -- Chapter 11 - Selected Applications -- Chapter 12 - Solutions.
001445186 506__ $$aAccess limited to authorized users.
001445186 520__ $$aThis book gathers together a colorful set of problems on classical Mathematical Logic, selected from over 30 years of teaching. The initial chapters start with problems from supporting fields, like set theory (ultrafilter constructions), full-information game theory (strategies), automata, and recursion theory (decidability, Kleenes theorems). The work then advances toward propositional logic (compactness and completeness, resolution method), followed by first-order logic, including quantifier elimination and the Ehrenfeucht Fraisse game; ultraproducts; and examples for axiomatizability and non-axiomatizability. The Arithmetic part covers Robinsons theory, Peanos axiom system, and Godels incompleteness theorems. Finally, the book touches universal graphs, tournaments, and the zero-one law in Mathematical Logic. Instructors teaching Mathematical Logic, as well as students who want to understand its concepts and methods, can greatly benefit from this work. The style and topics have been specially chosen so that readers interested in the mathematical content and methodology could follow the problems and prove the main theorems themselves, including Godels famous completeness and incompleteness theorems. Examples of applications on axiomatizability and decidability of numerous mathematical theories enrich this volume.
001445186 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed March 30, 2022).
001445186 650_0 $$aLogic, Symbolic and mathematical.
001445186 650_0 $$aModel theory.
001445186 650_6 $$aLogique symbolique et mathématique.
001445186 650_6 $$aThéorie des modèles.
001445186 655_7 $$aLlibres electrònics.$$2thub
001445186 655_0 $$aElectronic books.
001445186 7001_ $$aGyenis, Zalán,$$eauthor.
001445186 77608 $$iPrint version:$$z3030790096$$z9783030790097$$w(OCoLC)1252413420
001445186 830_0 $$aProblem books in mathematics,$$x2197-8506
001445186 852__ $$bebk
001445186 85640 $$3Springer Nature$$uhttps://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-3-030-79010-3$$zOnline Access$$91397441.1
001445186 909CO $$ooai:library.usi.edu:1445186$$pGLOBAL_SET
001445186 980__ $$aBIB
001445186 980__ $$aEBOOK
001445186 982__ $$aEbook
001445186 983__ $$aOnline
001445186 994__ $$a92$$bISE