Bücher veröffentlicht von College Publications

Classifying objects --- thus collecting them into classes --- is anoperation both fundamental and common in everyday life as well as inscientific endeavours. Logic, philosophy, mathematics and computerscience analyse this activity by means of such notions as `class',`set', and `type'. Furthermore, according to the so-called ``logical(or naive) conception of classes", these notions are related to thenotion `concept' in that classes are considered `extensions' ofconcepts. This relationship, however, is a delicate one --- as wehave learned from the paradoxes of class theory. The contributions tothis volume shed new light both on concepts and classes and theirdelicate relationship. New and original approaches to these issues(e.g., map theory, epsilon-sets, intensional type theory, AFA settheory) are presented and discussed in the broader context of theirapplication to problems from informatics and linguistics. The focus ison such matters as unrestrictive comprehension, extensionality, therelationship between the notions of concept, class and extension, andon unfounded (circular and infinitely descending) patterns ofelementhood. These and related problems have always played a role inthe development of set theory and have always delivered motivation forthe development of unorthodox views and theories. This is alsodemonstrated in this volume by contributions dealing with the historyof Zermelo's axiomatization of set theory and Ackermann's class theorywith unrestrictive comprehension, respectively.The contributions of this volume are based on the presentation at aWorkshop on ``Alternative Set Theories --- Alternatives to Set Theory"held at the University of Southern Denmark in 2006.

Ce livre est le premier volume d'un ouvrage, Logique Dialogique : une introduction, conçu selon deux parties autonomes sur la logique dialogique. Les deux volumes fournissent néanmoins, à un niveau technique et philosophique, une vue d'ensemble de l'approche dialogique de la logique. Constituant un support efficace et didactique pour apprendre les fondements et la pratique de la logique dialogique, elles s'adressent ainsi tant aux professeurs et enseignants pour la préparation de cours qu'aux étudiants qui veulent se former individuellement.Le premier volume, Méthode de Dialogique : Règles et Exercices, constitue la première introduction à la pratique de la dialogique et contient des commentaires précis sur la solution d'exercices divers de logique classique de premier ordre, de logique intuitionniste et de logique modale propositionnelle. Le présent volume est lui-même écrit en deux parties. La première étant écrite pour le lecteur non spécialisé envisage, pour apprendre à jouer avec des dialogues, un point de vue analogue à la façon dont on apprend à jouer à des jeux conventionnels comme les échecs par exemple : on se familiarise avec les règles qui gouvernent les figures, les règles du développement du jeu et finalement les règles qui produisent les stratégies gagnantes.La deuxième partie contient une formulation plus précise de ce qui a été présenté et travaillé dans la première section. Elle se termine sur une justification de la correspondance entre la dialogique et le calcul des séquents.Le second volume présente un contenu plus avancé incluant la métathéorie correspondante.

This volume sheds new light on the multifarious personality of Bruno de Finetti and his outstanding contributions not only to probability and statistics, but also to economics and philosophy. Rather than focusing on de Finetti¿s technical work on probability, the essays collected here address the philosophy underpinning all of de Finetti¿s writings, a view Richard Jeffrey labelled ¿radical probabilism¿. Special attention is devoted to de Finetti¿s ideas on economics, which are inspired by the same philosophical approach, while an effort is made to highlight some lesser known aspects of de Finetti¿s production. The volume ends with an Appendix on de Finetti¿s book L¿invenzione della verità (The invention of truth), written in 1934 and published in 2006, which contains an extensive presentation of de Finetti¿s philosophical viewpoint, revolving around the idea that our knowledge is the product of human thought, which in such enterprise is guided by considerations of utility, rather than metaphysical principles.

This volume of the Texts in Algorithmics series is a collectionof work by the participants and friends of London StringologyDays (LSD) and London Algorithmic Workshop (LAW) 2008,sponsored by the Department of Computer Science, King's CollegeLondon. The form of this volume is that of a specialissue, focussing on core computer science theory along withbringing that theory into the real world of computing viapractical implementation. Contributed works research:structures in music and text, diffusion tensor imaging, compression, automata, stringology, nondeterminism, transposition networks, heuristics for NP-hard problems,and novel Crochemore Sets.We dedicate this volume to Maxime Crochemore on the occasion of his 60th birthday.

The book provides a self-contained introduction to mathematical logic and computability theory for students of mathematics or computer science. It is organized around the failures and successes of Hilbert's programme for the formalization of Mathematics. It is widely known that the programme failed with Gödel's incompleteness theorems and related negative results about arithmetic. Unfortunately, the positive outcomes of the programme are less well known, even among mathematicians. The book covers key successes, like Gödel's proof of the completeness of first-order logic, Gentzen's proof of its consistency by purely symbolic means, and the decidability of a couple of useful theories. The book also tries to convey the message that Hilbert's programme made a significant contribution to the advent of the computer as it is nowadays understood and, thus, to the latest industrial revolution.Part I of the book addresses Hilbert's programme and computability. Part II presents first-order logic, including Gödel's completeness theorem and Gentzen's consistency theorem. Part III is focused on arithmetic, representability of computable maps, Gödel's incompleteness theorems and decidability of Presburger arithmetic. Part IV provides detailed answers to selected exercises.The book can be used at late undergraduate level or early graduate level. An undergraduate course would concentrate on Parts I and II, leaving out the Gentzen calculus, and sketching the way to the 1st incompleteness theorem. A more advanced course might skip early material already known to the students and concentrate on the positive and negative results of Hilbert's programme, thus covering Gentzen's proof of consistency and Part III in full.

Reasoning in Simple Type Theory is a collection of papers thatincludes reprints of eight seminal papers in this area as well asthirteen new contributed articles. For the reprints we have chosen apaper by Alonzo Church (introducing his simple theory of types), apaper by Leon Henkin (proving completeness of Church's type theoryrelative to Henkin's semantics) and some of the most important papersby Peter Andrews. The new articles were contributed by Peter Andrewsand his students and collaborators as well as a number of researchershis work has influenced. The volume intends to show the historicaldevelopment of this important area of formal reasoning up to itscurrent state of art and appears in honor of Peter Andrews on his 70thbirthday.

Non-classical views about important issues in logic and its philosophy are a distinctive trait of Shahid Rahman's work. This volume has been designed, on the occasion of his 50th birthday, as a gathering place for unconventional approaches, original ideas and attempts to question well-established standards. Some of the world top philosophers and logicians contributed to a brilliant collection of papers, some of which doubtlessly leave their mark on the work to come in logic and in philosophy of formal sciences.Contributors are: Philippe Balbiani, Diderik Batens, Johan van Benthem, Giacomo Bonanno, Walter A. Carnielli, Newton C. A. Da Costa, Michel Crubellier, Francisco A. Doria, Dov M. Gabbay, Olivier Gasquet, Gerhard Heinzmann, Andreas Herzig, Jaakko Hintikka, Justine Jacot, Reinhard Kahle, Erik C. W. Krabbe, Décio Krause, Franck Lihoreau, Kuno Lorenz, Ilkka Niiniluoto, Graham Priest, Stephen Read, Manuel Rebuschi, Greg Restall, Gabriel Sandu, Gerhard Schurz, François Schwarzentruber, Yaroslav Shramko, Göran Sundholm, John Symons, Christian Thiel, Nicolas Troquard, Tero Tulenheimo, Jean Paul Van Bendegem, Daniel Vanderveken, Yde Venema, Heinrich Wansing, Jan Wolenski and John Woods.

Cet ouvrage collectif contient les Actes d'un colloque international bilingue enhommage à J.-Nicolas Kaufmann tenu à Trois-Rivières au Québec en octobre2002. L'ouvrage auquel ont contribué des philosophes célèbres présente etdiscute d'hypothèses, d'enjeux et de théories contemporaines majeures surl'action, les attitudes, la rationalité et la décision. On y traite de l'intentionnalité et de la rationalité des agents lors de leurs actions, délibérations et activités sociales, des contributions de la phénoménologie classique à la philosophie de l'esprit, de l'action et à l'ontologie, ainsi que de causalité mentale et de naturalisme.Here are the Proceedings of an international bilingual Conference held inhomage to J.-Nicolas Kaufmann at Trois-Rivières (Quebec) in October 2002.This volume to which contributed leading philosophers presents and discussescentral contemporary hypotheses, issues and theories on action, attitudes,rationality and decision. It deals with the intentionality and rationality of agents in their actions, deliberations and social activities, with contributions of classical phenomenology to philosophy of mind, action and ontology and withmental causation and naturalism.

Infinity can feature in games in various forms: we can play games of infinite length, with infinitely many players, or allow for infinitely many moves or strategies.Games of infinite length have been thoroughly investigated by mathematicians ard have played a central role in mathematical logic. However, their applications go far beyond mathematics: they feature prominently in theoretical computer science, philosophical "Gedankenxperiments", as limit cases in economical applications, and in many other applications. The conference "Foundations of the Formal Sciences V" focused on games of infinite length, but was very open to include other notions of infinity in games as well. It brought together researchers from the various areas that employ infinitary game techniques to talk about similarities and dissimilarities of the different approaches and develop cross-cultural bridges. This volume contains the fully refereed proceedings of the conference and provides a healthy and interesting mixture of research papers and surveys for a broad audience.

L'année 2008 est le centenaire de la naissance de cet immense philosophe qu'est W. van O. Quine. La meilleure manière de lui rendre hommage est certainement de prendre au sérieux sa doctrine et ses thèses, et de les discuter. Dans Lecture de Quine, F. Rivenc entreprend de relire l'ouvrage central de Quine, Word and Object. Chaque chapitre de cet ouvrage fait ainsi l'objet d'une présentation critique, distribuée en deux parties : une libre exposition de l'essentiel de son développement, une discussion de certains thèmes privilégiés pour leur importance ou leur fragilité. C'est un fait que la philosophie analytique des cinquante dernières années n'a pas toujours suivi le chemin de Quine, en particulier son « négativisme logique » : ce fait est à considérer sérieusement. Lecture de Quine ne prétend pas être une « somme » sur Quine, mais plutôt un appel à faire ouvre d'esprit critique.

Quantum Mechanics (QM) is emerging from physics into non-physics domains (domains traditionally found outside of physics) such as human language, cognition, information processing, AI, biology, political science, economics, organizations, and social interaction.The Second Quantum Interaction Symposium advances and applies the methods and structures of QM to these and other non-physics domains, specifically including:. The advancement of theory and experimentation for applying QM to non-physics domains (including a clarification of what QM means in non-physics domains). Applications of QM inspired methods to address, or to more efficiently solve, problems in non-physics domains (including contrasts between classical and quantum methods). Applications of QM methods on a quantum computer, such as implementation of AI, or Information Retrieval (IR) techniques . Use of QM to address previously unsolved problems in other fields

This book presents detailed criticisms of existing systems for organising research, and outlines a new approach based on different principles. Part 1 criticizes the research assessment exercise (RAE) which has been used in the UK from 1986 to 2008. It is argued that the RAE is both very costly, and likely to reduce the quality of research produced. The UK government has decided that, from 2009, the RAE should be replaced by a system based on metrics. In Part 2 this system is criticized and it is argued that it is certainly no better, and probably worse, than the RAE. In Part 3 of the book, the proposed alternative system is outlined, and it is argued that it would produce better quality research at a much lower cost than either the RAE or the system based on metrics. The arguments are illustrated by a variety of examples of excellent research, taken from different fields. These include Einstein's discovery of Special Relativity, Fleming's discovery of penicillin, Frege's introduction of modern mathematical logic, and Wittgenstein's work on his masterpiece: Philosophical Investigations. The Author: Donald Gillies is Professor in the Department of Science and Technology Studies, University College London.

Advances in Modal Logic is a unique international forum for presenting the latest results and new directions of research in Modal Logic broadly conceived. The topics dealt with are of interdisciplinary interest and range from mathematical, computational, and philosophical problems to applications in knowledge representation and formal linguistics. This volume contains invited and contributed papers from the seventh conference in the AiML series, held in Nancy, France, in September 2008. It reports on substantial advances, both in the foundations of modal logic and in a number of application areas. It includes papers on the metatheory of a variety of modal logics; on systems for spatial and temporal reasoning and interpreting natural language; on the emerging coalgebraic perspective; and on historical views of the nature of modality.

Algorithms are central to all areas of computer science, from compiler construction to numerical analysis to artificial intelligence. Throughout your academic and professional careers, you may be required to construct new algorithms, analyze existing algorithms, or modify algorithms to suit new purposes. How do we know that such algorithms are correct? One method involves making claims about how we expect our programs to operate, and then constructing code that carries out these tasks. The key component of such reasoning is the invariant, and is the topic of this book. In these pages, you will study how invariants are developed, how they are used to construct correct algorithms, and how they are helpful in analyzing existing programs. Along the way, you'll be introduced to some classic sorting, searching and mathematical algorithms, and even some solutions to games and logic puzzles. These examples, though, are only conduits for the loftier goal: understanding why algorithms work.

This monograph is an investigation into certain new logical structures implicit in the formalism of quantum mechanics.Its message rests on two pillars. The first pillar is the dynamic view of propositions. Propositions are viewed as acting on states of the world and changing them rather than just being true or false in them. The second pillar is a logical enquiry into the nature of the states of a dynamic framework in general and thus the nature of physical states in particular. It turns out that a physical state viewed as a logical entity must encode other states and also itself.The main logical structures under investigation are that of an M-algebra and that of a holistic logic. In a sense to be made precise the latter structures reflect the 'holistic' nature of quantum mechanics.

Prolog est un langage de programmation tout à fait original. «Prolog» est l'abréviation de «Programmation logique», et le lien qu'il entretient avec la logique est ce qui lui donne sa spécificité. Au coeur de Prolog, réside une idée surprenante : ne pas dire à l'ordinateur ce qu'il doit faire, mais lui décrire des situations, et lui faire faire des calculs en lui posant des questions. Prolog déduira alors logiquement de nouveaux faits concernant les situations, et donnera en réponse ses déductions.Pourquoi apprendre Prolog ? Tout d'abord, l'aspect «dis-moi quel est ton problème au lieu de me dire comment le résoudre» de son approche en fait un langage de très haut niveau, adapté aux applications riches en connaissances comme l'intelligence artificielle, la linguistique informatique, ou le web sémantique. En étudiant Prolog, on arrive à une meilleure compréhension de la façon dont des tâches sophistiquées peuvent être effectuées informatiquement. De plus, Prolog demande un état d'esprit différent : il nous apprend à penser déclarativement au lieu de procéduralement. Acquérir cette façon de réfléchir et apprendre à apprécier les liens entre la logique et la programmation font de l'apprentissage de Prolog à la fois un challenge et une récompense.Prolog tout de suite ! est une traduction de Learn Prolog Now!). Gratuitement accessible en ligne depuis 2001 (www.learnprolognow.org), le texte anglais est devenu l'une des introductions à la programmation en Prolog les plus populaires, grâce à sa clarté et son approche résolument concrète. Il est très largement utilisé comme manuel dans les universités du monde entier, et encore plus largement comme support d'auto-formation.College publications est fier de proposer la traduction française de ce classique du web. Préparée avec soin, et grâce aux remarques des lecteurs de la version anglaise, cette traduction ne présente que les implantations de Prolog compatibles avec la norme ISO. Elle présente aussi le système de modules de Prolog, et fournit toutes les réponses aux exercices. Que vous appreniez Prolog pour élargir votre compréhension de la logique et de l'informatique, ou pour vous ouvrir les portes de la riche littérature sur Prolog et le Traitement Automatique des Langues, vous trouverez certainement ici tout ce que vous souhaitiez pour apprendre Prolog... tout de suite !

Ilkka Niiniluoto, a distinguished philosopher of science, has been a tirelesspokesman for scientific realism and reason more generally. Trained in the tradition of the Finnish school of inductive logic he has refined the notion of truthlikeness (verisimilitude) to make the realist idea scientific progress mathematically exact. Niiniluotös main technical works are included in his books Is Science Progressive? (1984) and Truthlikeness (1987), but his most recent general defense of scientific realism culminated in his Critical Scientific Realism (1999). Niiniluoto is, since 1981, Professor of Theoretical Philosophy at the University of Helsinki, and since 2003 the Rector of the University. He has for a long time been one of the most prominent public intellectuals in Finland.This Festschrift brings about a selection of philosophical essays on Niiniluotös philosophy by prominent member of the international community. The contributions are grouped around three themes. The first ones deal with philosophy of logic, the philosophy of language, and the philosophy of mathematics, and the second group consists of papers on induction, truthlikeness, and scientific progress. The third part collects essays on the history of logical empiricism, the ontology of social groups, and the dispute between theism and atheism. This book is a tribute to Ilkka Niiniluoto on his 60th birthday, and it also contains Niiniluoto's replies to comments, queries and criticisms.

Logic for Artificial Intelligence and Information Technology is based on student notes used to teach logic to second year undergraduates and Artificial Intelligence to graduate students at the University of London since1984, first at Imperial College and later at King's College.Logic has been applied to a wide variety of subjects such as theoretical computer science, software engineering, hardware design, logic programming, computational linguistics and artificial intelligence. In this way it has served to stimulate the research for clear conceptual foundations.Over the past 20 years many extensions of classical logic such as temporal, modal, relevance, fuzzy, probabilistic and non-monotoinic logics have been widely used in computer science and artificial intelligence, therefore requiring new formulations of classical logic, which can be modified to yield the effect of the new applied logics.The text introduces classical logic in a goal directed way which can easily deviate into discussing other applied logics. It defines the many types of logics and differences between them.Dov Gabbay, FRSC, FAvH, FRSA, FBCS, is Augustus De Morgan Professor of Logic at the University of London. He has written over 300 papers in logic and over 20 books. He is Editor-in-Chief of several leading journals and has published over 50 handbooks of logic volumes. He is a world authority on applied logics and is one of the directors and founder of the UK charity the International Federation of Computational Logic

"There is a principle in things, about which we cannot be deceived, but must always, on the contrary, recognize the truth - viz. that the same thing cannot at one and the same time be and not be": with these words of the Metaphysics, Aristotle introduced the Law of Non-Contradiction, which was to become the most authoritative principle in the history of Western thought. However, things have recently changed, and nowadays various philosophers, called dialetheists, claim that this Law does not hold unrestrictedly - that in peculiar circumstances the same thing may at the same time be and not be, and contradictions may obtain in the world.This book opens with an examination of the famous logical paradoxes that appear to speak on behalf of contradictions (e.g., the Liar paradox, the set-theoretic paradoxes such as Cantor's and Russell's), and of the reasons for the failure of the standard attempts to solve them. It provides, then, an introduction to paraconsistent logics - non-classical logics in which the admission of contradictions does not lead to logical chaos -, and their astonishing applications, going from inconsistent data base management to contradictory arithmetics capable of circumventing Gödel's celebrated Incompleteness Theorem. The final part of the book discusses the philosophical motivations and difficulties of dialetheism, and shows how to extract from Aristotle's ancient words a possible reply to the dialetheic challenge.How to Sell a Contradiction will appeal to anyone interested in non-classical logics, analytic metaphysics, and philosophy of mathematics, and especially to those who consider challenging our most entrenched beliefs the main duty of philosophical inquiry. Francesco Berto is Lecturer in Logic and Metaphysics at the University of Venice, Italy. He has published articles in American Philosophical Quarterly, The Australasian Journal of Philosophy, Dialectica, Logique et Analyse, The European Journal of Philosophy, and the books La dialettica della struttura originaria [The Dialectics of the Basic Structure, Padua 2003], Che cos'è la dialettica hegeliana [What is Hegel's Dialectics?, Padua 2005], Teorie dell'assurdo [Theories of the Absurd, Rome 2006] and Logica da zero a Gödel [Logic, from Zero to Gödel, Rome 2007].

Many mathematical and computational concepts can be represented in a natural way using higher-order logic. Consequently, higher-order logic has become an important topic of research. /Automated Reasoning in Higher-Order Logic/ presents both a theoretical analysis of fragments of higher-order logic as well as a complete automated search procedure for an extensional form ofhigher-order logic.The first part of the book provides a detailed presentation of the theory (syntax and semantics) of fragments of higher-order logic. The fragments differ in the amount of extensionality and set comprehension principles included. Three families of sequent calculi are defined and proven sound and complete with respect to appropriate model classes. Using the model constructions in the book, different versions of Cantor's theorem are determined to not be provable in certain fragments. In fact, some versions of Cantor's theorem are independent of other versions (in sufficiently weak fragments).In the second part of the book, an automated proof procedure for extensional type theory is described. Proving completeness of such a higher-order search procedure is a nontrivial task. The book provides such a completeness proof by first proving completeness of the ground case and then proving appropriate lifting results./Automated Reasoning in Higher-Order Logic/ is an essential document for researchers in higher-order logic and higher-order theorem proving. The book is also essential reading for programmers implementing or extending higher-order search procedures. Users of higher-order theorem provers can use the book to improve their understanding of the underlying logical systems.