This volume comprises seven of the eight addresses presented before the International Colloquium on Mathematical Logic and Foundations of Set theory held at the Acadmey Building in Jerusalem, Israel, On November 11-14, 1968.

LN , so f lies in the elementary submodel M'. Clearly co 9 M' . It follows that 6 = {f(n): n em} is included in M'. Hence the ordinals of M' form an initial ...

The four volumes of this collection bring together some of the major contributions to the literature on Gottlob Frege (1848-1925), one of the most formative influences on the course of philosophy during the last hundred years. The first volume provided general assessments of Frege's work and examined its historical context. The present volume deals with Frege's contributions to logic and the foundations of mathematics. The essays are arranged in order of their first publication, providing insight into the historical (...) evolution of the Frege literature. Annotation copyright by Book News, Inc., Portland, OR. (shrink)

Graduate-level historical study is ideal for students intending to specialize in the topic, as well as those who only need a general treatment. Part I discusses traditional and symbolic logic. Part II explores the foundations of mathematics, emphasizing Hilbert’s metamathematics. Part III focuses on the philosophy of mathematics. Each chapter has extensive supplementary notes; a detailed appendix charts modern developments.

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)

We discuss the differences between first-order set theory and second-order logic as a foundation for mathematics. We analyse these languages in terms of two levels of formalization. The analysis shows that if second-order logic is understood in its full semantics capable of characterizing categorically central mathematical concepts, it relies entirely on informal reasoning. On the other hand, if it is given a weak semantics, it loses its power in expressing concepts categorically. First-order set theory and second-order (...) class='Hi'>logic are not radically different: the latter is a major fragment of the former. (shrink)

With material on his early philosophical views, his contributions to set theory and his work on nominalism and higher-order quantification, this book offers a uniquely expansive critical commentary on one of analytical philosophy’s great ...

This volume brings together those papers of mine which may be of interest not only to various specialists but also to philosophers. Many of my writings in mathematics were motivated by epistemological considerations; some papers originated in the critique of certain views that at one time dominated the discussions of the Vienna Cirele; others grew out of problems in teaching fundamental ideas of mathematics; sti II others were occasioned by personal relations with economists. Hence a wide range of subjects will (...) be discussed: epistemology, logic, basic concepts of pure and applied mathematics, philosophical ideas resulting from geometric studies, mathematical didactics and, finally, economics. The papers also span a period of more than fifty years. What unifies the various parts of the book is the spirit of searching for the elarification of basic concepts and methods and of articulating hidden ideas and tacit procedures. Part 1 ineludes papers published about 1930 which expound an idea that Carnap, after a short period of opposition in the Cirele, fully adopted ; and, under the name "Princip/e of To/erance", he eloquently formulated it in great generality in his book, Logica/ Syntax of Language, through which it was widely disseminated. "The New Logic" in Chapter 1 furthermore ineludes the first report to a larger public of Godel's epochal discovery presented among the great logic results of ali time. Chapter 2 is a translation of an often quoted 1930 paper presenting a detailed exposition and critique of intuitionism. (shrink)

This volume presents the proceedings from the Eleventh Brazilian Logic Conference on Mathematical Logic held by the Brazilian Logic Society in Salvador, Bahia, Brazil. The conference and the volume are dedicated to the memory of professor Mario Tourasse Teixeira, an educator and researcher who contributed to the formation of several generations of Brazilian logicians. Contributions were made from leading Brazilian logicians and their Latin-American and European colleagues. All papers were selected by a careful refereeing processs and (...) were revised and updated by their authors for publication in this volume. There are three sections: Advances in Logic, Advances in Theoretical Computer Science, and Advances in Philosophical Logic. Well-known specialists present original research on several aspects of model theory, proof theory, algebraic logic, category theory, connections between logic and computer science, and topics of philosophical logic of current interest. Topics interweave proof-theoretical, semantical, foundational, and philosophical aspects with algorithmic and algebraic views, offering lively high-level research results. (shrink)

This is volume ten in Reidel's Vienna Circle Collection. Twenty-six papers written during the period 1921-1978 are included, together with a bibliography of the author's works, a list of his principal dates, and a list of his fields of research. Seven papers are on logic and foundations of mathematics, twelve have to do with the improvement of mathematical notation and the teaching of mathematics, four are concerned with philosophical ramifications of geometric ideas, one is memoir about the (...) author's relations with L. E. J. Brouwer during 1925-1929, and two treat issues in the foundations of economics. Nine of the selections date from 1939 and before and the rest from 1952 and after. (shrink)

This textbook is a second edition of the successful, Mathematical Logic: On Numbers, Sets, Structures, and Symmetry. It retains the original two parts found in the first edition, while presenting new material in the form of an added third part to the textbook. The textbook offers a slow introduction to mathematical logic, and several basic concepts of model theory, such as first-order definability, types, symmetries, and elementary extensions. Part I, Logic Sets, and Numbers, shows how (...) mathematical logic is used to develop the number structures of classical mathematics. All necessary concepts are introduced exactly as they would be in a course in mathematical logic; but are accompanied by more extensive introductory remarks and examples to motivate formal developments. The second part, Relations, Structures, Geometry, introduces several basic concepts of model theory, such as first-order definability, types, symmetries, and elementary extensions, and shows how they are used to study and classify mathematical structures. The added Part III to the book is closer to what one finds in standard introductory mathematical textbooks. Definitions, theorems, and proofs that are introduced are still preceded by remarks that motivate the material, but the exposition is more formal, and includes more advanced topics. The focus is on the notion of countable categoricity, which analyzed in detail using examples from the first two parts of the book. This textbook is suitable for graduate students in mathematical logic and set theory and will also be of interest to mathematicians who know the technical aspects of the subject, but are not familiar with its history and philosophical background. (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 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 book is dedicated to a classic presentation of the theory of computable functions in the context of the foundations of mathematics. Part I motivates the study of computability with discussions and readings about the crisis in the foundations of mathematics in the early 20th century, while presenting the basic ideas of whole number, function, proof, and real number. Part II starts with readings from Turing and Post leading to the formal theory of recursive functions. Part III presents (...) sufficient formal logic to give a full development of Gödel's incompleteness theorems. Part IV considers the significance of the technical work with a discussion of Church's Thesis and readings on the foundations of mathematics. This new edition contains the timeline "Computability and Undecidability" as well as the essay "On mathematics". (shrink)

Markov, A. A. On constructive mathematics.--Ceĭtin, G. S. Mean value theorems in constructive analysis.--Zaslavskiĭ, I. D. and Ceĭtlin, G. S. On singular coverings and properties of constructive functions connected with them.--Maslov, S. Ju. Certain properties of E. L. Post's apparatus of canonical calculi.--Zaslavskiĭ, I. D. Graph schemes with memory.

The prime purpose of this paper is, first, to restore to discourse-bound occasion sentences their rightful central place in semantics and secondly, taking these as the basic propositional elements in the logical analysis of language, to contribute to the development of an adequate logic of occasion sentences and a mathematical (Boolean) foundation for such a logic, thus preparing the ground for more adequate semantic, logical and mathematical foundations of the study of natural language. Some of (...) the insights elaborated in this paper have appeared in the literature over the past thirty years, and a number of new developments have resulted from them. The present paper aims at providing an integrated conceptual basis for this new development in semantics. In Section 1 it is argued that the reduction by translation of occasion sentences to eternal sentences, as proposed by Russell and Quine, is semantically and thus logically inadequate. Natural language is a system of occasion sentences, eternal sentences being merely boundary cases. The logic has fewer tasks than is standardly assumed, as it excludes semantic calculi, which depend crucially on information supplied by cognition and context and thus belong to cognitive psychology rather than to logic. For sentences to express a proposition and thus be interpretable and informative, they must first be properly anchored in context. A proposition has a truth value when it is, moreover, properly keyed in the world, i.e. is about a situation in the world. Section 2 deals with the logical properties of natural language. It argues that presuppositional phenomena require trivalence and presents the trivalent logic ${\rm PPC}_{3}$ , with two kinds of falsity and two negations. It introduces the notion of Σ-space for a sentence A (or / A /, the set of situations in which A is true) as the basis of logical model theory, and the notion of / ${\bf P}^{A}$ / (the Σ-space of the presuppositions of A), functioning as a 'private' subuniverse for / A /. The trivalent Kleene calculus is reinterpreted as a logical account of vagueness, rather than of presupposition. ${\rm PPC}_{3}$ and the Kleene calculus are refinements of standard bivalent logic and can be combined into one logical system. In Section 3 the adequacy of ${\rm PPC}_{3}$ as a truth-functional model of presupposition is considered more closely and given a Boolean foundation. In a noncompositional extended Boolean algebra, three operators are defined: $1_{a}$ for the conjoined presuppositions of a, ã for the complement of a within $1_{a}$ , and â for the complement of $1_{a}$ within Boolean 1. The logical properties of this extended Boolean algebra are axiomatically defined and proved for all possible models. Proofs are provided of the consistency and the completeness of the system. Section 4 is a provisional exploration of the possibility of using the results obtained for a new discourse-dependent account of the logic of modalities in natural language. The overall result is a modified and refined logical and model-theoretic machinery, which takes into account both the discourse-dependency of natural language sentences and the necessity of selecting a key in the world before a truth value can be assigned. (shrink)

Pierre de Fermat is known as the inventor of modern number theory. He invented–improved many methods useful in this discipline. Fermat often claimed to have proved his most difficult theorems thanks to a method of his own invention: the infinite descent. He wrote of numerous applications of this procedure. Unfortunately, he left only one almost complete demonstration and an outline of another demonstration. The outline concerns the theorem that every prime number of the form 4n + 1 is the sum (...) of two squares. In this paper, we analyse a recent proof of this theorem. It is interesting because: it follows all the elements of which Fermat wrote in his outline; it represents a good introduction to all logical nuances and mathematical variants concerning this method of which Fermat spoke. The assertions by Fermat will also be framed inside their historical context. Therefore, the aims of this paper are related to the history of mathematics and to the logic of proof-methods. (shrink)

Comprehensive account of constructive theory of first-order predicate calculus. Covers formal methods including algorithms and epi-theory, brief treatment of Markov’s approach to algorithms, elementary facts about lattices and similar algebraic systems, more. Philosophical and reflective as well as mathematical. Graduate-level course. 1963 ed. Exercises.

Hermann Grassmann's Ausdehnungslehre of 1844 and his Lehrbuch der Arithmetik of 1861 are landmark works in mathematics; the former not only developed new mathematical fields but also both contributed to the setting of modern standards of rigor. Their very modernity, however, may obscure features of Grassmann's view of the foundations of mathematics that were not adopted since. Grassmann gave a key role to the learning of mathematics that affected his method of presentation, including his emphasis on making initial (...) assumptions explicit. In order to better understand this less well-known aspect of his work it will help to examine why some commentators have overlooked his theme of unifying logic, pedagogy and foundations, while others have recognised it. (shrink)

In computational complexity theory, decision problems are divided into complexity classes based on the amount of computational resources it takes for algorithms to solve them. In theoretical computer science, it is commonly accepted that only functions for solving problems in the complexity class P, solvable by a deterministic Turing machine in polynomial time, are considered to be tractable. In cognitive science and philosophy, this tractability result has been used to argue that only functions in P can feasibly work as computational (...) models of human cognitive capacities. One interesting area of computational complexity theory is descriptive complexity, which connects the expressive strength of systems of logic with the computational complexity classes. In descriptive complexity theory, it is established that only first-order (classical) systems are connected to P, or one of its subclasses. Consequently, second-order systems of logic are considered to be computationally intractable, and may therefore seem to be unfit to model human cognitive capacities. This would be problematic when we think of the role of logic as the foundations of mathematics. In order to express many important mathematical concepts and systematically prove theorems involving them, we need to have a system of logic stronger than classical first-order logic. But if such a system is considered to be intractable, it means that the logical foundation of mathematics can be prohibitively complex for human cognition. In this paper I will argue, however, that this problem is the result of an unjustified direct use of computational complexity classes in cognitive modelling. Placing my account in the recent literature on the topic, I argue that the problem can be solved by considering computational complexity for humanly relevant problem solving algorithms and input sizes. (shrink)

In this paper the authors develop a logic of concepts within a mathematical linguistic theory. In the set of concepts defined in a belief system, the order relationship and Boolean algebra of the concepts are considered. This study is designed to obtain a tool, which is the metatheoretical base of this type of theory.