You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
A so-called "effective" algorithm may require arbitrarily large finite amounts of time and space resources, and hence may not be practical in the real world. A "feasible" algorithm is one which only requires a limited amount of space and/or time for execution; the general idea is that a feasible algorithm is one which may be practical on today's or at least tomorrow's computers. There is no definitive analogue of Church's thesis giving a mathematical definition of feasibility; however, the most widely studied mathematical model of feasible computability is polynomial-time computability. Feasible Mathematics includes both the study of feasible computation from a mathematical and logical point...
The Fourth Scandinavian Logic Symposium and the First Soviet-Finnish Logic Conference were held in JyvaskyIa, Finland, June 29-July 6, 1976. The Conferences were organized by a committee which consisted of the editors of the present volume. The Conferences were supported financially by the Ministry of Education of Finland, by the Academy of Finland, and by the Division of Logic, Methodology, and Philosophy of Science of the International Union of History of Science. The Philosophical Society of Finland and the Jyvaskyla Summer Festival gave valuable help in various practicalities. 35 papers by authors representing 10 countries were presented at the two meetings. Of those papers 24 appear her...
Intuitionism and Proof Theory: Proceedings of the Summer Conference at Buffalo N.Y. 1968
Noted logician discusses both theoretical underpinnings and practical applications, exploring set theory, model theory, recursion theory and constructivism, proof theory, logic's relation to computer science, and other subjects. 1981 edition, reissued by Dover in 1993 with a new Postscript by the author.
The first edition of the Handbook of Philosophical Logic (four volumes) was published in the period 1983-1989 and has proven to be an invaluable reference work to both students and researchers in formal philosophy, language and logic. The second edition of the Handbook is intended to comprise some 18 volumes and will provide a very up-to-date authoritative, in-depth coverage of all major topics in philosophical logic and its applications in many cutting-edge fields relating to computer science, language, argumentation, etc. The volumes will no longer be as topic-oriented as with the first edition because of the way the subject has evolved over the last 15 years or so. However the volumes will follow some natural groupings of chapters. Audience: Students and researchers whose work or interests involve philosophical logic and its applications
Proceedings of the 1996 European Summer Meeting of the Association for Symbolic Logic, held in San Sebastian, Spain.
This volume features the latest scientific developments in the fields of computability theory and logical foundations of mathematics as well as applications. The scope involves the topics of Computability Theory, Reverse Mathematics, Nonstandard Analysis, Proof Theory, Set Theory, Philosophy of Mathematics, Constructive Mathematics, Theory of Randomness and Computational Complexity Theory.
This book constitutes the refereed proceedings of the 7th International Conference on Typed Lambda Calculi and Applications, TLCA 2005, held in Nara, Japan in April 2005. The 27 revised full papers presented together with 2 invited papers were carefully reviewed and selected from 61 submissions. The volume reports research results on all current aspects of typed lambda calculi, ranging from theoretical and methodological issues to applications in various contexts.
First of two volumes providing a comprehensive guide to mathematical logic.
The papers presented in this volume examine topics of central interest in contemporary philosophy of logic. They include reflections on the nature of logic and its relevance for philosophy today, and explore in depth developments in informal logic and the relation of informal to symbolic logic, mathematical metatheory and the limiting metatheorems, modal logic, many-valued logic, relevance and paraconsistent logic, free logics, extensional v. intensional logics, the logic of fiction, epistemic logic, formal logical and semantic paradoxes, the concept of truth, the formal theory of entailment, objectual and substitutional interpretation of the quantifiers, infinity and domain constraints, the...