The IOth International Congress of Logic, Methodology and Philosophy of Science, which took place in Florence in August 1995, offered a vivid and comprehensive picture of the present state of research in all directions of Logic and Philosophy of Science. The final program counted 51 invited lectures and around 700 contributed papers, distributed in 15 sections. Following the tradition of previous LMPS-meetings, some authors, whose papers aroused particular interest, were invited to submit their works for publication in a collection of (...) selected contributed papers. Due to the large number of interesting contributions, it was decided to split the collection into two distinct volumes: one covering the areas of Logic, Foundations of Mathematics and Computer Science, the other focusing on the general Philosophy of Science and the Foundations of Physics. As a leading choice criterion for the present volume, we tried to combine papers containing relevant technical results in pure and applied logic with papers devoted to conceptual analyses, deeply rooted in advanced present-day research. After all, we believe this is part of the genuine spirit underlying the whole enterprise of LMPS studies. (shrink)

Long ago, when Alexander the Great asked the mathematician Menaechmus for a crash course in geometry, he got the famous reply ``There is no royal road to mathematics.'' Where there was no shortcut for Alexander, there is no shortcut for us. Still, the fact that we have access to computers and mature programming languages means that there are avenues for us that were denied to the kings and emperors of yore. The purpose of this book is to teach logic and (...) mathematical reasoning in practice, and to connect logical reasoning with computer programming in Haskell. Haskell emerged in the 1990s as a standard for lazy functional programming, a programming style where arguments are evaluated only when the value is actually needed. Haskell is a marvelous demonstration tool for logic and maths because its functional character allows implementations to remain very close to the concepts that get implemented, while the laziness permits smooth handling of infinite data structures. This book does not assume the reader to have previous experience with either programming or construction of formal proofs, but acquaintance with mathematical notation, at the level of secondary school mathematics is presumed. Everything one needs to know about mathematical reasoning or programming is explained as we go along. After proper digestion of the material in this book, the reader will be able to write interesting programs, reason about their correctness, and document them in a clear fashion. The reader will also have learned how to set up mathematical proofs in a structured way, and how to read and digest mathematical proofs written by others. This is the updated, expanded, and corrected second edition of a much-acclaimed textbook. Praise for the first edition: 'Doets and van Eijck's ``The Haskell Road to Logic, Maths and Programming'' is an astonishingly extensive and accessible textbook on logic, maths, and Haskell.' Ralf Laemmel, Professor of Computer Science, University of Koblenz-Landau. (shrink)

Depending on what one means by the main connective of logic, the -if..., then... -, several systems of logic result: classic and modal logics, intuitionistic logic or relevance logic. This book presents the underlying ideas, the syntax and the semantics of these logics. Soundness and completeness are shown constructively and in a uniform way. Attention is paid to the interdisciplinary role of logic: its embedding in the foundations of mathematics and its intimate connection with philosophy, in particular the philosophy of (...) language. Set theory is presented both as a conditio sine qua non for logic and as a interesting exact ontology. The study of infinite sets yields perplexing results. Formalization of informal number theory results in formal number theory; Godel's incompleteness is treated. At appropriate places attention is paid to paradoxes, intuitionism, conditionals, the historical development of logic, to logic programming and automated theorem proving for classical logic.". (shrink)

An introduction to Mathematical Logic using a unique pedagogical approach in which the students implement the underlying conceps as well as almost all the mathematical proofs in the Python programming language. The textbook is accompanied by an extensive collection of programming tasks, code skeletons, and unit tests. The covered mathematical material includes Propositional Logic and first-order Predicate Logic, culminating in a proof of Gödel's Completeness Theorem. A "sneak peak" into Gödel's Incompleteness Theorem is also provided.

This much-needed book provides a thorough account of temporal logic, one of the most important areas of logic in computer science today. The book begins with a solid introduction to semantical and axiomatic approaches to temporal logic. It goes on to cover predicate temporal logic, meta-languages, general theories of axiomatization, many dimensional systems, propositional quantifiers, expressive power, Henkin dimension, temporalization of other logics, and decidability results. With its inclusion of cutting-edge results and unifying methodologies, this book is an indispensable reference (...) for both the pure logician and the theoretical computer scientist. (shrink)

Undergraduate students with no prior classroom instruction in mathematical logic will benefit from this evenhanded multipart text by one of the centuries greatest authorities on the subject. Part I offers an elementary but thorough overview of mathematical logic of first order. The treatment does not stop with a single method of formulating logic; students receive instruction in a variety of techniques, first learning model theory (truth tables), then Hilbert-type proof theory, and proof theory handled through derived rules. Part (...) II supplements the material covered in Part I and introduces some of the newer ideas and the more profound results of logical research in the twentieth century. Subsequent chapters introduce the study of formal number theory, with surveys of the famous incompleteness and undecidability results of Godel, Church, Turing, and others. The emphasis in the final chapter reverts to logic, with examinations of Godel's completeness theorem, Gentzen's theorem, Skolem's paradox and nonstandard models of arithmetic, and other theorems. Unabridged republication of the edition published by John Wiley & Sons, Inc. New York, 1967. Preface. Bibliography. Theorem and Lemma Numbers: Pages. List of Postulates. Symbols and Notations. Index. (shrink)

Filling the need for an accessible, carefully structured introductory text in symbolic logic, Modern Logic has many features designed to improve students' comprehension of the subject, including a proof system that is the same as the award-winning computer program MacLogic, and a special appendix that shows how to use MacLogic as a teaching aid. There are graded exercises at the end of each chapter--more than 900 in all--with selected answers at the end of the book. Unlike competing texts, Modern (...) Logic gives equal weight to semantics and proof theory and explains their relationship, and develops in detail techniques for symbolizing natural language in first-order logic. After a general introduction featuring the notion of logical form, the book offers sections on classical sentential logic, monadic predicate logic, and full first-order logic with identity. A concluding section deals with extensions of and alternatives to classical logic, including modal logic, intuitionistic logic, and fuzzy logic. For students of philosophy, mathematics, computer science, or linguistics, Modern Logic provides a thorough understanding of basic concepts and a sound basis for more advanced work. (shrink)

This book contains an introduction to symbolic logic and a thorough discussion of mechanical theorem proving and its applications. The book consists of three major parts. Chapters 2 and 3 constitute an introduction to symbolic logic. Chapters 4–9 introduce several techniques in mechanical theorem proving, and Chapters 10 an 11 show how theorem proving can be applied to various areas such as question answering, problem solving, program analysis, and program synthesis.

Investigating meta-programming within the logic programming paradigm, Meta-Logics and Logic Programming presents original research on an important extension of logic programming that makes it more amenable for knowledge representation and programming in general. The 12 contributions, many written especially for this book, explore the foundations, language design issues, and applications of meta-programming in logic programming. Meta-programming—the process of writing computer programs that can manipulate representations of other programs—has been key both in the foundations of computer science and in its practical (...) developments. Examples of meta-programs include compilers, interpreters, program analyzers, and partial evaluators. The choice of logic programming as a basis for meta-programming offers several practical and theoretical advantages: among them, the possibility of tackling critical foundational problems of meta-programming within a strong theoretical framework, and the surprising ease of programming. The usual framework of logic programming (and more generally first-order logic), however, has to be modified and extended to formally deal with meta-programs, extensions the editors call "meta-logics." Along with an exploration of meta-programming in logic programming, the definitions, formal properties, and use of these extensions constitute one of the book's main themes. The first part of the book, Foundations, focuses on the representation problem—how object programs are represented within meta-programs. The second part, Language Support for Meta-Logics, is concerned with language extensions that make meta-programming easier and more elegant. The third part, Meta-Logics for Knowledge Management, deals with the use of meta-logic for advanced knowledge representation purposes. Logic Programming series. (shrink)

Mathematical logic is a branch of mathematics that takes axiom systems and mathematical proofs as its objects of study. This book shows how it can also provide a foundation for the development of information science and technology. The first five chapters systematically present the core topics of classical mathematical logic, including the syntax and models of first-order languages, formal inference systems, computability and representability, and Gödel’s theorems. The last five chapters present extensions and developments of classical (...) class='Hi'>mathematical logic, particularly the concepts of version sequences of formal theories and their limits, the system of revision calculus, proschemes (formal descriptions of proof methods and strategies) and their properties, and the theory of inductive inference. All of these themes contribute to a formal theory of axiomatization and its application to the process of developing information technology and scientific theories. The book also describes the paradigm of three kinds of language environments for theories and it presents the basic properties required of a meta-language environment. Finally, the book brings these themes together by describing a workflow for scientific research in the information era in which formal methods, interactive software and human invention are all used to their advantage. The second edition of the book includes major revisions on the proof of the completeness theorem of the Gentzen system and new contents on the logic of scientific discovery, R-calculus without cut, and the operational semantics of program debugging. This book represents a valuable reference for graduate and undergraduate students and researchers in mathematics, information science and technology, and other relevant areas of natural sciences. Its first five chapters serve as an undergraduate text in mathematical logic and the last five chapters are addressed to graduate students in relevant disciplines. (shrink)

This volume brings together a collection of papers covering a wide range of topics in computer and cognitive science. Topics included are: the foundational relevance of logic to computer science, with particular reference to tense logic, constructive logic, and Horn clause logic; logic as the theoretical underpinnings of the engineering discipline of expert systems; a discussion of the evolution of computational linguistics into functionally distinct task levels; and current issues in the implementation of speech act theory.

What is argumentation? -- Building a classroom culture of argumentation -- Structuring classroom discussions to focus on argumentation -- Infusing all instruction with argumentation -- Argumentation for all students -- Argumentation and the mathematical practices -- Technology in teaching and learning argumentation -- Assessing argumentation and proof -- Conclusion.

This book provides a synthesis of four versions of program semantic—srelational semantics, predicate transformer semantics, information systems, and domain theory—showing, through an exhaustive case study analysis, that it is possible to do back-and-forth translation from any of these versions of program semantics into any of the others, and demonstrating that while there are many variations of each, in principle they may be thought of as intertranslatable.

In the 21st century, digitalization is a global challenge of mankind. Even for the public, it is obvious that our world is increasingly dominated by powerful algorithms and big data. But, how computable is our world? Some people believe that successful problem solving in science, technology, and economies only depends on fast algorithms and data mining. Chances and risks are often not understood, because the foundations of algorithms and information systems are not studied rigorously. Actually, they are deeply rooted in (...) logics, mathematics, computer science and philosophy. Therefore, this book studies the foundations of mathematics, computer science, and philosophy, in order to guarantee security and reliability of the knowledge by constructive proofs, proof mining and program extraction. We start with the basics of computability theory, proof theory, and information theory. In a second step, we introduce new concepts of information and computing systems, in order to overcome the gap between the digital world of logical programming and the analog world of real computing in mathematics and science. The book also considers consequences for digital and analog physics, computational neuroscience, financial mathematics, and the Internet of Things (IoT). (shrink)

Learn how to develop your reasoning skills and how to write well-reasoned proofs Learning to Reason shows you how to use the basic elements of mathematical language to develop highly sophisticated, logical reasoning skills. You'll get clear, concise, easy-to-follow instructions on the process of writing proofs, including the necessary reasoning techniques and syntax for constructing well-written arguments. Through in-depth coverage of logic, sets, and relations, Learning to Reason offers a meaningful, integrated view of modern mathematics, cuts through confusing terms (...) and ideas, and provides a much-needed bridge to advanced work in mathematics as well as computer science. Original, inspiring, and designed for maximum comprehension, this remarkable book: Clearly explains how to write compound sentences in equivalent forms and use them in valid arguments Presents simple techniques on how to structure your thinking and writing to form well-reasoned proofs Reinforces these techniques through a survey of sets-the building blocks of mathematics Examines the fundamental types of relations, which is "where the action is" in mathematics Provides relevant examples and class-tested exercises designed to maximize the learning experience Includes a mind-building game/exercise space at www.wiley.com/products/subject/mathematics/. (shrink)

Merging logic and mathematics in deductive inference-an innovative, cutting-edge approach. Optimization methods for logical inference? Absolutely, say Vijay Chandru and John Hooker, two major contributors to this rapidly expanding field. And even though "solving logical inference problems with optimization methods may seem a bit like eating sauerkraut with chopsticks... it is the mathematical structure of a problem that determines whether an optimization model can help solve it, not the context in which the problem occurs." Presenting powerful, proven optimization techniques (...) for logic inference problems, Chandru and Hooker show how optimization models can be used not only to solve problems in artificial intelligence and mathematical programming, but also have tremendous application in complex systems in general. They survey most of the recent research from the past decade in logic/optimization interfaces, incorporate some of their own results, and emphasize the types of logic most receptive to optimization methods-propositional logic, first order predicate logic, probabilistic and related logics, logics that combine evidence such as Dempster-Shafer theory, rule systems with confidence factors, and constraint logic programming systems. Requiring no background in logic and clearly explaining all topics from the ground up, Optimization Methods for Logical Inference is an invaluable guide for scientists and students in diverse fields, including operations research, computer science, artificial intelligence, decision support systems, and engineering. (shrink)

First-order logic. The origin of modern foundational studies. Frege's system and the paradoxes. The teory of types. Zermelo-Fraenkel set theory. Hilbert's program and Godel's incompleteness theorems. The foundational systems of W.V. Quine. Categorical algebra.

The aim of this book is to present mathematical logic to students who are interested in what this field is but have no intention of specializing in it. The point of view is to treat logic on an equal footing to any other topic in the mathematical curriculum. The book starts with a presentation of naive set theory, the theory of sets that mathematicians use on a daily basis. Each subsequent chapter presents one of the main areas of (...) mathematical logic: first order logic and formal proofs, model theory, recursion theory, Gödel's incompleteness theorem, and, finally, the axiomatic set theory. Each chapter includes several interesting highlights—outside of logic when possible—either in the main text, or as exercises or appendices. Exercises are an essential component of the book, and a good number of them are designed to provide an opening to additional topics of interest. (shrink)

Traditional logic as a part of philosophy is one of the oldest scientific disciplines. Mathematical logic, however, is a relatively young discipline and arose from the endeavors of Peano, Frege, Russell and others to create a logistic foundation for mathematics. It steadily developed during the 20th century into a broad discipline with several sub-areas and numerous applications in mathematics, informatics, linguistics and philosophy. While there are already several well-known textbooks on mathematical logic, this book is unique in that (...) it is much more concise than most others, and the material is treated in a streamlined fashion which allows the professor to cover many important topics in a one semester course. Although the book is intended for use as a graduate text, the first three chapters could be understood by undergraduates interested in mathematical logic. These initial chapters cover just the material for an introductory course on mathematical logic combined with the necessary material from set theory. This material is of a descriptive nature, providing a view towards decision problems, automated theorem proving, non-standard models and other subjects. The remaining chapters contain material on logic programming for computer scientists, model theory, recursion theory, Godel’s Incompleteness Theorems, and applications of mathematical logic. Philosophical and foundational problems of mathematics are discussed throughout the text. The author has provided exercises for each chapter, as well as hints to selected exercises. About the German edition: …The book can be useful to the student and lecturer who prepares a mathematical logic course at the university. What a pity that the book is not written in a universal scientific language which mankind has not yet created. - A.Nabebin, Zentralblatt. (shrink)

Well-Structured Mathematical Logic does for logic what Structured Programming did for computation: make large-scale work possible. From the work of George Boole onward, traditional logic was made to look like a form of symbolic algebra. In this work, the logic undergirding conventional mathematics resembles well-structured computer programs. A very important feature of the new system is that it structures the expression of mathematics in much the same way that people already do informally. In this way, the new system (...) is simultaneously machine-parsable and user-friendly, just as Structured Programming is for algorithms. Unlike traditional logic, the new system works with you, not against you, as you use it to structure--and understand--the mathematics you work with on a daily basis. The book provides a complete guide to its subject matter. It presents the major results and theorems one needs to know in order to use the new system effectively. Two chapters provide tutorials for the reader in the new way that symbols move when logical calculations are performed in the well-structured system. Numerous examples and discussions are provided to illustrate the system's many results and features. Well-Structured Mathematical Logic is accessible to anyone who has at least some knowledge of traditional logic to serve as a foundation, and is of interest to all who need a system of pliant, user-friendly mathematical logic to use in their work in mathematics and computer science. (shrink)

Workshop organized by Fraunhofer-Institut f'ur Arbeitswirtschaft und Organisation.".

This textbook is designed for an Introduction to Proofs course organized around the themes of number and space. Concepts are illustrated using both geometric and number examples, while frequent analogies and applications help build intuition and context in the humanities, arts, and sciences. Sophisticated mathematical ideas are introduced early and then revisited several times in a spiral structure, allowing students to progressively develop rigorous thinking. Throughout, the presentation is enlivened with whimsical illustrations, apt quotations, and glimpses of mathematical (...) history and culture. Early chapters integrate an introduction to sets, logic, and beginning proof techniques with a first exposure to more advanced mathematical structures. The middle chapters focus on equivalence relations, functions, and induction. Carefully chosen examples elucidate familiar topics, such as natural and rational numbers and angle measurements, as well as new mathematics, such as modular arithmetic and beginning graph theory. The book concludes with a thorough exploration of the cardinalities of finite and infinite sets and, in two optional chapters, brings all the topics together by constructing the real numbers and other complete metric spaces. Designed to foster the mental flexibility and rigorous thinking needed for advanced mathematics, Introduction to Mathematics suits either a lecture-based or flipped classroom. A year of mathematics, statistics, or computer science at the university level is assumed, but the main prerequisite is the willingness to engage in a new challenge. (shrink)

This book introduces the notions and methods of formal logic from a computer science standpoint, covering propositional logic, predicate logic, and foundations ...

A pioneering look at the fundamental role of logic in optimizationand constraint satisfaction While recent efforts to combine optimization and constraintsatisfaction have received considerable attention, little has beensaid about using logic in optimization as the key to unifying thetwo fields. Logic-Based Methods for Optimization develops for thefirst time a comprehensive conceptual framework for integratingoptimization and constraint satisfaction, then goes a step furtherand shows how extending logical inference to optimization allowsfor more powerful as well as flexible modeling and solutiontechniques. Designed to (...) be easily accessible to industryprofessionals and academics in both operations research andartificial intelligence, the book provides a wealth of examples aswell as elegant techniques and modeling frameworks ready forimplementation. Timely, original, and thought-provoking,Logic-Based Methods for Optimization: * Demonstrates the advantages of combining the techniques inproblem solving * Offers tutorials in constraint satisfaction/constraintprogramming and logical inference * Clearly explains such concepts as relaxation, cutting planes,nonserial dynamic programming, and Bender's decomposition * Reviews the necessary technologies for software developersseeking to combine the two techniques * Features extensive references to important computationalstudies * And much more. (shrink)

This book contains 21 essays by leading authorities on aspects of contemporary logic, ranging from foundations of set theory to applications of logic in computing and in the theory of fields. In computer science and mathematics, this gap between foundations and applications is small, as illustrated by essays on the proof theory of non-classical logics, lambda calculus, relating logic programs to inductive definition, and definability in Lindenbaum algebras. Other chapters discuss how to apply model theory to field theory, complex geometry (...) and groups, and how to recover from its automorphism group. (shrink)

A First Course in Logic is an introduction to first-order logic suitable for first and second year mathematicians and computer scientists. There are three components to this course: propositional logic; Boolean algebras; and predicate/first-order, logic. Logic is the basis of proofs in mathematics — how do we know what we say is true? — and also of computer science — how do I know this program will do what I think it will? Surprisingly little mathematics is needed to learn and (...) understand logic (this course doesn't involve any calculus). The real mathematical prerequisite is an ability to manipulate symbols: in other words, basic algebra. Anyone who can write programs should have this ability. (shrink)

The value of logic techniques in circuit design has been well-known for many years, but a thorough grounding in mathematical logic is needed for all stages of software development, especially program specification, verification and program transformation. In all these stages, logic underpins the theory, bearing out the dictum that Logic is the calculus of computer science. This book presents the subject of mathematical logic in order to provide a grounding for students in computer science.

Designed to provide a firm foundation in mathematical logic, this work aims to serve as an elementary textbook for both graduate study and for applications of logic, such as logic programming and format specification and verification.

An understanding of logic is essential to computer science. This book provides a highly accessible account of the logical basis required for reasoning about computer programs and applying logic in fields like artificial intelligence. The text contains extended examples, algorithms, and programs written in Standard ML and Prolog. No prior knowledge of either language is required. The book contains a clear account of classical first-order logic, one of the basic tools for program verification, as well as an introductory survey of (...) modal and temporal logics and possible world semantics. An introduction to intuitionistic logic as a basis for an important style of program specification is also featured in the book. (shrink)

Logic has pride of place in mathematics and its 20th century offshoot, computer science. Modern symbolic logic was developed, in part, as a way to provide a formal framework for mathematics: Frege, Peano, Whitehead and Russell, as well as Hilbert developed systems of logic to formalize mathematics. These systems were meant to serve either as themselves foundational, or at least as formal analogs of mathematical reasoning amenable to mathematical study, e.g., in Hilbert’s consistency program. Similar efforts continue, (...) but have been expanded by the development of sophisticated methods to study the properties of such systems using proof and model theory. In parallel with this evolution of logical formalisms as tools for articulating mathematical theories (broadly speaking), much progress has been made in the quest for a mechanization of logical inference and the investigation of its theoretical limits, culminating recently in the development of new foundational frameworks for mathematics with sophisticated computer-assisted proof systems. In addition, logical formalisms developed by logicians in mathematical and philosophical contexts have proved immensely useful in describing theories and systems of interest to computer scientists, and to some degree, vice versa. Three examples of the influence of logic in computer science are automated reasoning, computer verification, and type systems for programming languages. (shrink)

Linear Logic is a branch of proof theory which provides refined tools for the study of the computational aspects of proofs. These tools include a duality-based categorical semantics, an intrinsic graphical representation of proofs, the introduction of well-behaved non-commutative logical connectives, and the concepts of polarity and focalisation. These various aspects are illustrated here through introductory tutorials as well as more specialised contributions, with a particular emphasis on applications to computer science: denotational semantics, lambda-calculus, logic programming and concurrency theory. The (...) volume is rounded-off by two invited contributions on new topics rooted in recent developments of linear logic. The book derives from a summer school that was the climax of the EU Training and Mobility of Researchers project 'Linear Logic in Computer Science'. It is an excellent introduction to some of the most active research topics in the area. (shrink)

Linear logic, introduced in 1986 by J.-Y. Girard, is based upon a fine grain analysis of the main proof-theoretical notions of logic. The subject develops along the lines of denotational semantics, proof nets and the geometry of interaction. Its basic dynamical nature has attracted computer scientists, and various promising connections have been made in the areas of optimal program execution, interaction nets and knowledge representation. This book is the refereed proceedings of the first international meeting on linear logic held at (...) Cornell University, in June 1993. Survey papers devoted to specific areas of linear logic, as well as an extensive general introduction to the subject by J.-Y. Girard, have been added, so as to make this book a valuable tool both for the beginner and for the advanced researcher. (shrink)

Language in Action demonstrates the viability of mathematical research into the foundations of categorial grammar, a topic at the border between logic and linguistics. Since its initial publication it has become the classic work in the foundations of categorial grammar. A new introduction to this paperback edition updates the open research problems and records relevant results through pointers to the literature. Van Benthem presents the categorial processing of syntax and semantics as a central component in a more general dynamic (...) logic of information flow, in tune with computational developments in artificial intelligence and cognitive science. Using the paradigm of categorial grammar, he describes the substructural logics driving the dynamics of natural language syntax and semantics. This is a general type-theoretic approach that lends itself easily to proof-theoretic and semantic studies in tandem with standard logic. The emphasis is on a broad landscape of substructural categorial logics and their proof-theoretical and semantic peculiarities. This provides a systematic theory for natural language understanding, admitting of significant mathematical results. Moreover, the theory makes possible dynamic interpretations that view natural languages as programming formalisms for various cognitive activities. (shrink)

This volume presents the proceedings of the workshop CSL '91 (Computer Science Logic) held at the University of Berne, Switzerland, October 7-11, 1991. This was the fifth in a series of annual workshops on computer sciencelogic (the first four are recorded in LNCS volumes 329, 385, 440, and 533). The volume contains 33 invited and selected papers on a variety of logical topics in computer science, including abstract datatypes, bounded theories, complexity results, cut elimination, denotational semantics, infinitary queries, Kleene algebra (...) with recursion, minimal proofs, normal forms in infinite-valued logic, ordinal processes, persistent Petri nets, plausibility logic, program synthesis systems, quantifier hierarchies, semantics of modularization, stable logic, term rewriting systems, termination of logic programs, transitive closure logic, variants of resolution, and many others. (shrink)

Boston Studies in the Philosophy of Science are devoted to symposia, con gresses, colloquia, monographs and collected papers on the philosophical foundations of the sciences. It is now our pleasure to include A. A. Zi nov'ev's treatise on complex logic among these volumes. Zinov'ev is one of the most creative of modern Soviet logicians, and at the same time an innovative worker on the methodological foundations of science. More over, Zinov'ev, although still a developing scholar, has exerted a sub stantial (...) and stimulating influence upon his colleagues and students in Moscow and within other philosophical and logical circles of the Soviet Union. Hence it may be helpful, in bringing this present work to an English-reading audience, to review briefly some contemporary Soviet investigations into scientific methodology. During the 1950's, a vigorous new research program in logic was under taken, and the initial published work -characteristic of most Soviet pub lications in the logic and methodology of the sciences - was a collection of essays, Logical Investigations (Moscow, 1959). Among the authors, in addition to Zinov'ev himself, were the philosophers A. Kol'man and P. V. Tavanec, and the mathematicians and linguists, S. A. Janovskaja, A. S. Esenin-Vol'pin, S. K. Saumjan, G. N. Povarov. (shrink)

Fuzzy logic is finding increased application in the control of real-world processes and in the work with and the manipulation of inexact knowledge. Two of the major attractions of fuzzy logic are: it permits one to express problems in (familiar) linguistic terms and it can be applied where the numerical mathematical model of a system may be too complex or impossible to build using conventional techniques. This book, written in an easily accessible style, assumes that students have a solid (...) background in embedded systems including basic logic design and C/C programming. (shrink)