Matematisk logik

This book presents a selection of papers presented to the Second Inter- national Symposium on Semi-Markov Models: Theory and Applications held in Compiegne (France) in December 1998. This international meeting had the same aim as the first one held in Brussels in 1984 : to make, fourteen years later, the state of the art in the field of semi-Markov processes and their applications, bring together researchers in this field and also to stimulate fruitful discussions. The set of the subjects of the papers presented in Compiegne has a lot of similarities with the preceding Symposium; this shows that the main fields of semi-Markov processes are now well established particularly for basic applications in Reliability and Maintenance, Biomedicine, Queue- ing, Control processes and production. A growing field is the one of insurance and finance but this is not really a surprising fact as the problem of pricing derivative products represents now a crucial problem in economics and finance. For example, stochastic models can be applied to financial and insur- ance models as we have to evaluate the uncertainty of the future market behavior in order, firstly, to propose different measures for important risks such as the interest risk, the risk of default or the risk of catas- trophe and secondly, to describe how to act in order to optimize the situation in time. Recently, the concept of VaR (Value at Risk) was "e;discovered"e; in portfolio theory enlarging so the fundamental model of Markowitz.

Nowadays algebra is understood basically as the general theory of algebraic oper­ ations and relations. It is characterised by a considerable intrinsic naturalness of its initial notions and problems, the unity of its methods, and a breadth that far exceeds that of its basic concepts. It is more often that its power begins to be displayed when one moves outside its own limits. This characteristic ability is seen when one investigates not only complete operations, but partial operations. To a considerable extent these are related to algebraic operators and algebraic operations. The tendency to ever greater generality is amongst the reasons that playa role in explaining this development. But other important reasons play an even greater role. Within this same theory of total operations (that is, operations defined everywhere), there persistently arises in its different sections a necessity of examining the emergent feature of various partial operations. It is particularly important that this has been found in those parts of algebra it brings together and other areas of mathematics it interacts with as well as where algebra finds applica­ tion at the very limits of mathematics. In this connection we mention the theory of the composition of mappings, category theory, the theory of formal languages and the related theory of mathematical linguistics, coding theory, information theory, and algebraic automata theory. In all these areas (as well as in others) from time to time there arises the need to consider one or another partial operation.

The analysis, processing, evolution, optimization and/or regulation, and control of shapes and images appear naturally in engineering (shape optimization, image processing, visual control), numerical analysis (interval analysis), physics (front propagation), biological morphogenesis, population dynamics (migrations), and dynamic economic theory.   These problems are currently studied with tools forged out of differential geometry and functional analysis, thus requiring shapes and images to be smooth.  However, shapes and images are basically sets, most often not smooth.  J.-P. Aubin thus constructs another vision, where shapes and images are just any compact set.  Hence their evolution -- which requires a kind of differential calculus -- must be studied in the metric space of compact subsets.  Despite the loss of linearity, one can transfer most of the basic results of differential calculus and differential equations in vector spaces to mutational calculus and mutational equations in any mutational space, including naturally the space of nonempty compact subsets.   "e;Mutational and Morphological Analysis"e; offers a structure that embraces and integrates the various approaches, including shape optimization and mathematical morphology.   Scientists and graduate students will find here other powerful mathematical tools for studying problems dealing with shapes and images arising in so many fields.

Cognitive science, with its guiding metaphor of the mind as a computer, has made substantial progress towards an understanding of how people comprehend and produce discourse. The essays in this book apply these insights to problems in the interpretation of literature. The first two chapters present the outline of a cognitive theory of discourse and use it to shed light on some classic issues in literary theory, including the roles of the author's intention and the reader's brief systems in the meaning of a literary work. The next three chapters are more technical investigations of discourse interpretation, metaphor, and discourse coherence. The framework developed is then used in the examination of two literary works, a sonnet by Milton and the novella Sylvie by Gérard de Nerval.

This volume contains the reviewed papers presented at the 12th International Conference on Automated Deduction (CADE-12) held at Nancy, France in June/July 1994.The 67 papers presented were selected from 177 submissions and document many of the most important research results in automated deduction since CADE-11 was held in June 1992. The volume is organized in chapters on heuristics, resolution systems, induction, controlling resolutions, ATP problems, unification, LP applications, special-purpose provers, rewrite rule termination, ATP efficiency, AC unification, higher-order theorem proving, natural systems, problem sets, and system descriptions.

For Students Congratulations! You are about to take a course in mathematical proof. If you are nervous about the whole thing, this book is for you (if not, please read the second and third paragraphs in the introduction for professors following this, so you won't feel left out). The rumors are true; a first course in proof may be very hard because you will have to do three things that are probably new to you: 1. Read mathematics independently. 2. Understand proofs on your own. :1. Discover and write your own proofs. This book is all about what to do if this list is threatening because you "never read your calculus book" or "can't do proofs. " Here's the good news: you must be good at mathematics or you wouldn't have gotten this far. Here's the bad news: what worked before may not work this time. Success may lie in improving or discarding many habits that were good enough once but aren't now. Let's see how we've gotten to a point at which someone could dare to imply that you have bad habits. l The typical elementary and high school mathematics education in the United States tends to teach students to have ineffective learning habits, 1 In the first paragraph, yet. xiv Introduction and we blush to admit college can be just as bad.

Was haben ein König und eine Prinzessin in der Mengenlehre zu suchen? Eine Menge!In dem fantastischen Königreich Mathemagika erleben die Freunde Prof und Dio eine abenteuerliche Geschichte um das rätselhafte Verschwinden eines Ministers, eine bezaubernde Prinzessin - und einen der verrücktesten Sätze der Mathematik: das Banach-Tarski-Paradoxon. Es behauptet zum Beispiel, dass man eine Kugel von Erbsengröße in endlich vielen Teilen zu einer Kugel von Sonnengröße umbauen kann. Unmöglich?Der Untergang von Mathemagika ist eine neuartige Darstellung von Mathematik, die fesselt und hineinzieht. Es ist ein Vergnügen zu lesen, wie sich eins zum anderen fügt und am Ende alles zusammenpasst.Stimme zum Buch:  "Dass ein mathematischer Satz in der Hauptrolle ein so herrliches Theater machen kann, begeistert mich: Math Fiction mit Witz, Dramatik und Tiefe." Prof. Dr. Thomas Bedürftig, Universität Hannover Über den Autor:Karl Kuhlemann hat in Münster Mathematik studiert und arbeitet als Berater für Informationssicherheit. Die mathematischen Grundlagenfragen haben ihn seit dem Studium nicht mehr losgelassen. Der Untergang von Mathemagika ist sein erster Roman.

This three-volume set LNAI 6911, LNAI 6912, and LNAI 6913 constitutes the refereed proceedings of the European conference on Machine Learning and Knowledge Discovery in Databases: ECML PKDD 2011, held in Athens, Greece, in September 2011.The 121 revised full papers presented together with 10 invited talks and 11 demos in the three volumes, were carefully reviewed and selected from about 600 paper submissions. The papers address all areas related to machine learning and knowledge discovery in databases as well as other innovative application domains such as supervised and unsupervised learning with some innovative contributions in fundamental issues; dimensionality reduction, distance and similarity learning, model learning and matrix/tensor analysis; graph mining, graphical models, hidden markov models, kernel methods, active and ensemble learning, semi-supervised and transductive learning, mining sparse representations, model learning, inductive logic programming, and statistical learning. a significant part of the papers covers novel and timely applications of data mining and machine learning in industrial domains.

This three-volume set LNAI 6911, LNAI 6912, and LNAI 6913 constitutes the refereed proceedings of the European conference on Machine Learning and Knowledge Discovery in Databases: ECML PKDD 2011, held in Athens, Greece, in September 2011.The 121 revised full papers presented together with 10 invited talks and 11 demos in the three volumes, were carefully reviewed and selected from about 600 paper submissions. The papers address all areas related to machine learning and knowledge discovery in databases as well as other innovative application domains such as supervised and unsupervised learning with some innovative contributions in fundamental issues; dimensionality reduction, distance and similarity learning, model learning and matrix/tensor analysis; graph mining, graphical models, hidden markov models, kernel methods, active and ensemble learning, semi-supervised and transductive learning, mining sparse representations, model learning, inductive logic programming, and statistical learning. a significant part of the papers covers novel and timely applications of data mining and machine learning in industrial domains.

The evaluation of a logical formula can be viewed as a game played by two opponents, one trying to show that the formula is true and the other trying to prove it is false. This correspondence has been known for a very long time and has inspired numerous research directions. In this book, the author extends this connection between logic and games to the class of automatic structures, where relations are recognized by synchronous finite automata.In model-checking games for automatic structures, two coalitions play against each other with a particular kind of hierarchical imperfect information. The investigation of such games leads to the introduction of a game quantifier on automatic structures, which connects alternating automata with the classical model-theoretic notion of a game quantifier. This study is then extended, determining the memory needed for strategies in infinitary games on the one hand, and characterizing regularity-preserving Lindström quantifiers on the other. Counting quantifiers are investigated in depth: it is shown that all countable omega-automatic structures are in fact finite-word automatic and that the infinity and uncountability set quantifiers are definable in MSO over countable linear orders and over labeled binary trees.This book is based on the PhD thesis of Lukasz Kaiser, which was awarded with the E.W. Beth award for outstanding dissertations in the fields of logic, language, and information in 2009. The work constitutes an innovative study in the area of algorithmic model theory, demonstrating the deep interplay between logic and computability in automatic structures. It displays very high technical and presentational quality and originality, advances significantly the field of algorithmic model theory and raises interesting new questions, thus emerging as a fruitful and inspiring source for future research.

Edited in collaboration with FoLLI, the Association of Logic, Language and Information, this book constitutes the refereed proceedings of the 8th International Tbilisi Symposium on Logic, Language, and Computation, TbiLLC 2009, held in Bakuriani, Georgia, in September 2009. The 20 revised full papers included in the book were carefully reviewed and selected from numerous presentations given at the symposium. The focus of the papers is on the following topics: natural language syntax, semantics, and pragmatics; constructive, modal and algebraic logic; linguistic typology and semantic universals; logics for artificial intelligence; information retrieval, query answer systems; logic, games, and formal pragmatics; language evolution and learnability; computational social choice; historical linguistics, history of logic.

This book contains selected papers from the Colloquium in Honor of Alain Lecomte, held in Pauillac, France, in November 2007. The event was part of the ANR project "Prélude" (Towards Theoretical Pragmatics Based on Ludics and Continuation Theory), the proceedings of which were published in another FoLLI-LNAI volume (LNAI 6505) edited by Alain Lecomte and Samuel Tronçon. The selected papers of this Festschrift volume focus on the scientific areas in which Alain Lecomte has worked and to which he has contributed: formal linguistics, computational linguistics, logic, and cognition.

This book constitutes the proceedings of the 8th International Conference on Modeling Decisions for Artificial Intelligence, MDAI 2011, held in Changsha, China, in July 2011.The 25 papers presented were carefully reviewed and selected from 43 submissions. The volume also contains extended abstracts of the three invited papers. The topics covered are aggregation operators and decision making; clustering and similarity; computational intelligence; and data privacy.

This book constitutes the refereed proceedings of the 7th Conference on Computability in Europe, CiE 2011, held in Sofia, Bulgaria, in June/July 2011. The 22 revised papers presented together with 11 invited lectures were carefully reviewed and selected with an acceptance rate of under 40%.The papers cover the topics computability in analysis, algebra, and geometry; classical computability theory; natural computing; relations between the physical world and formal models of computability; theory of transfinite computations; and computational linguistics.

This Festschrift volume, published in honor of Michael Gelfond on the occasion of his 65th birthday, contains a collection of papers written by his closest friends and colleagues. Several of these papers were presented during the Symposium on Constructive Mathematics in Computer Science, held in Lexington, KY, USA on October 25-26, 2010. The 27 scientific papers included in the book focus on answer set programming. The papers are organized in sections named "Foundations: ASP and Theories of LP, KR, and NMR", "ASP and Dynamic Domains", and "ASP - Applications and Tools".

This book constitutes the refereed proceedings of the 17th European Conference on Machine Learning, ECML 2006, held, jointly with PKDD 2006. The book presents 46 revised full papers and 36 revised short papers together with abstracts of 5 invited talks, carefully reviewed and selected from 564 papers submitted. The papers present a wealth of new results in the area and address all current issues in machine learning.

Context is of crucial importance for research and applications in many disciplines, as evidenced by many workshops, symposia, seminars, and conferences on specific aspects of context. The International and Interdisciplinary Conference on Modeling and Using Context (CONTEXT), the oldest conference series focusing on context, provides a unique interdisciplinary emphasis, bringing together participants from a wide range of disciplines, including artificial intelligence, cognitive science, computer science, linguistics, organizational science, philosophy, psychology, ubiquitous computing, and application areas such as medicine and law, to discuss and report on context-related research and projects. Previous CONTEXT conferences were held in Rio de Janeiro, Brazil (1997), Trento, Italy (1999, LNCS 1688), Dundee, UK (2001, LNCS 2116), and Palo Alto, USA (2003, LNCS 2680). CONTEXT 2005 was held in Paris, France during July 5-8, 2005. There was a strong response to the CONTEXT 2005 Call for Papers, with 120 submissions received. A careful review process assessed all submissions, with each paper first reviewed by the international Program Committee, and then reviewer discussions were initiated as needed to assure that the final decisions carefully considered all aspects of each paper. Reviews of submissions by the Program Chairs were supervised independently and anonymously, to assure fair consideration of all work. Out of the 120 submissions, 23 were selected as full papers for oral presentation, and 20 were selected as full papers for poster presentation. These outstanding papers are presented in this proceedings.

This book constitutes the refereed proceedings of the 13th International Conference on Automated Deduction, CADE-13, held in July/August 1996 in New Brunswick, NJ, USA, as part of FLoC '96.The volume presents 46 revised regular papers selected from a total of 114 submissions in this category; also included are 15 selected system descriptions and abstracts of two invited talks. The CADE conferences are the major forum for the presentation of new results in all aspects of automated deduction. Therefore, the volume is a timely report on the state-of-the-art in the area.