Multiple -conclusion logic extends formal logic by allowing arguments to have a set of conclusions instead of a single one, the truth lying somewhere among the conclusions if all the premises are true. The extension opens up interesting possibilities based on the symmetry between premises and conclusions, and can also be used to throw fresh light on the conventional logic and its limitations. This is a sustained study of the subject and is certain to stimulate further research. Part I reworks (...) the fundamental ideas of logic to take account of multiple conclusions, and investigates the connections between multiple - and single - conclusion calculi. Part II draws on graph theory to discuss the form and validity of arguments independently of particular logical systems. Part III contrasts the multiple - and the single - conclusion treatment of one and the same subject, using many-valued logic as the example; and Part IV shows how the methods of 'natural deduction' can be matched by direct proofs using multiple conclusions. (shrink)

A proof is a successful demonstration that a conclusion necessarily follows by logical reasoning from axioms which are considered evident for the given context and agreed upon by the community. It is this concept that sets mathematics apart from other disciplines and distinguishes it as the prototype of a deductive science. Proofs thus are utterly relevant for research, teaching and communication in mathematics and of particular interest for the philosophy of mathematics. In computer science, moreover, proofs have proved to be (...) a rich source for already certified algorithms. This book provides the reader with a collection of articles covering relevant current research topics circled around the concept 'proof'. It tries to give due consideration to the depth and breadth of the subject by discussing its philosophical and methodological aspects, addressing foundational issues induced by Hilbert's Programme and the benefits of the arising formal notions of proof, without neglecting reasoning in natural language proofs and applications in computer science such as program extraction. (shrink)

Completeness and other forms of Zorn’s Lemma are sometimes invoked for semantic proofs of conservation in relatively elementary mathematical contexts in which the corresponding syntactical conservation would suffice. We now show how a fairly general syntactical conservation theorem that covers plenty of the semantic approaches follows from an utmost versatile criterion for conservation given by Scott in 1974.To this end we work with multi-conclusion entailment relations as extending single-conclusion entailment relations. In a nutshell, the additional axioms with disjunctions in positive (...) position can be eliminated by reducing them to the corresponding disjunction elimination rules, which in turn prove admissible in all known mathematical instances. In deduction terms this means to fold up branchings of proof trees by way of properties of the relevant mathematical structures.Applications include the syntactical counterparts of the theorems or lemmas known under the names of Artin–Schreier, Krull–Lindenbaum, and Szpilrajn. Related work has been done before on individual instances, e.g., in locale theory, dynamical algebra, formal topology and proof analysis. (shrink)

In the present contribution we look at the legacy of Hilbert's programme in some recent developments in mathematics. Hilbert's ideas have seen new life in generalised and relativised forms by the hands of proof theorists and have been a source of motivation for the so--called reverse mathematics programme initiated by H. Friedman and S. Simpson. More recently Hilbert's programme has inspired T. Coquand and H. Lombardi to undertake a new approach to constructive algebra in which strong emphasis is laid on (...) the use of finite methods. The main aim is to eliminate the ideal objects and in so doing obtain more elementary and informative proofs. We survey some work in commutative algebra---mainly about and around the Zariski spectrum and the Krull dimension of a commutative ring---which witnesses the feasibility of such a revised Hilbert's programme. (shrink)

A way is found to add axioms to sequent calculi that maintains the eliminability of cut, through the representation of axioms as rules of inference of a suitable form. By this method, the structural analysis of proofs is extended from pure logic to free-variable theories, covering all classical theories, and a wide class of constructive theories. All results are proved for systems in which also the rules of weakening and contraction can be eliminated. Applications include a system of predicate logic (...) with equality in which also cuts on the equality axioms are eliminated. (shrink)

A possible relevant meaning of Hilbert’s program is the following one: “give a constructive semantic for classical mathematics”. More precisely, give a systematic interpretation of classical abstract proofs about abstract objects, as constructive proofs about constructive versions of these objects.If this program is fulfilled we are able “at the end of the tale” to extract constructive proofs of concrete results from classical abstract proofs of these results.Dynamical algebraic structures or geometric theories seem to be a good tool for doing this (...) job. In this setting, classical abstract objects are interpreted through incomplete concrete specifications of these objects.The structure of axioms in geometric theories gives rise in a natural way to distributive lattices and pointfree topological spaces. Abstract objects correspond to classical points of these pointfree spaces.We shall insist on the Zariski spectrum of distributive lattices and commutative rings and give a constructive interpretation of the Krull dimension.We underline the fact that many abstract objects in classical mathematics can be viewed as points of spectral spaces corresponding to distributive lattices whose definition is concrete and natural.Two important facts are to be stressed.First, abstract proofs about points of these pointfree spaces can very often be reread as constructive proofs about constructible subsets of these spaces.Second, function spaces on these pointfree spaces are often explicitly used in elegant abstract theories. The structure of these function spaces is fully constructive: indeed by the compactness theorem, “all is finite”. The constructive rereading of the abstract proofs is in this setting is nothing but the simple constatation that abstract proofs use correctly axioms.RésuméUne manière pertinente de revisiter le Programme de Hilbert serait la suivante: « donner une sémantique constructive pour les mathématiques classiques ». Plus précisément donner une interprétation systématique des preuves classiques abstraites au sujet des objets abstraits, en terme de preuves constructives au sujet de contreparties constructives de ces objets abstraits.Si ce programme est rempli, nous sommes capables « à la fin de l’histoire » d’extraire des preuves constructives de résultats concrets à partir des preuves classiques abstraites de ces résultats.Les structures algébriques dynamiques, ou ce qui revient à peu près au même les théories géométriques, semblent être un bon outil pour réaliser ce travail. Dans cette optique, les objets abstraits des mathématiques classiques sont remplacés par des spécifications incomplètes mais concrètes de ces mêmes objets.La structure des théories géométriques donne naissance de manière naturelle à des treillis distributifs et à des espaces topologiques sans points. Les objets abstraits utilisés par les mathématiques classiques correspondent aux points classiques de ces espaces sans points.Dans cet article, nous illustrerons ce phénomène principalement avec le spectre de Zariski des treillis distributifs et celui des anneaux commutatifs, en indiquant notamment un équivalent constructif de la notion de dimension de Krull.Nous insistons sur le caractère extrêmement général de l’interpétation des objets abstraits idéaux des mathématiques classiques comme des points d’espaces spectraux associés à des treillis distributifs qui sont définis de façon naturelle et concrète.Souligons deux faits d’expérience importants.Tout d’abord, les preuves abstraites au sujet des points de ces espaces sans points peuvent en général être relues comme des preuves concernant les parties constructibles de ces espaces.Enfin, les espaces de fonctions continues sur ces espaces sans points sont souvent utilisés dans d’élégantes théories abstraites. Ces espaces de fonctions sont bien définis constructivement. Cela tient au « théorème de compacité » qui nous dit que dans le cadre en question « tout est fini ». La relecture constructive des preuves abstraites n’est alors rien d’autre que la constatation que les axiomes géométriques sont utilisés de manière correcte. (shrink)

A way is found to add axioms to sequent calculi that maintains the eliminability of cut, through the representation of axioms as rules of inference of a suitable form. By this method, the structural analysis of proofs is extended from pure logic to free-variable theories, covering all classical theories, and a wide class of constructive theories. All results are proved for systems in which also the rules of weakening and contraction can be eliminated. Applications include a system of predicate logic (...) with equality in which also cuts on the equality axioms are eliminated. (shrink)

In the late 1960s and early 1970s, Dana Scott introduced a kind of generalization (or perhaps simplification would be a better description) of the notion of inference, familiar from Gentzen, in which one may consider multiple conclusions rather than single formulas. Scott used this idea to good effect in a number of projects including the axiomatization of many-valued logics (of various kinds) and a reconsideration of the motivation of C.I. Lewis. Since he left the subject it has been vigorously prosecuted (...) by a number of authors under the heading of abstract entailment relations where it has found an important role in both algebra and theoretical computer science. In this essay we go back to the beginnings, as presented by Scott, in order to make some comments about Scott’s cut rule, and show how much of Scott’s main result may be applied to the case of single-conclusion logic. (shrink)

Formal topology aims at developing general topology in intuitionistic and predicative mathematics. Many classical results of general topology have been already brought into the realm of constructive mathematics by using formal topology and also new light on basic topological notions was gained with this approach which allows distinction which are not expressible in classical topology. Here we give a systematic exposition of one of the main tools in formal topology: inductive generation. In fact, many formal topologies can be presented in (...) a predicative way by an inductive generation and thus their properties can be proved inductively. We show however that some natural complete Heyting algebra cannot be inductively defined. (shrink)

RésuméNous introduisons la notion de structure algébrique dynamique, inspirée de l'évaluation dynamique et de la théorie des modèles. Nous montrons comment cette notion constructive permet une relecture de la théorie d'Artin-Schreier, avec la modification capitale que le résultat final est alors établi de manière constructive. Nous pensons que ce que nous avons réalisé ici sur un cas d'école peut être généralisé à des parties significatives de l'algèbre classique, et est donc une contribution à la réalisation du programme de Hilbert pour (...) l'algèbre classique.We introduce the notion of “Dynamic Algebraic Structure” inspired by Dynamic Evaluation and Model Theory. We show that this constructive notion allows a rereading of the Artin-Schreier-Robinson solution for the 17th Hilbert Problem. So, once we know how to reread the proofs, this kind of abstract theory contains an algorithm which computes the concrete result . Our method gives a constructive semantic for certain parts of abstract classical mathematics.The idea is the following: replace the classical algebraic structures “constructed” by Choice and Principle of Third Excluded Middle , by DAS and dynamic evaluations of these DAS. Then TEM is replaced by construction of branching in the trees of dynamic evaluation of the DAS. If Choice is used in the form of Godel completeness theorem, it is not really necessary to use it for obtaining concrete results: in DAS, Choice is simply replaced by … nothing!. This is because the classical proof is by contradiction: “if there were not a sum of squares then some formal theory would admit a pathological model”. The constructive reasoning is more direct: since the pathological theory proves 0 = 1 we know how to construct the sum of squares … and classical models have disappeared in the proof. They are replaced by dynamic evaluations of DAS. We think that we have given, for an academic example, a new method, realizing a kind of Hilbert Program for significant parts of classical algebra. (shrink)

We give a general method for producing various effective Null and Positivstellensätze, and getting new Positivstellensätze in algebraically closed valued fields and ordered groups. These various effective Nullstellensätze produce algebraic identities certifying that some geometric conditions cannot be simultaneously satisfied. We produce also constructive versions of abstract classical results of algebra based on Zorn's lemma in several cases where such constructive version did not exist. For example, the fact that a real field can be totally ordered, or the fact that (...) a field can be embedded in an algebraically closed field. Our results are based on the concepts we develop of dynamical proofs and simultaneous collapse. (shrink)

. This paper examines the underpinnings of the preservationist approach to characterizing inference relations. Starting with a critique of the ‘truth-preservation’ semantic paradigm, we discuss the merits of characterizing an inference relation in terms of preserving consistency. Finally we turn our attention to the generalization of consistency introduced in the early work of Jennings and Schotch, namely the concept of level.