In this paper we obtain a finite Hilbert-style axiomatization of the implicationless fragment of the intuitionistic propositional calculus. As a consequence we obtain finite axiomatizations of all structural closure operators on the algebra of {–}-formulas containing this fragment.

After a brief flirtation with logicism around 1917, David Hilbertproposed his own program in the foundations of mathematics in 1920 and developed it, in concert with collaborators such as Paul Bernays andWilhelm Ackermann, throughout the 1920s. The two technical pillars of the project were the development of axiomatic systems for everstronger and more comprehensive areas of mathematics, and finitisticproofs of consistency of these systems. Early advances in these areaswere made by Hilbert (and Bernays) in a series of lecture courses (...) atthe University of Göttingen between 1917 and 1923, and notably in Ackermann's dissertation of 1924. The main innovation was theinvention of the -calculus, on which Hilbert's axiom systemswere based, and the development of the -substitution methodas a basis for consistency proofs. The paper traces the developmentof the ``simultaneous development of logic and mathematics'' throughthe -notation and provides an analysis of Ackermann'sconsistency proofs for primitive recursive arithmetic and for thefirst comprehensive mathematical system, the latter using thesubstitution method. It is striking that these proofs use transfiniteinduction not dissimilar to that used in Gentzen's later consistencyproof as well as non-primitive recursive definitions, and that thesemethods were accepted as finitistic at the time. (shrink)

Restall set forth a "consecution" calculus in his "An Introduction to Substructural Logics." This is a natural deduction type sequent calculus where the structural rules play an important role. This paper looks at different ways of extending Restall's calculus. It is shown that Restall's weak soundness and completeness result with regards to a Hilbert calculus can be extended to a strong one so as to encompass what Restall calls proofs from assumptions. It is also shown (...) how to extend the calculus so as to validate the metainferential rule of reasoning by cases, as well as certain theory-dependent rules. (shrink)

Sobre la base que aportan las notas manuscritas de David Hilbert para cursos sobre geometría, el artículo procura contextualizar y analizar una de las contribuciones más importantes y novedosas de su célebre monografía Fundamentos de la geometría, a saber: el cálculo de segmentos lineales. Se argumenta que, además de ser un resultado matemático importante, Hilbert depositó en su aritmética de segmentos un destacado significado epistemológico y metodológico. En particular, se afirma que para Hilbert este resultado representaba un (...) claro ejemplo de uno de los rasgos más fructíferos y atractivos de su nuevo método axiomático formal, o sea, la capacidad de descubrir y exhibir conexiones estructurales o internas entre diferentes teorías matemáticas. On the basis of a set of unpublished notes for lecture courses on geometry, the paper seeks to contextualize and analyze one of the most important and original contributions of David Hilbert's celebrated monograph Foundations of Geometry, namely its arithmetic of line segments. It is argued that Hilbert attributed to his arithmetic of segments an important epistemological and methodological meaning, in addition to its relevance as an original mathematical result. In particular, it is claimed that for Hilbert his arithmetic of segments represented a clear example of one of the most fruitful and attractive traits of his new formal axiomatic method, i.e., the power to discover and exhibit inner or structural connections among different mathematical theories. (shrink)

Hilbert's plan for understanding the concept of infinity required the elimination of non‐finitist machinery from proofs of finitist assertions. The failure of the original plan leads to a hierarchy of progressively less elementary, but still constructive methods instead of finitist ones . A mathematical proof of this failure requires a definition of « finitist ».—The paper sketches the three principal methods for the syntactic analysis of non‐constructive mathematics, the resulting consistency proofs and constructive interpretations, modelled on Herbrand's theorem, and (...) their mathematical and logical consequences. A characterization of finitist proofs is sketched. A remark on the completeness of the predicate calculus concludes the paper. Throughout open problems and alternative approaches are emphasized.ZusammenfassungHilbert sah das Verstehen des Begriffs des Unendlichen in der Eliminierung nichtfiniter Methoden aus Beweisen finiter Sätze. Das Versagen dieses Unternehmens führt zu einer Hierarchic progressiv weniger elementarer, aber noch konstruktiver Methoden, statt der finiten . Ein Unmöglichkeitsbeweis des ursprünglichen Planes setzt eine Definition von « finit » voraus.—Die drei wichtigsten Methoden der syntaktischen Analyse nichtkonstruktiver mathematischer Theorien, die daraus gewonnenen Widerspruchsfreiheitsbeweise and konstruktiven Interpretationen and deren mathematische and logische Anwendungen werden besprochen. Eine Prazisierung des Begriffs « finit » wird skizziert. Eine Bemerkung zur Vollstandigkeit des engeren Funktionenkalküls beschliesst die Abhandlung.—Oflene Fragen and komplementare Fragestellungen werden betont. (shrink)

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.

Historically, nonclassical physics developed in three stages. First came a collection of ad hoc assumptions and then a cookbook of equations known as "quantum mechanics". The equations and their philosophical underpinnings were then collected into a model based on the mathematics of Hilbert space. From the Hilbert space model came the abstaction of "quantum logics". This book explores all three stages, but not in historical order. Instead, in an effort to illustrate how physics and abstract mathematics influence each (...) other we hop back and forth between a purely mathematical development of Hilbert space, and a physically motivated definition of a logic, partially linking the two throughout, and then bringing them together at the deepest level in the last two chapters. This book should be accessible to undergraduate and beginning graduate students in both mathematics and physics. The only strict prerequisites are calculus and linear algebra, but the level of mathematical sophistication assumes at least one or two intermediate courses, for example in mathematical analysis or advanced calculus. No background in physics is assumed. (shrink)

The epsilon calculus is a logical formalism developed by David Hilbert in the service of his program in the foundations of mathematics. The epsilon operator is a term-forming operator which replaces quantifiers in ordinary predicate logic. Specifically, in the calculus, a term εx A denotes some x satisfying A(x), if there is one. In Hilbert's Program, the epsilon terms play the role of ideal elements; the aim of Hilbert's finitistic consistency proofs is to give a (...) procedure which removes such terms from a formal proof. The procedures by which this is to be carried out are based on Hilbert's epsilon substitution method. The epsilon calculus, however, has applications in other contexts as well. The first general application of the epsilon calculus was in Hilbert's epsilon theorems, which in turn provide the basis for the first correct proof of Herbrand's theorem. More recently, variants of the epsilon operator have been applied in linguistics and linguistic philosophy to deal with anaphoric pronouns. (shrink)

In this paper we study the variety of order Hilbert algebras, which is the equivalent algebraic semantics of the order implicational calculus of Bull.

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)

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.

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)

In their paper Nothing but the Truth Andreas Pietz and Umberto Rivieccio present Exactly True Logic, an interesting variation upon the four-valued logic for first-degree entailment FDE that was given by Belnap and Dunn in the 1970s. Pietz & Rivieccio provide this logic with a Hilbert-style axiomatisation and write that finding a nice sequent calculus for the logic will presumably not be easy. But a sequent calculus can be given and in this paper we will show that (...) a calculus for the Belnap-Dunn logic we have defined earlier can in fact be reused for the purpose of characterising ETL, provided a small alteration is made—initial assignments of signs to the sentences of a sequent to be proved must be different from those used for characterising FDE. While Pietz & Rivieccio define ETL on the language of classical propositional logic we also study its consequence relation on an extension of this language that is functionally complete for the underlying four truth values. On this extension the calculus gets a multiple-tree character—two proof trees may be needed to establish one proof. (shrink)

The previous Part I of the paper discusses the option of the Gödel incompleteness statement (1931: whether “Satz VI” or “Satz X”) to be an axiom due to the pair of the axiom of induction in arithmetic and the axiom of infinity in set theory after interpreting them as logical negations to each other. The present Part II considers the previous Gödel’s paper (1930) (and more precisely, the negation of “Satz VII”, or “the completeness theorem”) as a necessary condition for (...) granting the Gödel incompleteness statement to be a theorem just as the statement itself, to be an axiom. Then, the “completeness paper” can be interpreted as relevant to Hilbert mathematics, according to which mathematics and reality as well as arithmetic and set theory are rather entangled or complementary rather than mathematics to obey reality able only to create models of the latter. According to that, both papers (1930; 1931) can be seen as advocating Russell’s logicism or the intensional propositional logic versus both extensional arithmetic and set theory. Reconstructing history of philosophy, Aristotle’s logic and doctrine can be opposed to those of Plato or the pre-Socratic schools as establishing ontology or intensionality versus extensionality. Husserl’s phenomenology can be analogically realized including and particularly as philosophy of mathematics. One can identify propositional logic and set theory by virtue of Gödel’s completeness theorem (1930: “Satz VII”) and even both and arithmetic in the sense of the “compactness theorem” (1930: “Satz X”) therefore opposing the latter to the “incompleteness paper” (1931). An approach identifying homomorphically propositional logic and set theory as the same structure of Boolean algebra, and arithmetic as the “half” of it in a rigorous construction involving information and its unit of a bit. Propositional logic and set theory are correspondingly identified as the shared zero-order logic of the class of all first-order logics and the class at issue correspondingly. Then, quantum mechanics does not need any quantum logics, but only the relation of propositional logic, set theory, arithmetic, and information: rather a change of the attitude into more mathematical, philosophical, and speculative than physical, empirical and experimental. Hilbert’s epsilon calculus can be situated in the same framework of the relation of propositional logic and the class of all mathematical theories. The horizon of Part III investigating Hilbert mathematics (i.e. according to the Pythagorean viewpoint about the world as mathematical) versus Gödel mathematics (i.e. the usual understanding of mathematics as all mathematical models of the world external to it) is outlined. (shrink)

Hilbert's ε-calculus is based on an extension of the language of predicate logic by a term-forming operator εx. Two fundamental results about the ε-calculus, the first and second epsilon theorem, play a rôle similar to that which the cut-elimination theorem plays in sequent calculus. In particular, Herbrand's Theorem is a consequence of the epsilon theorems. The paper investigates the epsilon theorems and the complexity of the elimination procedure underlying their proof, as well as the length of (...) Herbrand disjunctions of existential theorems obtained by this elimination procedure. (shrink)

The paper deals with some of the developments in analysis against the background of Hilbert's contributions to the Calculus of Variations. As a starting point the transformation is chosen that took place at the end of the 19th century in the Calculus of Variations, and emphasis is placed on the influence of Dirichlet's principle. The proof of the principle (the resuscitation ) led Hilbert to questions arising in the 19th and 20th problems of his famous Paris (...) address in 1900: theexistence in a generalized sense, and theregularity of solutions of elliptic partial differential equations. By this new concept Hilbert pointed out two very important issues the history of which is closely tied up with the rise of modern analysis. Further on, Hilbert'stheorem of independence of the Calculus of Variations, an important contribution to its formal apparatus as well as to its field theory, is briefly discussed. But even as Hilbert published his first essential results, he was turning his attention to another area of mathematics that differs in an important respect from the Calculus of Variations:integral equations. Hilbert did so because he recognized that in this branch by its flexibility he was coming closer to his goal of an unifying methodological approach to analysis. (shrink)

The variety \ of semi-Heyting algebras was introduced by H. P. Sankappanavar [13] as an abstraction of the variety of Heyting algebras. Semi-Heyting algebras are the algebraic models for a logic HsH, known as semi-intuitionistic logic, which is equivalent to the one defined by a Hilbert style calculus in Cornejo :9–25, 2011) [6]. In this article we introduce a Gentzen style sequent calculus GsH for the semi-intuitionistic logic whose associated logic GsH is the same as HsH. The (...) advantage of this presentation of the logic is that we can prove a cut-elimination theorem for GsH that allows us to prove the decidability of the logic. As a direct consequence, we also obtain the decidability of the equational theory of semi-Heyting algebras. (shrink)

§1. Introduction. By and large, definitions of a differentiable structure on a set involve two ingredients, topology and algebra. However, in some cases, partial information on one or both of these is sufficient. A very simple example is that of the field ℝ where algebra alone determines the ordering and hence the topology of the field:In the case of the field ℂ, the algebraic structure is insufficient to determine the Euclidean topology; another topology, Zariski, is associated with the ield but (...) this will be too coarse to give a diferentiable structure.A celebrated example of how partial algebraic and topological data determines a differentiable structure is Hilbert's 5th problem and its solution by Montgomery-Zippin and Gleason.The main result which we discuss here is of a similar flavor: we recover an algebraic and later differentiable structure from a topological data. We begin with a linearly ordered set ⟨M, <⟩, equipped with the order topology, and its cartesian products with the product topologies. We then consider the collection of definable subsets of Mn, n = 1, 2, …, in some first order expansion ℳ of ⟨M, <⟩. (shrink)

The paper presents and applies Hilbert's Epsilon Calculus, first describing its standard proof theory, and giving it an intensional semantics. These are contrasted with the proof theory of Fregean Predicate Logic, and the traditional (extensional) choice function semantics for the calculus. The semantics provided show that epsilon terms are referring terms in Donnellan's sense, enabling the symbolisation and validation of argument forms involving E-type pronouns, both in extensional and intensional contexts. By providing for transparency in intensional constructions (...) they support a Model Conceptualism to contrast with traditional intensional logic's Modal Realism. But epsilon-terms also symbolise fictions, and through their difference from iota terms enable the solution of a number of outstanding puzzles about Direct Reference and de re beliefs. (shrink)

The paper presents and applies Hilbert's Epsilon Calculus, first describing its standard proof theory, and giving it an intensional semantics. These are contrasted with the proof theory of Fregean Predicate Logic, and the traditional (extensional) choice function semantics for the calculus. The semantics provided show that epsilon terms are referring terms in Donnellan's sense, enabling the symbolisation and validation of argument forms involving E-type pronouns, both in extensional and intensional contexts. By providing for transparency in intensional constructions (...) they support a Model Conceptualism to contrast with traditional intensional logic's Modal Realism. But epsilon-terms also symbolise fictions, and through their difference from iota terms enable the solution of a number of outstanding puzzles about Direct Reference and de re beliefs. (shrink)

We formulate a Hilbert-style axiomatic system and a tableau calculus for the STIT-based logic of imagination recently proposed in Wansing. Completeness of the axiom system is shown by the method of canonical models; completeness of the tableau system is also shown by using standard methods.

The typical kind of color realism is reductive: the color properties are identified with properties specified in other terms (as ways of altering light, for instance). If no reductive analysis is available — if the colors are primitive sui generis properties — this is often taken to be a convincing argument for eliminativism. That is, realist primitivism is usually thought to be untenable. The realist preference for reductive theories of color over the last few decades is particularly striking in light (...) of the generally anti-reductionist mood of recent philosophy of mind. The parallels between the mind—body problem and the case of color are substantial enough that the difference in trajectory is surprising. While dualism and non-reductive physicalism are staples, realist primitivism is by and large a recent addition to the color literature. And it remains a minority position, although one that is perhaps gaining support. In this paper, we investigate whether it should be accepted, and conclude it should not be. (shrink)

Die theoretische Logik, auch mathematische oder symbolische Logik genannt, ist eine Ausdehnung der fonnalen Methode der Mathematik auf das Gebiet der Logik. Sie wendet fUr die Logik eine ahnliche Fonnel­ sprache an, wie sie zum Ausdruck mathematischer Beziehungen schon seit langem gebrauchlich ist. In der Mathematik wurde es heute als eine Utopie gelten, wollte man beim Aufbau einer mathematischen Disziplin sich nur der gewohnlichen Sprache bedienen. Die groBen Fortschritte, die in der Mathematik seit der Antike gemacht worden sind, sind zum (...) wesentlichen Teil mit dadurch bedingt, daB es gelang, einen brauchbaren und leistungsfahigen Fonnalismus zu finden. - Was durch die Formel­ sprache in der Mathematik erreicht wird, das solI auch in der theoretischen Logik durch diese erzielt werden, namlich eine exakte, wissenschaftliche Behandlung ihres Gegenstandes. Die logischen Sachverhalte, die zwischen Urteilen, Begriffen usw. bestehen, finden ihre Darstellung durch Formeln, deren Interpretation frei ist von den Unklarheiten, die beim sprachlichen Ausdruck leicht auftreten konnen. Der Dbergang zu logischen Folgerungen, wie er durch das SchlieBen geschieht, wird in seine letzten Elemente zerlegt und erscheint als fonnale Umgestaltung der Ausgangsfonneln nach gewissen Regeln, die den Rechenregeln in der Algebra analog sind; das logische Denken findet sein Abbild in einem LogikkalkUl. Dieser Kalkiil macht die erfolgreiche Inangriffnahme von Problemen moglich, bei denen das rein inhaltliche Denken prinzipiell versagt. Zu diesen gehort z. B. (shrink)

In this paper, we present a simple sequent calculus for the modal propositional logic S5. We prove that this sequent calculus is theoremwise equivalent to the Hilbert-style system S5, that it is contraction-free and cut-free, and finally that it is decidable. All results are proved in a purely syntactic way.

The constructive functional calculus for a sequence of commuting selfadjoint operators on a separable Hilbert space is shown to be independent of the orthonormal basis used in its construction. The proof requires a constructive criterion for the absolute continuity of two positive measures in terms of test functions.

The original decision criterion and method of the combined calculus, presented by D. Hilbert and W. Ackermann, and applied by later logicians, are illuminating, but also go seriously awry and lead the universality and preciseness of the combined calculus to be damaged. The main error is that they confuse the two levels of the combined calculus in the course of calculating. This paper aims to resolve the problem through dividing the levels of the combined calculus, (...) introducing a mixed operation mode, and therefore finding a normal-form decision method approximated by that in sentential logic. Finally, this paper provides a more precise proof of Hauber’s theorem by using the normal-form decision method of the combined calculus. (shrink)

In this paper we present a sequent calculus for the modal propositional logic GL (the logic of provability) obtained by means of the tree-hypersequent method, a method in which the metalinguistic strength of hypersequents is improved, so that we can simulate trees shapes. We prove that this sequent calculus is sound and complete with respect to the Hilbert-style system GL, that it is contraction free and cut free and that its logical and modal rules are invertible. No (...) explicit semantic element is used in the sequent calculus and all the results are proved in a purely syntactic way. (shrink)

The issue of the emergence of formal axiomatic logical systems due to the emergence of logical antinomies in formal axiomatic systems, specifically the issue of developing formal logical axiomatics in the calculus of considerations was investigated in the considered research. At the same time, in order to determine the characteristics of the implementation of the logical-methodological principles and provisions of the deductive reasoning obviously, conceptual-logical foundations of the calculus of considerations was studied and the main propositions of the (...) calculus of considerations and the analysis of the initial logical operations on them were given in the study. The basic laws of logic and the expression of one logical act with another one were also explained in the research work by giving the concepst of proportional form and tautology in the calculus of considerations. At the same time, main properties and the procedure of setting of the formal deductive theory in the calculus of considerations were studied in the article. In order to provide an adequate characterization of the conceptual and methodological bases of the calculus of considerations in the research work, the basic logical laws of the calculus of considerations developed by the German mathematician and thinker P. Hilbert were also given. In addition, the main principles and methodological provisions of the deductive method were investigated, and the rules of deriving new conclusions from the axioms were interpreted. At the end of the reviewed article, the main principles and methods of the formal axiomatic mathematical systems built on a deductive basis, specifically the calculus of considerations, were studied and a logical-methodological analysis of the calculus of considerations was carried out on this basis. In this framework, the syntactic and semantic analysis of formalized language in formal axiomatic logical systems was carried out separately, the constituent parts of those systems, including the construction scheme, were given. (shrink)

§30. Significance of Desargues's theorem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 64 CHAPTER VI. PASCAL'S THEOREM. §31. ...

It will be shown that the probability calculus of a quantum mechanical entity can be obtained in a deterministic framework, embedded in a real space, by introducing a lack of knowledge in the measurements on that entity. For all n ∃ ℕ we propose an explicit model in $\mathbb{R}^{n^2 } $ , which entails a representation for a quantum entity described by an n-dimensional complex Hilbert space þn, namely, the “þn,Euclidean hidden measurement representation.” This Euclidean hidden measurement representation (...) is also in a more general sense equivalent with the orthodox Hilbert space formulation of quantum mechanics, since every mathematical ingredient of ordinary quantum mechanics can easily be translated into the framework of these representations. (shrink)

Dynamic epistemic logic (DEL) is a multi-modal logic for reasoning about the change of knowledge in multi-agent systems. It extends epistemic logic by a modal operator for actions which announce logical formulas to other agents. In Hilbert-style proof calculi for DEL, modal action formulas are reduced to epistemic logic, whereas current sequent calculi for DEL are labelled systems which internalize the semantic accessibility relation of the modal operators, as well as the accessibility relation underlying the semantics of the actions. (...) We present a novel cut-free ordinary sequent calculus, called |$ \textbf{G4}_{P,A}[] $|⁠, for propositional DEL. In contrast to the known sequent calculi, our calculus does not internalize the accessibility relations, but—similar to Hilbert style proof calculi—action formulas are reduced to epistemic formulas. Since no ordinary sequent calculus for full S5 modal logic is known, the proof rules for the knowledge operator and the Boolean operators are those of an underlying S4 modal calculus. We show the soundness and completeness of |$ \textbf{G4}_{P,A}[] $| and prove also the admissibility of the cut-rule and of several other rules for introducing the action modality. (shrink)

In this paper we present a sequent calculus for propositional dynamic logic built using an enriched version of the tree-hypersequent method and including an infinitary rule for the iteration operator. We prove that this sequent calculus is theoremwise equivalent to the corresponding Hilbert-style system, and that it is contraction-free and cut-free. All results are proved in a purely syntactic way.

Edward Wilson Averill By the phrase 'anthropocentric account of color' I mean an account of color that makes an assumption of the following form: two ...

We introduce a typed version of the intuitionistic epsilon calculus. We give a categorical semantics of it introducing a class of categories which we call \-categories. We compare our results with earlier ones of Bell :323–337, 1993).

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)

The $$\varepsilon $$ -elimination method of Hilbert’s $$\varepsilon $$ -calculus yields the up-to-date most direct algorithm for computing the Herbrand disjunction of an extensional formula. A central advantage is that the upper bound on the Herbrand complexity obtained is independent of the propositional structure of the proof. Prior (modern) work on Hilbert’s $$\varepsilon $$ -calculus focused mainly on the pure calculus, without equality. We clarify that this independence also holds for first-order logic with equality. Further, (...) we provide upper bounds analyses of the extended first $$\varepsilon $$ -theorem, even if the formalisation incorporates so-called $$\varepsilon $$ -equality axioms. (shrink)

Dijkstra and Scholten have proposed a formalization of classical predicate logic on a novel deductive system as an alternative to Hilbert's style of proof and Gentzen's deductive systems. In this context we call it CED (Calculus of Equational Deduction). This deductive method promotes logical equivalence over implication and shows that there are easy ways to prove predicate formulas without the introduction of hypotheses or metamathematical tools such as the deduction theorem. Moreover, syntactic considerations (in Dijkstra's words, "letting the (...) symbols do the work") have led to the "calculational style," an impressive array of techniques for elegant proof constructions. In this paper, we formalize intuitionistic predicate logic according to CED with similar success. In this system (I-CED), we prove Leibniz's principle for intuitionistic logic and also prove that any (intuitionistic) valid formula of predicate logic can be proved in I-CED. (shrink)

Dieser Buchtitel ist Teil des Digitalisierungsprojekts Springer Book Archives mit Publikationen, die seit den Anfängen des Verlags von 1842 erschienen sind. Der Verlag stellt mit diesem Archiv Quellen für die historische wie auch die disziplingeschichtliche Forschung zur Verfügung, die jeweils im historischen Kontext betrachtet werden müssen. Dieser Titel erschien in der Zeit vor 1945 und wird daher in seiner zeittypischen politisch-ideologischen Ausrichtung vom Verlag nicht beworben.

Die Leitgedanken meiner Untersuchungen über die Grundlagen der Mathematik, die ich - anknüpfend an frühere Ansätze - seit 1917 in Besprechungen mit P. BERNAYS wieder aufgenommen habe, sind von mir an verschiedenen Stellen eingehend dargelegt worden. Diesen Untersuchungen, an denen auch W. ACKERMANN beteiligt ist, haben sich seither noch verschiedene Mathematiker angeschlossen. Der hier in seinem ersten Teil vorliegende, von BERNAYS abgefaßte und noch fortzusetzende Lehrgang bezweckt eine Darstellung der Theorie nach ihren heutigen Ergebnissen. Dieser Ergebnisstand weist zugleich die Richtung (...) für die weitere Forschung in der Beweistheorie auf das Endziel hin, unsere üblichen Methoden der Mathematik samt und sonders als widerspruchsfrei zu erkennen. Im Hinblick auf dieses Ziel möchte ich hervorheben, daß die zeit weilig aufgekommene Meinung, aus gewissen neueren Ergebnissen von GÖDEL folge die Undurchführbarkeit meiner Beweistheorie, als irrtüm lich erwiesen ist. Jenes Ergebnis zeigt in der Tat auch nur, daß man für die weitergehenden Widerspruchsfreiheitsbeweise den finiten Stand punkt in einer schärferen Weise ausnutzen muß, als dieses bei der Be trachtung der elementaren Formallsmen erforderlich ist. Göttingen, im März 1934 HILBERT Vorwort zur ersten Auflage Eine Darstellung der Beweistheorie, welche aus dem HILBERTschen Ansatz zur Behandlung der mathematisch-logischen Grundlagenpro bleme erwachsen ist, wurde schon seit längerem von HILBERT ange kündigt. (shrink)