Structuring co-constructive logic for proofs and refutations

This paper considers a topos-theoretic structure for the interpretation of co-constructive logic for proofs and refutations following. It is notoriously tricky to define a proof-theoretic semantics for logics that adequately represent constructivity over proofs and refutations. By developing abstractions of elementary topoi, we consider an elementary topos as structure for proofs, and complement topos as structure for refutation. In doing so, it is possible to consider a dialogue structure between these topoi, and also control their relation such that classical logic (interpreted in a Boolean topos) is simulated where proofs and refutations are conclusive

A proposal for broad spectrum proof certificates

International audienceRecent developments in the theory of focused proof systems provide flexible means for structuring proofs within the sequent calculus. This structuring is organized around the construction of ''macro'' level inference rules based on the ''micro'' inference rules which introduce single logical connectives. After presenting focused proof systems for first-order classical logics (one with and one without fixed points and equality) we illustrate several examples of proof certificates formats that are derived naturally from the structure of such focused proof systems. In principle, a proof certificate contains two parts: the first part describes how macro rules are defined in terms of micro rules and the second part describes a particular proof object using the macro rules. The first part, which is based on the vocabulary of focused proof systems, describes a collection of macro rules that can be used to directly present the structure of proof evidence captured by a particular class of computational logic systems. While such proof certificates can capture a wide variety of proof structures, a proof checker can remain simple since it must only understand the micro-rules and the discipline of focusing. Since proofs and proof certificates are often likely to be large, there must be some flexibility in allowing proof certificates to elide subproofs: as a result, proof checkers will necessarily be required to perform (bounded) proof search in order to reconstruct missing subproofs. Thus, proof checkers will need to do unification and restricted backtracking search

From LCF to Isabelle/HOL

Interactive theorem provers have developed dramatically over the past four decades, from primitive beginnings to today's powerful systems. Here, we focus on Isabelle/HOL and its distinctive strengths. They include automatic proof search, borrowing techniques from the world of first order theorem proving, but also the automatic search for counterexamples. They include a highly readable structured language of proofs and a unique interactive development environment for editing live proof documents. Everything rests on the foundation conceived by Robin Milner for Edinburgh LCF: a proof kernel, using abstract types to ensure soundness and eliminate the need to store proofs. Compared with the research prototypes of the 1970s, Isabelle is a practical and versatile tool. It is used by system designers, mathematicians and many others

Interactive Knowledge Construction in the Collaborative Building of an Encyclopedia

International audienceOne of the major challenges of Applied Artificial Intelligence is to provide environments where high level human activities like learning, constructing theories or performing experiments, are enhanced by Artificial Intelligence technologies. This paper starts with the description of an ambitious project: EnCOrE2. The specific real world EnCOrE scenario, significantly representing a much wider class of potential applicative contexts, is dedicated to the building of an Encyclopedia of Organic Chemistry in the context of Virtual Communities of experts and students. Its description is followed by a brief survey of some major AI questions and propositions in relation with the problems raised by the EnCOrE project. The third part of the paper starts with some definitions of a set of “primitives” for rational actions, and then integrates them in a unified conceptual framework for the interactive construction of knowledge. To end with, we sketch out protocols aimed at guiding both the collaborative construction process and the collaborative learning process in the EnCOrE project.The current major result is the emerging conceptual model supporting interaction between human agents and AI tools integrated in Grid services within a socio-constructivist approach, consisting of cycles of deductions, inductions and abductions upon facts (the shared reality) and concepts (their subjective interpretation) submitted to negotiations, and finally converging to a socially validated consensus

Space exploration: The interstellar goal and Titan demonstration

Automated interstellar space exploration is reviewed. The Titan demonstration mission is discussed. Remote sensing and automated modeling are considered. Nuclear electric propulsion, main orbiting spacecraft, lander/rover, subsatellites, atmospheric probes, powered air vehicles, and a surface science network comprise mission component concepts. Machine, intelligence in space exploration is discussed

Reliability of mathematical inference

Of all the demands that mathematics imposes on its practitioners, one of the most fundamental is that proofs ought to be correct. This is also a demand that is especially hard to fulfill, given the fragility and complexity of mathematical proof. This essay considers some of ways that mathematics supports reliable assessment, which is necessary to maintain the coherence and stability of the practice

Reliability of mathematical inference

Of all the demands that mathematics imposes on its practitioners, one of the most fundamental is that proofs ought to be correct. It has been common since the turn of the twentieth century to take correctness to be underwritten by the existence of formal derivations in a suitable axiomatic foundation, but then it is hard to see how this normative standard can be met, given the differences between informal proofs and formal derivations, and given the inherent fragility and complexity of the latter. This essay describes some of the ways that mathematical practice makes it possible to reliably and robustly meet the formal standard, preserving the standard normative account while doing justice to epistemically important features of informal mathematical justification

Beyond Logic. Proceedings of the Conference held in Cerisy-la-Salle, 22-27 May 2017

The project "Beyond Logic" is devoted to what hypothetical reasoning is all about when we go beyond the realm of "pure" logic into the world where logic is applied. As such extralogical areas we have chosen philosophy of science as an application within philosophy, informatics as an application within the formal sciences, and law as an application within the field of social interaction. The aim of the conference was to allow philosophers, logicians and computer scientists to present their work in connection with these three areas. The conference took place 22-27 May, 2017 in Cerisy-la-Salle at the Centre Culturel International de Cerisy. The proceedings collect abstracts, slides and papers of the presentations given, as well as a contribution from a speaker who was unable to attend

Is ‘No’ a Force-Indicator? Yes, Soone or Later!

This paper discusses the philosophical and logical motivations for rejectivism, primarily by considering a dialogical approach to logic, which is formalised in a Question–Answer Semantics. We develop a generalised account of rejectivism through close consideration of Mark Textor's arguments against rejectivism that the negative expression 'no' is never used as an act of rejection and is equivalent with a negative sentence. In doing so, we also shed light upon well-known issues regarding the supposed non-embeddability and non-iterability of force indicators