Mathematical proofs generally allow for various levels of detail and conciseness, such that they can be adapted for a particular audience or purpose. Using automated reasoning approaches for teaching proof construction in mathematics presupposes that the step size of proofs in such a system is appropriate within the teaching context. This work proposes a framework that supports the granularity analysis of mathematical proofs, to be used in the automated assessment of students' proof attempts and for the presentation (...) of hints and solutions at a suitable pace. Models for granularity are represented by classifiers, which can be generated by hand or inferred from a corpus of sample judgments via machine-learning techniques. This latter procedure is studied by modeling granularity judgments from four experts. The results provide support for the granularity of assertion-level proofs but also illustrate a degree of subjectivity in assessing step size. (shrink)

Rigorous formal proof is one of the key techniques in the natural sciences, engineering, and of course also in the formal sciences. Progress in automated reasoning increasingly enables computer systems to support, and even teach, users to conduct formal a.

This is the first comprehensive textbook on higher order logic that is written specifically to introduce the subject matter to graduate students in philosophy. The book covers both the formal aspects of higher-order languages -- their model theory and proof theory, the theory of λ-abstraction and its generalizations -- and their philosophical applications, especially to the topics of modality and propositional granularity. The book has a strong focus on non-extensional higher-order logics, making it more appropriate for foundational metaphysics (...) than other introductions to the subject from computer science, mathematics, and linguistics. A Philosophical Introduction to Higher Order Logics assumes only that readers have a basic knowledge of first-order logic. With an emphasis on exercises, it can be used as a textbook though is also ideal for self-study. Author Andrew Bacon organizes the book's 18 chapters around four main parts: I. Typed Language II. Higher Order Languages III. General Higher-Order Languages IV. Higher-Order Model Theory In addition, two appendices cover the Curry-Howard isomorphism and its applications for modeling propositional structure. Each chapter includes exercises that move from easier to more difficult, strategically placed throughout the chapter, and concludes with an annotated suggested reading list providing graduate students with most valuable additional resources. Key Features Is the first comprehensive introduction to higher-order logic as a grounding for addressing problems in metaphysics Introduces the basic formal tools that are needed to theorize in, and model, higher order languages Offers an abundance of: - Simple exercises throughout the book, serving as comprehension checks on basic concepts and definitions - More difficult exercises designed to facilitate long-term learning Contains annotated sections on further reading, pointing the reader to related literature, learning resources, and historical context. (shrink)

Proof Theory of Modal Logic is devoted to a thorough study of proof systems for modal logics, that is, logics of necessity, possibility, knowledge, belief, time, computations etc. It contains many new technical results and presentations of novel proof procedures. The volume is of immense importance for the interdisciplinary fields of logic, knowledge representation, and automated deduction.

It has been generally assumed that certain categories of numerical expressions, such as ‘more than n’, ‘at least n’, and ‘fewer than n’, systematically fail to give rise to scalar implicatures in unembedded declarative contexts. Various proposals have been developed to explain this perceived absence. In this paper, we consider the relevance of scale granularity to scalar implicature, and make two novel predictions: first, that scalar implicatures are in fact available from these numerical expressions at the appropriate granularity (...) level, and second, that these implicatures are attenuated if the numeral has been previously mentioned or is otherwise salient in the context. We present novel experimental data in support of both of these predictions, and discuss the implications of this for recent accounts of numerical quantifier usage. (shrink)

Possible-worlds accounts of mental or linguistic content are often criticized for being too coarse-grained. To make room for more fine-grained distinctions among contents, several authors have recently proposed extending the space of possible worlds by "impossible worlds". We argue that this strategy comes with serious costs: we would effectively have to abandon most of the features that make the possible-worlds framework attractive. More generally, we argue that while there are intuitive and theoretical considerations against overly coarse-grained notions of content, the (...) same kinds of considerations also prohibit an overly fine-grained individuation of content. An adequate notion of content, it seems, should have intermediate granularity. However, it is hard to construe a notion of content that meets these demands. Any notion of content, we suggest, must be either implausibly coarse-grained or implausibly fine-grained (or both). (shrink)

This comprehensive monograph is a cornerstone in the area of mathematical logic and related fields. Focusing on Gentzen-type proof theory, the book presents a detailed overview of creative works by the author and other 20th-century logicians that includes applications of proof theory to logic as well as other areas of mathematics. 1975 edition.

Grounding is a hyperintensional notion: necessarily equivalent sentences need not be equivalent from a ground-theoretic perspective. How fine-grained, exactly, is grounding? There is a striking lack of consensus on this question. In this chapter, I try to systematize and review the main options that have been put forward in the literature. For reasons that have to do with both naturalness and convenience, I for the most part take the question to be about what is sometimes called, following Kit Fine’s (2012a) (...) terminology, strict full grounding, and I take for granted a conception of grounding as a relation that is many-to-one and non-factive. I discuss the consequences of making alternative assumptions only in the very last section. (shrink)

The proof theory of many-valued systems has not been investigated to an extent comparable to the work done on axiomatizatbility of many-valued logics. Proof theory requires appropriate formalisms, such as sequent calculus, natural deduction, and tableaux for classical (and intuitionistic) logic. One particular method for systematically obtaining calculi for all finite-valued logics was invented independently by several researchers, with slight variations in design and presentation. The main aim of this report is to develop the proof theory of (...) finite-valued first order logics in a general way, and to present some of the more important results in this area. In Systems covered are the resolution calculus, sequent calculus, tableaux, and natural deduction. This report is actually a template, from which all results can be specialized to particular logics. (shrink)

There are some who defend a view of vagueness according to which there are intrinsically vague objects or attributes in reality. Here, in contrast, we defend a view of vagueness as a semantic property of names and predicates. All entities are crisp, on this view, but there are, for each vague name, multiple portions of reality that are equally good candidates for being its referent, and, for each vague predicate, multiple classes of objects that are equally good candidates for being (...) its extension. We provide a new formulation of these ideas in terms of a theory of granular partitions. We show that this theory provides a general framework within which we can understand the relation between vague terms and concepts on the one hand and correlated portions of reality on the other. We also sketch how it might be possible to formulate within this framework a theory of vagueness which dispenses with the notion of truth-value gaps and other artifacts of more familiar approaches. (shrink)

The ability to represent emotional experiences in a precise fashion with language, termed emotional granularity, is related to a number of beneficial outcomes. However, the emotion granularity construct and operationalization are rooted in the lens of so-called Western, Educated, Industrialized, Rich and Democratic (WEIRD) societies that focus on emotions as a mental-state phenomena. Using evidence from multiple non-WEIRD societies, we illustrate that people's everyday vernacular often emphasizes bodily over, or in addition to, mental states. This suggests that (...) class='Hi'>granularity focused only on mental state language may limit our ability to operationalize this construct in a culturally valid manner. To overcome this limitation, we propose capturing “experiential” granularity and a concept model on how it may link to regulation and health. (shrink)

Rough sets are used in numerous knowledge representation contexts and are then empowered with varied ontologies. These may be intrinsically associated with ideas of rationality under certain conditions. In recent papers, specific granular generalisations of graded and variable precision rough sets are investigated by the present author from the perspective of rationality of approximations (and the associated semantics of rationality in approximate reasoning). The studies are extended to ideal-based approximations (sometimes referred to as subsethood-based approximations). It is additionally shown that (...) co-granular or point-wise approximations defined by σ-ideals/filters (for an arbitrary relation σ) fit easily into the entire scheme. Concepts of the rationality of objects (vague or crisp) and their types are introduced and are shown to be applicable to most general rough sets by the present author. Surprising results on these are proved on these by her in this part of the research paper. The present paper is the first of a three part study on the topic. (shrink)

We have a variety of different ways of dividing up, classifying, mapping, sorting and listing the objects in reality. The theory of granular partitions presented here seeks to provide a general and unified basis for understanding such phenomena in formal terms that is more realistic than existing alternatives. Our theory has two orthogonal parts: the first is a theory of classification; it provides an account of partitions as cells and subcells; the second is a theory of reference or intentionality; it (...) provides an account of how cells and subcells relate to objects in reality. We define a notion of well-formedness for partitions, and we give an account of what it means for a partition to project onto objects in reality. We continue by classifying partitions along three axes: (a) in terms of the degree of correspondence between partition cells and objects in reality; (b) in terms of the degree to which a partition represents the mereological structure of the domain it is projected onto; and (c) in terms of the degree of completeness with which a partition represents this domain. (shrink)

Witnessing in merging biological, social and algorithmic realities is crucial to trust, as modelled in the YUTPA framework. Being witness and bearing witness is fundamental to human interaction. System participation in human communities of practice challenges the notion of witnessing and therefore the ability to build trust. Nevertheless, through trial and error, people in a variety of practices have found ways to establish the presence and develop trust in merging realities. This paper presents the results of 20 in-depth interviews with (...) professionals from a variety of disciplines and nations. The conclusion of cumulative analysis is that systems do not witness themselves, but their output deeply affects the mental maps that human beings make of each other, the world around them and their own self. Essential qualities human beings seek when being involved with other beings are defined by granularity and reciprocity in the design of time (duration of engagement, synchronizing performance, integrating rhythms and moments to signify), place (body sense, material interaction, emotional space and situated agency), relation (shared meaning, engagement, reputation and use) and action (tuning, reciprocity, negotiation and quality of deeds). By designing granular interaction in 4 dimensions, reciprocity in witnessing obtains significance and the basis for establishing trust in a variety of presences emerges while human agency acquires potential. (shrink)

The standard of proof in criminal trials in many liberal democracies is proof beyond a reasonable doubt, the BARD standard. It is customary to describe it, when putting a number on it, as requiring that the fact finder be at least 90% certain, after considering the evidence, that the defendant is guilty. Strikingly, no good reason has yet been offered in defense of using that standard. A number of non-consequentialist justifications that aim to support an even higher standard (...) have been offered; all are morally unsound. Meanwhile, consequentialist arguments plausibly support a substantially lower standard — in some cases so low as to undermine the idea that punishment is what is at stake. In this paper, I offer a new retributive justification that supports excluding the instrumental benefits of punishment from the balance that sets the standard. The resulting balance supports a standard arguably in the ballpark of the customary understanding of BARD: a standard requiring that the fact finder have a high, though not maximally high, degree of confidence that the defendant is guilty. (shrink)

In this paper I consider one kind of vague linguistic expression: adjec- tives like tall, big, expensive. These are called gradable adjectives. The most well-known linguistic theories that account for them are the so-called degree-based theories. In this paper I present a formal model that accounts for vague gradable adjectives as an alternative to degree-based theories. The model is built on two basic ingredients: (i) comparison classes and (ii) gran- ular partitions. (i) Comparison classes are introduced to account for the (...) context-sensitivity of vague adjectives. The extension of the predicate being tall in the comparison class of men is different from its extension in the com- parison class of children. (ii) We can look at the elements of a context under different standards of precision, each of them corresponding to a granular level of observation. The finer the level is, the more differences between the individuals are detected. Granular partitions are used to represent in- distinguishability relations between objects with respect to the properties expressed by vague adjectives. (shrink)

Structural proof theory is a branch of logic that studies the general structure and properties of logical and mathematical proofs. This book is both a concise introduction to the central results and methods of structural proof theory, and a work of research that will be of interest to specialists. The book is designed to be used by students of philosophy, mathematics and computer science. The book contains a wealth of results on proof-theoretical systems, including extensions of such (...) systems from logic to mathematics, and on the connection between the two main forms of structural proof theory - natural deduction and sequent calculus. The authors emphasize the computational content of logical results. A special feature of the volume is a computerized system for developing proofs interactively, downloadable from the web and regularly updated. (shrink)

The traditional view of evidence in mathematics is that evidence is just proof and proof is just derivation. There are good reasons for thinking that this view should be rejected: it misrepresents both historical and current mathematical practice. Nonetheless, evidence, proof, and derivation are closely intertwined. This paper seeks to tease these concepts apart. It emphasizes the role of argumentation as a context shared by evidence, proofs, and derivations. The utility of argumentation theory, in general, and argumentation (...) schemes, in particular, as a methodology for the study of mathematical practice is thereby demonstrated. Argumentation schemes represent an almost untapped resource for mathematics education. Notably, they provide a consistent treatment of rigorous and non-rigorous argumentation, thereby working to exhibit the continuity of reasoning in mathematics with reasoning in other areas. Moreover, since argumentation schemes are a comparatively mature methodology, there is a substantial body of existing work to draw upon, including some increasingly sophisticated software tools. Such tools have significant potential for the analysis and evaluation of mathematical argumentation. The first four sections of the paper address the relationships of evidence to proof, proof to derivation, argument to proof, and argument to evidence, respectively. The final section directly addresses some of the educational implications of an argumentation scheme account of mathematical reasoning. (shrink)

A sand table is an intentional structure that is an early, indeed ancient, interactive platform for visualization and simulation. An intellectual furnishing that is also a tangible instance of speculative infrastructure, the sand table offers a tactile space for the rehearsal of tactics, staccato words whose roots lie in haptics and arrangement. While common in military settings, sand tables have also been used to teach the blind, train wilderness firefighters, conduct therapy for trauma victims, illustrate stories to children, and play (...) imaginative games. Today there is a direct line from this seemingly modest technology—an implementation of what has been called elemental media—to augmented reality and other tangible interfaces. Part media history, part media archaeology, this article argues that sand tables belong to the lineage of platforms for speculative thinking and world-building that culminated in the rise of the digital computer amid a Cold War complex of scenario-driven futurology (whose centerpiece was the so-called situation room). It also suggests that sand, in its literal granularity—the physical affordances of the minute particulars of its particulate matter—offers an alternative to the binary regimen of ones and zeros that is the extractive product of the refined silica out of which semiconductors are still made. (shrink)

Explaining the reasons behind the success of various kinds of fiction is important, but how granular should our explanations be? I suggest that using a less granular, more general hypothesis would allow avoiding some pitfalls, such as using the concept of “imaginary world,” which eludes precise definitions.

This book presents an original exploration of philosophical questions pertaining to the ways we grasp the Absolute by bringing together the Buddhist notion of interpermeation of all phenomena into contemporary strains of thought in continental philosophy. This text introduces an ontological concept, granularity, deploying it to probe questions concerning the intersection of ontology, ethics, and education. A wide range of issues in metaphysics are covered—including being, nothingness, unity, plurality, truth, change, transformation, subjectivity, contradiction, coherence, potentiality—from the perspective of thinkers (...) such as Hegel, Heidegger, Badiou, Meillassoux, Malabou, Žižek, and Harman. The text deploys granularity in arguing for an ethics of unconditional hospitality within education. This volume is intended for students and researchers working in the areas of philosophy of education, philosophy of religion, and continental philosophy. (shrink)

Data analytics, particularly the current rhetoric around “Big Data”, tend to be presented as new and innovative, emerging ahistorically to revolutionize modern life. In this article, we situate one branch of Big Data analytics, spatial Big Data, through a historical predecessor, geodemographic analysis, to help develop a critical approach to current data analytics. Spatial Big Data promises an epistemic break in marketing, a leap from targeting geodemographic areas to targeting individuals. Yet it inherits characteristics and problems from geodemographics, including a (...) justification through the market, and a process of commodification through the black-boxing of technology. As researchers develop sustained critiques of data analytics and its effects on everyday life, we must so with a grounding in the cultural and historical contexts from which data technologies emerged. This article and others develop a historically situated, critical approach to spatial Big Data. This history illustrates connections to the critical issues of surveillance, redlining, and the production of consumer subjects and geographies. The shared histories and structural logics of spatial Big Data and geodemographics create the space for a continued critique of data analyses’ role in society. (shrink)

Abstract: We propose a view of vagueness as a semantic property of names and predicates. All entities are crisp, on this semantic view, but there are, for each vague name, multiple portions of reality that are equally good candidates for being its referent, and, for each vague predicate, multiple classes of objects that are equally good candidates for being its extension. We provide a new formulation of these ideas in terms of a theory of granular partitions. We show that this (...) theory provides a general framework within which we can understand the relation between vague terms and concepts and the corresponding crisp portions of reality. We also sketch how it might be possible to formulate within this framework a theory of vagueness which dispenses with the notion of truth-value gaps and other artifacts of more familiar approaches. Central to our approach is the idea that judgments about reality involve in every case (1) a separation of reality into foreground and background of attention and (2) the feature of granularity. On this basis we attempt to show that even vague judgments made in naturally occurring contexts are not marked by truth-value indeterminacy. We distinguish, in addition to crisp granular partitions, also vague partitions, and reference partitions, and we explain the role of the latter in the context of judgments that involve vagueness. We conclude by showing how reference partitions provide an effective means by which judging subjects are able to temper the vagueness of their judgments by means of approximations. (shrink)

Kant's A-Edition objective deduction is naturally (and has traditionally been) divided into two arguments: an " argument from above" and one that proceeds " von unten auf." This would suggest a picture of Kant's procedure in the objective deduction as first descending and ascending the same ladder, the better, perhaps, to test its durability or to thoroughly convince the reader of its soundness. There are obvious obstacles to such a reading, however; and in this chapter I will argue that the (...) arguments from above and below constitute different, albeit importantly inter-related, proofs. Rather than drawing on the differences in their premises, however, I will highlight what I take to be the different concerns addressed and, correspondingly, the distinct conclusions reached by each. In particular, I will show that both arguments can be understood to address distinct specters, with the argument from above addressing an internal concern generated by Kant’s own transcendental idealism, and the argument from below seeking to dispel a more traditional, broadly Humean challenge to the understanding’s role in experience. These distinct concerns also imply that these arguments yield distinct conclusions, though I will show that they are in fact complementary. (shrink)

Though pictures are often used to present mathematical arguments, they are not typically thought to be an acceptable means for presenting mathematical arguments rigorously. With respect to the proofs in the Elements in particular, the received view is that Euclid's reliance on geometric diagrams undermines his efforts to develop a gap-free deductive theory. The central difficulty concerns the generality of the theory. How can inferences made from a particular diagrams license general mathematical results? After surveying the history behind the received (...) view, this essay provides a contrary analysis by introducing a formal account of Euclid's proofs, termed Eu. Eu solves the puzzle of generality surrounding Euclid's arguments. It specifies what diagrams Euclid's diagrams are, in a precise formal sense, and defines generality-preserving proof rules in terms of them. After the central principles behind the formalization are laid out, its implications with respect to the question of what does and does not constitute a genuine picture proof are explored. (shrink)

Objective: There are benefits and risks of giving patients more granular control of their personal health information in electronic health record (EHR) systems. When designing EHR systems and policies, informaticists and system developers must balance these benefits and risks. Ethical considerations should be an explicit part of this balancing. Our objective was to develop a structured ethics framework to accomplish this. -/- Methods: We reviewed existing literature on the ethical and policy issues, developed an ethics framework called a “Points to (...) Consider” (P2C) document, and convened a national expert panel to review and critique the P2C. -/- Results: We developed the P2C to aid informaticists designing an advanced query tool for an electronic health record (EHR) system in Indianapolis. The P2C consists of six questions (“Points”) that frame important ethical issues, apply accepted principles of bioethics and Fair Information Practices, comment on how questions might be answered, and address implications for patient care. -/- Discussion: The P2C is intended to clarify whatis at stake when designers try to accommodate potentially competing ethical commitments and logistical realities. The P2C was developed to guide informaticists who were designing a query tool in an existing EHR that would permit patient granular control. While consideration of ethical issues is coming to the forefront of medical informatics design and development practices, more reflection is needed to facilitate optimal collaboration between designers and ethicists. This report contributes to that discussion. (shrink)

We propose an ontological theory that is powerful enough to describe both complex spatio-temporal processes (occurrents) and the enduring entities (continuants) that participate therein. The theory is divided into two major categories of sub-theories: (sub-) theories of type SPAN and (sub-)theories of type SNAP. These theories represent two complementary perspectives on reality and result in distinct though compatible systems of categories. In SNAP we have enduring entities such as substances, qualities, roles, functions; in SPAN we have perduring entities such as (...) processes and their parts and aggregates. We argue that both kinds of ontological theory are required in order to give a non-reductionism account of complex domains of reality. (shrink)

Implicit contextual factors mean that the boundary between causal and noncausal explanation is not as neat as one might hope: as the phenomenon to be explained is given descriptions with varying degrees of granularity, the nature of the favored explanation alternates between causal and non-causal. While it is not surprising that different descriptions of the same phenomenon should favor different explanations, it is puzzling why re-describing the phenomenon should make any difference for the causal nature of the favored explanation. (...) I argue that this is a problem for the ontic framework of causal and noncausal explanation, and instead propose a pragmatic-modal account of causal and non-causal explanation. This account has the added advantage of dissolving several important disagreements concerning the status of non-causal explanation. (shrink)

This introduction to the basic ideas of structural proof theory contains a thorough discussion and comparison of various types of formalization of first-order logic. Examples are given of several areas of application, namely: the metamathematics of pure first-order logic (intuitionistic as well as classical); the theory of logic programming; category theory; modal logic; linear logic; first-order arithmetic and second-order logic. In each case the aim is to illustrate the methods in relatively simple situations and then apply them elsewhere in (...) much more complex settings. There are numerous exercises throughout the text. In general, the only prerequisite is a standard course in first-order logic, making the book ideal for graduate students and beginning researchers in mathematical logic, theoretical computer science and artificial intelligence. For the new edition, many sections have been rewritten to improve clarity, new sections have been added on cut elimination, and solutions to selected exercises have been included. (shrink)

This book continues from where the authors' previous book, Structural Proof Theory, ended. It presents an extension of the methods of analysis of proofs in pure logic to elementary axiomatic systems and to what is known as philosophical logic. A self-contained brief introduction to the proof theory of pure logic is included that serves both the mathematically and philosophically oriented reader. The method is built up gradually, with examples drawn from theories of order, lattice theory and elementary geometry. (...) The aim is, in each of the examples, to help the reader grasp the combinatorial behaviour of an axiom system, which typically leads to decidability results. The last part presents, as an application and extension of all that precedes it, a proof-theoretical approach to the Kripke semantics of modal and related logics, with a great number of new results, providing essential reading for mathematical and philosophical logicians. (shrink)

This study examines Nǐ yìsi shì X ‘Your Meaning is X’ as a practice of doing other-initiation in Mandarin conversations, focusing on how it addresses different sources of troubles systematically in informing sequences. It is found that while ‘Nǐ yìsi shì’ signals the speaker’s having trouble with the prior informing turn, ‘X’ is deployed to locate different aspects of the trouble source, being shaped by how an informing emerges in talk-in-interaction. Specifically, when following a volunteered informing, ‘X’ is usually built (...) to clarify specific words or phrases in preceding informing, thereby treating a certain element as underspecified or ambiguous. However, when following a question-solicited informing, ‘X’ is typically constructed to work out what the provided information exactly conveys, indicating the whole informing turn/action is in some way problematic, inappropriate, or inapposite. In both cases, ‘Nǐ yìsi shì X’ serves as an OI, working to target different kinds of the trouble source, and simultaneously proposes a potential solution to it. (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)

In this paper we propose a formal theory of partitions (ways of dividing up or sorting or mapping reality) and we show how the theory can be applied in the geospatial domain. We characterize partitions at two levels: as systems of cells (theory A), and in terms of their projective relation to reality (theory B). We lay down conditions of well-formedness for partitions and we define what it means for partitions to project truly onto reality. We continue by classifying well-formed (...) partitions along three axes: (a) degree of correspondence between partition cells and objects in reality; (b) degree to which a partition represents the mereological structure of the domain it is projected onto; and (c) degree of completeness and exhaustiveness with which a partition represents reality. This classification is used to characterize three types of partitions that play an important role in spatial information science: cadastral partitions, categorical coverages, and the partitions involved in folk categorizations of the geospatial domain. (shrink)

Proofs and Refutations is essential reading for all those interested in the methodology, the philosophy and the history of mathematics. Much of the book takes the form of a discussion between a teacher and his students. They propose various solutions to some mathematical problems and investigate the strengths and weaknesses of these solutions. Their discussion (which mirrors certain real developments in the history of mathematics) raises some philosophical problems and some problems about the nature of mathematical discovery or creativity. Imre (...) Lakatos is concerned throughout to combat the classical picture of mathematical development as a steady accumulation of established truths. He shows that mathematics grows instead through a richer, more dramatic process of the successive improvement of creative hypotheses by attempts to 'prove' them and by criticism of these attempts: the logic of proofs and refutations. (shrink)

In this paper we show how Dummett-Prawitz-style proof-theoretic semantics has to be modified in order to cope with paradoxical phenomena. It will turn out that one of its basic tenets has to be given up, namely the definition of the correctness of an inference as validity preservation. As a result, the notions of an argument being valid and of an argument being constituted by correct inference rules will no more coincide. The gap between the two notions is accounted for (...) by introducing the distinction between sense and denotation in the proof-theoretic-semantic setting. (shrink)

The aim of this paper is to provide epistemic reasons for investigating the notions of informal rigour and informal provability. I argue that the standard view of mathematical proof and rigour yields an implausible account of mathematical knowledge, and falls short of explaining the success of mathematical practice. I conclude that careful consideration of mathematical practice urges us to pursue a theory of informal provability.

We argue that Wittgenstein’s philosophical perspective on Gödel’s most famous theorem is even more radical than has commonly been assumed. Wittgenstein shows in detail that there is no way that the Gödelian construct of a string of signs could be assigned a useful function within (ordinary) mathematics. — The focus is on Appendix III to Part I of Remarks on the Foundations of Mathematics. The present reading highlights the exceptional importance of this particular set of remarks and, more specifically, emphasises (...) its refined composition and rigorous internal structure. (shrink)

This book argues that the meaning of negation, perhaps the most important logical constant, cannot be defined within the framework of the most comprehensive theory of proof-theoretic semantics, as formulated in the influential work of Michael Dummett and Dag Prawitz. Nils Kürbis examines three approaches that have attempted to solve the problem - defining negation in terms of metaphysical incompatibility; treating negation as an undefinable primitive; and defining negation in terms of a speech act of denial - and concludes (...) that they cannot adequately do so. He argues that whereas proof-theoretic semantics usually only appeals to a notion of truth, it also needs to appeal to a notion of falsity, and proposes a system of natural deduction in which both are incorporated. Offering new perspectives on negation, denial and falsity, his book will be important for readers working on logic, metaphysics and the philosophy of language. (shrink)

Proofs and countermodels are the two sides of completeness proofs, but, in general, failure to find one does not automatically give the other. The limitation is encountered also for decidable non-classical logics in traditional completeness proofs based on Henkin’s method of maximal consistent sets of formulas. A method is presented that makes it possible to establish completeness in a direct way: For any given sequent either a proof in the given logical system or a countermodel in the corresponding frame (...) class is found. The method is a synthesis of a generation of calculi with internalized relational semantics, a Tait–Schütte–Takeuti style completeness proof, and procedures to finitize the countermodel construction. Finitizations for intuitionistic propositional logic are obtained through the search for a minimal derivation, through pruning of infinite branches in search trees by means of a suitable syntactic counterpart of semantic filtration, or through a proof-theoretic embedding into an appropriate provability logic. A number of examples illustrates the method, its subtleties, challenges, and present scope. (shrink)

By considering the new notion of theinversesof syllogisms such asBarbaraandCelarent, we show how the rule ofIndirect Proof, in the form (no multiple or vacuous discharges) used by Aristotle, may be dispensed with, in a system comprising four basic rules of subalternation or conversion and six basic syllogisms.

This work is derived from the SERC "Logic for IT" Summer School Conference on Proof Theory held at Leeds University. The contributions come from acknowledged experts and comprise expository and research articles which form an invaluable introduction to proof theory aimed at both mathematicians and computer scientists.