The first systematic exposition of all the central topics in the philosophy of logic, Susan Haack's book has established an international reputation for its accessibility, clarity, conciseness, orderliness, and range as well as for its thorough scholarship and careful analyses. Haack discusses the scope and purpose of logic, validity, truth-functions, quantification and ontology, names, descriptions, truth, truth-bearers, the set-theoretical and semantic paradoxes, and modality. She also explores the motivations for a whole range of non-classical systems of logic, including many-valued logics, (...) fuzzy logic, moddal and tense logics, and relevance logics. Persupposing only an elementary knowledge of formal logic, this book includes many useful summary tables and diagrams, as well as a helpful glossary of technical terms. Wide-ranging, informative, and eminently readable, this book has proven a valuable resource for generations of students and scholars in a variety of disciplines outside philosophy needing guidance on the philosophy of logic. (shrink)

In [14], we studied the computational behaviour of various first-order and modal languages interpreted in metric or weaker distance spaces. [13] gave an axiomatisation of an expressive and decidable metric logic. The main result of this paper is in showing that the technique of representing metric spaces by means of Kripke frames can be extended to cover the modal (hybrid) language that is expressively complete over metric spaces for the (undecidable) two-variable fragment of first-order logic with binary pred-icates interpreting the (...) metric. The frame conditions needed correspond rather directly with a Boolean modal logic that is, again, of the same expressivity as the two-variable fragment. We use this representation to derive an axiomatisation of the modal hybrid variant of the two-variable fragment, discuss the compactness property in distance logics, and derive some results on (the failure of) interpolation in distance logics of various expressive power. (shrink)

This volume is a self-contained introduction to interactive proof in high- order logic, using the proof assistant Isabelle 2002. Compared with existing Isabelle documentation, it provides a direct route into higher-order logic, which most people prefer these days. It bypasses?rst-order logic and minimizes discussion of meta-theory. It is written for potential users rather than for our colleagues in the research world. Another departure from previous documentation is that we describe Markus Wenzel’s proof script notation instead of ML tactic scripts. The (...) l- ter make it easier to introduce new tactics on the?y, but hardly anybody does that. Wenzel’s dedicated syntax is elegant, replacing for example eight simpli?cation tactics with a single method, namely simp, with associated - tions. The book has three parts. – The?rst part, Elementary Techniques, shows how to model functional programs in higher-order logic. Early examples involve lists and the natural numbers. Most proofs are two steps long, consisting of induction on a chosen variable followed by the auto tactic. But even this elementary part covers such advanced topics as nested and mutual recursion. – The second part, Logic and Sets, presents a collection of lower-level tactics that you can use to apply rules selectively. It also describes I- belle/HOL’s treatment of sets, functions, and relations and explains how to de?ne sets inductively. One of the examples concerns the theory of model checking, and another is drawn from a classic textbook on formal languages. (shrink)

This paper gives a general definition of a “kind of schema” along with general definitions for the schemas of a species, and for the databases, constraints, and queries over a given schema of a species. This leads naturally to a general theory of data translation and integration over arbitrary schemas of arbitrary species, based on schema morphisms, and to a similar general theory of ontology translation and integration over arbitrary logics. Institutions provide a general notion of logic, and Grothendieck flattening (...) provides a general tool for integrating heterogeneous schemas, species and logics, as well as theories, such as ontologies, over different logics. Many examples of our novel concepts are included, some rather detailed. An initial section introduces data integration and ontologies for readers who are not specialists, with some emphasis on challenges. A brief review of universal algebra is also given, though some familiarity with category theory is assumed in later sections. (shrink)

Current approaches to formal representation in biomedicine are characterized by their focus on either the static or the dynamic aspects of biological reality. We here outline a theory that combines both perspectives and at the same time tackles the by no means trivial issue of their coherent integration. Our position is that a good ontology must be capable of accounting for reality both synchronically (as it exists at a time) and diachronically (as it unfolds through time), but that these are (...) two quite different tasks, whose simultaneous realization is by no means trivial. The paper is structured as follows. We begin by laying out the methodological and philosophical background of our approach. We then summarize the structure and elements of the Basic Formal Ontology on which it rests, in particular the SNAP ontology of objects and the SPAN ontology of processes. Finally, we apply the general framework to the specific domain of biomedicine. (shrink)

In this paper, I distinguish different kinds of pluralism about logical consequence. In particular, I distinguish the pluralism about logic arising from Carnap’s Principle of Tolerance from a pluralism which maintains that there are different, equally “good” logical consequence relations on the one language. I will argue that this second form of pluralism does more justice to the contemporary state of logical theory and practice than does Carnap’s more moderate pluralism.

It seems to me that the ingredients of most theories both in Artificial Intelligence and in Psychology have been on the whole too minute, local, and unstructured to account–either practically or phenomenologically–for the effectiveness of common-sense thought. The "chunks" of reasoning, language, memory, and "perception" ought to be larger and more structured; their factual and procedural contents must be more intimately connected in order to explain the apparent power and speed of mental activities.

In this book Terence Parsons revives the older tradition of taking such objects at face value. Using various modern techniques from logic and the philosophy of language, he formulates a metaphysical theory of nonexistent objects. The theory is given a formalization in symbolism rich enough to contain definite descriptions, modal operators, and epistemic contexts, and the book includes a discussion which relates the formalized theory explicitly to English.

A Mathematical Introduction to Logic, Second Edition, offers increased flexibility with topic coverage, allowing for choice in how to utilize the textbook in a course. The author has made this edition more accessible to better meet the needs of today's undergraduate mathematics and philosophy students. It is intended for the reader who has not studied logic previously, but who has some experience in mathematical reasoning. Material is presented on computer science issues such as computational complexity and database queries, with additional (...) coverage of introductory material such as sets. Increased flexibility of the text, allowing instructors more choice in how they use the textbook in courses. Reduced mathematical rigour to fit the needs of undergraduate students. (shrink)

Initially proposed as rivals of classical logic, alternative logics have become increasingly important in areas such as computer science and artificial intelligence. Fuzzy logic, in particular, has motivated major technological developments in recent years. Susan Haack's Deviant Logic provided the first extended examination of the philosophical consequences of alternative logics. In this new volume, Haack includes the complete text of Deviant Logic , as well as five additional papers that expand and update it. Two of these essays critique fuzzy logic, (...) while three augment Deviant Logic 's treatment of deduction and logical truth. Haack also provides an extensive new foreword, brief introductions to the new essays, and an updated bibliography of recent work in these areas. Deviant Logic, Fuzzy Logic will be indispensable to students of philosophy, philosophy of science, linguistics, mathematics, and computer science, and will also prove invaluable to experienced scholars working in these fields. (shrink)

We are pluralists about logical consequence [1]. We hold that there is more than one sense in which arguments may be deductively valid, that these senses are equally good, and equally deserving of the name deductive validity. Our pluralism starts with our analysis of consequence. This analysis of consequence is not idiosyncratic. We agree with Richard Jeffrey, and with many other philosophers of logic about how logical consequence is to be defined. To quote Jeffrey.

We study logic translations from an abstract perspective, without any commitment to the structure of sentences and the nature of logical entailment, which also means that we cover both proof- theoretic and model-theoretic entailment. We show how logic translations induce notions of logical expressiveness, consistency strength and sublogic, leading to an explanation of paradoxes that have been described in the literature. Connectives and quantifiers, although not present in the definition of logic and logic translation, can be recovered by their abstract (...) properties and are preserved and reflected by translations under suitable conditions. (shrink)

“Flat pre-semantics” lets each parameter of truth (etc.) be considered sepa-rately and equally, and without worrying about grammatical complications. This allows one to become a little clearer on a variety of philosophical-logical points, such as the use fulness of Carnapian tolerance and the deep relativity of truth. A more definite result of thinking in terms of flat pre-semantics lies in the articulation of some instructive ways of categorizing operations on meanings in purely logical terms in relation to various parame- ters (...) of truth (etc.); namely, closing vs. leaving open, local vs. translocal, and anchored vs. unanchored. Basic relations among these categories are established. (shrink)

Spatial reasoning is essential for many AI applications. In most existing systems the representation is primarily numerical, so the information that can be handled is limited to precise quantitative data. However, for many purposes the ability to manipulate high-level qualitative spatial information in a flexible way would be extremely useful. Such capabilities can be proveded by logical calculi; and indeed 1st-order theories of certain spatial relations have been given [20]. But computing inferences in 1st-order logic is generally intractable unless special (...) methods are known.0-order modal logics provide an alternative representation which is more expressive than classical 0-order logic and yet often more amenable to automated deduction than 1st-order formalisms. These calculi are usually interpreted as propositional logics: non-logical constants are taken as denoting propositions. However, they can also be given a nominal interpretation in which the constants stand for some kind of object. I show how 0-order logics can be given a spatial interpretation: constants denote regions and logical operators correspond to operations on regions which are important for characterising spatial situations.Representing certain spatial concepts requires the introduction of modal operators, interpreted as functions generating regions related in specific ways to those denoted by their arguments. A significant example is the convex-hull operator whose value is the smallest convex region containing its argument. I investigate how this this operator can be captured in a multi-medal logic. (shrink)

ABSTRACT The paper studies propositional logics in a bimodal language, in which the first modality is interpreted as the local truth, and the second as the universal truth. The logic S4UC is introduced, which is finitely axiomatizable, has the f.m.p. and is determined by every connected separable metric space.

SYMBOLIC LOGIC. CHAPTER I. ON THE FORMS OF LOGICAL PROPOSITION. IT has been mentioned in the Introduction that the System of Logic which this work is ...

Many types of part-whole relations have been proposed in the literature to aid the conceptual modeller to choose the most appropriate type, but many of those relations lack a formal specification to give clear and unambiguous semantics to them. To remedy this, a formal taxonomy of types of mereological and meronymic part-whole relations is presented that distinguishes between transitive and intransitive relations and the kind of entity types that are related. The demand to use it effectively brings afore new requirements (...) for automated reasoning over a hierarchy of relations. To ensure logically and ontologically correct inferencing over both the class and role hierarchy, the new reasoning service RBox compatibility for Description Logics reasoners is introduced. The proposed combination of formal semantics and the new reasoning service will improve the representation of the application domain when using part-whole relations in conceptual models and ontologies. (shrink)

Where is logic heading today? There is a general feeling that the discipline is broadening its scope and agenda beyond classical foundational issues, and maybe even a concern that, like Stephen Leacock’s famous horseman, it is ‘riding off madly in all directions’. So, what is the resultant vector? There seem to be two broad answers in circulation today. One is logical pluralism, locating the new scope of logic in charting a wide variety of reasoning styles, often marked by non-classical structural (...) rules of inference. This is the new program that I subscribed to in my work on sub-structural logics around 1990, and it is a powerful movement today. But gradually, I have changed my mind about the crux of what logic should become. I would now say that the main issue is not variety of reasoning styles and notions of consequence, but the variety of informational tasks performed by intelligent interacting agents, of which inference is only one among many, involving observation, memory, questions and answers, dialogue, or general communication. And logical systems should deal with a wide variety of these, making information-carrying events first-class citizens in their set-up. The purpose of this brief paper is to contrast and compare the two approaches, drawing freely on some insights from earlier published papers. In particular, I will argue that logical dynamics sets itself the more ambitious diagnostic goal of explaining why substructural phenomena occur, by ‘deconstructing’ them into classical logic plus an explicit account of the relevant informational events. (shrink)

Modal logics, originally conceived in philosophy, have recently found many applications in computer science, artificial intelligence, the foundations of mathematics, linguistics and other disciplines. Celebrated for their good computational behaviour, modal logics are used as effective formalisms for talking about time, space, knowledge, beliefs, actions, obligations, provability, etc. However, the nice computational properties can drastically change if we combine some of these formalisms into a many-dimensional system, say, to reason about knowledge bases developing in time or moving objects. To study (...) the computational behaviour of many-dimensional modal logics is the main aim of this book. On the one hand, it is concerned with providing a solid mathematical foundation for this discipline, while on the other hand, it shows that many seemingly different applied many-dimensional systems (e.g., multi-agent systems, description logics with epistemic, temporal and dynamic operators, spatio-temporal logics, etc.) fit in perfectly with this theoretical framework, and so their computational behaviour can be analyzed using the developed machinery. We start with concrete examples of applied one- and many-dimensional modal logics such as temporal, epistemic, dynamic, description, spatial logics, and various combinations of these. Then we develop a mathematical theory for handling a spectrum of 'abstract' combinations of modal logics - fusions and products of modal logics, fragments of first-order modal and temporal logics - focusing on three major problems: decidability, axiomatizability, and computational complexity. Besides the standard methods of modal logic, the technical toolkit includes the method of quasimodels, mosaics, tilings, reductions to monadic second-order logic, algebraic logic techniques. Finally, we apply the developed machinery and obtained results to three case studies from the field of knowledge representation and reasoning: temporal epistemic logics for reasoning about multi-agent systems, modalized description logics for dynamic ontologies, and spatio-temporal logics. The genre of the book can be defined as a research monograph. It brings the reader to the front line of current research in the field by showing both recent achievements and directions of future investigations (in particular, multiple open problems). On the other hand, well-known results from modal and first-order logic are formulated without proofs and supplied with references to accessible sources. The intended audience of this book is logicians as well as those researchers who use logic in computer science and artificial intelligence. More specific application areas are, e.g., knowledge representation and reasoning, in particular, terminological, temporal and spatial reasoning, or reasoning about agents. And we also believe that researchers from certain other disciplines, say, temporal and spatial databases or geographical information systems, will benefit from this book as well. Key Features: Integrated approach to modern modal and temporal logics and their applications in artificial intelligence and computer science Written by internationally leading researchers in the field of pure and applied logic Combines mathematical theory of modal logic and applications in artificial intelligence and computer science Numerous open problems for further research Well illustrated with pictures and tables. (shrink)

This book develops model theory independently of any concrete logical system or structure, within the abstract category-theoretic framework of the so called ‘institution theory’. The development includes most of the important methods and concepts of conventional concrete model theory at the abstract institution-independent level. Consequently it is easily applicable to a rather large diverse collection of logics from the mathematical and computer science practice.

Johan van Benthem compares and contrasts two research programmes, which he calls logical pluralism and logical dynamics, stating his ‘preference’ for the second of these ‘alternatives’. In this note I want to put the matter into a slightly different perspective.

Over the last twenty years, in all of these neighbouring fields, modal systems have been developed that we call multi-dimensional. (Our definition of multi ...

General Ontological Language (GOL) is a formal framework for representing and building ontologies. The purpose of GOL is to provide a system of top-level ontologies which can be used as a basis for building domain-specific ontologies. The present paper gives an overview about the basic categories of the GOL-ontology. GOL is part of the work of the research group Ontologies in Medicine (Onto-Med) at the University of Leipzig which is based on the collaborative work of the Institute of Medical Informatics (...) (IMISE) and the Institute for Computer Science (IfI). It represents work in progress toward a proposal for an integrated family of top-level ontologies and will be applied to several fields of medicine, in particular to the field of Clinical Trials. (shrink)

Basically, the connection of two many-sorted theories is obtained by taking their disjoint union, and then connecting the two parts through connection functions that must behave like homomorphisms on the shared signature. We determine conditions under which decidability of the validity of universal formulae in the component theories transfers to their connection. In addition, we consider variants of the basic connection scheme. Our results can be seen as a generalization of the so-called E-connection approach for combining modal logics to an (...) algebraic setting. (shrink)

We propose and investigate a uniform modal logic framework for reasoning about topology and relative distance in metric and more general distance spaces, thus enabling the comparison and combination of logics from distinct research traditions such as Tarski’s for topological closure and interior, conditional logics, and logics of comparative similarity. This framework is obtained by decomposing the underlying modal-like operators into first-order quantifier patterns. We then show that quite a powerful and natural fragment of the resulting first-order logic can be (...) captured by one binary operator comparing distances between sets and one unary operator distinguishing between realised and limit distances . Due to its greater expressive power, this logic turns out to behave quite differently from both and conditional logics. We provide finite axiomatisations and ExpTime-completeness proofs for the logics of various classes of distance spaces, in particular metric spaces. But we also show that the logic of the real line is not recursively enumerable. This result is proved by an encoding of Diophantine equations. (shrink)