Although Kant envisaged a prominent role for logic in the argumentative structure of his Critique of pure reason, logicians and philosophers have generally judged Kant's logic negatively. What Kant called `general' or `formal' logic has been dismissed as a fairly arbitrary subsystem of first order logic, and what he called `transcendental logic' is considered to be not a logic at all: no syntax, no semantics, no definition of validity. Against this, we argue that Kant's `transcendental logic' is a logic in (...) the strict formal sense, albeit with a semantics and a definition of validity that are vastly more complex than that of first order logic. The main technical application of the formalism developed here is a formal proof that Kant's Table of Judgements in §9 of the Critique of pure reason, is indeed, as Kant claimed, complete for the kind of semantics he had in mind. This result implies that Kant's 'general' logic is after all a distinguished subsystem of first order logic, namely what is known as geometric logic. (shrink)

In this paper, we offer a Piagetian perspective on the construction of the logico-mathematical schemas which embody our knowledge of logic and mathematics. Logico-mathematical entities are tied to the subject's activities, yet are so constructed by reflective abstraction that they result from sensorimotor experience only via the construction of intermediate schemas of increasing abstraction. The axiom set does not exhaust the cognitive structure (schema network) which the mathematician thus acquires. We thus view truth not as something to be defined within (...) the closed world of a formal system but rather in terms of the schema network within which the formal system is embedded. We differ from Piaget in that we see mathematical knowledge as based on social processes of mutual verification which provide an external drive to any necessary dynamic of reflective abstraction within the individual. From this perspective, we argue that axiom schemas tied to a preferred interpretation may provide a necessary intermediate stage of reflective abstraction en route to acquisition of the ability to use formal systems in abstracto. (shrink)

Using a slight generalization, due to Palmgren, of sheaf semantics, we present a term-model construction that assigns a model to any first-order intuitionistic theory. A modification of this construction then assigns a nonstandard model to any theory of arithmetic, enabling us to reproduce conservation results of Moerdijk and Palmgren for nonstandard Heyting arithmetic. Internalizing the construction allows us to strengthen these results with additional transfer rules; we then show that even trivial transfer axioms or minor strengthenings of these rules destroy (...) conservativity over HA. The analysis also shows that nonstandard HA has neither the disjunction property nor the explicit definability property. Finally, careful attention to the complexity of our definitions allows us to show that a certain weak fragment of intuitionistic nonstandard arithmetic is conservative over primitive recursive arithmetic. (shrink)

claims that constructive mathematics is inadequate for spacetime physics and hence that constructive mathematics cannot be considered as an alternative to classical mathematics. He also argues that the contructivist must be guilty of a form of a priorism unless she adopts a strong form of anti-realism for science. Here I want to dispute both claims. First, even if there are non-constructive results in physics this does not show that adequate constructive alternatives could not be formulated. Secondly, the constructivist adopts a (...) 'philosophy first' approach that Hellman rejects. This deep difference means that the viability of constructive mathematics cannot yet be decided by determining whether current scientific theories require classical mathematics. We need to decide which approach is most appropriate before we can even determine how we should go about deciding whether we should be constructive or classical mathematicians. (shrink)

When Bishop published Foundations of Constructive Analysis he showed that it was possible to do ordinary analysis within a constructive framework. Bishop's reasons for doing his mathematics constructively are explicitly philosophical. In this paper, I will expound, examine, and amplify his philosophical arguments for constructivism in mathematics. In the end, however, I argue that Bishop's philosophical comments cannot be rounded out into an adequate philosophy of constructive mathematics.

Friedrich Waismann, a little-known mathematician and onetime student of Wittgenstein's, provides answers to problems that vexed Wittgenstein in his attempt to explicate the foundations of mathematics through an analysis of its practice. Waismann argues in favor of mathematical intuition and the reality of infinity with a Wittgensteinian twist. Waismann's arguments lead toward an approach to the foundation of mathematics that takes into consideration the language and practice of experts.

This is an introduction to, and survey of, the constructive approaches to pure mathematics. The authors emphasise the viewpoint of Errett Bishop's school, but intuitionism. Russian constructivism and recursive analysis are also treated, with comparisons between the various approaches included where appropriate. Constructive mathematics is now enjoying a revival, with interest from not only logicans but also category theorists, recursive function theorists and theoretical computer scientists. This account for non-specialists in these and other disciplines.

It is argued that Hellman's arguments purporting to demonstrate that constructive mathematics cannot cope with unbounded operators on a Hilbert space are seriously flawed, and that there is no evidence that his thesis is correct.

Problem: There is currently a great deal of mysticism, uncritical hype, and blind adulation of imaginary mathematical and physical entities in popular culture. We seek to explore what a radical constructivist perspective on mathematical entities might entail, and to draw out the implications of this perspective for how we think about the nature of mathematical entities. Method: Conceptual analysis. Results: If we want to avoid the introduction of entities that are ill-defined and inaccessible to verification, then formal systems need to (...) avoid introduction of potential and actual infinities. If decidability and consistency are desired, keep formal systems finite. Infinity is a useful heuristic concept, but has no place in proof theory. Implications: We attempt to debunk many of the mysticisms and uncritical adulations of Gödelian arguments and to ground mathematical foundations in intersubjectively verifiable operations of limited observers. We hope that these insights will be useful to anyone trying to make sense of claims about the nature of formal systems. If we return to the notion of formal systems as concrete, finite systems, then we can be clear about the nature of computations that can be physically realized. In practical terms, the answer is not to proscribe notions of the infinite, but to recognize that these concepts have a different status with respect to their verifiability. We need to demarcate clearly the realm of free creation and imagination, where platonic entities are useful heuristic devices, and the realm of verification, testing, and proof, where infinities introduce ill-defined entities that create ambiguities and undecidable, ill-posed sets of propositions. Constructivist content: The paper attempts to extend the scope of radical constructivist perspective to mathematical systems, and to discuss the relationships between radical constructivism and other allied, yet distinct perspectives in the debate over the foundations of mathematics, such as psychological constructivism and mathematical constructivism. (shrink)

This edited collection bridges the foundations and practice of constructive mathematics and focuses on the contrast between the theoretical developments, which have been most useful for computer science (ie: constructive set and type theories), and more specific efforts on constructive analysis, algebra and topology. Aimed at academic logician, mathematicians, philosophers and computer scientists with contributions from leading researchers, it is up to date, highly topical and broad in scope.

We approach the philosophy of mathematics via a discussion of the differences between classical mathematics and constructive mathematics, arguing that each is a valid activity within its own context.

An extension of intuitionism to empirical discourse, a project most seriously taken up by Dummett and Tennant, requires an empirical negation whose strength lies somewhere between classical negation (‘It is unwarranted that. . . ’) and intuitionistic negation (‘It is refutable that. . . ’). I put forward one plausible candidate that compares favorably to some others that have been propounded in the literature. A tableau calculus is presented and shown to be strongly complete.

to constructive systems is significant for contemporary metaphysics. However, many are surprised by these results, having learned that the Axiom of Choice (AC) is constructively valid. Indeed, even among specialists there were, until recently, reasons for puzzlement-rival versions of Intuitionistic Type Theory, one where (AC) is valid, another where it implies classical logic. This paper accessibly explains the situation, puts the issues in a broader setting by considering other choice principles, and draws philosophical morals for the understanding of quantification, choice (...) principles, and the prospects for constructivism. (shrink)

Crispin Wright joins the ranks of those who have sought to refute mechanist theories of mind by invoking Gödel's Incompleteness Theorems. His predecessors include Gödel himself, J. R. Lucas and, most recently, Roger Penrose. The aim of this essay is to show that, like his predecessors, Wright, too, fails to make his case, and that, indeed, he fails to do so even when judged by standards of success which he himself lays down.

This is a long-awaited new edition of one of the best known Oxford Logic Guides. The book gives an informal but thorough introduction to intuitionistic mathematics, leading the reader gently through the fundamental mathematical and philosophical concepts. The treatment of various topics has been completely revised for this second edition. Brouwer's proof of the Bar Theorem has been reworked, the account of valuation systems simplified, and the treatment of generalized Beth Trees and the completeness of intuitionistic first-order logic rewritten. Readers (...) are assumed to have some knowledge of classical formal logic and a general awareness of the history of intuitionism. (shrink)

This is a survey of Gödel's perennial preoccupations with the limits of finitism, its relations to constructivity, and the significance of his incompleteness theorems for Hilbert's program, using his published and unpublished articles and lectures as well as the correspondence between Bernays and Gödel on these matters. There is also an important subtext, namely the shadow of Hilbert that loomed over Gödel from the beginning to the end.

We introduce a constructive model of selective belief revision in which it is possible to accept only a part of the input information. A selective revision operator ο is defined by the equality K ο α = K * f(α), where * is an AGM revision operator and f a function, typically with the property ⊢ α → f(α). Axiomatic characterizations are provided for three variants of selective revision.

This paper examines the problem of extending the programme of mathematical constructivism to applied mathematics. I am not concerned with the question of whether conventional mathematical physics makes essential use of the principle of excluded middle, but rather with the more fundamental question of whether the concept of physical infinity is constructively intelligible. I consider two kinds of physical infinity: a countably infinite constellation of stars and the infinitely divisible space-time continuum. I argue (contrary to Hellman) that these do not. (...) pose any insuperable problem for constructivism, and that constructivism may have a useful new perspective to offer on physics. (shrink)

The theme « Truth and Certainty » is reminiscent of Hegel’s dialectic of prominent in the Phänomenologie des Geistes, but I want to treat it from a different angle in the perspective of the constructivist stance in the foundations of logic and mathematics. Although constructivism stands in opposition to mathematical realism, it is not to be considered as an idealist alternative in the philosophy of mathematics. It is true that Brouwer’s intuitionism, as a variety of constructivism, (...) has idealistic overtones, but my main concern in this paper is located in the mathematical tradition of constructive mathematics from the Greeks to Fermat, Gauss and Kronecker, and from the logical side, in the finitist doctrine of Hilbert and his followers. (shrink)

Prolegomena It is fitting to begin this book on intuitionistic type theory by putting the subject matter into perspective. The purpose of this chapter is to ...

A remembrance of Dummett's work on philosophy of mathematcis.

A plurality of approaches to foundational aspects of mathematics is a fact of life. Two loci of this are discussed here, the classicism/constructivism controversy over standards of proof, and the plurality of universes of discourse for mathematics arising in set theory and in category theory, whose problematic relationship is discussed. The first case illustrates the hypothesis that a sufficiently rich subject matter may require a multiplicity of approaches. The second case, while in some respects special to mathematics, raises issues of (...) ontological multiplicity and relativity encountered in the natural sciences as well. (shrink)

To what extent can constructive mathematics based on intuitionistc logic recover the mathematics needed for spacetime physics? Certain aspects of this important question are examined, both technical and philosophical. On the technical side, order, connectivity, and extremization properties of the continuum are reviewed, and attention is called to certain striking results concerning causal structure in General Relativity Theory, in particular the singularity theorems of Hawking and Penrose. As they stand, these results appear to elude constructivization. On the philosophical side, it (...) is argued that any mentalist-based radical constructivism suffers from a kind of neo-Kantian apriorism. It would be at best a lucky accident if objective spacetime structure mirrored mentalist mathematics. the latter would seem implicitly committed to a Leibnizian relationist view of spacetime, but is it doubtful if implementation of such a view would overcome the objection. As a result, an anti-realist view of physics seems forced on the radical constructivist. (shrink)

Context: As one of the major approaches within the philosophy of mathematics, constructivism is to be contrasted with realist approaches such as Platonism in that it takes human mental activity as the basis of mathematical content. Problem: Mathematical constructivism is mostly identified as one of the so-called foundationalist accounts internal to mathematics. Other perspectives are possible, however. Results: The notion of “meaning finitism” is exploited to tie together internal and external directions within mathematical constructivism. The various contributions to this issue (...) support our case in different ways. Constructivist content: Further contributions from a multitude of constructivist directions are needed for the puzzle of an integrative, overarching theory of mathematical practice to be solved. (shrink)

There is a review of how Mark Addis has made a case that it would require great effort for scant philosophical profit to formalize a notion of surveyability as a metamathematical predicate demarcating strict finitistic mathematics. It is then suggested how the notion of surveyability is useful in informal philosophizing about mathematics.

These questions are addressed in this volume by leading mathematical logicians and philosophers of mathematics.A special section is concerned with constructive ...

Context: It is often suggested that the methodology of the programme of Constructive Reverse Mathematics (CRM) can be sufficiently clarified by a thorough understanding of Brouwer’s intuitionism, Bishop’s constructive mathematics, and classical Reverse Mathematics. In this paper, the correctness of this suggestion is questioned. Method: We consider the notion of a mathematical programme in order to compare these schools of mathematics in respect of their methodologies. Results: Brouwer’s intuitionism, Bishop’s constructive mathematics, and classical Reverse Mathematics are historical influences upon the (...) origin and development of CRM, but do not give a full “methodological explanation” for it. Implications: Discussion on the methodological issues concerning CRM is needed. Constructivist content: It is shown that the characterisation and comparison of varieties of constructive mathematics should include methodological aspects (as understood from their practices). (shrink)

Call an argument a ‘happy sorites’ if it is a sorites argument with true premises and a false conclusion. It is a striking fact that although most philosophers working on the sorites paradox find it at prima facie highly compelling that the premises of the sorites paradox are true and its conclusion false, few (if any) of the standard theories on the issue ultimately allow for happy sorites arguments. There is one philosophical view, however, that appears to allow for at (...) least some happy sorites arguments: strict finitism in the philosophy of mathematics. My aim in this paper is to explore to what extent this appearance is accurate. As we shall see, this question is far from trivial. In particular, I will discuss two arguments that threaten to show that strict finitism cannot consistently accept happy sorites arguments, but I will argue that (given reasonable assumptions on strict finitistic logic) these arguments can ultimately be avoided, and the view can indeed allow for happy sorites arguments. (shrink)

In his paper ‘Wang’s Paradox’, Michael Dummett provides an argument for why strict finitism in mathematics is internally inconsistent and therefore an untenable position. Dummett’s argument proceeds by making two claims: (1) Strict finitism is committed to the claim that there are sets of natural numbers which are closed under the successor operation but nonetheless have an upper bound; (2) Such a commitment is inconsistent, even by finitistic standards. -/- In this paper I claim that Dummett’s argument fails. I question (...) both parts of Dummett’s argument, but most importantly I claim that Dummett’s argument in favour of the second claim crucially relies on an implicit assumption that Dummett does not acknowledge and that the strict finitist need not accept. (shrink)

, Rudolf Carnap became a chief proponent of the doctrine that the statements of intuitionism carry nonstandard intuitionistic meanings. This doctrine is linked to Carnap's ‘Principle of Tolerance’ and claims he made on behalf of his notion of pure syntax. From premises independent of intuitionism, we argue that the doctrine, the Principle, and the attendant claims are mistaken, especially Carnap's repeated insistence that, in defining languages, logicians are free of commitment to mathematical statements intuitionists would reject. I am grateful to (...) Nathan Carter, Gary Ebbs, Janet Folina, Luise Prior McCarty, Stewart Shapiro, Neil Tennant, Christopher Tillman, Beth Tropman, Wen-fang Wang, and two anonymous referees for their comments and suggestions. CiteULike Connotea Del.icio.us What's this? (shrink)

We put together several observations on constructive negation. First, Russell anticipated intuitionistic logic by clearly distinguishing propositional principles implying the law of the excluded middle from remaining valid principles. He stated what was later called Peirce’s law. This is important in connection with the method used later by Heyting for developing his axiomatization of intuitionistic logic. Second, a work by Dragalin and his students provides easy embeddings of classical arithmetic and analysis into intuitionistic negationless systems. In the last section, we (...) present in some detail a stepwise construction of negation which essentially concluded the formation of the logical base of the Russian constructivist school. Markov’s own proof of Markov’s principle (different from later proofs by Friedman and Dragalin) is described. (shrink)

Argues that classical arithmetic can be viewed as a proper part of intuitionistic arithmetic. Suggests that this largely neutralizes Dummett's argument for intuitionism in the case of arithmetic.

In this paper it is argued, firstly, that Kuhnian revolutions in mathematics are logically possible, in the sense of not being inconsistent with the nature of mathematics; and, secondly, that Kuhnian revolutions are actually possible, in the sense that a Kuhnian paradigm for mathematics can be exhibited which would, if accepted by the mathematical community, produce a full Kuhnian revolution. These two arguments depend on first proving that a shift from a classical conception of mathematics to an intuitionist conception would (...) be incommensurable, that is, that some classical statements, possessing meanings which cannot be preserved in the intuitionist language, would become unintelligible. The vague but intriguing thesis is then tentatively advanced that Kuhnian revolutions are even historically possible, in the sense that only what we might call 'accidental' historical factors may have prevented mathematics from undergoing just such a Kuhnian revolution in the early years of the twentieth century. (shrink)

Context: the position of pure and applied mathematics in the epistemic conflict between realism and relativism. Problem: To investigate the change in the status of mathematical knowledge over historical time: specifically, the shift from a realist epistemology to a relativist epistemology. Method: Two examples are discussed: geometry and number theory. It is demonstrated how the initially realist epistemic framework – with mathematics situated in a platonic ideal reality from where it governs our physical world – became untenable, with the advent (...) of non-Euclidean geometry and the increasing abstraction of the number concept. Results: Radical constructivism offers an alternative relativist epistemology, where mathematical knowledge is constructed by the individual knower in a context of an axiomatic base and subject items chosen at her discretion, for the purpose of modelling some part of her personal experiential world. Thus it can be expedient to view the practice of mathematics as a game, played by mathematicians according to agreed-upon rules. Constructivist content: The role played by constructivism in the formulation of mathematics is discussed. This is illustrated by the historical transition from a classical (platonic) view of mathematics, as having an objective existence of its own in the “realm of ideal forms,” to the now widely accepted modern view where one has a wide freedom to construct mathematical theories to model various parts of one’s experiential world. (shrink)

The main ideas behind Brouwer’s philosophy of Intuitionism are presented. Then some critical remarks against Intuitionism made by William Tait in “Against Intuitionism” [Journal of Philosophical Logic, 12, 173–195] are answered.

We study axiomatic extensions of the propositional constructive logic with strong negation having the disjunction property in terms of corresponding to them varieties of Nelson algebras. Any such varietyV is characterized by the property: (PQWC) ifA,B V, thenA×B is a homomorphic image of some well-connected algebra ofV.We prove:• each varietyV of Nelson algebras with PQWC lies in the fibre –1(W) for some varietyW of Heyting algebras having PQWC, • for any varietyW of Heyting algebras with PQWC the least and the (...) greatest varieties in –1(W) have PQWC, • there exist varietiesW of Heyting algebras having PQWC such that –1(W) contains infinitely many varieties (of Nelson algebras) with PQWC. (shrink)

In this paper I attempt to clarify a relatively little-studied aspect of Michael Dummett's argument for intuitionism: its use of the notion of ‘undecidable’ sentence. I give a new analysis of this concept in epistemic terms, with which I resolve some puzzles and questions about how it works in the anti-realist critique of classical logic.

This paper sets out to adduce visual evidence for Kroneckerian finitism by making perspicuous some of the insights that buttress Kronecker’s conception of arithmetization as a process aiming at disclosing the arithmetical essence enshrined in analytical formulas, by spotting discrete patterns through algorithmic fine-tuning. In the light of a fairly tractable case study, it is argued that Kronecker’s main tenet in philosophy of mathematics is not so much an ontological as a methodological one, inasmuch as highly demanding requirements regarding mathematical (...) understanding prevail over mere preemptive reductionism to whole numbers. (shrink)

An implication is a proposition, a consequence is a relation between propositions, and an inference is act of passage from certain premise-judgements to another conclusion-judgement: a proposition is true, a consequence holds, whereas an inference is valid. The paper examines interrelations, differences, refinements and linguistic renderings of these notions, as well as their history. The truth of propositions, respectively the holding of consequences, are treated constructively in terms of verification-objects. The validity of an inference is elucidated in terms of the (...) existence of a chain of immediately evident steps linking premises and conclusion. (shrink)

One criterion of constructive logics is the disjunction, property (DP). The Halldén-completeness is a weak DP, and is related to the relevance principle and variable separation. This concept is well-understood in the case of propositional logics. We extend this notion to predicate logics. Then three counterparts naturally arise. We discuss relationships between these properties and meet-irreducibility in the lattice of logics.

Gödel regarded the Dialectica interpretation as giving constructive content to intuitionism, which otherwise failed to meet reasonable conditions of constructivity. He founded his theory of primitive recursive functions, in which the interpretation is given, on the concept of computable function of finite type. I will (1) criticize this foundation, (2) propose a quite different one, and (3) note that essentially the latter foundation also underlies the Curry-Howard type theory, and hence Heyting's intuitionistic conception of logic. Thus the Dialectica interpretation (in (...) so far as its aim was to give constructive content to intuitionism) is superfluous. (shrink)

Weyl's inclination toward constructivism in the foundations of mathematics runs through his entire career, starting with Das Kontinuum. Why was Weyl inclined toward constructivism? I argue that Weyl's general views on foundations were shaped by a type of transcendental idealism in which it is held that mathematical knowledge must be founded on intuition. Kant and Fichte had an impact on Weyl but HusserFs transcendental idealism was even more influential. I discuss Weyl's views on vicious circularity, existence claims, meaning, the continuum (...) and choice sequences, and the intuitive-symbolic distinction against the background of his transcendental idealism and general intuitionism. (shrink)

The paper discusses the transition from informal concepts to mathematically precise notions; examples are given, and in some detail the case of lawless sequences, a concept of intuitionistic mathematics, is discussed. A final section comments on philosophical discussions concerning intuitionistic logic in connection with a ‘theory of meaning’.

Provability, Computability and Reflection.

Although Brouwer is well known for his Intuitionistic philosophy of mathematics, a constructivist philosophy which calls for restricted use of certain logical principles, there is much less awareness of the well-developed metaphysical basis which underlies those restrictions. In the first half of this paper I outline a basic interpretation of Brouwer's metaphysics, and then in the second half consider the compatibility of that metaphysics with Dummett's argument for a principled non-metaphysical approach to intuitionism. I conclude that once the variously misleading (...) accretions of the central concepts - metaphysics and logic - are set aside, Dummett and Brouwer's accounts can be seen to be at the very least compatible, if not complementar. (shrink)

Even though Husserl and Brouwer have never discussed each other's work, ideas from Husserl have been used to justify Brouwer's intuitionistic logic. I claim that a Husserlian reading of Brouwer can also serve to justify the existence of choice sequences as objects of pure mathematics. An outline of such a reading is given, and some objections are discussed.

Brouwer and Weyl recognized that the intuitive continuum requires a mathematical analysis of a kind that set theory is not able to provide. As an alternative, Brouwer introduced choice sequences. We first describe the features of the intuitive continuum that prompted this development, focusing in particular on the flow of internal time as described in Husserl's phenomenology. Then we look at choice sequences and their logic. Finally, we investigate the differences between Brouwer and Weyl, and argue that Weyl's conception of (...) choice sequences is defective on several counts. (shrink)

Can the straight line be analysed mathematically such that it does not fall apart into a set of discrete points, as is usually done but through which its fundamental continuity is lost? And are there objects of pure mathematics that can change through time? Mathematician and philosopher L.E.J. Brouwer argued that the two questions are closely related and that the answer to both is "yes''. To this end he introduced a new kind of object into mathematics, the choice sequence. But (...) other mathematicians and philosophers have been voicing objections to choice sequences from the start. This book aims to provide a sound philosophical basis for Brouwer's choice sequences by subjecting them to a phenomenological critique in the style of the later Husserl. (shrink)

We discuss a number of topics that are central in Brouwer's intuitionism. A complete treatment is beyond the scope of the paper, the reader may find it a useful introduction to Brouwer's papers.

We discuss the foundations of constructive mathematics, including recursive mathematics and intuitionism, in relation to classical mathematics. There are connections with the foundations of physics, due to the way in which the different branches of mathematics reflect reality. Many different axioms and their interrelationship are discussed. We show that there is a fundamental problem in BISH (Bishop’s school of constructive mathematics) with regard to its current definition of ‘continuous function’. This problem is closely related to the definition in BISH of (...) ‘locally compact’. Possible approaches to this problem are discussed. Topology seems to be a key to understanding many issues. We offer several new simplifying axioms, which can form bridges between the various branches of constructive mathematics and classical mathematics (‘reuniting the antipodes’). We give a simplification of basic intuitionistic theory, especially with regard to so-called ‘bar induction’. We then plead for a limited number of axiomatic systems, which differentiate between the various branches of mathematics. Finally, in the appendix we offer BISH an elegant topological definition of ‘locally compact’, which unlike the current definition is equivalent to the usual classical and/or intuitionistic definition in classical and intuitionistic mathematics, respectively. (shrink)

Given a classical theory T, a Kripke model K for the language L of T is called T-normal or locally PA just in case the classical L-structure attached to each node of K is a classical model of T. Van Dalen, Mulder, Krabbe, and Visser showed that Kripke models of Heyting Arithmetic (HA) over finite frames are locally PA, and that Kripke models of HA over frames ordered like the natural numbers contain infinitely many PA-nodes. We show that Kripke models (...) of the latter sort are in fact PA-normal. This result is extended to a somewhat larger class of frames. (shrink)

It is not unreasonable to think that the dispute between classical and intuitionistic mathematics might be unresolvable or 'faultless', in the sense of there being no objective way to settle it. If so, we would have a pretty case of relativism. In this note I argue, however, that there is in fact not even disagreement in any interesting sense, let alone a faultless one, in spite of appearances and claims to the contrary. A position I call classical pluralism is sketched, (...) intended to provide a coherent methodological stance towards the issue. Some reasons to recommend this stance are given, as well as some speculations as to why not everyone might want to follow the recommendation. (shrink)

Lucas and Penrose have contended that, by displaying how any characterisation of arithmetical proof programmable into a machine allows of diagonalisation, generating a humanly recognisable proof which eludes that characterisation, Gödel's incompleteness theorem rules out any purely mechanical model of the human intellect. The main criticisms of this argument have been that the proof generated by diagonalisation (i) will not be humanly recognisable unless humans can grasp the specification of the object-system (Benacerraf); and (ii) counts as a proof only on (...) the (unproven) hypothesis that the object system is consistent (Putnam). The present paper argues that criticism (ii) may be met head-on by an intuitionistic proponent of the anti-mechanist argument; and that criticism (i) is simply mistaken. However the paper concludes by questioning the sufficiency of the situation for an interesting anti-mechanist conclusion. (shrink)

We show that the following results in the classical theory of unbounded linear operators on Hilbert spaces can be proved within the framework of Bishop's constructive mathematics: the Kato-Rellich theorem, the spectral theorem, Stone's theorem, and the self-adjointness of the most common quantum mechanical operators, including the Hamiltonians of electro-magnetic fields with some general forms of potentials.