This work is a sequel to our [16]. It is shown how Theorem 4 of [16], dealing with the translatability of HA(Heyting's arithmetic) into negationless arithmetic NA, can be extended to the case of intuitionistic arithmetic in higher types.

Published in 1903, this book was the first comprehensive treatise on the logical foundations of mathematics written in English. It sets forth, as far as possible without mathematical and logical symbolism, the grounds in favour of the view that mathematics and logic are identical. It proposes simply that what is commonly called mathematics are merely later deductions from logical premises. It provided the thesis for which _Principia Mathematica_ provided the detailed proof, and introduced the work of Frege to a wider (...) audience. In addition to the new introduction by John Slater, this edition contains Russell's introduction to the 1937 edition in which he defends his position against his formalist and intuitionist critics. (shrink)

This work is a sequel to our [16]. It is shown how Theorem 4 of [16], dealing with the translatability of HA(Heyting's arithmetic) into negationless arithmetic NA, can be extended to the case of intuitionistic arithmetic in higher types.

The present volume is intended as an all-round introduction to constructivism. Here constructivism is to be understood in the wide sense, and covers in particular Brouwer's intuitionism, Bishop's constructivism and A.A. Markov's constructive recursive mathematics. The ending "-ism" has ideological overtones: "constructive mathematics is the (only) right mathematics"; we hasten, however, to declare that we do not subscribe to this ideology, and that we do not intend to present our material on such a basis.

The present work contains an axiomatic treatment of some parts of the restricted version of intuitionistic mathematics advocated by G. F. C. Griss, also known as negationless intuitionistic mathematics.Formal systems NPC, NA, and FIMN for negationless predicate logic, arithmetic, and analysis are proposed. Our Theorem 4 in Section 2 asserts the translatability of Heyting's arithmetic HAinto NA. The result can in fact be extended to a large class of intuitionistic theories based on HAand their negationless counterparts. For instance, in Section (...) 3 this is shown for Kleene's system of intuitionistic analysis FIMand our FIMN. (shrink)

in die operative Logik und Mathematik Zweite Auflage Springer-Verlag Berlin Heidelberg New York 1969 Paul Lorenzen o. Prof. der Philosophie an der Universitat Erlangen Geschaftsfilhrende Herausgeber: Prof. Dr. B. Eckmann Eidgenossische Technische Hochschule Zurich Prof. Dr. B. L. van cler Waerclen Mathematisches Institut der Universitat ZUrich ISBN 978-3-642-86519-0 ISBN 978-3-642-86518-3 (eBook) DOl 10.1007/978-3-642-86518-3 Aile Rechte vorbehalten. Kein Teil dieses Buches darf ohne schriftliche Genehmigung des Springer-Verlages ubersetzt oder in irgendeiner Form vervielfaltigt werden © by Springer-Verlag Berlin· Heidelberg 1955 und 1969 (...) Softcover reprint of the hardcover 2nd edition 1969 Library of Congress Catalog Card Number 73-76724 Titel-Nr. 5061 Vorwort zur zweiten Auflage. Fiir die Neuauflage ist der Text nur unwesentlich geandert worden. Es ist - neben der Korrektur einiger Ungenauigkeiten - vor allem die Terminologie und Symbolik an meine spateren Arbeiten angeglichen. Obwohl ich - verstandlicherweise - jetzt die Ansatze der spateren Arbeiten fiir "sachgemaBer" halte, z. B. eine Logik der Dialoge statt einer Logik der Kalkiile, die Verwendung indefiniter Quantoren statt einer expliziten Konstruktion von Sprachschichten, enthalt diese Neu­ auflage den Inhalt der 1. Auflage unverandert. Der Leser kann also einen Vergleich mit meinen spateren Arbeiten (vgl. Literaturverzeichnis) seIber durchfiihren. Mein Dank gilt wiederum dem Verlag fiir seine entgegenkommende Mitarbeit bei der Vorbereitung dieser Neuauflage. Erlangen, den 1. November I968. PAUL LORENZEN. Vorwort zur ersten Auflage. (shrink)

The present work contains an axiomatic treatment of some parts of the restricted version of intuitionistic mathematics advocated by G. F. C. Griss, also known as negationless intuitionistic mathematics.Formal systems NPC, NA, and FIMN for negationless predicate logic, arithmetic, and analysis are proposed. Our Theorem 4 in Section 2 asserts the translatability of Heyting's arithmetic HAinto NA. The result can in fact be extended to a large class of intuitionistic theories based on HAand their negationless counterparts. For instance, in Section (...) 3 this is shown for Kleene's system of intuitionistic analysis FIMand our FIMN. (shrink)