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)

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 ...

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.

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)

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 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)

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 ...

The Joint International Conference on Logic Programming, sponsored by the Association for Logic Programming, is a major forum for presentations of research, applications, and implementations in this important area of computer science. Logic programming is one of the most promising steps toward declarative programming and forms the theoretical basis of the programming language Prolog and its various extensions. Logic programming is also fundamental to work in artificial intelligence, where it has been used for nonmonotonic and commonsense (...) reasoning, expert systems implementation, deductive databases, and applications such as computer-aided manufacturing. Krzysztof R. Apt is project leader at the Centre for Mathematics and Computer Science in Amsterdam and part-time Professor in Computer Science at the University of Amsterdam. Topics covered: Theory Foundations. Programming Languages. Implementation. Programming Methodologies and Tools. Applications. Deductive Databases. Artificial Intelligence. Parallelism. (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)

The volume deals with the history of logic, the question of the nature of logic, the relation of logic and mathematics, modal or alternative logics (many-valued, relevant, paraconsistent logics) and their relations, including translatability, to classical logic in the Fregean and Russellian sense, and, more generally, the aim or aims of philosophy of logic and mathematics. Also explored are several problems concerning the concept of definition, non-designating terms, the interdependence of quantifiers, and the idea of (...) an assertion sign. The contributions concerned with Wittgenstein's investigations into the philosophy of logic and mathematics pursue issues relating to logical necessity, the undeniability of the law of the excluded middle, and the source of self-evidence, often characterized in the literature as the "rule-following considerations". Additionally, they examine Wittgenstein's attitudes towards the very idea of set-theory as a possible foundation for arithmetic. The volume also includes a number of contributions on specific issues concerning Wittgenstein's views on moral and religious judgements. (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.

This junior/senior level text is devoted to a study of first-order logic and its role in the foundations of mathematics: What is a proof? How can a proof be justified? To what extent can a proof be made a purely mechanical procedure? How much faith can we have in a proof that is so complex that no one can follow it through in a lifetime? The first substantial answers to these questions have only been obtained in this century. (...) The most striking results are contained in Goedel's work: First, it is possible to give a simple set of rules that suffice to carry out all mathematical proofs; but, second, these rules are necessarily incomplete - it is impossible, for example, to prove all true statements of arithmetic. The book begins with an introduction to first-order logic, Goedel's theorem, and model theory. A second part covers extensions of first-order logic and limitations of the formal methods. The book covers several advanced topics, not commonly treated in introductory texts, such as Trachtenbrot's undecidability theorem. Fraissé's elementary equivalence, and Lindstroem's theorem on the maximality of first-order logic. (shrink)

"Foundations of the Formal Sciences" is a series of interdisciplinary conferences in mathematics, philosophy, computer science and linguistics. The main goal is to reestablish the traditionally strong links between these areas of research that have been lost in the past decades. The second conference in the series had the subtitle "Applications of Mathematical Logic in Philosophy and Linguistics" and brought speakers from all parts of the Formal Sciences together to give a holistic view of how mathematical (...) methods can improve our philosophical and technical understanding of language and scientific discourse, ranging from the theoretical level up to applications in language recognition software. Audience: This volume is of interest to all formal philosophers and theoretical linguists. In addition to that, logicians interested in the applications of their field and logic students in mathematics, computer science, philosophy and linguistics can use the volume to broaden their knowledge of applications of logic. (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 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)

_Philosophical Approaches to the Foundations of Logic and Mathematics_ consists of eleven articles addressing various aspects of the "roots" of logic and mathematics, their basic concepts and the mechanisms that work in the practice of their use.

The concept of an operator is used in a variety of practical and theoretical areas. Operators, as both conceptual and physical entities, are found throughout the world as subsystems in nature, the human mind, and the manmade world. Operators, and what they operate, i.e., their substrates, targets, or operands, have a wide variety of forms, functions, and properties. Operators have explicit philosophical significance. On the one hand, they represent important ontological issues of reality. On the other hand, epistemological operators form (...) the basic mechanism of cognition. At the same time, there is no unified theory of the nature and functions of operators. In this work, we elaborate a detailed analysis of operators, which range from the most abstract formal structures and symbols in mathematics and logic to real entities, human and machine, and are responsible for effecting changes at both the individual and collective human levels. Our goal is to find what is common in physical objects called operators and abstract mathematical structures, with the name operator providing foundations for building a unified but flexible theory of operators. The paper concludes with some reflections on functionalism and other philosophical aspects of the ‘operation’ of operators. (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.