Mathematical Intuitionism

Author: Al'bert Grigor'evi_ Dragalin
Publisher: American Mathematical Soc.
ISBN: 9780821845202
Release Date: 1988-12-31
Genre: Mathematics

In the area of mathematical logic, a great deal of attention is now being devoted to the study of nonclassical logics. This book intends to present the most important methods of proof theory in intuitionistic logic and to acquaint the reader with the principal axiomatic theories based on intuitionistic logic.

Constructivity and Computability in Historical and Philosophical Perspective

Author: Jacques Dubucs
Publisher: Springer
ISBN: 9789401792172
Release Date: 2014-08-27
Genre: Philosophy

Ranging from Alan Turing’s seminal 1936 paper to the latest work on Kolmogorov complexity and linear logic, this comprehensive new work clarifies the relationship between computability on the one hand and constructivity on the other. The authors argue that even though constructivists have largely shed Brouwer’s solipsistic attitude to logic, there remain points of disagreement to this day. Focusing on the growing pains computability experienced as it was forced to address the demands of rapidly expanding applications, the content maps the developments following Turing’s ground-breaking linkage of computation and the machine, the resulting birth of complexity theory, the innovations of Kolmogorov complexity and resolving the dissonances between proof theoretical semantics and canonical proof feasibility. Finally, it explores one of the most fundamental questions concerning the interface between constructivity and computability: whether the theory of recursive functions is needed for a rigorous development of constructive mathematics. This volume contributes to the unity of science by overcoming disunities rather than offering an overarching framework. It posits that computability’s adoption of a classical, ontological point of view kept these imperatives separated. In studying the relationship between the two, it is a vital step forward in overcoming the disagreements and misunderstandings which stand in the way of a unifying view of logic.

Lectures on intuitionistic logic

Author: Anil Nerode
ISBN: CORNELL:31924074847165
Release Date: 1989

Intuitionistic logic has become ubiquitous in computer science. An important question is how to teach intuitionistic logic to computer science and mathematics students. We attempted to begin such an exposition in Nerode 1989 using Kripke models which allow us to represent states of knowledge about machines. This document is an introduction, without proofs, to the semantics of recursive realizability and the Curry-Howard isomorphism. This is the subject behind term extraction functional computer languages such as ML or NuPRL. Partial Contents: Orientation; Logical deduction and computation; Instuitionistic natural deduction; Heyting's semantics; Set theory and application; Curry-Howard isomorphism; Typed combinators; Second order propositional calculus; Polymorphic lambda calculus. (KR).

Lectures on Soft Computing and Fuzzy Logic

Author: Antonio Di Nola
Publisher: Springer Science & Business Media
ISBN: 3790813966
Release Date: 2001-07-31
Genre: Computers

The present volume collects selected papers arising from lectures delivered by the authors at the School on Fuzzy Logic and Soft Computing held during the years 1996/97/98/99 and sponsored by the Salerno University. The authors contributing to this volume agreed with editors to write down, to enlarge and, in many cases, to rethink their original lectures, in order to offer to readership, a more compact presentation of the proposed topics. The aim of the volume is to offer a picture, as a job in progress, of the effort that is coming in founding and developing soft computing's techniques. The volume contains papers aimed to report on recent results containing genuinely logical aspects of fuzzy logic. The topics treated in this area cover algebraic aspects of Lukasiewicz Logic, Fuzzy Logic as the logic of continuous t-norms, Intuitionistic Fuzzy Logic. Aspects of fuzzy logic based on similar ity relation are presented in connection with the problem of flexible querying in deductive database. Departing from fuzzy logic, some papers present re sults in Probability Logic treating computational aspects, results based on indishernability relation and a non commutative version of generalized effect algebras. Several strict applications of soft computing are presented in the book. Indeed we find applications ranging among pattern recognition, image and signal processing, evolutionary agents, fuzzy cellular networks, classi fication in fuzzy environments. The volume is then intended to serve as a reference work for foundational logico-algebraic aspect of Soft Computing and for concrete applications of soft computing technologies.

Mechanism Mentalism and Metamathematics

Author: J. Webb
Publisher: Springer Science & Business Media
ISBN: 9789401576536
Release Date: 2013-03-09
Genre: Philosophy

This book grew out of a graduate student paper [261] in which I set down some criticisms of J. R. Lucas' attempt to refute mechanism by means of G6del's theorem. I had made several such abortive attempts myself and had become familiar with their pitfalls, and especially with the double edged nature of incompleteness arguments. My original idea was to model the refutation of mechanism on the almost universally accepted G6delian refutation of Hilbert's formalism, but I kept getting stuck on questions of mathematical philosophy which I found myself having to beg. A thorough study of the foundational works of Hilbert and Bernays finally convinced me that I had all too naively and uncritically bought this refutation of formalism. I did indeed discover points of surprisingly close contact between formalism and mechanism, but also that it was possible to under mine certain strong arguments against these positions precisely by invok ing G6del's and related work. I also began to realize that the Church Turing thesis itself is the principal bastion protecting mechanism, and that G6del's work was perhaps the best thing that ever happened to both mechanism and formalism. I pushed these lines of argument in my dis sertation with the patient help of my readers, Raymond Nelson and Howard Stein. I would especially like to thank the latter for many valuable criticisms of my dissertation as well as some helpful suggestions for reor ganizing it in the direction of the present book.