Combinatory logic is one of the most versatile areas within logic that is tied to parts of philosophical, mathematical, and computational logic. Functioning as a comprehensive source for current developments of combinatory logic, this book is the only one of its kind to cover results of the last four decades. Using a reader-friendly style, the author presents the most up-to-date research studies. She includes an introduction to combinatory logic before progressing to its central theorems and proofs. The text makes intelligent and well-researched connections between combinatory logic and lambda calculi and presents models and applications to illustrate these connections.

These notes present some of the basic techniques and results in the subject of combinatory logic. This subject will first be treated with an introduction via lambda-conversion. Chapter two is an introduction to combinators. Chapters three and four will deal with recursive functions. Chapters five, six, and seven deal with extensional theory of combinators. Chapters nine and ten deal with combinator-based systems of logic . Chapters eight and eleven deal with proof-theoretic application.

'A wealth of examples to which solutions are given permeate the text so the reader will certainly be active.'The Mathematical GazetteThis is the final book written by the late great puzzle master and logician, Dr. Raymond Smullyan.This book is a sequel to my Beginner's Guide to Mathematical Logic.The previous volume deals with elements of propositional and first-order logic, contains a bit on formal systems and recursion, and concludes with chapters on Gödel's famous incompleteness theorem, along with related results.The present volume begins with a bit more on propositional and first-order logic, followed by what I would call a 'fein' chapter, which simultaneously generalizes some results from recursion theory, first-order arithmetic systems, and what I dub a 'decision machine.' Then come five chapters on formal systems, recursion theory and metamathematical applications in a general setting. The concluding five chapters are on the beautiful subject of combinatory logic, which is not only intriguing in its own right, but has important applications to computer science. Argonne National Laboratory is especially involved in these applications, and I am proud to say that its members have found use for some of my results in combinatory logic.This book does not cover such important subjects as set theory, model theory, proof theory, and modern developments in recursion theory, but the reader, after studying this volume, will be amply prepared for the study of these more advanced topics.

This book is a revised edition of the monograph which appeared under the same title in the series Research Notes in Theoretical Computer Science, Pit man, in 1986. In addition to a general effort to improve typography, English, and presentation, the main novelty of this second edition is the integration of some new material. Part of it is mine (mostly jointly with coauthors). Here is brief guide to these additions. I have augmented the account of categorical combinatory logic with a description of the confluence properties of rewriting systems of categor ical combinators (Hardin, Yokouchi), and of the newly developed cal culi of explicit substitutions (Abadi, Cardelli, Curien, Hardin, Levy, and Rios), which are similar in spirit to the categorical combinatory logic, but are closer to the syntax of A-calculus (Section 1.2). The study of the full abstraction problem for PCF and extensions of it has been enriched with a new full abstraction result: the model of sequential algorithms is fully abstract with respect to an extension of PCF with a control operator (Cartwright, Felleisen, Curien). An order extensional model of error-sensitive sequential algorithms is also fully abstract for a corresponding extension of PCF with a control operator and errors (Sections 2.6 and 4.1). I suggest that sequential algorithms lend themselves to a decomposition of the function spaces that leads to models of linear logic (Lamarche, Curien), and that connects sequentiality with games (Joyal, Blass, Abramsky) (Sections 2.1 and 2.6).

The Fourth International Congress for Logic, Methodology, and Philos ophy of Science was held in Bucharest, Romania, on August 29-September 4, 1971. The Congress was organized, under the auspices of the Inter national Union for History and Philosophy of Science, Division of Logic, Methodology and Philosophy of Science, by the Academy of the Socialist Republic of Romania, the Academy of Social and Political Sciences of the Socialist Republic of Romania, and the Ministry of Education of Romania. With more than eight hundred participating scholars from thirty-four countries, the Congress was one of the major scientific events of the year 1971. The dedicated efforts of the organizers, the rich and carefully planned program, and the warm and friendly atmosphere contributed to making the Congress a successful and fruitful forum of exchange of scientific ideas. The work of the Congress consisted of invited one hour and half-hour addresses, symposia, and contributed papers. The proceedings were organized into twelve sections of Mathematical Logic, Foundations of Mathematical Theories, Automata and Programming Languages, Philos ophy of Logic and Mathematics, General Problems of Methodology and Philosophy of Science, Foundations of Probability and Induction, Methodology and Philosophy of Physical Sciences, Methodology and Philosophy of Biological Sciences, Methodology and Philosophy of Psychological Sciences, Methodology and Philosophy of Historical and Social Sciences, Methodology and Philosophy of Linguistics, and History of Logic, Methodology and Philosophy of Science.

The Encyclopaedia of Mathematics is the most up-to-date, authoritative and comprehensive English-language work of reference in mathematics which exists today. With over 7,000 articles from `A-integral' to `Zygmund Class of Functions', supplemented with a wealth of complementary information, and an index volume providing thorough cross-referencing of entries of related interest, the Encyclopaedia of Mathematics offers an immediate source of reference to mathematical definitions, concepts, explanations, surveys, examples, terminology and methods. The depth and breadth of content and the straightforward, careful presentation of the information, with the emphasis on accessibility, makes the Encyclopaedia of Mathematics an immensely useful tool for all mathematicians and other scientists who use, or are confronted by, mathematics in their work. The Enclyclopaedia of Mathematics provides, without doubt, a reference source of mathematical knowledge which is unsurpassed in value and usefulness. It can be highly recommended for use in libraries of universities, research institutes, colleges and even schools.

This book presents contributions from world-renowned logicians, discussing important topics of logic from the point of view of their further development in light of requirements arising from successful application in Computer Science and AI language. Coverage includes: the logic of provability, computability theory applied to biology, psychology, physics, chemistry, economics, and other basic sciences; computability theory and computable models; logic and space-time geometry; hybrid systems; logic and region-based theory of space.

This book constitutes the refereed proceedings of the 10th International Conference on Typed Lambda Calculi and Applications, TLCA 2011, held in Novi Sad, Serbia, in June 2011 as part of RDP 2011, the 6th Federated Conference on Rewriting, Deduction, and Programming. The 15 revised full papers presented were carefully reviewed and selected from 44 submissions. The papers provide prevailing research results on all current aspects of typed lambda calculi, ranging from theoretical and methodological issues to applications in various contexts addressing a wide variety of topics such as proof-theory, semantics, implementation, types, and programming.

Passivization is explained by using the formalism of combinatory logic. The agented passive is derived from the agentless as follows: a term denoting an agent is transposed into a predicate modifier and applied to the passive predicate of the agentless construction. The passive predicate consists of two parts: 1) the two-place converse of the active predicate and 2) a zero unspecified term to which the converse predicate is applied. The passive is not derived from but is related to the active. The modifier of the passive predicate is the functional counterpart of the subject in the active. The proposed hypothesis gives an adequate solution to problems arising from various types of passive constructions. Passivization and antipassivization are defined as instances of a general cross-linguistic process involving conversion.

This book constitutes the thoroughly refereed post-proceedings of four workshops held as satellite events of the JSAI International Symposia on Artificial Intelligence 2010, in Tokyo, Japan, in November 2010. The 28 revised full papers with four papers for the following four workshops presented were carefully reviewed and selected from 70 papers. The papers are organized in sections Logic and Engineering of Natural Language Semantics (LENLS), Juris-Informatics (JURISIN), Advanced Methodologies for Bayesian Networks (AMBN), and Innovating Service Systems (ISS).