Between the two world wars, Stanislaw Lesniewski (1886-1939), created the famous and important system of foundations of mathematics that comprises three deductive theories: Protothetic, Ontology, and Mereology. His research started in 1914 with studies on the general theory of sets (later named `Mereology'). Ontology followed between 1919 and 1921, and was the next step towards an integrated system. In order to combine these two systematically he constructed Protothetic - the system of `first principles'. Together they amount to what Z. Jordan called `... most thorough, original, and philosophically significant attempt to provide a logically secure foundation for the whole of mathematics'. The volume collects many of the most significant commentaries on, and contributions to, Protothetic. A Protothetic Bibliography is included.

Foundations of mathematics is the study of the most basic concepts and logical structure of mathematics, with an eye to the unity of human knowledge. Almost all of the problems studied in this book are motivated by an overriding foundational question: What are the appropriate axioms for mathematics? Through a series of case studies, these axioms are examined to prove particular theorems in core mathematical areas such as algebra, analysis, and topology, focusing on the language of second-order arithmetic, the weakest language rich enough to express and develop the bulk of mathematics. In many cases, if a mathematical theorem is proved from appropriately weak set existence axioms, then the axioms will be logically equivalent to the theorem. Furthermore, only a few specific set existence axioms arise repeatedly in this context, which in turn correspond to classical foundational programs. This is the theme of reverse mathematics, which dominates the first half of the book. The second part focuses on models of these and other subsystems of second-order arithmetic. Additional results are presented in an appendix.

The monograph is a 'de-construction' of Kurt Godel's Incompleteness Theorem's paradox sentence's used to prove that no formal systems of logic or mathematics can exist. The semantic valuation of the 'meaning' behind the sentences used for the paradox is challenged and revised using other words that change the very nature of the sentences used in the paradox. These 'semantic' changes result in new meanings for the sentences used for the paradoxes and forms new interpretations of examining Godel's Incompleteness Theorem as it related to David Hilbert's unifying plan for a Formalized mathematics. The monograph includes an unpublished paper on the reason 'why' behind the writing of this monograph in the Appendix section as well as a copy of my original mathematics dissertation from which this monograph is derived that is also located in the Appendix section of this monograph. The monograph includes a chapter on 'machine intelligence' and is a culmination of my thoughts on language, machines and artificial intelligence as a whole. Technical papers on the subject are included in the Appendix section of this monograph. Content: Abstract, Preface, Introduction, The Incompleteness Theorem, Hilbert's Axiomatic System for Mathematics, Of Two Words, Language and Godel's Theorem, Can Machines Think?, Conclusions, Summary, References, Notes, Appendix and Index.

The book is about Gentzen calculi for (the main systems of) modal logic. It is divided into three parts. In the first partwe introduce and discuss the main philosophical ideas related to proof theory, and we try to identify criteria for distinguishing good sequent calculi. In the second part we present the several attempts made from the 50's until today to provide modal logic with Gentzen calculi. In the third and and final part we analyse new calculi for modal logics, called tree-hypersequent calculi, which were recently introduced by the author. We show in a precise and clear way the main results that can be proved with and about them.

"

Multiple-conclusion logic extends formal logic by allowing arguments to have a set of conclusions instead of a single one, the truth lying somewhere among the conclusions if all the premises are true. The extension opens up interesting possibilities based on the symmetry between premises and conclusions, and can also be used to throw fresh light on the conventional logic and its limitations. This is a sustained study of the subject and is certain to stimulate further research. Part I reworks the fundamental ideas of logic to take account of multiple conclusions, and investigates the connections between multiple - and single - conclusion calculi. Part II draws on graph theory to discuss the form and validity of arguments independently of particular logical systems. Part III contrasts the multiple - and the single - conclusion treatment of one and the same subject, using many-valued logic as the example; and Part IV shows how the methods of 'natural deduction' can be matched by direct proofs using multiple conclusions.

The Unprovability of Consistency is concerned with connections between two branches of logic: proof theory and modal logic. Modal logic is the study of the principles that govern the concepts of necessity and possibility; proof theory is, in part, the study of those that govern provability and consistency. In this book, George Boolos looks at the principles of provability from the standpoint of modal logic. In doing so, he provides two perspectives on a debate in modal logic that has persisted for at least thirty years between the followers of C. I. Lewis and W. V. O. Quine. The author employs semantic methods developed by Saul Kripke in his analysis of modal logical systems. The book will be of interest to advanced undergraduate and graduate students in logic, mathematics and philosophy, as well as to specialists in those fields.

The proceedings of the Los Angeles Caltech-UCLA 'Cabal Seminar' were originally published in the 1970s and 1980s. Games, Scales, and Suslin Cardinals is the first of a series of four books collecting the seminal papers from the original volumes together with extensive unpublished material, new papers on related topics, and discussion of research developments since the publication of the original volumes. Focusing on the subjects of 'Games and Scales' (Part 1) and 'Suslin Cardinals, Partition Properties, and Homogeneity' (Part 2), each of the two sections is preceded by an introductory survey putting the papers into present context. This volume will be an invaluable reference for anyone interested in higher set theory.

Weighted finite automata are classical nondeterministic finite automata in which the transitions carry weights. These weights may model, for example, the cost involved when executing a transition, the resources or time needed for this, or the probability or reliability of its successful execution. Weights can also be added to classical automata with infinite state sets like pushdown automata, and this extension constitutes the general concept of weighted automata. Since their introduction in the 1960s they have stimulated research in related areas of theoretical computer science, including formal language theory, algebra, logic, and discrete structures. Moreover, weighted automata and weighted context-free grammars have found application in natural-language processing, speech recognition, and digital image compression.

This book covers all the main aspects of weighted automata and formal power series methods, ranging from theory to applications. The contributors are the leading experts in their respective areas, and each chapter presents a detailed survey of the state of the art and pointers to future research. The chapters in Part I cover the foundations of the theory of weighted automata, specifically addressing semirings, power series, and fixed point theory. Part II investigates different concepts of weighted recognizability. Part III examines alternative types of weighted automata and various discrete structures other than words. Finally, Part IV deals with applications of weighted automata, including digital image compression, fuzzy languages, model checking, and natural-language processing.

Computer scientists and mathematicians will find this book an excellent survey and reference volume, and it will also be a valuable resource for students exploring this exciting research area.

Combinatory logic and lambda-calculus, originally devised in the 1920's, have since developed into linguistic tools, especially useful in programming languages. The authors' previous book served as the main reference for introductory courses on lambda-calculus for over 20 years: this long-awaited new version is thoroughly revised and offers a fully up-to-date account of the subject, with the same authoritative exposition. The grammar and basic properties of both combinatory logic and lambda-calculus are discussed, followed by an introduction to type-theory. Typed and untyped versions of the systems, and their differences, are covered. Lambda-calculus models, which lie behind much of the semantics of programming languages, are also explained in depth. The treatment is as non-technical as possible, with the main ideas emphasized and illustrated by examples. Many exercises are included, from routine to advanced, with solutions to most at the end of the book.

Although several books cover the coding theory of wireless communications and the hardware technologies and coding techniques of optical CDMA, no book has been specifically dedicated to optical coding theory-until now. Written by renowned authorities in the field, Optical Coding Theory with Prime gathers together in one volume the fundamentals and developments of optical coding theory, with a focus on families of prime codes, supplemented with several families of non-prime codes. The book also explores potential applications to coding-based optical systems and networks. Learn How to Construct and Analyze Optical Codes The authors use a theorem-proof approach, breaking down theories into digestible form so that readers can understand the main message without searching through tedious proofs. The book begins with the mathematical tools needed to understand and apply optical coding theory, from Galois fields and matrices to Gaussian and combinatorial analytical tools. Using a wealth of examples, the authors show how optical codes are constructed and analyzed, and detail their performance in a variety of applications. The book examines families of 1-D and 2-D asynchronous and synchronous, multilength, and 3-D prime codes, and some non-prime codes. Get a Working Knowledge of Optical Coding Theory to Help You Design Optical Systems and Networks Prerequisites include a basic knowledge of linear algebra and coding theory, as well as a foundation in probability and communications theory. This book draws on the authors' extensive research to offer an authoritative reference on the emerging field of optical coding theory. In addition, it supplies a working knowledge of the theory and optical codes to help readers in the design of coding-based optical systems and networks. For more on the technological aspects of optical CDMA, see Optical Code Division Multiple Access: Fundamentals and Applications (CRC Press 2005).

Domain theory is an established part of theoretical computer science, used in giving semantics to programming languages and logics. In mathematics and logic it has also proved to be useful in the study of algorithms. This book is devoted to providing a unified and self-contained treatment of the subject. The theory is presented in a mathematically precise manner which nevertheless is accessible to mathematicians and computer scientists alike. The authors begin with the basic theory including domain equations, various domain representations and universal domains. They then proceed to more specialized topics such as effective and power domains, models of lambda-calculus and so on. In particular, the connections with ultrametric spaces and the Kleene-Kreisel continuous functionals are made precise. Consequently the text will be useful as an introductory textbook (earlier versions have been class-tested in Uppsala, Gothenburg, Passau, Munich and Swansea), or as a general reference for professionals in computer science and logic.

This is an up-to-date and integrated introduction to model theory, designed to be used for graduate courses (for students who are familiar with first-order logic), and as a reference for more experienced logicians and mathematicians. Model theory is concerned with the notions of definition, interpretation and structure in a very general setting, and is applied to a wide variety of other areas such as set theory, geometry, algebra (in particular group theory), and computer science (e.g. logic programming and specification). Professor Hodges emphasises definability and methods of construction, and introduces the reader to advanced topics such as stability. He also provides the reader with much historical information and a full bibliography, enhancing the book's use as a reference.

This book describes the mathematical aspects of the semantics of programming languages. The main goals are to provide formal tools to assess the meaning of programming constructs in both a language-independent and a machine-independent way and to prove properties about programs, such as whether they terminate, or whether their result is a solution of the problem they are supposed to solve. In order to achieve this the authors first present, in an elementary and unified way, the theory of certain topological spaces that have proved of use in the modeling of various families of typed lambda calculi considered as core programming languages and as meta-languages for denotational semantics. This theory is now known as Domain Theory, and was founded as a subject by Scott and Plotkin. One of the main concerns is to establish links between mathematical structures and more syntactic approaches to semantics, often referred to as operational semantics, which is also described. This dual approach has the double advantage of motivating computer scientists to do some mathematics and of interesting mathematicians in unfamiliar application areas from computer science.

This revised and considerably expanded 2nd edition brings together a wide range of topics, including modal, tense, conditional, intuitionist, many-valued, paraconsistent, relevant, and fuzzy logics. Part 1, on propositional logic, is the old Introduction, but contains much new material. Part 2 is entirely new, and covers quantification and identity for all the logics in Part 1. The material is unified by the underlying theme of world semantics. All of the topics are explained clearly using devices such as tableau proofs, and their relation to current philosophical issues and debates are discussed. Students with a basic understanding of classical logic will find this book an invaluable introduction to an area that has become of central importance in both logic and philosophy. It will also interest people working in mathematics and computer science who wish to know about the area.

This is a compact mtroduction to some of the pnncipal tOpICS of mathematical logic . In the belief that beginners should be exposed to the most natural and easiest proofs, I have used free-swinging set-theoretic methods. The significance of a demand for constructive proofs can be evaluated only after a certain amount of experience with mathematical logic has been obtained. If we are to be expelled from "Cantor's paradise" (as nonconstructive set theory was called by Hilbert), at least we should know what we are missing. The major changes in this new edition are the following. (1) In Chapter 5, Effective Computability, Turing-computabIlity IS now the central notion, and diagrams (flow-charts) are used to construct Turing machines. There are also treatments of Markov algorithms, Herbrand-Godel-computability, register machines, and random access machines. Recursion theory is gone into a little more deeply, including the s-m-n theorem, the recursion theorem, and Rice's Theorem. (2) The proofs of the Incompleteness Theorems are now based upon the Diagonalization Lemma. Lob's Theorem and its connection with Godel's Second Theorem are also studied. (3) In Chapter 2, Quantification Theory, Henkin's proof of the completeness theorem has been postponed until the reader has gained more experience in proof techniques. The exposition of the proof itself has been improved by breaking it down into smaller pieces and using the notion of a scapegoat theory. There is also an entirely new section on semantic trees.

This is a first course in propositional modal logic, suitable for mathematicians, computer scientists and philosophers. Emphasis is placed on semantic aspects, in the form of labelled transition structures, rather than on proof theory. The book covers all the basic material - propositional languages, semantics and correspondence results, proof systems and completeness results - as well as some topics not usually covered in a modal logic course. It is written from a mathematical standpoint. To help the reader, the material is covered in short chapters, each concentrating on one topic. These are arranged into five parts, each with a common theme. An important feature of the book is the many exercises, and an extensive set of solutions is provided.

Type theory is one of the most important tools in the design of higher-level programming languages, such as ML. This book introduces and teaches its techniques by focusing on one particularly neat system and studying it in detail. By concentrating on the principles that make the theory work in practice, the author covers all the key ideas without getting involved in the complications of more advanced systems. This book takes a type-assignment approach to type theory, and the system considered is the simplest polymorphic one. The author covers all the basic ideas, including the system's relation to propositional logic, and gives a careful treatment of the type-checking algorithm that lies at the heart of every such system. Also featured are two other interesting algorithms that until now have been buried in inaccessible technical literature. The mathematical presentation is rigorous but clear, making it the first book at this level that can be used as an introduction to type theory for computer scientists.

Professor Merrie Bergmann presents an accessible introduction to the subject of many-valued and fuzzy logic designed for use on undergraduate and graduate courses in non-classical logic. Bergmann discusses the philosophical issues that give rise to fuzzy logic - problems arising from vague language - and returns to those issues as logical systems are presented. For historical and pedagogical reasons, three-valued logical systems are presented as useful intermediate systems for studying the principles and theory behind fuzzy logic. The major fuzzy logical systems - Lukasiewicz, Goedel, and product logics - are then presented as generalisations of three-valued systems that successfully address the problems of vagueness. A clear presentation of technical concepts, this book includes exercises throughout the text that pose straightforward problems, that ask students to continue proofs begun in the text, and that engage students in the comparison of logical systems.

Professor Merrie Bergmann presents an accessible introduction to the subject of many-valued and fuzzy logic designed for use on undergraduate and graduate courses in non-classical logic. Bergmann discusses the philosophical issues that give rise to fuzzy logic - problems arising from vague language - and returns to those issues as logical systems are presented. For historical and pedagogical reasons, three-valued logical systems are presented as useful intermediate systems for studying the principles and theory behind fuzzy logic. The major fuzzy logical systems - Lukasiewicz, Goedel, and product logics - are then presented as generalisations of three-valued systems that successfully address the problems of vagueness. A clear presentation of technical concepts, this book includes exercises throughout the text that pose straightforward problems, that ask students to continue proofs begun in the text, and that engage students in the comparison of logical systems.

This book addresses a gap in the model-theoretic understanding of valued fields that has, until now, limited the interactions of model theory with geometry. It contains significant developments in both pure and applied model theory. Part I of the book is a study of stably dominated types. These form a subset of the type space of a theory that behaves in many ways like the space of types in a stable theory. This part begins with an introduction to the key ideas of stability theory for stably dominated types. Part II continues with an outline of some classical results in the model theory of valued fields and explores the application of stable domination to algebraically closed valued fields. The research presented here is made accessible to the general model theorist by the inclusion of the introductory sections of each part.

The Annual European Meeting of the Association for Symbolic Logic, generally known as the Logic Colloquium, is the most prestigious annual meeting in the field. Many of the papers presented there are invited surveys of developments, and the rest of the papers are chosen to complement the invited talks. This 2007 volume includes surveys, tutorials, and selected research papers from the 2005 meeting. Highlights include three papers on different aspects of connections between model theory and algebra; a survey of major advances in combinatorial set theory; a tutorial on proof theory and modal logic; and a description of Bernay's philosophy of mathematics.

Computability and Logic has become a classic because of its accessibility to students without a mathematical background and because it covers not simply the staple topics of an intermediate logic course, such as Godel's incompleteness theorems, but also a large number of optional topics, from Turing's theory of computability to Ramsey's theorem. This 2007 fifth edition has been thoroughly revised by John Burgess. Including a selection of exercises, adjusted for this edition, at the end of each chapter, it offers a simpler treatment of the representability of recursive functions, a traditional stumbling block for students on the way to the Godel incompleteness theorems. This updated edition is also accompanied by a website as well as an instructor's manual.

This undergraduate textbook covers the key material for a typical first course in logic, in particular presenting a full mathematical account of the most important result in logic, the Completeness Theorem for first-order logic. Looking at a series of interesting systems, increasing in complexity, then proving and discussing the Completeness Theorem for each, the author ensures that the number of new concepts to be absorbed at each stage is manageable, whilst providing lively mathematical applications throughout. Unfamiliar terminology is kept to a minimum, no background in formal set-theory is required, and the book contains proofs of all the required set theoretical results. The reader is taken on a journey starting with Koenig's Lemma, and progressing via order relations, Zorn's Lemma, Boolean algebras, and propositional logic, to completeness and compactness of first-order logic. As applications of the work on first-order logic, two final chapters provide introductions to model theory and nonstandard analysis.

This undergraduate textbook covers the key material for a typical first course in logic, in particular presenting a full mathematical account of the most important result in logic, the Completeness Theorem for first-order logic. Looking at a series of interesting systems, increasing in complexity, then proving and discussing the Completeness Theorem for each, the author ensures that the number of new concepts to be absorbed at each stage is manageable, whilst providing lively mathematical applications throughout. Unfamiliar terminology is kept to a minimum, no background in formal set-theory is required, and the book contains proofs of all the required set theoretical results. The reader is taken on a journey starting with K??nig's Lemma, and progressing via order relations, Zorn's Lemma, Boolean algebras, and propositional logic, to completeness and compactness of first-order logic. As applications of the work on first-order logic, two final chapters provide introductions to model theory and nonstandard analysis.

Dependence is a common phenomenon, wherever one looks: ecological systems, astronomy, human history, stock markets - but what is the logic of dependence? This book is the first to carry out a systematic logical study of this important concept, giving on the way a precise mathematical treatment of Hintikka's independence friendly logic. Dependence logic adds the concept of dependence to first order logic. Here the syntax and semantics of dependence logic are studied, dependence logic is given an alternative game theoretic semantics, and sharp results about its complexity are proven. This is a textbook suitable for a special course in logic in mathematics, philosophy and computer science departments, and contains over 200 exercises, many of which have a full solution at the end of the book. It is also accessible to general readers, with a basic knowledge of logic, interested in new phenomena in logic.