- Table View
- List View
Logical Foundations of Computer Science: International Symposium, LFCS 2020, Deerfield Beach, FL, USA, January 4–7, 2020, Proceedings (Lecture Notes in Computer Science #11972)
by Sergei Artemov Anil NerodeThis book constitutes the refereed proceedings of the International Symposium on Logical Foundations of Computer Science, LFCS 2020, held in Deerfield Beach, FL, USA, in January 2020. The 17 revised full papers were carefully reviewed and selected from 30 submissions. The scope of the Symposium is broad and includes constructive mathematics and type theory; homotopy type theory; logic, automata, and automatic structures; computability and randomness; logical foundations of programming; logical aspects of computational complexity; parameterized complexity; logic programming and constraints; automated deduction and interactive theorem proving; logical methods in protocol and program verification; logical methods in program specification and extraction; domain theory logics; logical foundations of database theory; equational logic and term rewriting; lambda and combinatory calculi; categorical logic and topological semantics; linear logic; epistemic and temporal logics; intelligent and multiple-agent system logics; logics of proof and justification; non-monotonic reasoning; logic in game theory and social software; logic of hybrid systems; distributed system logics; mathematical fuzzy logic; system design logics; other logics in computer science.
Logical Foundations of Computer Science: International Symposium, LFCS 2022, Deerfield Beach, FL, USA, January 10–13, 2022, Proceedings (Lecture Notes in Computer Science #13137)
by Sergei Artemov Anil NerodeThis book constitutes the refereed proceedings of the International Symposium on Logical Foundations of Computer Science, LFCS 2022, held in Deerfield Beach, FL, USA, in January 2022. The 23 revised full papers were carefully reviewed and selected from 35 submissions. The scope of the Symposium is broad and includes constructive mathematics and type theory; homotopy type theory; logic, automata, and automatic structures; computability and randomness; logical foundations of programming; logical aspects of computational complexity; parameterized complexity; logic programming and constraints; automated deduction and interactive theorem proving; logical methods in protocol and program verification; logical methods in program specification and extraction; domain theory logics; logical foundations of database theory; equational logic and term rewriting; lambda and combinatory calculi; categorical logic and topological semantics; linear logic; epistemic and temporal logics; intelligent and multiple-agent system logics; logics of proof and justification; non-monotonic reasoning; logic in game theory and social software; logic of hybrid systems; distributed system logics; mathematical fuzzy logic; system design logics; other logics in computer science.
Logical Foundations of Computer Science: International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3-6, 2009, Proceedings (Lecture Notes in Computer Science #5407)
by Sergei Artemov Anil NerodeThis book constitutes the refereed proceedings of the International Symposium on Logical Foundations of Computer Science, LFCS 2009, held in Deerfield Beach, Florida, USA in January 2008. The volume presents 31 revised refereed papers carefully selected by the program committee. All current aspects of logic in computer science are addressed, including constructive mathematics and type theory, logical foundations of programming, logical aspects of computational complexity, logic programming and constraints, automated deduction and interactive theorem proving, logical methods in protocol and program verification and in program specification and extraction, domain theory logics, logical foundations of database theory, equational logic and term rewriting, lambda and combinatory calculi, categorical logic and topological semantics, linear logic, epistemic and temporal logics, intelligent and multiple agent system logics, logics of proof and justification, nonmonotonic reasoning, logic in game theory and social software, logic of hybrid systems, distributed system logics, system design logics, as well as other logics in computer science.
Logical Foundations of Computer Science: International Symposium, LFCS 2007, New York, NY, USA, June 4-7, 2007, Proceedings (Lecture Notes in Computer Science #4514)
by Sergei Artemov Anil NerodeThis book constitutes the refereed proceedings of the International Symposium on Logical Foundations of Computer Science, LFCS 2007, held in New York, NY, USA in June 2007. The volume presents 36 revised refereed papers that address all current aspects of logic in computer science.
Logical Foundations of Computer Science: International Symposium, LFCS 2013, San Diego, CA, USA, January 6-8, 2013. Proceedings (Lecture Notes in Computer Science #7734)
by Sergei Artemov Anil NerodeThis book constitutes the refereed proceedings of the International Symposium on Logical Foundations of Computer Science, LFCS 2013, held in San Diego, CA, USA in January 2013. The volume presents 29 revised refereed papers carefully selected by the program committee. The scope of the Symposium is broad and includes constructive mathematics and type theory; logic, automata and automatic structures; computability and randomness; logical foundations of programming; logical aspects of computational complexity; logic programming and constraints; automated deduction and interactive theorem proving; logical methods in protocol and program verification; logical methods in program specification and extraction; domain theory logic; logical foundations of database theory; equational logic and term rewriting; lambda and combinatory calculi; categorical logic and topological semantics; linear logic; epistemic and temporal logics; intelligent and multiple agent system logics; logics of proof and justification; nonmonotonic reasoning; logic in game theory and social software; logic of hybrid systems; distributed system logics; mathematical fuzzy logic; system design logics; and other logics in computer science.
Logical Foundations of Cyber-Physical Systems
by André PlatzerCyber-physical systems (CPSs) combine cyber capabilities, such as computation or communication, with physical capabilities, such as motion or other physical processes. Cars, aircraft, and robots are prime examples, because they move physically in space in a way that is determined by discrete computerized control algorithms. Designing these algorithms is challenging due to their tight coupling with physical behavior, while it is vital that these algorithms be correct because we rely on them for safety-critical tasks. This textbook teaches undergraduate students the core principles behind CPSs. It shows them how to develop models and controls; identify safety specifications and critical properties; reason rigorously about CPS models; leverage multi-dynamical systems compositionality to tame CPS complexity; identify required control constraints; verify CPS models of appropriate scale in logic; and develop an intuition for operational effects. The book is supported with homework exercises, lecture videos, and slides.
The Logical Foundations of Mathematics: Foundations and Philosophy of Science and Technology Series
by William S. HatcherThe Logical Foundations of Mathematics offers a study of the foundations of mathematics, stressing comparisons between and critical analyses of the major non-constructive foundational systems. The position of constructivism within the spectrum of foundational philosophies is discussed, along with the exact relationship between topos theory and set theory.Comprised of eight chapters, this book begins with an introduction to first-order logic. In particular, two complete systems of axioms and rules for the first-order predicate calculus are given, one for efficiency in proving metatheorems, and the other, in a "natural deduction" style, for presenting detailed formal proofs. A somewhat novel feature of this framework is a full semantic and syntactic treatment of variable-binding term operators as primitive symbols of logic. Subsequent chapters focus on the origin of modern foundational studies; Gottlob Frege's formal system intended to serve as a foundation for mathematics and its paradoxes; the theory of types; and the Zermelo-Fraenkel set theory. David Hilbert's program and Kurt Gödel's incompleteness theorems are also examined, along with the foundational systems of W. V. Quine and the relevance of categorical algebra for foundations.This monograph will be of interest to students, teachers, practitioners, and researchers in mathematics.
Logical Foundations of Mathematics and Computational Complexity: A Gentle Introduction (Springer Monographs in Mathematics)
by Pavel PudlákThe two main themes of this book, logic and complexity, are both essential for understanding the main problems about the foundations of mathematics. Logical Foundations of Mathematics and Computational Complexity covers a broad spectrum of results in logic and set theory that are relevant to the foundations, as well as the results in computational complexity and the interdisciplinary area of proof complexity. The author presents his ideas on how these areas are connected, what are the most fundamental problems and how they should be approached. In particular, he argues that complexity is as important for foundations as are the more traditional concepts of computability and provability.Emphasis is on explaining the essence of concepts and the ideas of proofs, rather than presenting precise formal statements and full proofs. Each section starts with concepts and results easily explained, and gradually proceeds to more difficult ones. The notes after each section present some formal definitions, theorems and proofs.Logical Foundations of Mathematics and Computational Complexity is aimed at graduate students of all fields of mathematics who are interested in logic, complexity and foundations. It will also be of interest for both physicists and philosophers who are curious to learn the basics of logic and complexity theory.
The Logical Foundations of Scientific Theories: Languages, Structures, and Models (Routledge Studies in the Philosophy of Mathematics and Physics)
by Decio Krause Jonas R.B. ArenhartThis book addresses the logical aspects of the foundations of scientific theories. Even though the relevance of formal methods in the study of scientific theories is now widely recognized and regaining prominence, the issues covered here are still not generally discussed in philosophy of science. The authors focus mainly on the role played by the underlying formal apparatuses employed in the construction of the models of scientific theories, relating the discussion with the so-called semantic approach to scientific theories. The book describes the role played by this metamathematical framework in three main aspects: considerations of formal languages employed to axiomatize scientific theories, the role of the axiomatic method itself, and the way set-theoretical structures, which play the role of the models of theories, are developed. The authors also discuss the differences and philosophical relevance of the two basic ways of aximoatizing a scientific theory, namely Patrick Suppes’ set theoretical predicates and the "da Costa and Chuaqui" approach. This book engages with important discussions of the nature of scientific theories and will be a useful resource for researchers and upper-level students working in philosophy of science.
The Logical Foundations of Scientific Theories: Languages, Structures, and Models (Routledge Studies in the Philosophy of Mathematics and Physics)
by Decio Krause Jonas R.B. ArenhartThis book addresses the logical aspects of the foundations of scientific theories. Even though the relevance of formal methods in the study of scientific theories is now widely recognized and regaining prominence, the issues covered here are still not generally discussed in philosophy of science. The authors focus mainly on the role played by the underlying formal apparatuses employed in the construction of the models of scientific theories, relating the discussion with the so-called semantic approach to scientific theories. The book describes the role played by this metamathematical framework in three main aspects: considerations of formal languages employed to axiomatize scientific theories, the role of the axiomatic method itself, and the way set-theoretical structures, which play the role of the models of theories, are developed. The authors also discuss the differences and philosophical relevance of the two basic ways of aximoatizing a scientific theory, namely Patrick Suppes’ set theoretical predicates and the "da Costa and Chuaqui" approach. This book engages with important discussions of the nature of scientific theories and will be a useful resource for researchers and upper-level students working in philosophy of science.
LOGICAL INTRO TO PROBABIL & INDUCTION C
by Franz HuberA Logical Introduction to Probability and Induction is a textbook on the mathematics of the probability calculus and its applications in philosophy. On the mathematical side, the textbook introduces these parts of logic and set theory that are needed for a precise formulation of the probability calculus. On the philosophical side, the main focus is on the problem of induction and its reception in epistemology and the philosophy of science. Particular emphasis is placed on the means-end approach to the justification of inductive inference rules. In addition, the book discusses the major interpretations of probability. These are philosophical accounts of the nature of probability that interpret the mathematical structure of the probability calculus. Besides the classical and logical interpretation, they include the interpretation of probability as chance, degree of belief, and relative frequency. The Bayesian interpretation of probability as degree of belief locates probability in a subject's mind. It raises the question why her degrees of belief ought to obey the probability calculus. In contrast to this, chance and relative frequency belong to the external world. While chance is postulated by theory, relative frequencies can be observed empirically. A Logical Introduction to Probability and Induction aims to equip students with the ability to successfully carry out arguments. It begins with elementary deductive logic and uses it as basis for the material on probability and induction. Throughout the textbook results are carefully proved using the inference rules introduced at the beginning, and students are asked to solve problems in the form of 50 exercises. An instructor's manual contains the solutions to these exercises as well as suggested exam questions. The book does not presuppose any background in mathematics, although sections 10.3-10.9 on statistics are technically sophisticated and optional. The textbook is suitable for lower level undergraduate courses in philosophy and logic.
A Logical Introduction to Probability and Induction
by Franz HuberA Logical Introduction to Probability and Induction is a textbook on the mathematics of the probability calculus and its applications in philosophy. On the mathematical side, the textbook introduces these parts of logic and set theory that are needed for a precise formulation of the probability calculus. On the philosophical side, the main focus is on the problem of induction and its reception in epistemology and the philosophy of science. Particular emphasis is placed on the means-end approach to the justification of inductive inference rules. In addition, the book discusses the major interpretations of probability. These are philosophical accounts of the nature of probability that interpret the mathematical structure of the probability calculus. Besides the classical and logical interpretation, they include the interpretation of probability as chance, degree of belief, and relative frequency. The Bayesian interpretation of probability as degree of belief locates probability in a subject's mind. It raises the question why her degrees of belief ought to obey the probability calculus. In contrast to this, chance and relative frequency belong to the external world. While chance is postulated by theory, relative frequencies can be observed empirically. A Logical Introduction to Probability and Induction aims to equip students with the ability to successfully carry out arguments. It begins with elementary deductive logic and uses it as basis for the material on probability and induction. Throughout the textbook results are carefully proved using the inference rules introduced at the beginning, and students are asked to solve problems in the form of 50 exercises. An instructor's manual contains the solutions to these exercises as well as suggested exam questions. The book does not presuppose any background in mathematics, although sections 10.3-10.9 on statistics are technically sophisticated and optional. The textbook is suitable for lower level undergraduate courses in philosophy and logic.
A Logical Introduction to Proof
by Daniel W. CunninghamThe book is intended for students who want to learn how to prove theorems and be better prepared for the rigors required in more advance mathematics. One of the key components in this textbook is the development of a methodology to lay bare the structure underpinning the construction of a proof, much as diagramming a sentence lays bare its grammatical structure. Diagramming a proof is a way of presenting the relationships between the various parts of a proof. A proof diagram provides a tool for showing students how to write correct mathematical proofs.
The Logical Legacy of Nikolai Vasiliev and Modern Logic (Synthese Library #387)
by Vladimir Markin Dmitry ZaitsevThis volume offers a wide range of both reconstructions of Nikolai Vasiliev’s original logical ideas and their implementations in the modern logic and philosophy. A collection of works put together through the international workshop "Nikolai Vasiliev’s Logical Legacy and the Modern Logic," this book also covers foundations of logic in the light of Vasiliev’s contradictory ontology. Chapters range from a look at the Heuristic and Conceptual Background of Vasiliev's Imaginary Logic to Generalized Vasiliev-style Propositions. It includes works which cover Imaginary and Non-Aristotelian Logics, Inconsistent Set Theory and the Expansion of Mathematical Thinking, Plurivalent Logic, and the Impact of Vasiliev's Imaginary Logic on Epistemic Logic. The Russian logician, Vasiliev, was widely recognized as one of the forerunners of modern non-classical logic. His "imaginary logic" developed in some of his work at the beginning of 20th century is often considered to be one of the first systems of paraconsistent and multi-valued logic. The novelty of his logical project has opened up prospects for modern logic as well as for non-classical science in general. This volume contains a selection of papers written by modern specialists in the field and deals with various aspects of Vasiliev's logical ideas. The logical legacy of Nikolai Vasiliev can serve as a promising source for developing an impressive range of philosophical interpretations, as it marries promising technical innovations with challenging philosophical insights.
Logical Methods: The Art of Thinking Abstractly and Mathematically
by Roger AntonsenMany believe mathematics is only about calculations, formulas, numbers, and strange letters. But mathematics is much more than just crunching numbers or manipulating symbols. Mathematics is about discovering patterns, uncovering hidden structures, finding counterexamples, and thinking logically. Mathematics is a way of thinking. It is an activity that is both highly creative and challenging. This book offers an introduction to mathematical reasoning for beginning university or college students, providing a solid foundation for further study in mathematics, computer science, and related disciplines. Written in a manner that directly conveys the sense of excitement and discovery at the heart of doing science, its 25 short and visually appealing chapters cover the basics of set theory, logic, proof methods, combinatorics, graph theory, and much more. In the book you will, among other things, find answers to:What is a proof? What is a counterexample?What does it mean to say that something follows logically from a set of premises?What does it mean to abstract over something?How can knowledge and information be represented and used in calculations?What is the connection between Morse code and Fibonacci numbers?Why could it take billions of years to solve Hanoi's Tower? Logical Methods is especially appropriate for students encountering such concepts for the very first time. Designed to ease the transition to a university or college level study of mathematics or computer science, it also provides an accessible and fascinating gateway to logical thinking for students of all disciplines.
Logical Methods: In Honor of Anil Nerode’s Sixtieth Birthday (Progress in Computer Science and Applied Logic #12)
by John N. Crossley Jeffrey B. Remmel Richard Shore Moss E. SweedlerThe twenty-six papers in this volume reflect the wide and still expanding range of Anil Nerode's work. A conference on Logical Methods was held in honor of Nerode's sixtieth birthday (4 June 1992) at the Mathematical Sciences Institute, Cornell University, 1-3 June 1992. Some of the conference papers are here, but others are from students, co-workers and other colleagues. The intention of the conference was to look forward, and to see the directions currently being pursued, in the development of work by, or with, Nerode. Here is a brief summary of the contents of this book. We give a retrospective view of Nerode's work. A number of specific areas are readily discerned: recursive equivalence types, recursive algebra and model theory, the theory of Turing degrees and r.e. sets, polynomial-time computability and computer science. Nerode began with automata theory and has also taken a keen interest in the history of mathematics. All these areas are represented. The one area missing is Nerode's applied mathematical work relating to the environment. Kozen's paper builds on Nerode's early work on automata. Recursive equivalence types are covered by Dekker and Barback, the latter using directly a fundamental metatheorem of Nerode. Recursive algebra is treated by Ge & Richards (group representations). Recursive model theory is the subject of papers by Hird, Moses, and Khoussainov & Dadajanov, while a combinatorial problem in recursive model theory is discussed in Cherlin & Martin's paper. Cenzer presents a paper on recursive dynamics.
Logical Number Theory I: An Introduction (Universitext)
by Craig SmorynskiNumber theory as studied by the logician is the subject matter of the book. This first volume can stand on its own as a somewhat unorthodox introduction to mathematical logic for undergraduates, dealing with the usual introductory material: recursion theory, first-order logic, completeness, incompleteness, and undecidability. In addition, its second chapter contains the most complete logical discussion of Diophantine Decision Problems available anywhere, taking the reader right up to the frontiers of research (yet remaining accessible to the undergraduate). The first and third chapters also offer greater depth and breadth in logico-arithmetical matters than can be found in existing logic texts. Each chapter contains numerous exercises, historical and other comments aimed at developing the student's perspective on the subject, and a partially annotated bibliography.
Logical Skills: Social-Historical Perspectives (Studies in Universal Logic)
by Julie Brumberg-Chaumont Claude RosentalThis contributed volume explores the ways logical skills have been perceived over the course of history. The authors approach the topic from the lenses of philosophy, anthropology, sociology, and history to examine two opposing perceptions of logic: the first as an innate human ability and the second as a skill that can be learned and mastered. Chapters focus on the social and political dynamics of the use of logic throughout history, utilizing case studies and critical analyses.Specific topics covered include:the rise of logical skillsproblems concerning medieval notions of idiocy and rationalitydecolonizing natural logicnatural logic and the course of timeLogical Skills: Social-Historical Perspectives will appeal to undergraduate and graduate students, as well as researchers in the fields of history, sociology, philosophy, and logic. Psychology and colonial studies scholars will also find this volume to be of particular interest.
The Logical Structure of Mathematical Physics
by Joseph D. SneedThis book is about scientific theories of a particular kind - theories of mathematical physics. Examples of such theories are classical and relativis tic particle mechanics, classical electrodynamics, classical thermodynamics, statistical mechanics, hydrodynamics, and quantum mechanics. Roughly, these are theories in which a certain mathematical structure is employed to make statements about some fragment of the world. Most of the book is simply an elaboration of this rough characterization of theories of mathematical physics. It is argued that each theory of mathematical physics has associated with it a certain characteristic mathematical struc ture. This structure may be used in a variety of ways to make empirical claims about putative applications of the theory. Typically - though not necessarily - the way this structure is used in making such claims requires that certain elements in the structure play essentially different roles. Some playa "theoretical" role; others playa "non-theoretical" role. For example, in classical particle mechanics, mass and force playa theoretical role while position plays a non-theoretical role. Some attention is given to showing how this distinction can be drawn and describing precisely the way in which the theoretical and non-theoretical elements function in the claims of the theory. An attempt is made to say, rather precisely, what a theory of mathematical physics is and how you tell one such theory from anothe- what the identity conditions for these theories are.
Logical Structures for Representation of Knowledge and Uncertainty (Studies in Fuzziness and Soft Computing #14)
by Ellen HisdalIt is the business of science not to create laws, but to discover them. We do not originate the constitution of our own minds, greatly as it may be in our power to modify their character. And as the laws of the human intellect do not depend upon our will, so the forms of science, of (1. 1) which they constitute the basis, are in all essential regards independent of individual choice. George Boole [10, p. llJ 1. 1 Comparison with Traditional Logic The logic of this book is a probability logic built on top of a yes-no or 2-valued logic. It is divided into two parts, part I: BP Logic, and part II: M Logic. 'BP' stands for 'Bayes Postulate'. This postulate says that in the absence of knowl edge concerning a probability distribution over a universe or space one should assume 1 a uniform distribution. 2 The M logic of part II does not make use of Bayes postulate or of any other postulates or axioms. It relies exclusively on purely deductive reasoning following from the definition of probabilities. The M logic goes an important step further than the BP logic in that it can distinguish between certain types of information supply sentences which have the same representation in the BP logic as well as in traditional first order logic, although they clearly have different meanings (see example 6. 1. 2; also comments to the Paris-Rome problem of eqs. (1. 8), (1. 9) below).
Logical Studies of Paraconsistent Reasoning in Science and Mathematics (Trends in Logic #45)
by Holger Andreas Peter VerdéeThis book covers work written by leading scholars from different schools within the research area of paraconsistency. The authors critically investigate how contemporary paraconsistent logics can be used to better understand human reasoning in science and mathematics. Offering a variety of perspectives, they shed a new light on the question of whether paraconsistent logics can function as the underlying logics of inconsistent but useful scientific and mathematical theories. The great variety of paraconsistent logics gives rise to various, interrelated questions, such as what are the desiderata a paraconsistent logic should satisfy, is there prospect of a universal approach to paraconsistent reasoning with axiomatic theories, and to what extent is reasoning about sets structurally analogous to reasoning about truth. Furthermore, the authors consider paraconsistent logic’s status as either a normative or descriptive discipline (or one which falls in between) and which inconsistent but non-trivial axiomatic theories are well understood by which types of paraconsistent approaches. This volume addresses such questions from different perspectives in order to (i) obtain a representative overview of the state of the art in the philosophical debate on paraconsistency, (ii) come up with fresh ideas for the future of paraconsistency, and most importantly (iii) provide paraconsistent logic with a stronger philosophical foundation, taking into account the developments within the different schools of paraconsistency.
The Logical Syntax of Greek Mathematics (Sources and Studies in the History of Mathematics and Physical Sciences)
by Fabio AcerbiThe aim of this monograph is to describe Greek mathematics as a literary product, studying its style from a logico-syntactic point of view and setting parallels with logical and grammatical doctrines developed in antiquity. In this way, major philosophical themes such as the expression of mathematical generality and the selection of criteria of validity for arguments can be treated without anachronism. Thus, the book is of interest for both historians of ancient philosophy and specialists in Ancient Greek, in addition to historians of mathematics.This volume is divided into five parts, ordered in decreasing size of the linguistic units involved. The first part describes the three stylistic codes of Greek mathematics; the second expounds in detail the mechanism of "validation"; the third deals with the status of mathematical objects and the problem of mathematical generality; the fourth analyzes the main features of the "deductive machine," i.e. the suprasentential logical system dictated by the traditional division of a mathematical proposition into enunciation, setting-out, construction, and proof; and the fifth deals with the sentential logical system of a mathematical proposition, with special emphasis on quantification, modalities, and connectors. A number of complementary appendices are included as well.
A Logical Theory of Nonmonotonic Inference and Belief Change (Artificial Intelligence)
by Alexander BochmanThis is the first book that integrates nonmonotonic reasoning and belief change into a single framework from an artificial intelligence logic point-of-view. The approach to both these subjects is based on a powerful notion of an epistemic state that subsumes both existing models for nonmonotonic inference and current models for belief change. Many results and constructions in the book are completely new and have not appeared earlier in the literature.
Logical Thinking in the Pyramidal Schema of Concepts: The Logical and Mathematical Elements
by Lutz Geldsetzer Richard L. SchwartzThis new volume on logic follows a recognizable format that deals in turn with the topics of mathematical logic, moving from concepts, via definitions and inferences, to theories and axioms. However, this fresh work offers a key innovation in its ‘pyramidal’ graph system for the logical formalization of all these items. The author has developed this new methodology on the basis of original research, traditional logical instruments such as Porphyrian trees, and modern concepts of classification, in which pyramids are the central organizing concept. The pyramidal schema enables both the content of concepts and the relations between the concept positions in the pyramid to be read off from the graph. Logical connectors are analyzed in terms of the direction in which they connect within the pyramid. Additionally, the author shows that logical connectors are of fundamentally different types: only one sort generates propositions with truth values, while the other yields conceptual expressions or complex concepts. On this basis, strong arguments are developed against adopting the non-discriminating connector definitions implicit in Wittgensteinian truth-value tables. Special consideration is given to mathematical connectors so as to illuminate the formation of concepts in the natural sciences. To show what the pyramidal method can contribute to science, a pyramid of the number concepts prevalent in mathematics is constructed. The book also counters the logical dogma of ‘false’ contradictory propositions and sheds new light on the logical characteristics of probable propositions, as well as on syllogistic and other inferences.
Logical Tools for Handling Change in Agent-Based Systems (Cognitive Technologies)
by Dov M. Gabbay Karl SchlechtaAgents act on the basis of their beliefs and these beliefs change as they interact with other agents. In this book the authors propose and explain general logical tools for handling change. These tools include preferential reasoning, theory revision, and reasoning in inheritance systems, and the authors use these tools to examine nonmonotonic logic, deontic logic, counterfactuals, modal logic, intuitionistic logic, and temporal logic. This book will be of benefit to researchers engaged with artificial intelligence, and in particular agents, multiagent systems and nonmonotonic logic.