Colour has often been supposed to be a subjective property, a property to be analysed orretly in terms of the phenomenological aspects of human expereince. In contrast with subjectivism, an objectivist analysis of color takes color to be a property objects possess in themselves, independently of the character of human perceptual expereince. David Hilbert defends a form of objectivism that identifies color with a physical property of surfaces - their spectral reflectance. This analysis of color is shown to provide (...) a more adequate account of the features of human color vision than its subjectivist rivals. The author's account of colro also recognises that the human perceptual system provides a limited and idiosyncratic picture of the world. These limitations are shown to be consistent with a realist account of colour and to provide the necessary tools for giving an analysis of common sense knowledge of color phenomena. (shrink)

Neuroethological investigations of mammalian and avian auditory systems have documented species-specific specializations for processing complex acoustic signals that could, if viewed in abstract terms, have an intriguing and striking relevance for human speech sound categorization and representation. Each species forms biologically relevant categories based on combinatorial analysis of information-bearing parameters within the complex input signal. This target article uses known neural models from the mustached bat and barn owl to develop, by analogy, a conceptualization of human processing of consonant (...) plus vowel sequences that offers a partial solution to the noninvariance dilemma the locus equations orderly output constraint”) is hypothesized based on the notion of an evolutionarily conserved auditory-processing strategy. High correlation and linearity between critical parameters in the speech signal that help to cue place of articulation categories might have evolved to satisfy a preadaptation by mammalian auditory systems for representing tightly correlated, linearly related components of acoustic signals. (shrink)

The most frequent criticism of the target article is the lack of clear separability of human speech data relative to neuroethological data. A rationalization for this difference was sought in the tinkered nature of such new adaptations as human speech. Basic theoretical premises were defended, and new data were presented to support a claim that speakers maintain a low-noise relationship between F2 transition onset and offset frequencies for stops in pre-vocalic positions through articulatory choices. It remains a viable and testable (...) hypothesis that the phenomenon described by the locus equation is a functional adaptation of production mechanisms to processing preferences of the auditory system. (shrink)

Multiple-conclusion Hilbert-style systems allow us to finitely axiomatize every logic defined by a finite matrix. Having obtained such axiomatizations for Paraconsistent Weak Kleene and Bochvar–Kleene logics, we modify them by replacing the multiple-conclusion rules with carefully selected single-conclusion ones. In this way we manage to introduce the first finite Hilbert-style single-conclusion axiomatizations for these logics.

Most Gentzen systems arising in logic contain few axiom schemata and many rule schemata. Hilbert systems, on the other hand, usually contain few proper inference rules and possibly many axioms. Because of this, the two notions tend to serve different purposes. It is common for a logic to be specified in the first instance by means of a Gentzen calculus, whereupon a Hilbert-style presentation ‘for’ the logic may be sought—or vice versa. Where this has occurred, the (...) word ‘for’ has taken on several different meanings, partly because the Gentzen separator ⇒ can be interpreted intuitively in a number of ways. Here ⇒ will be denoted less evocatively by ⊲.In this paper we aim to discuss some of the useful ways in which Gentzen and Hilbert systems may correspond to each other. Actually, we shall be concerned with thededucibility relationsof the formal systems, as it is these that are susceptible to transformation in useful ways. To avoid potential confusion, we shall speak of Hilbert and Gentzenrelations. By aHilbert relationwe mean any substitution-invariant consequence relation onformulas—this comes to the same thing as the deducibility relation of a set of Hilbert-style axioms and rules. By aGentzen relationwe mean the fully fledged generalization of this notion in whichsequentstake the place of single formulas. In the literature, Hilbert relations are often referred to assentential logics. Gentzen relations as defined here are their exactsequentialcounterparts. (shrink)

This paper shows Hilbert system (C+J)-, given by del Cerro and Herzig (1996) is semantically incomplete. This system is proposed as a proof theory for Kripke semantics for a combination of intuitionistic and classical propositional logic, which is obtained by adding the natural semantic clause of classical implication into intuitionistic Kripke semantics. Although Hilbert system (C+J)- contains intuitionistic modus ponens as a rule, it does not contain classical modus ponens. This paper gives an argument ensuring that the system (...) (C+J)- is semantically incomplete because of the absence of classical modus ponens. Our method is based on the logic of paradox, which is a paraconsistent logic proposed by Priest (1979). (shrink)

Traditionally, there has been a clear distinction between classical systems and quantum systems, particularly in the mathematical theories used to describe them. In our recent work on macroscopic quantum systems, this distinction has become blurred, making a unified mathematical formulation desirable, so as to show up both the similarities and the fundamental differences between quantum and classical systems. This paper serves this purpose, with explicit formulations and a number of examples in the form of superconducting circuit (...) systems. We introduce three classes of physical systems with finite degrees of freedom: classical, standard quantum, and mixed quantum, and present a unified Hilbert space treatment of all three types of system. We consider the classical/quantum divide and the relationship between standard quantum and mixed quantum systems, illustrating the latter with a derivation of a superselection rule in superconducting systems. (shrink)

This paper deals with the axiomatizability problem for the matrix-based logics RMQ − and RMQ *. We present a Hilbert-style axiom system for RMQ −, and a quasi-axiomatization based on it for RMQ *. We further compare these logics to different well-known modal logics, and assess its status as relevance logics.

Structural reasoning is simply reasoning that is governed exclusively by structural rules. In this context a proof system can be said to be structural if all of its inference rules are structural. A logic is considered to be structuralizable if it can be equipped with a sound and complete structural proof system. This paper provides a general formulation of the problem of structuralizability of a given logic, giving specific consideration to a family of logics that are based on the Dunn–Belnap (...) four-valued semantics. It is shown how sound and complete structural proof systems can be constructed for a spectrum of logics within different logical frameworks. (shrink)

Recentemente diversi studi hanno mostrato come la distanza tra i Grundlagen e le precedenti pubblicazioni di Hilbert non sia tanto abissale come ritenuto in passato, ma vi sia una significativa consequenzialità con la teoria dei campi numerici. Nel ribadire questa visione, si intende mostrare come i risultati ottenuti da Hilbert, in particolare sui teoremi di Pappo e di Desargues, siano conseguenza di una ricerca più ampia sulla possibilità di introdurre all’interno della geometria dei sistemi numerici atti a coordinatizzare (...) il piano o lo spazio. Nello sviluppo della ricerca hanno avuto un ruolo determinante la scoperta di Hurwitz delle uniche quattro algebre di divisione normate e le idee maturate, già agli inizi della sua carriera, sulla finitezza degli strumenti da utilizzare in geometria, in particolare la rinuncia al concetto di continuità e la limitazione a sistemi numerici ordinati e numerabili. Nelle conclusioni dei Grundlagen, Hilbert rimarca l’importanza di dimostrare l’impossibilità delle assunzioni, tra cui l’impossibilità di determinare, attraverso solo relazioni geometriche di incidenza, dei sistemi numerici ordinati che abbiano le stesse proprietà dei quaternioni e degli ottonioni rispetto alle operazioni dell’aritmetica. (shrink)

David Hilbert’s early foundational views, especially those corresponding to the 1890s, are analysed here. I consider strong evidence for the fact that Hilbert was a logicist at that time, following upon Dedekind’s footsteps in his understanding of pure mathematics. This insight makes it possible to throw new light on the evolution of Hilbert’s foundational ideas, including his early contributions to the foundations of geometry and the real number system. The context of Dedekind-style logicism makes it possible to (...) offer a new analysis of the emergence of Hilbert’s famous ideas on mathematical existence, now seen as a revision of basic principles of the “naive logic” of sets. At the same time, careful scrutiny of his published and unpublished work around the turn of the century uncovers deep differences between his ideas about consistency proofs before and after 1904. Along the way, we cover topics such as the role of sets and of the dichotomic conception of set theory in Hilbert’s early axiomatics, and offer detailed analyses of Hilbert’s paradox and of his completeness axiom (Vollständigkeitsaxiom). (shrink)

Hilbert’s program was an ambitious and wide-ranging project in the philosophy and foundations of mathematics. In order to “dispose of the foundational questions in mathematics once and for all,” Hilbert proposed a two-pronged approach in 1921: first, classical mathematics should be formalized in axiomatic systems; second, using only restricted, “finitary” means, one should give proofs of the consistency of these axiomatic systems. Although Gödel’s incompleteness theorems show that the program as originally conceived cannot be carried out, (...) it had many partial successes, and generated important advances in logical theory and metatheory, both at the time and since. The article discusses the historical background and development of Hilbert’s program, its philosophical underpinnings and consequences, and its subsequent development and influences since the 1930s. (shrink)

A Hilbert algebra with supremum is a Hilbert algebra where the associated order is a join-semilattice. This class of algebras is a variety and was studied in Celani and Montangie . In this paper we shall introduce and study the variety of $${H_{\Diamond}^{\vee}}$$ H ◊ ∨ -algebras, which are Hilbert algebras with supremum endowed with a modal operator $${\Diamond}$$ ◊ . We give a topological representation for these algebras using the topological spectral-like representation for Hilbert algebras (...) with supremum given in Celani and Montangie . We will consider some particular varieties of $${H_{\Diamond}^{\vee}}$$ H ◊ ∨ -algebras. These varieties are the algebraic counterpart of extensions of the implicative fragment of the intuitionistic modal logic $${\mathbf{IntK}_{\Diamond}}$$ IntK ◊ . We also determine the congruences of $${H_{\Diamond}^{\vee}}$$ H ◊ ∨ -algebras in terms of certain closed subsets of the associated space, and in terms of a particular class of deductive systems. These results enable us to characterize the simple and subdirectly irreducible $${H_{\Diamond}^{\vee }}$$ H ◊ ∨ -algebras. (shrink)

We analyze the variety of A. Monteiro’s tetravalent modal algebras under the perspective of two logic systems naturally associated to it. Taking profit of the contrapositive implication introduced by A. Figallo and P. Landini, sound and complete Hilbert-style calculi for these logics are presented.

David Hilbert proposed his well-known Hilbert Program in the early 1920s for foundations of mathematics. The purpose of his program was to prove the consistency of mathematics by using the finitary methods and relying on axiomatic system. Thus, riddles and paradoxes related with the foundations of mathematics could be solved. Hilbert considers, formalizing whole mathematics in a consistent finite way depending on axioms, as an effort to develop a proof theory. So much so that any problems which (...) may occur in a mathematical system, including those related to infinity, will be solved. Hilbert begins with finite number of signs and rules and then proceeds to develop various proved consistent statements. From there, he continues to a higher-order mathematics that includes ideal objects. Hilbert's development of the program started in 1899 with the Foundations of Geometry, and completed by The Grounding of Elementary Number Theory in 1931. In this paper, we will exhibit the various stages and attempts of Hilbert to found the numbers. Our thesis states that Hilbert has always maintained an intuitive apprehension in these foundational attempts i.e. Hilbert advocates intuitional insight prior to any logical inference that makes it possible to found the numbers. Although Hilbert did not define himself as a formalist in any of his works, he was named as a formalist because of Brouwer's criticism of him. Hilbert’s emphasis on intuition reveals that a kind of formalism which is a mere play of signs can be associated with him. In this paper, we will also deal with the relations Hilbert established between signs, axioms, logic and intuition. (shrink)

This second part of a two-part essay discusses recent developments in the Brussels-Austin Group after the mid 1980s. The fundamental concerns are the same as in their similarity transformation approach (see Part I), but the contemporary approach utilizes rigged Hilbert space (whereas the older approach used Hilbert space). While the emphasis on nonequilibrium statistical mechanics remains the same, the use of similarity transformations shifts to the background. In its place arose an interest in the physical features of large (...) Poincaré systems, nonlinear dynamics and the mathematical tools necessary to analyze them. (shrink)

In the 1920s, David Hilbert proposed a research program with the aim of providing mathematics with a secure foundation. This was to be accomplished by first formalizing logic and mathematics in their entirety, and then showing---using only so-called finitistic principles---that these formalizations are free of contradictions. ;In the area of logic, the Hilbert school accomplished major advances both in introducing new systems of logic, and in developing central metalogical notions, such as completeness and decidability. The analysis of (...) unpublished material presented in Chapter 2 shows that a completeness proof for propositional logic was found by Hilbert and his assistant Paul Bernays already in 1917--18, and that Bernays's contribution was much greater than is commonly acknowledged. Aside from logic, the main technical contribution of Hilbert's Program are the development of formal mathematical theories and proof-theoretical investigations thereof, in particular, consistency proofs. In this respect Wilhelm Ackermann's 1924 dissertation is a milestone both in the development of the Program and in proof theory in general. Ackermann gives a consistency proof for a second-order version of primitive recursive arithmetic which, surprisingly, explicitly uses a finitistic version of transfinite induction up to www . He also gave a faulty consistency proof for a system of second-order arithmetic based on Hilbert's &egr;-substitution method. Detailed analyses of both proofs in Chapter 3 shed light on the development of finitism and proof theory in the 1920s as practiced in Hilbert's school. ;In a series of papers, Charles Parsons has attempted to map out a notion of mathematical intuition which he also brings to bear on Hilbert's finitism. According to him, mathematical intuition fails to be able to underwrite the kind of intuitive knowledge Hilbert thought was attainable by the finitist. It is argued in Chapter 4 that the extent of finitistic knowledge which intuition can provide is broader than Parsons supposes. According to another influential analysis of finitism due to W. W. Tait, finitist reasoning coincides with primitive recursive reasoning. The acceptance of non-primitive recursive methods in Ackermann's dissertation presented in Chapter 3, together with additional textual evidence presented in Chapter 4, shows that this identification is untenable as far as Hilbert's conception of finitism is concerned. Tait's conception, however, differs from Hilbert's in important respects, yet it is also open to criticisms leading to the conclusion that finitism encompasses more than just primitive recursive reasoning. (shrink)

In the 1920s, Ackermann and von Neumann, in pursuit of Hilbert's programme, were working on consistency proofs for arithmetical systems. One proposed method of giving such proofs is Hilbert's epsilon-substitution method. There was, however, a second approach which was not reflected in the publications of the Hilbert school in the 1920s, and which is a direct precursor of Hilbert's first epsilon theorem and a certain "general consistency result" due to Bernays. An analysis of the form (...) of this so-called "failed proof" sheds further light on an interpretation of Hilbert's programme as an instrumentalist enterprise with the aim of showing that whenever a "real" proposition can be proved by ?ideal? means, it can also be proved by "real", finitary means. (shrink)

The article explores the following question: which among the most often examined in the literature method of constructing Hilbert-type axiom systems for finite-valued propositional logics of Łukasi...

We investigate Hilbert’s varepsilon -calculus in the context of intuitionistic type theories, that is, within certain systems of intuitionistic higher-order logic. We determine the additional deductive strength conferred on an intuitionistic type theory by the adjunction of closed varepsilon -terms. We extend the usual topos semantics for type theories to the varepsilon -operator and prove a completeness theorem. The paper also contains a discussion of the concept of “partially defined‘ varepsilon -term. MSC: 03B15, 03B20, 03G30.

Hilbert's conference lectures during the year 1922, Neuebegründung der Mathematik. Erste Mitteilung and Die logischen Grundlagen der Mathematik (both are published in (Hilbert [1935] 1965) pp. 157-195), contain his first public presentation of an axiom system for propositional logic, or at least for a fragment of propositional logic, which is largely influenced by the study on logical woks of Frege and Russell during the previous years.The year 1922 is at the beginning of Hilbert's foundational program in its (...) definitive form. The final public presentation by Hilbert of an axiom system for propositional logic is contained in the 1934 book Grundlagen der Mathematik, I (Hilbert and Bernays [1934] 1968). Sequent .. (shrink)

The Hilbert program was actually a specific approach for proving consistency, a kind of constructive model theory. Quantifiers were supposed to be replaced by ε-terms. εxA(x) was supposed to denote a witness to ∃xA(x), or something arbitrary if there is none. The Hilbertians claimed that in any proof in a number-theoretic system S, each ε-term can be replaced by a numeral, making each line provable and true. This implies that S must not only be consistent, but also 1-consistent. Here (...) we show that if the result is supposed to be provable within S, a statement about all Pi-0-2 statements that subsumes itself within its own scope must be provable, yielding a contradiction. The result resembles Gödel's but arises naturally out of the Hilbert program itself. (shrink)

We discuss in this paper the question of the scope of the principle of tolerance about languages promoted in Carnap's The Logical Syntax of Language and the nature of the analogy between it and the rudimentary conventionalism purportedly exhibited in the work of Poincaré and Hilbert. We take it more or less for granted that Poincaré and Hilbert do argue for conventionalism. We begin by sketching Coffa's historical account, which suggests that tolerance be interpreted as a conventionalism that (...) allows us complete freedom to select whatever language we wish—an interpretation that generalizes the conventionalism promoted by Poincaré and Hilbert which allows us complete freedom to select whatever axiom system we wish for geometry. We argue that such an interpretation saddles Carnap with a theory of meaning that has unhappy consequences, a theory we believe he did not hold. We suggest that the principle of linguistic tolerance in fact has a more limited scope; but within that scope the analogy between tolerance and geometric conventionalism is quite tight. (shrink)

The fundamental problem on which Ilya Prigogine and the Brussels- Austin Group have focused can be stated briefly as follows. Our observations indicate that there is an arrow of time in our experience of the world (e.g., decay of unstable radioactive atoms like Uranium, or the mixing of cream in coffee). Most of the fundamental equations of physics are time reversible, however, presenting an apparent conflict between our theoretical descriptions and experimental observations. Many have thought that the observed arrow of (...) time was either an artifact of our observations or due to very special initial conditions. An alternative approach, followed by the Brussels-Austin Group, is to consider the observed direction of time to be a basic physical phenomenon due to the dynamics of physical systems. This essay focuses mainly on recent developments in the Brussels-Austin Group after the mid 1980s. The fundamental concerns are the same as in their earlier approaches (subdynamics, similarity transformations), but the contemporary approach utilizes rigged Hilbert space (whereas the older approaches used Hilbert space). While the emphasis on nonequilibrium statistical mechanics remains the same, their more recent approach addresses the physical features of large Poincar´. (shrink)

This paper introduces an axiomatisation for equational hybrid logic based on previous axiomatizations and natural deduction systems for propositional and first-order hybrid logic. Its soundness and completeness is discussed. This work is part of a broader research project on the development a general proof calculus for hybrid logics.

This paper studies proof systems for the logics of super-strict implication ST2–ST5, which correspond to C.I. Lewis’ systems S2–S5 freed of paradoxes of strict implication. First, Hilbert-style axiomatic systems are introduced and shown to be sound and complete by simulating STn in Sn and backsimulating Sn in STn, respectively(for n=2,...,5). Next, G3-style labelled sequent calculi are investigated. It is shown that these calculi have the good structural properties that are distinctive of G3-style calculi, that they are (...) sound and complete, and it is shown that the proof search for G3. ST2 is terminating and therefore the logic is decidable. (shrink)

The many-Hilbert-spaces theory of quantum measurements, which was originally proposed by S. Machida and the present author, is reviewed and developed. Dividing a typical quantum measurement in two successive steps, the first being responsible for spectral decomposition and the second for detection, we point out that the wave packet reduction by measurement takes place at the latter step, through interaction of an object system with one of the local systems of detectors. First we discuss the physics of the (...) detection process, using numerical simulations for a simple detector model, and then formulate a general theory of quantum measurements to give the wave packet reduction in an explicit form as a sort of phase transition. The derivation is based on the macroscopic nature of the local system, to be represented in a continuous direct sum of many Hilbert spaces, and on the finite-size effect of the local system, to give phase shifts proportional to size parameters. We give a definite criterion for examining any instrument as to whether it works well as a detector or not. Finally, we compare the present theory with famous measurement theories and propose a possible experimental test to discriminate it from others. A few solvable detector models are also discussed. (shrink)

This paper studies proof systems for the logics of super-strict implication \(\textsf{ST2}\) – \(\textsf{ST5}\), which correspond to C.I. Lewis’ systems \(\textsf{S2}\) – \(\textsf{S5}\) freed of paradoxes of strict implication. First, Hilbert-style axiomatic systems are introduced and shown to be sound and complete by simulating \(\textsf{STn}\) in \(\textsf{Sn}\) and backsimulating \(\textsf{Sn}\) in \(\textsf{STn}\), respectively (for \({\textsf{n}} =2, \ldots, 5\) ). Next, \(\textsf{G3}\) -style labelled sequent calculi are investigated. It is shown that these calculi have the good structural (...) properties that are distinctive of \(\textsf{G3}\) -style calculi, that they are sound and complete, and it is shown that the proof search for \(\mathsf {G3.ST2}\) is terminating and therefore the logic is decidable. (shrink)

In the first year of the twentieth century, in Gottingen, Husserl delivered two talks dealing with a problem that proved central in his philosophical development, that of imaginary elements in mathematics. In order to solve this problem Husserl introduced a logical notion, called “definiteness”, and variants of it, that are somehow related, he claimed, to Hilbert’s notions of completeness. Many different interpretations of what precisely Husserl meant by this notion, and its relations with Hilbert’s ones, have been proposed, (...) but no consensus has been reached. In this paper I approach this question afresh and thoroughly, taking into consideration not only the relevant texts and context, as others have also done before, but, more importantly, Husserl’s philosophy, his intuition-based epistemology in particular. Based on a system of clearly defined concepts that I here present, I reinforce an interpretation—definiteness as a form of syntactic completeness—that has, I believe, some advantages vis-à-vis alternative interpretations. It is in conformity with the available texts; it makes clear that Husserl’s notion of definiteness is indeed close to Hilbert’s notions of completeness; it solves the important problem of imaginaries for which it was created; and last, but not least, it fits naturally into Husserl’s system of concepts and ideas. (shrink)

In the first year of the twentieth century, in Gottingen, Husserl delivered two talks dealing with a problem that proved central in his philosophical development, that of imaginary elements in mathematics. In order to solve this problem Husserl introduced a logical notion, called “definiteness”, and variants of it, that are somehow related, he claimed, to Hilbert’s notions of completeness. Many different interpretations of what precisely Husserl meant by this notion, and its relations with Hilbert’s ones, have been proposed, (...) but no consensus has been reached. In this paper I approach this question afresh and thoroughly, taking into consideration not only the relevant texts and context, as others have also done before, but, more importantly, Husserl’s philosophy, his intuition-based epistemology in particular. Based on a system of clearly defined concepts that I here present, I reinforce an interpretation—definiteness as a form of syntactic completeness—that has, I believe, some advantages vis-à-vis alternative interpretations. It is in conformity with the available texts; it makes clear that Husserl’s notion of definiteness is indeed close to Hilbert’s notions of completeness; it solves the important problem of imaginaries for which it was created; and last, but not least, it fits naturally into Husserl’s system of concepts and ideas. (shrink)

Some of the most important developments of symbolic logic took place in the 1920s. Foremost among them are the distinction between syntax and semantics and the formulation of questions of completeness and decidability of logical systems. David Hilbert and his students played a very important part in these developments. Their contributions can be traced to unpublished lecture notes and other manuscripts by Hilbert and Bernays dating to the period 1917-1923. The aim of this paper is to describe (...) these results, focussing primarily on propositional logic, and to put them in their historical context. It is argued that truth-value semantics, syntactic ("Post-") and semantic completeness, decidability, and other results were first obtained by Hilbert and Bernays in 1918, and that Bernays's role in their discovery and the subsequent development of mathematical logic is much greater than has so far been acknowledged. (shrink)

This paper presents the history of the first German lectureship for mathematical logic based on a ministerial commission, to which the Göttingen mathematician Ernst Zermelo was appointed in 1907. The lectureship is shown as imbedded in the intellectual history of mathematical logic which was at that time determined by the discussion of the set theoretical and logical paradoxes. Although Zermelo's early set theoretic papers can be regarded, and were in fact regarded in the Göttingen mathematicians' application for the lectureship, as (...) contributions to mathematical logic, the close connection between set theory and logic was at that time not evident. It is shown, however, that such “internal” motives were not the only reasons for proposing the lectureship, since the application was also highly influenced by personal and institutional factors and the attempt to find a paid position for Zermelo at the University of Göttingen. In addition, Zermelo's lectureship is presented in the context of the history of academic teaching in mathematical and symbolic logic with an overview of German lecture courses in this topic in the period between 1830 and 1915. The results are correlated with the reception of George Boole's algebra of logic and other symbolic logical systems in Germany at that time. Zermelo's lectureship is regarded as the first step towards an institutionalization of mathematical logic as a subdiscipline of mathematics. This step is interpreted by critically applying the results of Hubert Laitko's and Martin Guntau's considerations on the genesis of scientific disciplines. (shrink)

This paper gives a survey of David Hilbert's (1862–1943) changing attitudes towards logic. The logical theory of the Göttingen mathematician is presented as intimately linked to his studies on the foundation of mathematics. Hilbert developed his logical theory in three stages: (1) in his early axiomatic programme until 1903 Hilbert proposed to use the traditional theory of logical inferences to prove the consistency of his set of axioms for arithmetic. (2) After the publication of the logical and (...) set-theoretical paradoxes by Gottlob Frege and Bertrand Russell it was due to Hilbert and his closest collaborator Ernst Zermelo that mathematical logic became one of the topics taught in courses for Göttingen mathematics students. The axiomatization of logic and set-theory became part of the axiomatic programme, and they tried to create their own consistent logical calculi as tools for proving consistency of axiomatic systems. (3) In his struggle with intuitionism, represented by L. E. J. Brouwer and his advocate Hermann Weyl, Hilbert, assisted by Paul Bemays, created the distinction between proper mathematics and meta-mathematics, the latter using only finite means. He considerably revised the logical calculus of thePrincipia Mathematica of Alfred North Whitehead and Bertrand Russell by introducing the ε-axiom which should serve for avoiding infinite operations in logic. (shrink)

The origin of Paraconsistent Logic is closely related with the argument that from the assertion of two mutually contradictory statements any other statement can be deduced, which can be referred to as ex contradict!one sequitur quodlibet (ECSQ). Despite its medieval origin, only in the 1930s did it become the main reason for the unfeasibility of having contradictions in a deductive system. The purpose of this paper is to study what happened before: from Principia Mathematica to that time, when it became (...) well established. The main historical claims that I am going to advance are the following: the first explicit use of ECSQ as the main argument for supporting the necessity of excluding any contradiction from deductive systems is to be found in the first edition (1928) of the book Grundzüge der theoretischen Logik by Hilbert and Ackermann. At the end, I will suggest that the aim of the 20th century usage of ECSQ was to change from the centuries long philosophical discussion about contradictions to a more "technical" one. But with Paraconsistent Logic viewed as a technical solution to this restriction, the philosophical problem revives, but now with an improved understanding of it at one's disposal. (shrink)

The origin of Paraconsistent Logic is closely related with the argument that from the assertion of two mutually contradictory statements any other statement can be deduced, which can be referred to as ex contradict!one sequitur quodlibet (ECSQ). Despite its medieval origin, only in the 1930s did it become the main reason for the unfeasibility of having contradictions in a deductive system. The purpose of this paper is to study what happened before: from Principia Mathematica to that time, when it became (...) well established. The main historical claims that I am going to advance are the following: the first explicit use of ECSQ as the main argument for supporting the necessity of excluding any contradiction from deductive systems is to be found in the first edition (1928) of the book Grundzüge der theoretischen Logik by Hilbert and Ackermann. At the end, I will suggest that the aim of the 20th century usage of ECSQ was to change from the centuries long philosophical discussion about contradictions to a more "technical" one. But with Paraconsistent Logic viewed as a technical solution to this restriction, the philosophical problem revives, but now with an improved understanding of it at one's disposal. (shrink)

The background to the development of proof theory since 1960 is contained in the article (MATHEMATICS, FOUNDATIONS OF), Vol. 5, pp. 208- 209. Brie y, Hilbert's program (H.P.), inaugurated in the 1920s, aimed to secure the foundations of mathematics by giving nitary consistency proofs of formal systems such as for number theory, analysis and set theory, in which informal mathematics can be represented directly. These systems are based on classical logic and implicitly or explicitly depend on the (...) assumption of \completed in nite" totalities. Consistency of a system S (containing a modicum of elementary number theory) is su cient to ensure that any nitary meaningful statement about the natural numbers which is provable in S is correct under the intended interpretation. Thus, in Hilbert's view, consistency of S would serve to eliminate the \completed in nite" in favor of the \potential in nite" and thus secure the body of mathematics represented in S. Hilbert established the subject of proof theory as a technical part of mathematical logic by means of which his program was to be carried out its methods will be described below. In 1931, Godel's second incompleteness theorem raised a prima facieobstacle to H.P. for the system Z of elementary number theory (also called Peano Arithmetic, and denoted below by PA) since all previously recognized forms of nitary reasoning could be formalized within it. In any case, Hilbert's program could not possibly succeed for any system such as set theory in which all nitary notions and reasoning could unquestionably be formalized. These obstacles led workers in proof theory to modify H.P. in two kinds of ways. The rst was to seek reductions of various formal systems S to more constructive systems S 0. The second was to shift the aims from foundational ones to more mathematical ones. Examples of 1 the former move are the reductions of PA to intuitionistic arithmetic HA, and Gentzen's consistency proof of PA by nitary reasoning coupled with quanti er-free trans nite induction up to the ordinal , TI( 0), both obtained in the 1930s (cf.. (shrink)

IN Hilbert's theory of the foundations of any given branch of mathematics the main problem is to establish the consistency (of a suitable formalisation) of this branch. Since the (intuitionist) criticisms of classical logic, which Hilbert's theory was intended to meet, never even alluded to inconsistencies (in classical arithmetic), and since the investigations of Hilbert's school have always established much more than mere consistency, it is natural to formulate another general problem in the foundations of mathematics: to (...) translate statements of theorems and proofs in the branch considered into those of some preferred system, where the translation must satisfy certain appropriate conditions (interpretation). The problem is relative to the choice of preferred system, as is Hilbert's consistency problem since he required the consistency to be established by particular methods (finitist ones). A finitist interpretation of classical number theory, which has been published in full detail elsewhere, is here described by means of typical examples. Partial results on analysis (theory of arbitrary functions whose arguments and values are the non-negative integers) are here presented for the first time. One of these results is restricted to functions whose values are bounded; its interest derives from the fact that real numbers may be represented by such functions. It is hoped that diverse general observations and comments, which would bore the specialist, may be of help to the general reader. The specialist may find some points of interest in the last two sections of the main text and in the notes following it. (shrink)

We study the question of how to decompose Hilbert space into a preferred tensor-product factorization without any pre-existing structure other than a Hamiltonian operator, in particular the case of a bipartite decomposition into "system" and "environment." Such a decomposition can be defined by looking for subsystems that exhibit quasi-classical behavior. The correct decomposition is one in which pointer states of the system are relatively robust against environmental monitoring (their entanglement with the environment does not continually and dramatically increase) and (...) remain localized around approximately-classical trajectories. We present an in-principle algorithm for finding such a decomposition by minimizing a combination of entanglement growth and internal spreading of the system. Both of these properties are related to locality in different ways. This formalism could be relevant to the emergence of spacetime from quantum entanglement. (shrink)

An investigation of the concept of “surveyability” as traced through the thought of Hilbert, Wittgenstein, and Turing. The communicability and reproducibility of proof, with certainty, are seen as earmarked by the “surveyability” of symbols, sequences, and structures of proof in all these thinkers. Hilbert initiated the idea within his metamathematics, Wittgenstein took up a kind of game formalism in the 1920s and early 1930s in response. Turing carried Hilbert’s conception of the “surveyability” of proof in metamathematics through (...) into his analysis of what a formal system (what a step in a computation) is in “On computable numbers, with an application to the Entscheidungsproblem” (1936). Wittgenstein’s 1939 investigations of the significance of surveyability to the concept of “proof “in Principia Mathematica were influenced, both by Turing’s remarkable everyday analysis of the Hilbertian idea, and by conversations with Turing. Although Turing does not use the word “surveyability” explicitly, it is clear that the Hilbertian idea plays a recurrent role in his work, refracted through his engagement with Wittgenstein’s idea of a “language-game”. This is evinced in some of his later writings, where the “reform” of mathematical notation for the sake of human surveyability (1944/45) may be seen to draw out the Hilbertian idea. For Turing, as for Wittgenstein, the need for “surveyability” earmarks the evolving culture of humans located in an evolving social and scientific world, just as it had for Hilbert. (shrink)

In the first year of the twentieth century, in Gottingen, Husserl delivered two talks dealing with a problem that proved central in his philosophical development, that of imaginary elements in mathematics. In order to solve this problem Husserl introduced a logical notion, called “definiteness”, and variants of it, that are somehow related, he claimed, to Hilbert’s notions of completeness. Many different interpretations of what precisely Husserl meant by this notion, and its relations with Hilbert’s ones, have been proposed, (...) but no consensus has been reached. In this paper I approach this question afresh and thoroughly, taking into consideration not only the relevant texts and context, as others have also done before, but, more importantly, Husserl’s philosophy, his intuition-based epistemology in particular. Based on a system of clearly defined concepts that I here present, I reinforce an interpretation—definiteness as a form of syntactic completeness—that has, I believe, some advantages vis-à-vis alternative interpretations. It is in conformity with the available texts; it makes clear that Husserl’s notion of definiteness is indeed close to Hilbert’s notions of completeness; it solves the important problem of imaginaries for which it was created; and last, but not least, it fits naturally into Husserl’s system of concepts and ideas. (shrink)

This book is designed to make accessible to nonspecialists the still evolving concepts of quantum mechanics and the terminology in which these are expressed. The opening chapters summarize elementary concepts of twentieth century quantum mechanics and describe the mathematical methods employed in the field, with clear explanation of, for example, Hilbert space, complex variables, complex vector spaces and Dirac notation, and the Heisenberg uncertainty principle. After detailed discussion of the Schrödinger equation, subsequent chapters focus on isotropic vectors, used to (...) construct spinors, and on conceptual problems associated with measurement, superposition, and decoherence in quantum systems. Here, due attention is paid to Bell's inequality and the possible existence of hidden variables. Finally, progression toward quantum computation is examined in detail: if quantum computers can be made practicable, enormous enhancements in computing power, artificial intelligence, and secure communication will result. This book will be of interest to a wide readership seeking to understand modern quantum mechanics and its potential applications. (shrink)

Sixteen years after his “Foundations of Geometry,” Hilbert published a communication that bears a similar and, by use of the definite article, even less mistakable title: “The Foundations of Physics.” In the opening paragraph of this article, Hilbert announced his intention self-confidently:In the following, I should like to set up — following the axiomatic method — a new system of fundamental equations of physics, constructed essentially from two simple axioms; equations that are of ideal beauty and in which, (...) as I believe, is contained the solution of both Einstein’s and Mie’s problems. (shrink)

The theory that ``consistency implies existence'' was put forward by Hilbert on various occasions around the start of the last century, and it was strongly and explicitly emphasized in his correspondence with Frege. Since (Gödel's) completeness theorem, abstractly speaking, forms the basis of this theory, it has become common practice to assume that Hilbert took for granted the semantic completeness of second order logic. In this paper I maintain that this widely held view is untrue to the facts, (...) and that the clue to explain what Hilbert meant by linking together consistency and existence is to be found in the role played by the completeness axiom within both geometrical and arithmetical axiom systems. (shrink)