Elijah Chudnoff elaborates and defends a view of intuition according to which intuition purports to, and reveals, how matters stand in abstract reality by making us aware of that reality through the intellect. He explores the experience of having an intuition; justification for beliefs that derives from intuition; and contact with abstract reality.

In this article, we come back to the seminal role of epistemology in didactics of sciences and particularly in mathematics. We defend that the epistemological research on the interactions between mathematics and informatics is necessary to feed didactical research on today’s mathematics learning and teaching situations, impacted by the development of informatics. We develop some examples to support this idea and propose some perspectives to attack this issue.

Emotions are powerful. In newspaper headlines and on social media, they have become the primary way of understanding the world. But strong feelings make it more difficult to see the reality behind the rhetoric. In The Art of Logic, Eugenia Cheng shows how mathematical logic can help us see things more clearly - and know when politicians and companies are trying to mislead us.First Cheng explains how to use black-and-white logic to illuminate the world around us, giving us new insight (...) into thorny political questions like public healthcare, Black Lives Matter and Brexit. Then she explains how logic and emotions, used side-by-side, can help us not only to be more rational individuals, but also to live more thoughtfully.Clear-sighted, revelatory and filled with useful real-life examples of logic and illogic at work, The Art of Logic is an essential guide to decoding modern life. (shrink)

Inference versus consequence , an invited lecture at the LOGICA 1997 conference at Castle Liblice, was part of a series of articles for which I did research during a Stockholm sabbatical in the autumn of 1995. The article seems to have been fairly effective in getting its point across and addresses a topic highly germane to the Uppsala workshop. Owing to its appearance in the LOGICA Yearbook 1997 , Filosofia Publishers, Prague, 1998, it has been rather inaccessible. Accordingly it is (...) republished here with only bibliographical changes and an afterword. (shrink)

The Web may critically transform the way we understand the activity of proving. The Web as a collaborative medium allows the active participation of people with different backgrounds, interests, viewpoints, and styles. Mathematical formal proofs are inadequate for capturing Web-based proofs. This article claims that Web provings can be studied as a particular type of Goguen's proof-events. Web-based proof-events have a social component, communication medium, prover-interpreter interaction, interpretation process, understanding and validation, historical component, and styles. To demonstrate its claim, the (...) article discusses the Kumo and Polymath projects, both of which employ Web-based communication as part of proving. Web proving is a novel type of proving activity that may have a serious impact on the change in mathematical practices, despite the fact that it is not currently a universally acceptable methodology. (shrink)

This is the first interdisciplinary exploration of the philosophical foundations of the Web, a new area of inquiry that has important implications across a range of domains. - Contains twelve essays that bridge the fields of philosophy, cognitive science, and phenomenology. - Tackles questions such as the impact of Google on intelligence and epistemology, the philosophical status of digital objects, ethics on the Web, semantic and ontological changes caused by the Web, and the potential of the Web to serve as (...) a genuine cognitive extension. - Brings together insightful new scholarship from well-known analytic and continental philosophers, such as Andy Clark and Bernard Stiegler, as well as rising scholars in “digital native” philosophy and engineering. - Includes an interview with Tim Berners-Lee, the inventor of the Web. (shrink)

The Argument Web is maturing as both a platform built upon a synthesis of many contemporary theories of argumentation in philosophy and also as an ecosystem in which various applications and application components are contributed by different research groups around the world. It already hosts the largest publicly accessible corpora of argumentation and has the largest number of interoperable and cross compatible tools for the analysis, navigation and evaluation of arguments across a broad range of domains, languages and activity types. (...) Such interoperability is key in allowing innovative combinations of tool and data reuse that can further catalyse the development of the field of computational argumentation. The aim of this paper is to summarise the key foundations, the recent advances and the goals of the Argument Web, with a particular focus on demonstrating the relevance to, and roots in, philosophical argumentation theory. (shrink)

Ordinary mathematical proofs—to be distinguished from formal derivations—are the locus of mathematical knowledge. Their epistemic content goes way beyond what is summarised in the form of theorems. Objections are raised against the formalist thesis that every mainstream informal proof can be formalised in some first-order formal system. Foundationalism is at the heart of Hilbert's program and calls for methods of formal logic to prove consistency. On the other hand, ‘systemic cohesiveness’, as proposed here, seeks to explicate why mathematical knowledge is (...) coherent and places the problem of reliability within the province of the philosophy of mathematics. (shrink)

Ordinary mathematical proofs—to be distinguished from formal derivations—are the locus of mathematical knowledge. Their epistemic content goes way beyond what is summarised in the form of theorems. Objections are raised against the formalist thesis that every mainstream informal proof can be formalised in some first-order formal system. Foundationalism is at the heart of Hilbert's program and calls for methods of formal logic to prove consistency. On the other hand, ‘systemic cohesiveness’, as proposed here, seeks to explicate why mathematical knowledge is (...) coherent (in an informal sense) and places the problem of reliability within the province of the philosophy of mathematics. (shrink)

The Web may critically transform the way we understand the activity of proving. The Web as a collaborative medium allows the active participation of people with different backgrounds, interests, viewpoints, and styles. Mathematical formal proofs are inadequate for capturing Web‐based proofs. This article claims that Web provings can be studied as a particular type of Goguen's proof‐events. Web‐based proof‐events have a social component, communication medium, prover‐interpreter interaction, interpretation process, understanding and validation, historical component, and styles. To demonstrate its claim, the (...) article discusses the Kumo and Polymath projects, both of which employ Web‐based communication as part of proving. Web proving is a novel type of proving activity that may have a serious impact on the change in mathematical practices, despite the fact that it is not currently a universally acceptable methodology. (shrink)

The last century has seen many disciplines place a greater priority on understanding how people reason in a particular domain, and several illuminating theories of informal logic and argumentation have been developed. Perhaps owing to their diverse backgrounds, there are several connections and overlapping ideas between the theories, which appear to have been overlooked. We focus on Peirce’s development of abductive reasoning [39], Toulmin’s argumentation layout [52], Lakatos’s theory of reasoning in mathematics [23], Pollock’s notions of counterexample [44], and argumentation (...) schemes constructed by Walton et al. [54], and explore some connections between, as well as within, the theories. For instance, we investigate Peirce’s abduction to deal with surprising situations in mathematics, represent Pollock’s examples in terms of Toulmin’s layout, discuss connections between Toulmin’s layout and Walton’s argumentation schemes, and suggest new argumentation schemes to cover the sort of reasoning that Lakatos describes, in which arguments may be accepted as faulty, but revised, rather than being accepted or rejected. We also consider how such theories may apply to reasoning in mathematics: in particular, we aim to build on ideas such as Dove’s [13], which help to show ways in which the work of Lakatos fits into the informal reasoning community. (shrink)

Mathematicians do not claim to know a proposition unless they think they possess a proof of it. For all their confidence in the truth of a proposition with weighty non-deductive support, they maintain that, strictly speaking, the proposition remains unknown until such time as someone has proved it. This article challenges this conception of knowledge, which is quasi-universal within mathematics. We present four arguments to the effect that non-deductive evidence can yield knowledge of a mathematical proposition. We also show that (...) some of what mathematicians take to be deductive knowledge is in fact non-deductive. 1 Introduction2 Why It Might Matter3 Two Further Examples and Preliminaries4 An Exclusive Epistemic Virtue of Proof?5 Analyses of Knowledge6 The Inductive Basis of Deduction7 Physical to Mathematical Linkages8 Conclusion. (shrink)

The relationship between teaching and argumentation is becoming a crucial issue in the field of education and, in particular, science education. Teaching has been analyzed as a dialogue aimed at persuading the interlocutors, introducing a conceptual change that needs to be grounded on the audience’s background knowledge. This paper addresses this issue from a perspective of argumentation studies. Our claim is that argumentation schemes, namely abstract patterns of argument, can be an instrument for reconstructing the tacit premises in students’ argumentative (...) reasoning and retrieving the background beliefs that are the basis of their arguments. On this perspective, the process of premise reconstruction is followed by a heuristic reasoning process aimed at discovering the students’ previous intuitions that can explain the premises and concepts that are left unexpressed in their arguments. The theoretical insights advanced in this paper are illustrated through selected examples taken from activities concerning predictive claims on scientific issues. (shrink)

The view that a mathematical proof is a sketch of or recipe for a formal derivation requires the proof to function as an argument that there is a suitable derivation. This is a mathematical conclusion, and to avoid a regress we require some other account of how the proof can establish it.

The relationship between teaching and argumentation is becoming a crucial issue in the field of education and, in particular, science education. Teaching has been analyzed as a dialogue aimed at persuading the interlocutors, introducing a conceptual change that needs to be grounded on the audience’s background knowledge. This paper addresses this issue from a perspective of argumentation studies. Our claim is that argumentation schemes, namely abstract patterns of argument, can be an instrument for reconstructing the tacit premises in students’ argumentative (...) reasoning and retrieving the background beliefs that are the basis of their arguments. On this perspective, the process of premise reconstruction is followed by a heuristic reasoning process aimed at discovering the students’ previous intuitions that can explain the premises and concepts that are left unexpressed in their arguments. The theoretical insights advanced in this paper are illustrated through selected examples taken from activities concerning predictive claims on scientific issues. (shrink)

In his introductory paper to first-order logic, Jon Barwise writes in the Handbook of Mathematical Logic :[T]he informal notion of provable used in mathematics is made precise by the formal notion provable in first-order logic. Following a sug[g]estion of Martin Davis, we refer to this view as Hilbert’s Thesis.This paper reviews the discussion of Hilbert’s Thesis in the literature. In addition to the question whether it is justifiable to use Hilbert’s name here, the arguments for this thesis are compared with (...) those for Church’s Thesis concerning computability. This leads to the question whether one could provide an analogue for proofs of the concept of partial recursive function. (shrink)

Mathematicians often speak of conjectures as being confirmed by evidence that falls short of proof. For their own conjectures, evidence justifies further work in looking for a proof. Those conjectures of mathematics that have long resisted proof, such as Fermat's Last Theorem and the Riemann Hypothesis, have had to be considered in terms of the evidence for and against them. It is argued here that it is not adequate to describe the relation of evidence to hypothesis as `subjective', `heuristic' or (...) `pragmatic', but that there must be an element of what it is rational to believe on the evidence, that is, of non-deductive logic. (shrink)

To adequately model mathematical arguments the analyst must be able to represent the mathematical objects under discussion and the relationships between them, as well as inferences drawn about these objects and relationships as the discourse unfolds. We introduce a framework with these properties, which has been used to analyse mathematical dialogues and expository texts. The framework can recover salient elements of discourse at, and within, the sentence level, as well as the way mathematical content connects to form larger argumentative structures. (...) We show how the framework might be used to support computational reasoning, and argue that it provides a more natural way to examine the process of proving theorems than do Lamport’s structured proofs. (shrink)

The relationship is explored between formal derivations, which occur in artificial languages, and mathematical proof, which occurs in natural languages. The suggestion that ordinary mathematical proofs are abbreviations or sketches of formal derivations is presumed false. The alternative suggestion that the existence of appropriate derivations in formal logical languages is a norm for ordinary rigorous mathematical proof is explored and rejected.

The published works of scientists often conceal the cognitive processes that led to their results. Scholars of mathematical practice must therefore seek out less obvious sources. This article analyzes a widely circulated mathematical joke, comprising a list of spurious proof types. An account is proposed in terms of argumentation schemes: stereotypical patterns of reasoning, which may be accompanied by critical questions itemizing possible lines of defeat. It is argued that humor is associated with risky forms of inference, which are essential (...) to creative mathematics. The components of the joke are explicated by argumentation schemes devised for application to topic-neutral reasoning. These in turn are classified under seven headings: retroduction, citation, intuition, meta-argument, closure, generalization, and definition. Finally, the wider significance of this account for the cognitive science of mathematics is discussed. (shrink)

Some authors have begun to appeal directly to studies of argumentation in their analyses of mathematical practice. These include researchers from an impressively diverse range of disciplines: not only philosophy of mathematics and argumentation theory, but also psychology, education, and computer science. This introduction provides some background to their work.

This book provides a systematic analysis of many common argumentation schemes and a compendium of 96 schemes. The study of these schemes, or forms of argument that capture stereotypical patterns of human reasoning, is at the core of argumentation research. Surveying all aspects of argumentation schemes from the ground up, the book takes the reader from the elementary exposition in the first chapter to the latest state of the art in the research efforts to formalize and classify the schemes, outlined (...) in the last chapter. It provides a systematic and comprehensive account, with notation suitable for computational applications that increasingly make use of argumentation schemes. (shrink)

This paper proposes an account of mathematical reasoning as parallel in structure: the arguments which mathematicians use to persuade each other of their results comprise the argumentational structure; the inferential structure is composed of derivations which offer a formal counterpart to these arguments. Some conflicts about the foundations of mathematics correspond to disagreements over which steps should be admissible in the inferential structure. Similarly, disagreements over the admissibility of steps in the argumentational structure correspond to different views about mathematical practice. (...) The latter steps may be analysed in terms of argumentation schemes. Three broad types of scheme are distinguished, a distinction which is then used to characterize and evaluate four contrasting approaches to mathematical practice. (shrink)

Most philosophers still tend to believe that mathematics is basically about producing formal proofs. A consequence of this view is that some aspects of mathematical practice are entirely lost from view. My contention is that it is precisely in those aspects that similarities can be found between practices in the exact sciences and in mathematics. Hence, if we are looking for a (more) unified treatment of science and mathematics it is necessary to incorporate these elements into our view of what (...) mathematics is about. As a helpful tool I introduce the notion of a mathematical argument as a more liberalized version of the notion of mathematical proof. (shrink)