Wolfgang Thomas – författare
Visar alla böcker från författaren Wolfgang Thomas. Handla med fri frakt och snabb leverans.
22 produkter
22 produkter
Inbunden, Engelska, 1994
839 kr
Skickas inom 5-8 vardagar
What is a mathematical proof? How can proofs be justified? Are there limitations to provability? To what extent can machines carry out mathe matical proofs? Only in this century has there been success in obtaining substantial and satisfactory answers. The present book contains a systematic discussion of these results. The investigations are centered around first-order logic. Our first goal is Godel's completeness theorem, which shows that the con sequence relation coincides with formal provability: By means of a calcu lus consisting of simple formal inference rules, one can obtain all conse quences of a given axiom system (and in particular, imitate all mathemat ical proofs). A short digression into model theory will help us to analyze the expres sive power of the first-order language, and it will turn out that there are certain deficiencies. For example, the first-order language does not allow the formulation of an adequate axiom system for arithmetic or analysis. On the other hand, this difficulty can be overcome--even in the framework of first-order logic-by developing mathematics in set-theoretic terms. We explain the prerequisites from set theory necessary for this purpose and then treat the subtle relation between logic and set theory in a thorough manner.
E-bok
PDF, Engelska, 2013855 kr
Läs direkt efter köp
What is a mathematical proof? How can proofs be justified? Are there limitations to provability? To what extent can machines carry out mathe matical proofs? Only in this century has there been success in obtaining substantial and satisfactory answers. The present book contains a systematic discussion of these results. The investigations are centered around first-order logic. Our first goal is Godel''s completeness theorem, which shows that the con sequence relation coincides with formal provability: By means of a calcu lus consisting of simple formal inference rules, one can obtain all conse quences of a given axiom system (and in particular, imitate all mathemat ical proofs). A short digression into model theory will help us to analyze the expres sive power of the first-order language, and it will turn out that there are certain deficiencies. For example, the first-order language does not allow the formulation of an adequate axiom system for arithmetic or analysis. On the other hand, this difficulty can be overcome--even in the framework of first-order logic-by developing mathematics in set-theoretic terms. We explain the prerequisites from set theory necessary for this purpose and then treat the subtle relation between logic and set theory in a thorough manner.
Del 291 - Graduate Texts in Mathematics
Mathematical Logic
Inbunden, Engelska, 2021
766 kr
Skickas inom 10-15 vardagar
This textbook introduces first-order logic and its role in the foundations of mathematics by examining fundamental questions. What is a mathematical proof? How can mathematical proofs be justified? Are there limitations to provability? To what extent can machines carry out mathematical proofs? In answering these questions, this textbook explores the capabilities and limitations of algorithms and proof methods in mathematics and computer science.The chapters are carefully organized, featuring complete proofs and numerous examples throughout. Beginning with motivating examples, the book goes on to present the syntax and semantics of first-order logic. After providing a sequent calculus for this logic, a Henkin-type proof of the completeness theorem is given. These introductory chapters prepare the reader for the advanced topics that follow, such as Gödel's Incompleteness Theorems, Trakhtenbrot's undecidability theorem, Lindström's theorems on the maximality of first-order logic, and results linking logic with automata theory. This new edition features many modernizations, as well as two additional important results: The decidability of Presburger arithmetic, and the decidability of the weak monadic theory of the successor function.Mathematical Logic is ideal for students beginning their studies in logic and the foundations of mathematics. Although the primary audience for this textbook will be graduate students or advanced undergraduates in mathematics or computer science, in fact the book has few formal prerequisites. It demands of the reader only mathematical maturity and experience with basic abstract structures, such as those encountered in discrete mathematics or algebra.
E-bok
PDF, Engelska, 2021712 kr
Läs direkt efter köp
This textbook introduces first-order logic and its role in the foundations of mathematics by examining fundamental questions. What is a mathematical proof? How can mathematical proofs be justified? Are there limitations to provability? To what extent can machines carry out mathematical proofs? In answering these questions, this textbook explores the capabilities and limitations of algorithms and proof methods in mathematics and computer science.
The chapters are carefully organized, featuring complete proofs and numerous examples throughout. Beginning with motivating examples, the book goes on to present the syntax and semantics of first-order logic. After providing a sequent calculus for this logic, a Henkin-type proof of the completeness theorem is given. These introductory chapters prepare the reader for the advanced topics that follow, such as Gödel''s Incompleteness Theorems, Trakhtenbrot''s undecidability theorem, Lindström''s theorems on the maximality of first-order logic, and results linking logic with automata theory. This new edition features many modernizations, as well as two additional important results: The decidability of Presburger arithmetic, and the decidability of the weak monadic theory of the successor function.
Mathematical Logic is ideal for students beginning their studies in logic and the foundations of mathematics. Although the primary audience for this textbook will be graduate students or advanced undergraduates in mathematics or computer science, in fact the book has few formal prerequisites. It demands of the reader only mathematical maturity and experience with basic abstract structures, such as those encountered in discrete mathematics or algebra.
Del 291 - Graduate Texts in Mathematics
Mathematical Logic
Häftad, Engelska, 2022
549 kr
Skickas inom 10-15 vardagar
This textbook introduces first-order logic and its role in the foundations of mathematics by examining fundamental questions. What is a mathematical proof? How can mathematical proofs be justified? Are there limitations to provability? To what extent can machines carry out mathematical proofs? In answering these questions, this textbook explores the capabilities and limitations of algorithms and proof methods in mathematics and computer science.The chapters are carefully organized, featuring complete proofs and numerous examples throughout. Beginning with motivating examples, the book goes on to present the syntax and semantics of first-order logic. After providing a sequent calculus for this logic, a Henkin-type proof of the completeness theorem is given. These introductory chapters prepare the reader for the advanced topics that follow, such as Gödel's Incompleteness Theorems, Trakhtenbrot's undecidability theorem, Lindström's theorems on the maximality of first-order logic, and results linking logic with automata theory. This new edition features many modernizations, as well as two additional important results: The decidability of Presburger arithmetic, and the decidability of the weak monadic theory of the successor function.Mathematical Logic is ideal for students beginning their studies in logic and the foundations of mathematics. Although the primary audience for this textbook will be graduate students or advanced undergraduates in mathematics or computer science, in fact the book has few formal prerequisites. It demands of the reader only mathematical maturity and experience with basic abstract structures, such as those encountered in discrete mathematics or algebra.
Häftad, Engelska, 2002
790 kr
Skickas inom 10-15 vardagar
A central aim and ever-lasting dream of computer science is to put the development of hardware and software systems on a mathematical basis which is both firm and practical. Such a scientific foundation is needed especially for the construction of reactive programs, like communication protocols or control systems.For the construction and analysis of reactive systems an elegant and powerful theory has been developed based on automata theory, logical systems for the specification of nonterminating behavior, and infinite two-person games.The 19 chapters presented in this multi-author monograph give a consolidated overview of the research results achieved in the theory of automata, logics, and infinite games during the past 10 years. Special emphasis is placed on coherent style, complete coverage of all relevant topics, motivation, examples, justification of constructions, and exercises.
E-bok
PDF, Engelska, 20061 416 kr
Läs direkt efter köp
Häftad, Engelska, 2006
1 125 kr
Skickas inom 10-15 vardagar
This book constitutes the refereed proceedings of the 23rd Annual Symposium on Theoretical Aspects of Computer Science, held in February 2006. The 54 revised full papers presented together with three invited papers were carefully reviewed and selected from 283 submissions. The papers address the whole range of theoretical computer science including algorithms and data structures, automata and formal languages, complexity theory, semantics, and logic in computer science.
E-bok
PDF, Engelska, 2003944 kr
Läs direkt efter köp
A central aim and ever-lasting dream of computer science is to put the development of hardware and software systems on a mathematical basis which is both firm and practical. Such a scientific foundation is needed especially for the construction of reactive programs, like communication protocols or control systems.
For the construction and analysis of reactive systems an elegant and powerful theory has been developed based on automata theory, logical systems for the specification of nonterminating behavior, and infinite two-person games.
The 19 chapters presented in this multi-author monograph give a consolidated overview of the research results achieved in the theory of automata, logics, and infinite games during the past 10 years. Special emphasis is placed on coherent style, complete coverage of all relevant topics, motivation, examples, justification of constructions, and exercises.
734 kr
Läs direkt efter köp
Häftad, Engelska, 1998
565 kr
Skickas inom 10-15 vardagar
This book constitutes the strictly refereed post-workshop proceedings of the 11th International Workshop on Computer Science Logic, CSL '97, held as the 1997 Annual Conference of the European Association on Computer Science Logic, EACSL, in Aarhus, Denmark, in August 1997.The volume presents 26 revised full papers selected after two rounds of refereeing from initially 92 submissions; also included are four invited papers. The book addresses all current aspects of computer science logics and its applications and thus presents the state of the art in the area.
565 kr
Skickas inom 10-15 vardagar
The International Conference "Foundations of Software Science and Compu- tion Structures" (FOSSACS) is a constituent of the "Joint European Conferences on Theoryand Practice of Software" (ETAPS). The present volume contains the contributions to FOSSACS'99, the second conference in this series, which took place in Amsterdam. As formulated in the call for papers, FOSSACS focusses on "papers which o?er progress in foundational research with a clear signi?cance for software science. A central issue is theories and methods which support the speci?cation, tra- formation, veri?cation, and analysis of programs and software systems." The articles in this volume represent a wide spectrum of approaches to this general aim. In manypapers, one ?nds the studyof new concepts and methods which are motivated byrecent trends (or problems) in the practical use of software and information technology. The volume contains 18 contributed papers, preceded bythree invited papers. The ?rst, byM. Abadi, accompanies his "unifying invited lecture" addressed to the whole ETAPS audience. The second, byJ. Esparza and J. Knoop, contains an application of the results presented byJ.Esparza in his invited lecture to FOSSACS'99. The third summarizes an invited tutorial byD. Sangiorgi p- sented to ETAPS'99.
Häftad, Engelska, 2007
1 125 kr
Skickas inom 10-15 vardagar
This book constitutes the refereed proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2007, held in Aachen, Germany in February 2007. The 56 revised full papers presented together with 3 invited papers address the whole range of theoretical computer science as well as current challenges like biological computing, quantum computing, and mobile and net computing.
E-bok
PDF, Engelska, 20071 408 kr
Läs direkt efter köp
Häftad, Engelska, 2009
1 092 kr
Skickas inom 10-15 vardagar
ICALP 2009, the 36th edition of the International Colloquium on Automata, Languages and Programming, was held on the island of Rhodes, July 6-10, 2009. ICALP is a series of annual conferences of the European Association for Theoretical Computer Science (EATCS) which ?rst took place in 1972. This year, the ICALP program consisted of the established track A (focusing on algorithms, complexity and games) and track B (focusing on logic, automata, semantics and theory of programming), and of the recently introduced track C (in 2009 focusing on foundations of networked computation). In response to the call for papers, the Program Committee received 370 s- missions: 223 for track A, 84 for track B and 63 for track C. Out of these, 108 papers were selected for inclusion in the scienti?c program: 62 papers for track A, 24 for track B and 22 for track C. The selection was made by the Program Committees based on originality, quality, and relevance to theoretical computer science. The quality of the manuscripts was very high indeed, and many dese- ing papers could not be selected. ICALP 2009 consisted of ?ve invited lectures and the contributed papers.Thisvolumeoftheproceedingscontainsallcontributedpaperspresentedintrack AtogetherwiththepapersbytheinvitedspeakersKurtMehlhorn(Max-Planck- Institut fu ..r Informatik, Saarbru ..cken)and Christos Papadimitriou(University of California at Berkeley). A companion volume contains all contributed papers presented at the conference in track B and track C, together with the papers by the invited speakers Georg Gottlob (University of Oxford), Tom Henzinger ' (EcolePolytechniqueF' ed' eraledeLausanne),andNoamNisan(Google,TelAviv, and Hebrew University).
E-bok
PDF, Engelska, 20091 367 kr
Läs direkt efter köp
Häftad, Engelska, 2009
1 125 kr
Skickas inom 10-15 vardagar
ICALP 2009, the 36th edition of the International Colloquium on Automata, Languages and Programming, was held on the island of Rhodes, July 6–10, 2009. ICALP is a series of annual conferences of the European Association for Theoretical Computer Science (EATCS) which ?rst took place in 1972. This year, the ICALP program consisted of the established track A (focusing on algorithms, complexity and games) and track B (focusing on logic, automata, semantics and theory of programming), and of the recently introduced track C (in 2009 focusing on foundations of networked computation). In response to the call for papers, the Program Committee received 370 s- missions: 223 for track A, 84 for track B and 63 for track C. Out of these, 108 papers were selected for inclusion in the scienti?c program: 62 papers for track A, 24 for track B and 22 for track C. The selection was made by the Program Committees based on originality, quality, and relevance to theoretical computer science. The quality of the manuscripts was very high indeed, and many dese- ing papers could not be selected. ICALP 2009 consisted of ?ve invited lectures and the contributed papers.
E-bok
PDF, Engelska, 20091 367 kr
Läs direkt efter köp
ICALP 2009, the 36th edition of the International Colloquium on Automata, Languages and Programming, was held on the island of Rhodes, July 6–10, 2009. ICALP is a series of annual conferences of the European Association for Theoretical Computer Science (EATCS) which ?rst took place in 1972. This year, the ICALP program consisted of the established track A (focusing on algorithms, complexity and games) and track B (focusing on logic, automata, semantics and theory of programming), and of the recently introduced track C (in 2009 focusing on foundations of networked computation). In response to the call for papers, the Program Committee received 370 s- missions: 223 for track A, 84 for track B and 63 for track C. Out of these, 108 papers were selected for inclusion in the scienti?c program: 62 papers for track A, 24 for track B and 22 for track C. The selection was made by the Program Committees based on originality, quality, and relevance to theoretical computer science. The quality of the manuscripts was very high indeed, and many dese- ing papers could not be selected. ICALP 2009 consisted of ?ve invited lectures and the contributed papers.
Häftad, Tyska, 2018
463 kr
Skickas inom 10-15 vardagar
Was ist ein mathematischer Beweis? Wie lassen sich Beweise rechtfertigen? Gibt es Grenzen der Beweisbarkeit? Ist die Mathematik widerspruchsfrei? Kann man das Auffinden mathematischer Beweise Computern übertragen? Erst im 20. Jahrhundert ist es der mathematischen Logik gelungen, weitreichende Antworten auf diese Fragen zu geben. Im vorliegenden Werk werden die Ergebnisse systematisch zusammengestellt; im Mittelpunkt steht dabei die Logik erster Stufe. Die Lektüre setzt – außer einer gewissen Vertrautheit mit der mathematischen Denkweise – keine spezifischen Kenntnisse voraus. Für die vorliegende 6. Auflage wurde der Text überarbeitet und durch die Darstellung zweier für Logik und Informatik wichtiger Entscheidbarkeitsresultate erweitert.
E-bok
PDF, Tyska, 2018458 kr
Läs direkt efter köp
Was ist ein mathematischer Beweis? Wie lassen sich Beweise rechtfertigen? Gibt es Grenzen der Beweisbarkeit? Ist die Mathematik widerspruchsfrei? Kann man das Auffinden mathematischer Beweise Computern übertragen? Erst im 20. Jahrhundert ist es der mathematischen Logik gelungen, weitreichende Antworten auf diese Fragen zu geben. Im vorliegenden Werk werden die Ergebnisse systematisch zusammengestellt; im Mittelpunkt steht dabei die Logik erster Stufe. Die Lektüre setzt – außer einer gewissen Vertrautheit mit der mathematischen Denkweise – keine spezifischen Kenntnisse voraus. Für die vorliegende 6. Auflage wurde der Text überarbeitet und durch die Darstellung zweier für Logik und Informatik wichtiger Entscheidbarkeitsresultate erweitert.
Häftad, Tyska, 2007
477 kr
Skickas inom 10-15 vardagar
Werbung in Computerspielen - In-Game Advertising genannt - ist ein viel versprechender Ansatz für die gebeutelte Werbebranche. Denn Spieler zappen nicht. Aktive Spieler finden sich nicht nur unter Kindern und Jugendlichen, sondern auch unter den 20- bis 40-Jährigen. Für Werbetreibende eröffnet sich in den On- und Offline-Spielen und sogar in virtuellen Welten wie Second Life ein völlig neuer Zugang zum Konsumenten.Die Autoren zeigen, wie dieses Werbemedium funktioniert. Das geänderte Mediennutzungsverhalten, die immer hochwertigere Grafik sowie die immer stärkere Vernetzung mit Online-Medien führen zu ganz neuen Möglichkeiten der Nutzung von Computerspielen als Werbeträger. Die Leser erfahren, welche Zielgruppen erreicht werden können, wie sie In-Game Advertising in ihre Mediaplanung einbeziehen und wie sie es in den Media-Mix integrieren. Mit Kampagnen-Beispielen internationaler Markenartikler.
E-bok
PDF, Tyska, 2007524 kr
Läs direkt efter köp