Mill’s Principle of Utility: Origins, Proof, and Implications (Leiden: Brill, 2022) is a scholarly monograph on John Stuart Mill’s utilitarianism with a particular emphasis on his proof of the principle of utility. Originally published as Mill’s Principle of Utility: A Defense of John Stuart Mill’s Notorious Proof (Amsterdam: Editions Rodopi, 1994), the present volume is a revised and enlarged edition with additional material, tighter arguments, crisper discussions, and updated references. The initiative is still principally an analysis, interpretation, (...) and defense of the controversial proof, which has yet to attract a scholarly consensus on how it works and whether it succeeds. Well over a century and a half after Mill’s contribution, the subject matter continues to figure prominently in classroom discussions, where the principle and its proof are presented and debated in connection with the critical baggage of logical problems and conceptual confusions wrongly attributed to Mill from the beginning. The overarching aim of the book, now supplemented by a comprehensive historical background and salient philosophical implications, remains the vindication of Mill’s reasoning in pursuit of what he promises as a proof of the principle of utility. (shrink)

Proof-theoretic semantics is an alternative to model-theoretic semantics. It aims at explaining the meaning of the logical constants in terms of the inference rules that govern their behaviour in proofs. We argue that this must be construed as the task of explaining these meanings relative to a logic, i.e., to a consequence relation. Alas, there is no agreed set of properties that a relation must have in order to qualify as a consequence relation. Moreover, the association of a consequence (...) relation to a logical calculus is not as straightforward as it may seem. We show that these facts are problematic for the proof-theoretic project but the problems can be solved. Our thesis is that the consequence relation relevant for proof-theoretic semantics is the one given by the sequent-to-sequent derivability relation in Gentzen systems. (shrink)

Proof-theoretic semantics is an alternative to model-theoretic semantics. It aims at explaining the meaning of the logical constants in terms of the inference rules that govern their behaviour in proofs. We argue that this must be construed as the task of explaining these meanings relative to a logic, i.e., to a consequence relation. Alas, there is no agreed set of properties that a relation must have in order to qualify as a consequence relation. Moreover, the association of a consequence (...) relation to a logical calculus is not as straightforward as it may seem. We show that these facts are problematic for the proof-theoretic project but the problems can be solved. Our thesis is that the consequence relation relevant for proof-theoretic semantics is the one given by the sequent-to-sequent derivability relation in Gentzen systems. (shrink)

In the 1920s, Paul Hertz (1881-1940) developed certain calculi based on structural rules only and established normal form results for proofs. It is shown that he anticipated important techniques and results of general proof theory as well as of resolution theory, if the latter is regarded as a part of structural proof theory. Furthermore, it is shown that Gentzen, in his first paper of 1933, which heavily draws on Hertz, proves a normal form result which corresponds to the (...) completeness of prepositional SLD-resolution in logic programming. (shrink)

Abstractabstract:In Morning Hours (1785), Moses Mendelssohn presents a proof for the existence of God from the grounding of possibility. Although Mendelssohn claims that this proof is original, it has not received much attention in the secondary literature. In this paper, I analyze this proof and present its historical context. I show that although it resembles Leibniz's proof from eternal truths and Kant's precritical possibility proof, it has unique characteristics that can be regarded as responses (...) to deficiencies Mendelssohn identified in these earlier proofs. I argue that by analyzing the semantics of judgments about dispositions, Mendelssohn provides a novel explanation for the basic premise shared by these proofs, namely that possibility is grounded in actuality. Additionally, this analysis simplifies the inference to a unique infinite mind grounding all possibility. Thus, the proof is worth studying both for historical reasons and for its original account of modal concepts. (shrink)

Gentzen's original proof of the Hauptsatz used a rule of multicut in the case that the right premiss of cut was derived by contraction. Cut elimination is here proved without multicut, by transforming suitably the derivation of the premiss of the contraction.

The idea of proof-theoretic validity originated in the work of Gentzen, when he suggested that the meaning of each logical expression was encapsulated in its introduction-rules. The idea was developed by Prawitz and Dummett, but came under attack by Prior under the soubriquet 'analytic validity'. Logical truths and logical consequences are deemed analytically valid by virtue of following, in a way which the present chapter clarifies, from the meaning of the logical constants. But different logics are based on different (...) rules, confer different meanings and so validate different theorems and consequences, some of which are arguably not true or valid at all. It seems to follow that some analytic statements are in fact false. The moral is that we must be careful what rules we adopt and what meanings we use our rules to determine. (shrink)

Sequent calculi constitute an interesting and important category of proof systems. They are much less known than axiomatic systems or natural deduction systems are, and they are much less known than they should be. Sequent calculi were designed as a theoretical framework for investigations of logical consequence, and they live up to the expectations completely as an abundant source of meta-logical results. The goal of this book is to provide a fairly comprehensive view of sequent calculi -- including a (...) wide range of variations. The focus is on sequent calculi for various non-classical logics, from intuitionistic logic to relevance logic, through linear and modal logics. A particular version of sequent calculi, the so-called consecution calculi, have seen important new developments in the last decade or so. The invention of new consecution calculi for various relevance logics allowed the last major open problem in the area of relevance logic to be solved positively: pure ticket entailment is decidable. An exposition of this result is included in chapter 9 together with further new decidability results (for less famous systems). A series of other results that were obtained by J. M. Dunn and me, or by me in the last decade or so, are also presented in various places in the book. Some of these results are slightly improved in their current presentation. Obviously, many calculi and several important theorems are not new. They are included here to ensure the completeness of the picture; their original formulations may be found in the referenced publications. This book contains very little about semantics, in general, and about the semantics of non-classical logic in particular. (shrink)

This paper explores the nature of mathematical beauty from a Kantian perspective. According to Kant’s Critique of the Power of Judgment, satisfaction in beauty is subjective and non-conceptual, yet a proof can be beautiful even though it relies on concepts. I propose that, much like art creation, the formulation and study of a complex demonstration involves multiple and progressive interactions between the freely original imagination and taste. Such a proof is artistic insofar as it is guided by (...) beauty, namely, the mere feeling about the imagination’s free lawfulness. The beauty in a proof’s process and the perfection in its completion together facilitate a transition from subjective to objective purposiveness, a transition that Kant himself does not address in the third Critique. (shrink)

Tetravalent modal logic (TML) was introduced by Font and Rius in 2000. It is an expansion of the Belnap-Dunn four-valued logic FOUR, a logical system that is well-known for the many applications found in several fields. Besides, TML is the logic that preserves degrees of truth with respect to Monteiro’s tetravalent modal algebras. Among other things, Font and Rius showed that TML has a strongly adequate sequent system, but unfortunately this system does not enjoy the cut-elimination property. However, in a (...) previous work we presented a sequent system for TML with the cut-elimination property. Besides, in this same work, it was also presented a sound and complete natural deduction system for this logic. In the present article we continue with the study of TML under a proof-theoretic perspective. In the first place, we show that the natural deduction system that we introduced before admits a normalization theorem. In the second place, taking advantage of the contrapositive implication for the tetravalent modal algebras introduced by A. V. Figallo and P. Landini, we define a decidable tableau system adequate to check validity in the logic TML. Finally, we provide a sound and complete tableau system for TML in the original language. These two tableau systems constitute new (proof-theoretic) decision procedures for checking validity in the variety of tetravalent modal algebras. (shrink)

This article investigates the proof theory of the Quantified Argument Calculus as developed and systematically studied by Hanoch Ben-Yami [3, 4]. Ben-Yami makes use of natural deduction, we, however, have chosen a sequent calculus presentation, which allows for the proofs of a multitude of significant meta-theoretic results with minor modifications to the Gentzen’s original framework, i.e., LK. As will be made clear in course of the article LK-Quarc will enjoy cut elimination and its corollaries.

In this paper, we present another case study in the general project of proof mining which means the logical analysis of prima facie non-effective proofs with the aim of extracting new computationally relevant data. We use techniques based on monotone functional interpretation developed in Kohlenbach , Oxford University Press, Oxford, 1996, pp. 225–260) to analyze Cheney's simplification 189) of Jackson's original proof 320) of the uniqueness of the best L1-approximation of continuous functions fC[0,1] by polynomials pPn of (...) degree n. Cheney's proof is non-effective in the sense that it is based on classical logic and on the non-computational principle WKL . The result of our analysis provides the first effective uniform modulus of uniqueness . Moreover, the extracted modulus has the optimal ε-dependency as follows from Kroó 331). The paper also describes how the uniform modulus of uniqueness can be used to compute the best L1-approximations of a fixed fC[0,1] with arbitrary precision. The second author uses this result to give a complexity upper bound on the computation of the best L1-approximation in Oliva 66–77). (shrink)

Proofs of God in Early Modern Europe offers a fascinating window into early modern efforts to prove God’s existence. Assembled here are twenty-two key texts, many translated into English for the first time, which illustrate the variety of arguments that philosophers of the seventeenth and eighteenth centuries offered for God. These selections feature traditional proofs—such as various ontological, cosmological, and design arguments—but also introduce more exotic proofs, such as the argument from eternal truths, the argument from universal aseity, and the (...) argument ex consensu gentium. Drawn from the work of eighteen philosophers, this book includes both canonical figures (such as Descartes, Spinoza, Newton, Leibniz, Locke, and Berkeley) and noncanonical thinkers (such as Norris, Fontenelle, Voltaire, Wolff, Du Châtelet, and Maupertuis). -/- Lloyd Strickland provides fresh translations of all selections not originally written in English and updates the spelling and grammar of those that were. Each selection is prefaced by a lengthy headnote, giving a biographical account of its author, an analysis of the main argument(s), and important details about the historical context. Strickland’s introductory essay provides further context, focusing on the various reasons that led so many thinkers of early modernity to develop proofs of God’s existence. -/- Proofs of God is perfect for both students and scholars of early modern philosophy and philosophy of religion. (shrink)

An Introduction to Proof Theory provides an accessible introduction to the theory of proofs, with details of proofs worked out and examples and exercises to aid the reader's understanding. It also serves as a companion to reading the original pathbreaking articles by Gerhard Gentzen. The first half covers topics in structural proof theory, including the Gödel-Gentzen translation of classical into intuitionistic logic, natural deduction and the normalization theorems, the sequent calculus, including cut-elimination and mid-sequent theorems, and various (...) applications of these results. The second half examines ordinal proof theory, specifically Gentzen's consistency proof for first-order Peano Arithmetic. The theory of ordinal notations and other elements of ordinal theory are developed from scratch, and no knowledge of set theory is presumed. The proof methods needed to establish proof-theoretic results, especially proof by induction, are introduced in stages throughout the text. Mancosu, Galvan, and Zach's introduction will provide a solid foundation for those looking to understand this central area of mathematical logic and the philosophy of mathematics. (shrink)

Fuzzy logics are many-valued logics that are well suited to reasoning in the context of vagueness. They provide the basis for the wider field of Fuzzy Logic, encompassing diverse areas such as fuzzy control, fuzzy databases, and fuzzy mathematics. This book provides an accessible and up-to-date introduction to this fast-growing and increasingly popular area. It focuses in particular on the development and applications of "proof-theoretic" presentations of fuzzy logics; the result of more than ten years of intensive work by (...) researchers in the area, including the authors. In addition to providing alternative elegant presentations of fuzzy logics, proof-theoretic methods are useful for addressing theoretical problems and developing efficient deduction and decision algorithms. Proof-theoretic presentations also place fuzzy logics in the broader landscape of non-classical logics, revealing deep relations with other logics studied in Computer Science, Mathematics, and Philosophy. The book builds methodically from the semantic origins of fuzzy logics to proof-theoretic presentations such as Hilbert and Gentzen systems, introducing both theoretical and practical applications of these presentations. (shrink)

We explore depth substitution invariance, or hyperformalism, and extend known results in this realm to justification logics extending weak relevant logics. We then examine the surprising invariance of justifications over formulas and restrict our attention to the substitution of proofs in the original relevant logic. The results of this paper indicate that depth invariance is a recalcitrant feature of the logic and that proof structures in hyperformal logics are quite inflexible.

Este trabajo tiene por objetivo examinar la idea de deducción metamatemática en el programa de Hilbert, mostrando su dependencia de conceptos gnoseológicos, tales como el de conocimiento intuitivo. También se comparará esta concepcion de la deducción con la fundamentación intuicionista de la logica. Sostendré que esta deducción metamatemática lleva a una caracterización de la logica como una teoría de las deducciones formales en un sentido particular.This paper aims to examine the idea of metamathematical deduction in Hilbert’s program showing its dependence (...) of epistemological notions, such as intuitive knowledge. This conception of deduction will be also compared with the intuitionistic foundation of logic. I will argue that this metamathematical deduction leads to a characterization of logic as a theory of formal deductions in a particular sense. (shrink)

In the first chapter, we discuss Dummett’s idea that the notion of truth arises from the one of the correctness of an assertion. We argue that, in a first-order language, the need of defining truth in terms of the notion of satisfaction, which is yielded by the presence of quantifiers, is structurally analogous to the need of a notion of truth as distinct from the one of correctness of an assertion. In the light of the analogy between predicates in Frege (...) and open formulas in Tarksi, we concentrate on the semantic status of predicates. We register a dual attitude of Dummett towards Frege’s ascription of reference to predicates. On the one it is needed to endow quantifiers with their appropriate meaning. On the other hand, the introduction of concepts, as semantic correlate of predicates, smuggles a realist flavor in the overall semantic picture. In concluding the excursus (and with it the chapter), we stress Dummett’s will of developing a semantic picture free from this realist trait. In the second chapter, we present the idea of a proof-theoretic semantics. As for Frege true sentences denotes the truth-value True, so here closed' (i.e. categorical) valid argumentations denotes proofs. If a language contains implication-like operators, in order to characterize the condition of validity of a closed argumentation one has to introduce a notion of validity applying to ‘open’ (i.e. hypothetical) argumentations. We argue that this problem is analogous to the one posed by quantifiers in Frege-Tarksi’s style semantics. That is, implication forces one to introduce notion of validity for argumentations, which is more substantial than the correctness of the assertion of their conclusions. As we saw, the corresponding claim in the truth-based approach—that quantifiers require one to introduce a notion of truth, which is more substantial than the one of an assertion being correct—was the source of realism. Hence, Dummett proposes to reduce the semantic contribution of open argumentations to the one of their ‘closed instances’. In the truth-based perspective, this would correspond to the denial of the need of introducing concepts as the semantic correlates of predicates. We argue that Dummett’s fear, that an irreducible notion of function (represented by the need of ascribing validity to open argumentations) would lead to realism, turns out to be ill-founded. In the third chapter, we discuss the role played by the notion of truth in the anti-realist account. The notion of truth is what the anti-realist needs to cope with the so-called paradox of deduction. The analysis of the paradox yields to distinguishing between the truth of a sentence and the truth of a sentence being recognized. In terms of these conceptual couple, we reconsider the relationship between truth and assertion in an anti-realist perspective. Grounds are provided for a thesis (which was already advanced in chapter two), according to which the notion of the assertion of a sentence being correct is primarily connected only with the canonical means of establishing a sentence. The possibility of establishing a sentence by indirect means is conceptually dependent on the practice of establishing logical relationship of dependence among sentences. That is, the notion of a closed valid non-canonical argumentation is of any theoretical relevance only in presence of a notion of validity applying to open argumentations. In the fourth chapter, we discuss the possibility of characterizing in the proof-theoretic-semantics a notion of refutation. We develop an original characterization of refutations starting from an informal inductive specification of the condition of refutations of logically complex sentences. A sub-structural logic, called dual-intuitionistic logic, stands to this notion in the same relationship in which intuitionistic logic stands to the notion of proof so far consdered. All notions developed in chapter 2 have their corresponding (dual) ones in the framework developed. In particular, the distinctions canonical/non-canonical and closed/open argumentations. In the refutation based perspective, elimination rules have priority over introductions and the (only) assumption over the (many) conclusions. In the conclusions, we indicate the ingredients that an anti-realist approach to meaning should incorporate, in order to avoid the difficulties we registered. The core of an alternative view is a different conception of the relationship between categorical and hypothetical notions, in which the validity of open argumentations is not reduced to that of their instances, but rather it is directly defined. As a limit case, one would get a notion of validity applying to closed argumentations. (shrink)

We present a survey of proof theory in the USSR beginning with the paper by Kolmogorov [1925] and ending (mostly) in 1969; the last two sections deal with work done by A. A. Markov and N. A. Shanin in the early seventies, providing a kind of effective interpretation of negative arithmetic formulas. The material is arranged in chronological order and subdivided according to topics of investigation. The exposition is more detailed when the work is little known in the West (...) or the original presentation can be improved using notions or results which appeared later. This includes such topics as Novikov's cut-elimination method (regular formulas) and Maslov's inverse method for the predicate logic. (shrink)

We present a novel way of using proof nets for the multimodal Lambek calculus, which provides a general treatment of both the unary and binary connectives. We also introduce a correctness criterion which is valid for a large class of structural rules and prove basic soundness, completeness and cut elimination results. Finally, we will present a correctness criterion for the original Lambek calculus Las an instance of our general correctness criterion.

This is a contribution to the idea that some proofs in first-order logic are synthetic. Syntheticity is understood here in its classical geometrical sense. Starting from Jaakko Hintikka’s original idea and Allen Hazen’s insights, this paper develops a method to define the ‘graphical form’ of formulae in monadic and dyadic fraction of first-order logic. Then a synthetic inferential step in Natural Deduction is defined. A proof is defined as synthetic if it includes at least one synthetic inferential step. (...) Finally, it will be shown that the proposed definition is not sensitive to different ways of driving the same conclusion from the same assumptions. (shrink)

Apologies. The purpose of the following talk is to give an overview of the present state of aims, methods and results in Pure Proof Theory. Shortage of time forces me to concentrate on my very personal views. This entails that I will emphasize the work which I know best, i.e., work that has been done in the triangle Stanford, Munich and Münster. I am of course well aware that there are as important results coming from outside this triangle and (...) I apologize for not displaying these results as well.Moreover the audience should be aware that in some points I have to oversimplify matters. Those who complain about that are invited to consult the original papers.1.1. General. Proof theory startedwithHilbert's Programme which aimed at a finitistic consistency proof for mathematics.By Gödel's Theorems, however, we know that we can neither formalize all mathematics nor even prove the consistency of formalized fragments by finitistic means. Inspite of this fact I want to give some reasons why I consider proof theory in the style of Gentzen's work still as an important and exciting field of Mathematical Logic. I will not go into applications of Gentzen's cut-elimination technique to computer science problems—this may be considered as applied proof theory—but want to concentrate on metamathematical problems and results. In this sense I am talking about Pure Proof Theory.Mathematicians are interested in structures. There is only one way to find the theorems of a structure. Start with an axiom system for the structure and deduce the theorems logically. These axiom systems are the objects of proof-theoretical research. Studying axiom systems there is a series of more or less obvious questions. (shrink)

Chapter 1 constitutes an introduction to Gentzen calculi from two perspectives, logical and philosophical. It introduces the notion of generalisations of Gentzen sequent calculus and the discussion on properties that characterize good inferential systems. Among the variety of Gentzen-style sequent calculi, I divide them in two groups: syntactic and semantic generalisations. In the context of such a discussion, the inferentialist philosophy of the meaning of logical constants is introduced, and some potential objections – mainly concerning the choice of working with (...) semantic generalizations – are addressed. Finally, I’ll introduce the case studies that I’ll be dealing with in part II. Chapter 2 is concerned with the origins and development of Jaśkowski’s discussive logic. The main idea of this chapter is to systematize the various stages of the development of discussive logic related researches from two different angles, i.e., its connections to modal logics and its proof theory, by highlighting virtues and vices. Chapter 3 focuses on the Gentzen-style proof theory of discussive logic, by providing a characterization of it in terms of labelled sequent calculi. Chapter 4 deals with the Gentzen-style proof theory of relevant logics, again by employing the methodology of labelled sequent calculi. This time, instead of working with a single logic, I’ll deal with a whole family of them. More precisely, I’ll study in terms of proof systems those relevant logics that can be characterised, at the semantic level, by reduced Routley-Meyer models, i.e., relational structures with a ternary relation between states and a unique base element. Chapter 5 investigates the proof theory of a modal expansion of intuitionistic propositional logic obtained by adding an ‘actuality’ operator to the connectives. This logic was introduced also using Gentzen sequents. Unfortunately, the original proof system is not cut-free. This chapter shows how to solve this problem by moving to hypersequents. Chapter 6 concludes the investigations and discusses the future of the research presented throughout the dissertation. (shrink)

A diagrammatic representation is given of the 24 rays of Peres that makes it easy to pick out all the 512 parity proofs of the Kochen-Specker theorem contained in them. The origin of this representation in the four-dimensional geometry of the rays is pointed out.

The author analyzes proof and argumentation as a form of appeal to a scientific community with deep ethical meaning. He presents proof primarily as an effort to persuade a scientific community rather than a search for true knowledge, as an instrument by which responsibility is taken for the correctness of the thesis being proved, which usually originates in a sudden flash of insight.

A proof of normalization for a classical system of Peano Arithmetic formulated in natural deduction is given. The classical rule of the system is the rule for indirect proof restricted to atomic formulas. This rule does not, due to the restriction, interfere with the standard detour conversions. The convertible detours, numerical inductions and instances of indirect proof concluding falsity are reduced in a way that decreases a vector assigned to the derivation. By interpreting the expressions of the (...) vectors as ordinals each derivation is assigned an ordinal less than ɛ0. The vector assignment, which proves termination of the procedure, originates in a normalization proof for Gödel’s T by Howard. (shrink)

Schwichtenberg showed that the System T definable functionals are closed under a rule-like version Spector’s bar recursion of lowest type levels 0 and 1. More precisely, if the functional Y which controls the stopping condition of Spector’s bar recursor is T-definable, then the corresponding bar recursion of type levels 0 and 1 is already T-definable. Schwichtenberg’s original proof, however, relies on a detour through Tait’s infinitary terms and the correspondence between ordinal recursion for α < ε₀ and primitive (...) recursion over finite types. This detour makes it hard to calculate on given concrete system T input, what the corresponding system T output would look like. In this paper we present an alternative (more direct) proof based on an explicit construction which we prove correct via a suitably defined logical relation. We show through an example how this gives a straightforward mechanism for converting bar recursive definitions into T-definitions under the conditions of Schwichtenberg’s theorem. Finally, with the explicit construction we can also easily state a sharper result: if Y is in the fragment Tᵢ then terms built from BR^ℕ,σ for this particular Y are definable in the fragment T_i+max{1,level(σ)}+2. (shrink)

We give a simplified proof of elimination of imaginaries in ACVF, based on ideas of Hrushovski. This proof manages to avoid many of the technical issues which arose in the original proof by Haskell, Hrushovski, and Macpherson.

The epsilon operator is a term-forming operator which replaces quantifiers in ordinary predicate logic. The application of this undervalued formalism has been hampered by the absence of well-behaved proof systems on the one hand, and accessible presentations of its theory on the other. One significant early result for the original axiomatic proof system for the epsilon-calculus is the first epsilon theorem, for which a proof is sketched. The system itself is discussed, also relative to possible semantic (...) interpretations. The problems facing the development of proof-theoretically well-behaved systems are outlined. (shrink)

Is truth in the law just plain truth - or something sui generis? Is a trial a search for truth? Do adversarial procedures and exclusionary rules of evidence enable, or impede, the accurate determination of factual issues? Can degrees of proof be identified with mathematical probabilities? What role can statistical evidence properly play? How can courts best handle the scientific testimony on which cases sometimes turn? How are they to distinguish reliable scientific testimony from unreliable hokum? These interdisciplinary essays (...) explore such questions about science, proof, and truth in the law. With her characteristic clarity and verve, Haack brings her original and distinctive work in theory of knowledge and philosophy of science to bear on real-life legal issues. She includes detailed analyses of a wide variety of cases and lucid summaries of relevant scientific work, of the many roles of the scientific peer-review system, and of relevant legal developments. (shrink)

The Hegel Lectures Series Series Editor: Peter C. Hodgson Hegel's lectures have had as great a historical impact as the works he himself published. Important elements of his system are elaborated only in the lectures, especially those given in Berlin during the last decade of his life. The original editors conflated materials from different sources and dates, obscuring the development and logic of Hegel's thought. The Hegel Lectures series is based on a selection of extant and recently discovered transcripts (...) and manuscripts. Lectures from specific years are reconstructed so that the structure of Hegel's argument can be followed. Each volume presents an accurate new translation accompanied by an editorial introduction and annotations on the text, which make possible the identification of Hegel's many allusions and sources. Lectures on the Proofs of the Existence of God Hegel lectured on the proofs of the existence of God as a separate topic in 1829. He also discussed the proofs in the context of his lectures on the philosophy of religion (1821-31), where the different types of proofs were considered mostly in relation to specific religions. The text that he prepared for his lectures in 1829 was a fully formulated manuscript and appears to have been the first draft of a work that he intended to publish and for which he signed a contract shortly before his death in 1831. The 16 lectures include an introduction to the problem of the proofs and a detailed discussion of the cosmological proof. Philipp Marheineke published these lectures in 1832 as an appendix to the lectures on the philosophy of religion, together with an earlier manuscript fragment on the cosmological proof and the treatment of the teleological and ontological proofs as found in the 1831 philosophy of religion lectures. Hegel's 1829 lectures on the proofs are of particular importance because they represent what he actually wrote as distinct from auditors' transcriptions of oral lectures. Moreover, they come late in his career and offer his final and most seasoned thinking on a topic of obvious significance to him, that of the reality status of God and ways of knowing God. These materials show how Hegel conceived the connection between the cosmological, teleological, and ontological proofs. All of this material has been newly translated by Peter C. Hodgson from the German critical editions by Walter Jaeschke. This edition includes an editorial introduction, annotations on the text, and a glossary and bibliography. (shrink)

This paper is a step toward showing what is achievable using non-classical metatheory—particularly, a substructural paraconsistent framework. What standard results, or analogues thereof, from the classical metatheory of first order logic can be obtained? We reconstruct some of the originals proofs for Completeness, Löwenheim-Skolem and Compactness theorems in the context of a substructural logic with the naive comprehension schema. The main result is that paraconsistent metatheory can ‘re-capture’ versions of standard theorems, given suitable restrictions and background assumptions; but the shift (...) to non-classical logic may recast the meanings of these apparently ‘absolute’ theorems. (shrink)

In this work we develop goal-directed deduction methods for the implicational fragment of several modal logics. We give sound and complete procedures for strict implication of K, T, K4, S4, K5, K45, KB, KTB, S5, G and for some intuitionistic variants. In order to achieve a uniform and concise presentation, we first develop our methods in the framework of Labelled Deductive Systems [Gabbay 96]. The proof systems we present are strongly analytical and satisfy a basic property of cut admissibility. (...) We then show that for most of the systems under consideration the labelling mechanism can be avoided by choosing an appropriate way of structuring theories. One peculiar feature of our proof systems is the use of restart rules which allow to re-ask the original goal of a deduction. In case of K, K4, S4 and G, we can eliminate such a rule, without loosing completeness. In all the other cases, by dropping such a rule, we get an intuitionistic variant of each system. The present results are part of a larger project of a goal directed proof theory for non-classical logics; the purpose of this project is to show that most implicational logics stem from slight variations of a unique deduction method, and from different ways of structuring theories. Moreover, the proof systems we present follow the logic programming style of deduction and seem promising for proof search [Gabbay and Reyle 84, Miller et al. 91]. (shrink)

I develop the decision-theoretic approach to quantum probability, originally proposed by David Deutsch, into a mathematically rigorous proof of the Born rule in (Everett-interpreted) quantum mechanics. I sketch the argument informally, then prove it formally, and lastly consider a number of proposed ``counter-examples'' to show exactly which premises of the argument they violate. (This is a preliminary version of a chapter to appear --- under the title ``How to prove the Born Rule'' --- in Saunders, Barrett, Kent and Wallace, (...) "Many worlds? Everett, quantum theory and reality", forthcoming from Oxford University Press.). (shrink)

This paper applies Dehornoy et al.’s Z theorem and its variant, called the compositional Z theorem, to prove confluence of Parigot’s \-calculi extended by the simplification rules. First, it is proved that Baba et al.’s modified complete developments for the call-by-name and the call-by-value variants of the \-calculus with the renaming rule, which is one of the simplification rules, satisfy the Z property. It gives new confluence proofs for them by the Z theorem. Secondly, it is shown that the compositional (...) Z theorem can be applied to prove confluence of the call-by-name and the call-by-value \-calculi with both simplification rules, the renaming and the \-rules, whereas it is hard to apply the ordinary parallel reduction technique or the original Z theorem by one-pass definition of mappings for these variants. (shrink)

hiS volume in the Synthese Library Series is the result of a conference T held at the University of Roskilde, Denmark, October 31st-November 1st, 1997. The aim was to provide a forum within which philosophers, math ematicians, logicians and historians of mathematics could exchange ideas pertaining to the historical and philosophical development of proof theory. Hence the conference was called Proof Theory: History and Philosophical Significance. To quote from the conference abstract: Proof theory was developed as part (...) of Hilberts Programme. According to Hilberts Programme one could provide mathematics with a firm and se cure foundation by formalizing all of mathematics and subsequently prove consistency of these formal systems by finitistic means. Hence proof theory was developed as a formal tool through which this goal should be fulfilled. It is well known that Hilbert's Programme in its original form was unfeasible mainly due to Gtldel's incompleteness theorems. Additionally it proved impossible to formalize all of mathematics and impossible to even prove the consistency of relatively simple formalized fragments of mathematics by finitistic methods. In spite of these problems, Gentzen showed that by extending Hilbert's proof theory it would be possible to prove the consistency of interesting formal systems, perhaps not by finitis tic methods but still by methods of minimal strength. This generalization of Hilbert's original programme has fueled modern proof theory which is a rich part of mathematical logic with many significant implications for the philosophy of mathematics. (shrink)

This book of sixteen original essays is the first to explore this range of new developments in the philosophy of mathematics, in a language accessible to ...

In this paper a complete proper subclass of Hilbert-style S4 proofs, named non-circular, will be determined. This study originates from an investigation into the formal connection between S4, as Logic of Provability and Logic of Knowledge, and Artemov's innovative Logic of Proofs, LP, which later developed into Logic of Justification. The main result concerning the formal connection is the realization theorem , which states that S4 theorems are precisely the formulas which can be converted to LP theorems with proper justificational (...) objects substituting for modal knowledge operators. We extend this result by showing that on the proof level, non-circular proofs are exactly the class of S4 proofs which can be realized to LP proofs. In turn, this study provides an alternative algorithm to achieve the realization theorem, and a novel logical system, called S4ΔS4Δ, is introduced, which, under an adequate interpretation, is worth studying for its own sake. (shrink)

Proof-theoretic semantics is an inferentialist theory of meaning, usually developed in a multiple-assumption and single-conclusion framework. In that framework, this theory seems unable to justify classical logic, so some authors have proposed a multiple-conclusion reformulation to accomplish this goal. In the first part of this paper, the debate originated by this proposal is briefly exposed and used to defend the diverging opinion that proof-theoretic semantics should always endorse a single-assumption and single-conclusion framework. In order to adopt this approach (...) some of its _criteria_ of validity, especially separability, need to be weakened. This choice is evaluated and defended. The main argument in this direction is based on the circular dependences of meaning between multiple assumptions and conjunctions, and between multiple conclusions and disjunctions. In the second part of this paper, some systems that suit the new requirements are proposed for both intuitionistic and classical logic. A proof that they are valid, according to the weakened _criteria_, is sketched. (shrink)

The aim of this paper is to offer a conceptual analysis of Weinberg's proof of the spin-statistics theorem by comparing it with Pauli's original proof and with the subsequent textbook tradition, which typically resorts to the dichotomy positive energy for half-integral spin particles/microcausality for integral-spin particles. In contrast to this tradition, Weinberg's proof does not directly invoke the positivity of the energy, but derives the theorem from the single relativistic requirement of microcausality. This seemingly innocuous difference (...) marks an important change in the conceptual basis of quantum physics. Its historical, theoretical, and conceptual roots are here reconstructed. The link between Weinberg's proof and Pauli's original is highlighted: Weinberg's proof turns out to do justice to Pauli's anti-Dirac lines of thought. The work of Furry and Oppenheimer is also surveyed as a “third way” between the textbook tradition established by Pauli and Weinberg's approach. (shrink)

We show that every MALL proof-structure [9] satisfies the property of softness, originally a categorical notion introduced by Joyal. Furthermore, we show that the notion of hereditary softness precisely captures Girard’s algebraic restriction of the technical condition on proof-structures. Relying on this characterization, we prove a MALL+Mix sequentialization theorem by a proof-theoretical method, using Girard’s notion of jump. Our MALL+Mix correctness criterion subsumes the Danos/Fleury-Retoré criterion [6] for MLL+Mix.

In 1996, Krivine applied Friedman's A-translation in order to get an intuitionistic version of Gödel completeness result for first-order classical logic and countable languages and models. Such a result is known to be intuitionistically underivable 559), but Krivine was able to derive intuitionistically a weak form of it, namely, he proved that every consistent classical theory has a model. In this paper, we want to analyze the ideas Krivine's remarkable result relies on, ideas which where somehow hidden by the heavy (...) formal machinery used in the original proof. We show that the ideas in Krivine's proof can be used to intuitionistically derive some crucial mathematical results, which were supposed to be purely classical up to now: the Ultrafilter Theorem for countable Boolean algebras, and the maximal ideal theorem for countable rings. (shrink)

By a thorough study of the Posterior Analytics and related Aristotelian texts, Richard McKirahan reconstructs Aristotle's theory of episteme--science. The Posterior Analytics contains the first extensive treatment of the nature and structure of science in the history of philosophy, and McKirahan's aim is to interpret it sympathetically, following the lead of the text, rather than imposing contemporary frameworks on it. In addition to treating the theory as a whole, the author uses textual and philological as well as philosophical material to (...) interpret many important but difficult individual passages. A number of issues left obscure by the Aristotelian material are settled by reference to Euclid's geometrical practice in the Elements. To justify this use of Euclid, McKirahan makes a comparative analysis of fundamental features of Euclidian geometry with the corresponding elements of Aristotle's theory. Emerging from that discussion is a more precise and more complex picture of the relation between Aristotle's theory and Greek mathematics--a picture of mutual, rather than one-way, dependence. Originally published in 1992. The Princeton Legacy Library uses the latest print-on-demand technology to again make available previously out-of-print books from the distinguished backlist of Princeton University Press. These editions preserve the original texts of these important books while presenting them in durable paperback and hardcover editions. The goal of the Princeton Legacy Library is to vastly increase access to the rich scholarly heritage found in the thousands of books published by Princeton University Press since its founding in 1905. (shrink)

We present a direct proof of the consistency of the existence of a five element basis for the uncountable linear orders. Our argument is based on the approach of König, Larson, Moore and Veličković and simplifies the original proof of Moore.

Since the beginning of human history, there has been no society that did not have any religion. Man meets his need to believe, encoded in his nature by turning to God. God has not left humans alone in their journey on earth, and from time to time, He has intervened in the world through his prophets. The prophethood, which constitutes one of the main subjects of theology, is an important institution in God-human communication. The messengers chosen by God convey to (...) people the information that they received through revelation and offer teachings that will bring them to salvation. The idea of salvation by God when suffering or feeling helpless has driven people to the expectation of a savior. Nearly all religions except Shintoism have the awaited savior belief in the world. Accordingly, the savior will emerge in an environment of chaos where disasters are experienced, and a moral collapse is observed. The expected savior will drive people away from this turmoil, bring them happiness, well-being, and lead them to salvation. Although there is a savior belief in Judaism and Christianity, Muslims claim that the awaited savior in these religions is Muhammad. Muslim thinkers who believe that Muhammad was heralded in previous scripts, tried to find evidence on the subject from the Bible. One of the Islamic scholars who did researches for this purpose is Shamsuddin al-Samarqandi. Shamsuddin Mohammed b. Ashraf al-Husayni al-Samarqandi is an important Turkish-Islamic scholar who lived in Turkestan at the end of the 7th century and the first quarter of the 8th century. Samarqandi is a versatile scholar who produced important works in various fields such as philosophy, logic, mathematics, discussion, debate and astronomy. Shamsuddin al-Samarqandi is one of the eminent scholars who have written his name in the history of science and philosophy with his works. He adopted a critical and analytical style in almost every field, putting the science of logic at the center of his system. His constructive criticisms had an important function in understanding and interpreting the ideas of numerous thinkers, from Greek philosophers to Islamic philosophers and representatives of philosophical theology. In addition to all these, Samarqandi did not hesitate to criticize the Christian and Jewish belief systems, religions such as Sanawiyyah and Zoroastrianism, and the teachings of the naturalist philosophers regarding the relationship between God and the world in the light of rational and scriptural evidence. Samarqandi, who distinguished himself in rational sciences, also showed himself with his background in theology. Due to his exceptional intellectual interest, he analyzes some key concepts and divine codes related to the Bible, making original inferences about the loyalty of Muhammad, the prophet of Islam. Samarqandi interprets some passages of the Torah and the New Testament, which he considers as signs of Muhammad's prophethood, in the axis of language, logic and the rules of shariah, and concludes that Muhammad is the last prophet to be announced. The conceptual framework that he mostly focuses on in this regard contains Mount Paran, Paraklite, comparison with Moses, and the good news given to the Ishmaelites. Samarqandi makes inferences about the environment in which Muhammad appeared, his qualities, and his lineage, based on the aforementioned concepts. Samarqandi also responds to the criticisms raised by the Ahl al-Kitab about the principles, such as the abolition of other religious rules constituting the basis of Muhammad's legitimacy and establishment of Islam instead, and him being a universal prophet. An important privilege of Samarqandi is that he not only grounds his claims on a theoretical scale but also engages in debates with the leaders of the Ahl al-Kitab. Although Samarqandi exhibits a satisfactory analytical attitude in most of his claims, he displays a sophisticated approach based on the method of coercion (ilzām) in some of his claims. Although he adheres to the tradition of beshair al-nubuwwah in general, he gives a different perspective and strong reasoning to the same evidence within the tradition with the effect of his identity as a verifier (muhaqqik). (shrink)