According to a main idea of Gentzen the meanings of the logical constants are reflected by the introduction rules in his system of natural deduction. This idea is here understood as saying roughly that a closed argument ending with an introduction is valid provided that its immediate subarguments are valid and that other closed arguments are justified to the extent that they can be brought to introduction form. One main part of the paper is devoted to the exact development of (...) this notion. Another main part of the paper is concerned with a modification of this notion as it occurs in Michael Dummett’s book The Logical Basis of Metaphysics. The two notions are compared and there is a discussion of how they fare as a foundation for a theory of meaning. It is noted that Dummett’s notion has a simpler structure, but it is argued that it is less appropriate for the foundation of a theory of meaning, because the possession of a valid argument for a sentence in Dummett’s sense is not enough to be warranted to assert the sentence. (shrink)

The traditional picture of logic takes it for granted that "valid arguments have a fundamental epistemic significance", but neither model theory nor traditional proof theory dealing with formal system has been able to give an account of this significance. Since valid arguments as usually understood do not in general have any epistemic significance, the problem is to explain how and why we can nevertheless use them sometimes to acquire knowledge. It is suggested that we should distinguish between arguments and acts (...) of inferences and that we have to reconsider the latter notion to arrive at the desired explanation. More precisely, the notions should be developed so that the following relationship holds: one gets in possession of a ground for a conclusion by inferring it from premisses for which one already has grounds, provided that the inference in question is valid. The paper proposes explications of the concepts of ground and deductively valid inference so that this relationship holds as a conceptual truth. Logical validity of inference is seen as a special case of deductive validity, but does not add anything as far as epistemic significance is concerned—it resides already in the deductively valid inferences. (shrink)

Reviewed Works:Gaisi Takeuti, Proof Theory.Georg Kreisel, Proof Theory: Some Personal Recollections.Wolfram Pohlers, Contributions of the Schutte School in Munich to Proof Theory.Stephen G. Simpson, Subsystems of $\mathbf{Z}_2$ and Reverse Mathematics.Solomon Feferman, Proof Theory: A Personal Report.

This volume examines the notion of an analytic proof as a natural deduction, suggesting that the proof's value may be understood as its normal form--a concept with significant implications to proof-theoretic semantics.

We study the logical and computational properties of basic theorems of uncountable mathematics, in particular Pincherle's theorem, published in 1882. This theorem states that a locally bounded function is bounded on certain domains, i.e. one of the first ‘local-to-global’ principles. It is well-known that such principles in analysis are intimately connected to (open-cover) compactness, but we nonetheless exhibit fundamental differences between compactness and Pincherle's theorem. For instance, the main question of Reverse Mathematics, namely which set existence axioms are necessary to (...) prove Pincherle's theorem, does not have an unique or unambiguous answer, in contrast to compactness. We establish similar differences for the computational properties of compactness and Pincherle's theorem. We establish the same differences for other local-to-global principles, even going back to Weierstrass. We also greatly sharpen the known computational power of compactness, for the most shared with Pincherle's theorem however. Finally, countable choice plays an important role in the previous, we therefore study this axiom together with the intimately related Lindelöf lemma. (shrink)

In the 12th century the "Book of the Soul" by the philosopher Avicenna was translated from Arabic into Latin. It had an immense success among scholastic writers and deeply influenced the structure and content of many psychological works of the Middle Ages. The reception of Avicenna's book is the story of cultural contact at an imipressively high intellectural level. The present volume investigates this successful reception using two approaches. The first is chronological, tracing the stages by which Avicenna's work was (...) accepted and adapted by Latin scholars. The second is doctrinal, analyzing the fortunes of key doctrines. The sense of the original Arabic text of Avicenna is kept in mind throughout and the degree to which his original Latin interpreters succeeded in conveying it is evaluated. (shrink)

Reverse Mathematics (RM hereafter) is a program in the foundations of mathematics where the aim is to identify the minimal axioms needed to prove a given theorem from ordinary, i.e., non-set theoretic, mathematics. This program has unveiled surprising regularities: the minimal axioms are very often equivalent to the theorem over the base theory, a weak system of ‘computable mathematics’, while most theorems are either provable in this base theory, or equivalent to one of only four logical systems. The latter plus (...) the base theory are called the ‘Big Five’ and the associated equivalences are robust following Montalbán, i.e., stable under small variations of the theorems at hand. Working in Kohlenbach’s higher-order RM, we obtain two new and long series of equivalences based on theorems due to Bolzano, Weierstrass, Jordan, and Cantor; these equivalences are extremely robust and have no counterpart among the Big Five systems. Thus, higher-order RM is much richer than its second-order cousin, boasting at least two extra ‘Big’ systems. (shrink)

I see the question what it is that makes an inference valid and thereby gives a proof its epistemic power as the most fundamental problem of general proof theory. It has been surprisingly neglected in logic and philosophy of mathematics with two exceptions: Gentzen’s remarks about what justifies the rules of his system of natural deduction and proposals in the intuitionistic tradition about what a proof is. They are reviewed in the paper and I discuss to what extent they succeed (...) in answering what a proof is. Gentzen’s ideas are shown to give rise to a new notion of valid argument. At the end of the paper I summarize and briefly discuss an approach to the problem that I have proposed earlier. (shrink)

By a valid inference is here understood an inference that succeeds in its aim to justify its conclusion given that its premisses are already justified. For an inference to be valid it is thus not enough that the sentence asserted in the conclusion is a logical consequence of the sentences asserted in the premisses. A proof is understood as a succession of valid inferences that is closed (i.e. all its assumptions are discharged and all its free variables are bound by (...) some of the inferences). On the other hand, in mathematics the justification of an assertion has traditionally been taken to consist in a proof of it, which gives rise to an explanatory circle.In an attempt to avoid this circle, I have in previous works tried to explain the notion of ground for an assertion without referring to valid inferences. However, it turns out that the resulting notion of ground has unwanted consequences like the notion of proof in the so-called BHK-interpretation of intuitionistic logic. For instance, one is guaranteed a ground or a proof of an implication A → B as soon as there is in fact no ground or proof of A, regardless of whether one really knows this fact, and hence without having a real justification of the assertion of the implication.In the absence of a non-circular explanation of the notions of valid inference and proof, I suggest that we should try to formulate a number of principles of how these two epistemic notions depend on each other. A more careful explanation of the validity of an inference results in what I call a heuristic idea about the validity of inference, which is used as a guide to formulate precise principles. One such principle generalizes Gentzen’s idea that his introduction rules define the meaning of the logical constants. Another principle generalizes a previously noted property of Gentzen’s elimination rules that I have called that of satisfying the inversion principle. It results in a notion that I call non-creativity, which implies validity. (shrink)

We study the logical and computational properties of basic theorems of uncountable mathematics, including the Cousin and Lindelöf lemma published in 1895 and 1903. Historically, these lemmas were among the first formulations of open-cover compactness and the Lindelöf property, respectively. These notions are of great conceptual importance: the former is commonly viewed as a way of treating uncountable sets like e.g. [Formula: see text] as “almost finite”, while the latter allows one to treat uncountable sets like e.g. [Formula: see text] (...) as “almost countable”. This reduction of the uncountable to the finite/countable turns out to have a considerable logical and computational cost: we show that the aforementioned lemmas, and many related theorems, are extremely hard to prove, while the associated sub-covers are extremely hard to compute. Indeed, in terms of the standard scale (based on comprehension axioms), a proof of these lemmas requires at least the full extent of second-order arithmetic, a system originating from Hilbert–Bernays’ Grundlagen der Mathematik. This observation has far-reaching implications for the Grundlagen’s spiritual successor, the program of Reverse Mathematics, and the associated Gödel hierarchy. We also show that the Cousin lemma is essential for the development of the gauge integral, a generalization of the Lebesgue and improper Riemann integrals that also uniquely provides a direct formalization of Feynman’s path integral. (shrink)

We prove that the Kleene schemes for primitive recursion relative to the μ-operator, relativized to some nondeterministic objects, have the same power to express total functionals when interpreted over the partial continuous functionals and over the Kleene-Kreisel continuous functionals. Relating the former interpretation to Niggl's ℳω we prove Nigg's conjecture that ℳω is strictly weaker than Plotkin's PCF + PA.

WeingartnerPaul and LeebHans-Peter, eds, Kreisel’s Interests: On the Foundations of Logic and Mathematics. Tributes; 41. London: College Publications, 2020. Pp. viii + 171. ISBN: 978-1-84890-330-2.

This article provides an introduction to Kaplan-style semantics. The formal semantics usually employs the notion of a model, which, besides supplying the sets utterance contexts, circumstances and a domain M 0 of individuals, and also interprets the nonlogical atomic expressions of the language. Standard compositionality applies only to character: Funct makes immediate sense, since character assigns a semantic value directly to expressions. For semantic functions taking contextual arguments, the notion of compositionality must be revised. Notions of contextual compositionality apply directly (...) to the functional version of the setup that starts with the function char, and defines the other semantics from it. The point of evaluation semantics is indeed basic: if it is compositional, so is the content semantics, and the character semantics. (shrink)

We investigate the connections between computability theory and Nonstandard Analysis. In particular, we investigate the two following topics and show that they are intimately related. A basic property of Cantor space$2^ $ is Heine–Borel compactness: for any open covering of $2^ $, there is a finite subcovering. A natural question is: How hard is it to compute such a finite subcovering? We make this precise by analysing the complexity of so-called fan functionals that given any $G:2^ \to $, output a (...) finite sequence $\langle f_0, \ldots,f_n \rangle $ in $2^ $ such that the neighbourhoods defined from $\overline {f_i } G\left$ for $i \le n$ form a covering of $2^ $. A basic property of Cantor space in Nonstandard Analysis is Abraham Robinson’s nonstandard compactness, i.e., that every binary sequence is “infinitely close” to a standard binary sequence. We analyse the strength of this nonstandard compactness property of Cantor space, compared to the other axioms of Nonstandard Analysis and usual mathematics.Our study of yields exotic objects in computability theory, while leads to surprising results in Reverse Mathematics. We stress that and are highly intertwined, i.e., our study is holistic in nature in that results in computability theory yield results in Nonstandard Analysis and vice versa. (shrink)

Ethics in business and economics is often attacked for being too superficial. By elaborating the conclusions of two such critics of business ethics and welfare economics respectively, this article will draw the attention to the ethics behind these apparently well-intended, but not always convincing constructions, by help of the fundamental ethics of Emmanuel Levinas. To Levinas, responsibility is more basic than language, and thus also more basic than all social constructions. Co-operation relations in organizations, markets and value networks are generated (...) from personal relations and personal responsibilities. It is not sufficient to integrate ethics in an impersonal, rational system, neither in business organizations nor in the world economy. Ethics has its source not in rationality, but in the personal. (shrink)

In the analysis of the ethicalproblems of online research, there is much tobe learned from the work that has already beendone on research ethics in the socialsciences and the humanities. I discuss thestructure of norms in the Norwegian ethicalguidelines for research in the social scienceswith respect to their relevance for the ethicalissues of Internet research. A four-stepprocedure for the ethical evaluation ofresearch is suggested. I argue that eventhough, at one level, the problems of onlineresearch are very similar to those we (...) find intraditional areas of social scientificresearch, there still are some issues that areunique to research online. A general model forthe analysis of privacy and data protection issuggested. This model is then used tocharacterize the special problems pertaining tothe protection of privacy in online contexts,and to argue that one cannot assume a simpledistinction between the private and the publicwhen researching in such contexts. (shrink)