The Bounds of Logic presents a new philosophical theory of the scope and nature of logic based on critical analysis of the principles underlying modern Tarskian logic and inspired by mathematical and linguistic development. Extracting central philosophical ideas from Tarski’s early work in semantics, Sher questions whether these are fully realized by the standard first-order system. The answer lays the foundation for a new, broader conception of logic. By generally characterizing logical terms, Sher establishes a fundamental result in semantics. Her (...) development of the notion of logicality for quantifiers and her work on branching are of great importance for linguistics. Sher outlines the boundaries of the new logic and points out some of the philosophical ramifications of the new view of logic for such issues as the logicist thesis, ontological commitment, the role of mathematics in logic, and the metaphysical underpinning of logic. She proposes a constructive definition of logical terms, reexamines and extends the notion of branching quantification, and discusses various linguistic issues and applications. (shrink)

We group the existing variants of the familiar set-theoretical and truth-theoretical paradoxes into two classes: connective paradoxes, which can in principle be ascribed to the presence of a contracting connective of some sort, and structural paradoxes, where at most the faulty use of a structural inference rule can possibly be blamed. We impute the former to an equivocation over the meaning of logical constants, and the latter to an equivocation over the notion of consequence. Both equivocation sources are tightly related, (...) and can be cleared up by adopting a particular substructural logic in place of classical logic. We then argue that our perspective can be justified via an informational semantics of contraction-free substructural logics. (shrink)

We begin with a brief explanation of our proof-theoretic criterion of paradoxicality—its motivation, its methods, and its results so far. It is a proof-theoretic account of paradoxicality that can be given in addition to, or alongside, the more familiar semantic account of Kripke. It is a question for further research whether the two accounts agree in general on what is to count as a paradox. It is also a question for further research whether and, if so, how the so-called Ekman (...) problem bears on the investigations here of the intensional paradoxes. Possible exceptions to the proof-theoretic criterion are Prior’s Theorem and Russell’s Paradox of Propositions—the two best-known ‘intensional’ paradoxes. We have not yet addressed them. We do so here. The results are encouraging. §1 studies Prior’s Theorem. In the literature on the paradoxes of intensionality, it does not enjoy rigorous formal proof of a Gentzenian kind—the kind that lends itself to proof-theoretic analysis of recondite features that might escape the attention of logicians using non-Gentzenian systems of logic. We make good that lack, both to render the criterion applicable to the formal proof, and to see whether the criterion gets it right. Prior’s Theorem is a theorem in an unfree, classical, quantified propositional logic. But if one were to insist that the logic employed be free, then Prior’s Theorem would not be a theorem at all. Its proof would have an undischarged assumption—the ‘existential presupposition’ that the proposition $$\forall p(Qp\!\rightarrow \!\lnot p)$$ ∀ p ( Q p → ¬ p ) exists. Call this proposition $$\vartheta $$ ϑ. §2 focuses on $$\vartheta $$ ϑ. We analyse a Priorean reductio of $$\vartheta $$ ϑ along with the possibilitate $$\Diamond \forall q(Qq\!\leftrightarrow \!(\vartheta \!\leftrightarrow \! q))$$ ◊ ∀ q ( Q q ↔ ( ϑ ↔ q ) ). The attempted reductio of this premise-pair, which is constructive, cannot be brought into normal form. The criterion says we have not straightforward inconsistency, but rather genuine paradoxicality. §3 turns to problems engendered by the proposition $$\exists p(Qp\wedge \lnot p)$$ ∃ p ( Q p ∧ ¬ p ) (call it $$\eta $$ η ) for the similar possibilitate $$\Diamond \forall q(Qq\!\leftrightarrow \!(\eta \!\leftrightarrow \! q))$$ ◊ ∀ q ( Q q ↔ ( η ↔ q ) ). The attempted disproof of this premise-pair—again, a constructive one—cannot succeed. It cannot be brought into normal form. The criterion says the premise-pair is a genuine paradox. In §4 we show how Russell’s Paradox of Propositions, like the Priorean intensional paradoxes, is to be classified as a genuine paradox by the proof-theoretic criterion of paradoxicality. (shrink)

In this paper I will develop a lambda-term calculus, lambda-2Int, for a bi-intuitionistic logic and discuss its implications for the notions of sense and denotation of derivations in a bilateralist setting. Thus, I will use the Curry-Howard correspondence, which has been well-established between the simply typed lambda-calculus and natural deduction systems for intuitionistic logic, and apply it to a bilateralist proof system displaying two derivability relations, one for proving and one for refuting. The basis will be the natural deduction system (...) of Wansing's bi-intuitionistic logic 2Int, which I will turn into a term-annotated form. Therefore, we need a type theory that extends to a two-sorted typed lambda-calculus. I will present such a term-annotated proof system for 2Int and prove a Dualization Theorem relating proofs and refutations in this system. On the basis of these formal results I will argue that this gives us interesting insights into questions about sense and denotation as well as synonymy and identity of proofs from a bilateralist point of view. (shrink)

It has been argued that reduction procedures are closely connected to the question about identity of proofs and that accepting certain reductions would lead to a trivialization of identity of proofs in the sense that every derivation of the same conclusion would have to be identified. In this paper it will be shown that the question, which reductions we accept in our system, is not only important if we see them as generating a theory of proof identity but is also (...) decisive for the more general question whether a proof has meaningful content. There are certain reductions which would not only force us to identify proofs of different arbitrary formulas but which would render derivations in a system allowing them meaningless. To exclude such cases, a minimal criterion is proposed which reductions have to fulfill to be acceptable. (shrink)

In this paper I will show the problems that are encountered when dealing with uniqueness of connectives in a bilateralist setting within the larger framework of proof-theoretic semantics and suggest a solution. Therefore, the logic 2Int is suitable, for which I introduce a sequent calculus system, displaying - just like the corresponding natural deduction system - a consequence relation for provability as well as one dual to provability. I will propose a modified characterization of uniqueness incorporating such a duality of (...) consequence relations, with which we can maintain uniqueness in a bilateralist setting. (shrink)

The paper proposes a strategy for understanding metaphysical grounding in deflationary terms and, more generally, proposes a form of methodological deflationism with respect to the notions of ground. The idea is to define a deflationary is grounded in-predicate by appeal to the two-place non-causal connective ‘because’ and a deflationary truth predicate. To this end, we discuss the explanatory role of the truth-predicate in non-causal explanations and develop a theory of truth for the language of the ‘because’-connective. We argue that at (...) least from a logical perspective our deflationary notion of ground is up to the task. (shrink)

The purpose of this introduction is to give a rough overview of the discussion of the formalization of arguments, focusing on deductive arguments. The discussion is structured around four important junctions: i) the notion of support, which captures the relation between the conclusion and premises of an argument, ii) the choice of a formal language into which the argument is translated in order to make it amenable to evaluation via formal methods, iii) the question of quality criteria for such formalizations, (...) and finally iv) the choice of the underlying logic. This introductory discussion is supplemented by a brief description of the genesis of the special issue, acknowledgements, and summaries of each article. (shrink)

Logicians disagree about how validity—the very heart of logic—should be understood. Many different formal systems have been born due to this disagreement. This thesis examines how teachers explain the subject matter of logic to students in introductory logic textbooks, and demonstrates the different explanations teachers use. These differences help explain why logicians have different intuitions about validity.

Inferentialism is a theory in the philosophy of language which claims that the meanings of expressions are constituted by inferential roles or relations. Instead of a traditional model-theoretic semantics, it naturally lends itself to a proof-theoretic semantics, where meaning is understood in terms of inference rules with a proof system. Most work in proof-theoretic semantics has focused on logical constants, with comparatively little work on the semantics of non-logical vocabulary. Drawing on Robert Brandom’s notion of material inference and Greg Restall’s (...) bilateralist interpretation of the multiple conclusion sequent calculus, I present a proof-theoretic semantics for atomic sentences and their constituent names and predicates. The resulting system has several interesting features: (1) the rules are harmonious and stable; (2) the rules create a structure analogous to familiar model-theoretic semantics; and (3) the semantics is compositional, in that the rules for atomic sentences are determined by those for their constituent names and predicates. (shrink)

This collection of papers, celebrating the contributions of Swedish logician Dag Prawitz to Proof Theory, has been assembled from those presented at the Natural Deduction conference organized in Rio de Janeiro to honour his seminal research. Dag Prawitz’s work forms the basis of intuitionistic type theory and his inversion principle constitutes the foundation of most modern accounts of proof-theoretic semantics in Logic, Linguistics and Theoretical Computer Science. The range of contributions includes material on the extension of natural deduction with higher-order (...) rules, as opposed to higher-order connectives, and a paper discussing the application of natural deduction rules to dealing with equality in predicate calculus. The volume continues with a key chapter summarizing work on the extension of the Curry-Howard isomorphism, via methods of category theory that have been successfully applied to linear logic, as well as many other contributions from highly regarded authorities. With an illustrious group of contributors addressing a wealth of topics and applications, this volume is a valuable addition to the libraries of academics in the multiple disciplines whose development has been given added scope by the methodologies supplied by natural deduction. The volume is representative of the rich and varied directions that Prawitz work has inspired in the area of natural deduction. (shrink)

This paper studies a formalisation of intuitionistic logic by Negri and von Plato which has general introduction and elimination rules. The philosophical importance of the system is expounded. Definitions of ‘maximal formula’, ‘segment’ and ‘maximal segment’ suitable to the system are formulated and corresponding reduction procedures for maximal formulas and permutative reduction procedures for maximal segments given. Alternatives to the main method used are also considered. It is shown that deductions in the system convert into normal form and that deductions (...) in normal form have the subformula property. (shrink)

Prawitz has recently developed a theory of epistemic grounding that differs in many respects from his earlier semantics of arguments and proofs. An innovative approach to inferences yields a new conception of the intertwinement of the notions of valid inference and proof. We aim at singling out three reasons that may have led Prawitz to the ground-theoretic turn, i.e.: a better order in the explanation of the relation between valid inferences and proofs; a notion of valid inference based on which (...) valid inferences and proofs are recognisable as such; a reconstruction of the deductive activity that makes inferences capable of yielding justification per se. These topics are discussed by Prawitz with reference to a very general and ancient question: why and how correct deduction has the epistemic power to compel us to accept its conclusions, provided its premises are justified? We conclude by remarking that, in spite of some improvements, the ground-theoretic approach shares with the previous one a problem of vacuous validity which, as Prawitz himself points out, blocks in both cases a satisfactory explanation of epistemic compulsion. (shrink)

Prawitz conjectured that proof-theoretic validity offers a semantics for intuitionistic logic. This conjecture has recently been proven false by Piecha and Schroeder-Heister. This article resolves one of the questions left open by this recent result by showing the extensional alignment of proof-theoretic validity and general inquisitive logic. General inquisitive logic is a generalisation of inquisitive semantics, a uniform semantics for questions and assertions. The paper further defines a notion of quasi-proof-theoretic validity by restricting proof-theoretic validity to allow double negation elimination (...) for atomic formulas and proves the extensional alignment of quasi-proof-theoretic validity and inquisitive logic. (shrink)

Penelope Maddy has recently addressed the set-theoretic multiverse, and expressed reservations on its status and merits ([Maddy, 2017]). The purpose of the paper is to examine her concerns, by using the interpretative framework of set-theoretic naturalism. I first distinguish three main forms of 'multiversism', and then I proceed to analyse Maddy's concerns. Among other things, I take into account salient aspects of multiverse-related mathematics , in particular, research programmes in set theory for which the use of the multiverse seems to (...) be crucial, and show how one may provide responses to Maddy's concerns based on a careful analysis of 'multiverse practice'. (shrink)

This paper considers Rumfitt’s bilateral classical logic (BCL), which is proposed to counter Dummett’s challenge to classical logic. First, agreeing with several authors, we argue that Rumfitt’s notion of harmony, used to justify logical rules by a purely proof theoretical manner, is not sufficient to justify coordination rules in BCL purely proof-theoretically. For the central part of this paper, we propose a notion of proof-theoretical validity similar to Prawitz for BCL and proves that BCL is sound and complete respect to (...) this notion of validity. The major difficulty in defining validity for BCL is that validity of positive +A appears to depend on negative −A, and vice versa. Thus, the straightforward inductive definition does not work because of this circular dependance. However, Knaster-Tarski’s fixed point theorem can resolve this circularity. Finally, we discuss the philosophical relevance of our work, in particular, the impact of the use of fixed point theorem and the issue of decidability. (shrink)

This volume is dedicated to Prof. Dag Prawitz and his outstanding contributions to philosophical and mathematical logic. Prawitz's eminent contributions to structural proof theory, or general proof theory, as he calls it, and inference-based meaning theories have been extremely influential in the development of modern proof theory and anti-realistic semantics. In particular, Prawitz is the main author on natural deduction in addition to Gerhard Gentzen, who defined natural deduction in his PhD thesis published in 1934. The book opens with an (...) introductory paper that surveys Prawitz's numerous contributions to proof theory and proof-theoretic semantics and puts his work into a somewhat broader perspective, both historically and systematically. Chapters include either in-depth studies of certain aspects of Dag Prawitz's work or address open research problems that are concerned with core issues in structural proof theory and range from philosophical essays to papers of a mathematical nature. Investigations into the necessity of thought and the theory of grounds and computational justifications as well as an examination of Prawitz's conception of the validity of inferences in the light of three “dogmas of proof-theoretic semantics” are included. More formal papers deal with the constructive behaviour of fragments of classical logic and fragments of the modal logic S4 among other topics. In addition, there are chapters about inversion principles, normalization of proofs, and the notion of proof-theoretic harmony and other areas of a more mathematical persuasion. Dag Prawitz also writes a chapter in which he explains his current views on the epistemic dimension of proofs and addresses the question why some inferences succeed in conferring evidence on their conclusions when applied to premises for which one already possesses evidence. (shrink)

This volume is the first ever collection devoted to the field of proof-theoretic semantics. Contributions address topics including the systematics of introduction and elimination rules and proofs of normalization, the categorial characterization of deductions, the relation between Heyting's and Gentzen's approaches to meaning, knowability paradoxes, proof-theoretic foundations of set theory, Dummett's justification of logical laws, Kreisel's theory of constructions, paradoxical reasoning, and the defence of model theory. The field of proof-theoretic semantics has existed for almost 50 years, but the term (...) itself was proposed by Schroeder-Heister in the 1980s. Proof-theoretic semantics explains the meaning of linguistic expressions in general and of logical constants in particular in terms of the notion of proof. This volume emerges from presentations at the Second International Conference on Proof-Theoretic Semantics in Tübingen in 2013, where contributing authors were asked to provide a self-contained description and analysis of a significant research question in this area. The contributions are representative of the field and should be of interest to logicians, philosophers, and mathematicians alike. (shrink)

Arguments, the story goes, have one or more premises and only one conclusion. A contentious generalisation allows arguments with several disjunctively connected conclusions. Contentious as this generalisation may be, I will argue nevertheless that it is justified. My main claim is that multiple conclusions are epiphenomena of the logical connectives: some connectives determine, in a certain sense, multiple-conclusion derivations. Therefore, such derivations are completely natural and can safely be used in proof-theoretic semantics.

Philosophers are divided on whether the proof- or truth-theoretic approach to logic is more fruitful. The paper demonstrates the considerable explanatory power of a truth-based approach to logic by showing that and how it can provide (i) an explanatory characterization —both semantic and proof-theoretical—of logical inference, (ii) an explanatory criterion for logical constants and operators, (iii) an explanatory account of logic’s role (function) in knowledge, as well as explanations of (iv) the characteristic features of logic —formality, strong modal force, generality, (...) topic neutrality, basicness, and (quasi-)apriority, (v) the veridicality of logic and its applicability to science, (v) the normativity of logic, (vi) error, revision, and expansion in/of logic, and (vii) the relation between logic and mathematics. The high explanatory power of the truth-theoretic approach does not rule out an equal or even higher explanatory power of the proof-theoretic approach. But to the extent that the truth-theoretic approach is shown to be highly explanatory, it sets a standard for other approaches to logic, including the proof-theoretic approach. (shrink)

This paper deals with a collection of concerns that, over a period of time, led the author away from the Routley–Meyer semantics, and towards proof- theoretic approaches to relevant logics, and indeed to the weak relevant logic MC of meaning containment.

Girard introduced phase semantics as a complete set-theoretic semantics of linear logic, and Okada modified phase-semantic completeness proofs to obtain normal-form theorems. On the basis of these works, Okada and Takemura reformulated Girard’s phase semantics so that it became phase semantics for proof-terms, i.e., lambda-terms. They formulated phase semantics for proof-terms of Laird’s dual affine/intuitionistic lambda-calculus and proved the normal-form theorem for Laird’s calculus via a completeness theorem. Their semantics was obtained by an application of computability predicates. In this paper, (...) we first formulate phase semantics for proof-terms of second-order intuitionistic propositional logic by modifying Tait-Girard’s saturated sets method. Next, we prove the completeness theorem with respect to this semantics, which implies a strong normalization theorem. (shrink)

This open access book is a superb collection of some fifteen chapters inspired by Schroeder-Heister's groundbreaking work, written by leading experts in the field, plus an extensive autobiography and comments on the various contributions by Schroeder-Heister himself. For several decades, Peter Schroeder-Heister has been a central figure in proof-theoretic semantics, a field of study situated at the interface of logic, theoretical computer science, natural-language semantics, and the philosophy of language. -/- The chapters of which this book is composed discuss the (...) subject from a rich variety of angles, including the history of logic, the proper interpretation of logical validity, natural deduction rules, the notions of harmony and of synonymy, the structure of proofs, the logical status of equality, intentional phenomena, and the proof theory of second-order arithmetic. All chapters relate directly to questions that have driven Schroeder-Heister's own research agenda and to which he has made seminal contributions. The extensive autobiographical chapter not only provides a fascinating overview of Schroeder-Heister's career and the evolution of his academic interests but also constitutes a contribution to the recent history of logic in its own right, painting an intriguing picture of the philosophical, logical, and mathematical institutional landscape in Germany and elsewhere since the early 1970s. The papers collected in this book are illuminatingly put into a unified perspective by Schroeder-Heister's comments at the end of the book. Both graduate students and established researchers in the field will find this book an excellent resource for future work in proof-theoretic semantics and related areas. (shrink)

A new type of formalization of classical first-order logic with equality is introduced on the basis of the sequent calculus. It serves to justify the claim that equality is a logical constant characterised by well-behaved rules satisfying properties usually regarded as essential. The main feature of this approach is the application of sequents built not only from formulae but also from terms. Two variants of sequent calculus are examined, a structural and a logical one. The former is defined in accordance (...) with Dos̆en’s criteria for logical constants. The latter is a standard Gentzen’s sequent calculus and satisfies Hacking’s criteria for logicality, including cut elimination. It is also shown that provided rules are harmonious in the sense advocated by Gratzl and Orlandelli. (shrink)

We expose some basic elements of a style of programming supported by functional languages like Haskell by relating them to a coherent set of notions and techniques from Curry’s work in combinatory logic and formal systems, and their algebraic and categorical interpretations. Our account takes the form of a commentary to a simple fragment of Haskell code attempting to isolate the conceptual sources of the linguistic abstractions involved.

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)

It has been argued in the literature that the deflationists’ thesis about the dispensability of truth as an explanatory notion forces them to adopt a conservative theory of truth. I suggest that the deflationists’ claim that the notion of truth is akin to a logical notion should be taken more seriously. This claim casts some doubts on the adequacy of the conservativity requirement, while it also calls for further investigation to assess its philosophical plausibility.

Validity, the central concept of the so-called ‘proof-theoretic semantics’ is described as correctly applying to the arguments that denote proofs. In terms of validity, I propose an anti-realist characterization of the notions of truth and correct assertion, at the core of which is the idea that valid arguments may fail to be recognized as such. The proposed account is compared with Dummett’s and Prawitz’s views on the matter.

This paper is dedicated to developing a formalism that takes rejection seriously. Bilateral notation of signed formulas with force indicators is adopted to define signed consequences which can be viewed as the bilateral counterpart of Tarskian consequence relations. Its relation to some other bilateral approaches is discussed. It is shown how David Nelson’s logic N4 can be characterized bilaterally and the corresponding completeness result is proved. Further, bilateral variants of three familiar notions are considered and investigated: that of a fragment, (...) of definitional equivalence, and of a conservative extension. (shrink)

This volume is dedicated to Prof. Dag Prawitz and his outstanding contributions to philosophical and mathematical logic. Prawitz's eminent contributions to structural proof theory, or general proof theory, as he calls it, and inference-based meaning theories have been extremely influential in the development of modern proof theory and anti-realistic semantics. In particular, Prawitz is the main author on natural deduction in addition to Gerhard Gentzen, who defined natural deduction in his PhD thesis published in 1934. The book opens with an (...) introductory paper that surveys Prawitz's numerous contributions to proof theory and proof-theoretic semantics and puts his work into a somewhat broader perspective, both historically and systematically. Chapters include either in-depth studies of certain aspects of Dag Prawitz's work or address open research problems that are concerned with core issues in structural proof theory and range from philosophical essays to papers of a mathematical nature. Investigations into the necessity of thought and the theory of grounds and computational justifications as well as an examination of Prawitz's conception of the validity of inferences in the light of three “dogmas of proof-theoretic semantics” are included. More formal papers deal with the constructive behaviour of fragments of classical logic and fragments of the modal logic S4 among other topics. In addition, there are chapters about inversion principles, normalization of p roofs, and the notion of proof-theoretic harmony and other areas of a more mathematical persuasion. Dag Prawitz also writes a chapter in which he explains his current views on the epistemic dimension of proofs and addresses the question why some inferences succeed in conferring evidence on their conclusions when applied to premises for which one already possesses evidence. (shrink)

According to Schroeder-Heister 2018, proof-theoretic semantics is ‘an alternative to truth-condition semantics. It is based on the fundamental assumption that the central notion in terms of which meanings are assigned to certain expressions of our language, in particular to logical constants, is that of proof rather than truth. In this sense proof-theoretic semantics is semantics in terms of proof. Proof-theoretic semantics also means the semantics of proofs, i.e. the semantics of entities which describe how we arrive at certain assertions given (...) certain assumptions.' This text advocates that proof-theoretic semantics, as described above, was an approach to semantical issues in logic that appeared in mainstream philosophical literature at least a couple of centuries before the tradition of general proof theory (cf. Prawitz 1971) came into being. This is done by means of an interpretive analysis of Kant’s 1762 essay Die falsche Spitzfindigkeit der vier syllogistischen Figuren, in which two theses are argued: first, that the issue of justifying the logical validity of inferences is approached by Kant in this text, in a strong sense, in terms of proofs; and second, that the purpose of his effort is to establish a point concerning the semantical equivalence between certain distinct valid inferences. (shrink)

An oft-defended claim of a close relationship between Gentzen inference rules and the meaning of the connectives they introduce and eliminate has given rise to a whole domain called proof-theoretic semantics, see Schroeder- Heister (1991); Prawitz (2006). A branch of proof-theoretic semantics, mainly developed by Dosen (2019); Dosen and Petric (2011), isolates in a precise mathematical manner formulas (of a logic L) that have the same meaning. These isomorphic formulas are defined to be those that behave identically in inferences. The (...) aim of this paper is to investigate another type of recently discussed rules in the literature, namely grounding rules, and their link to the meaning of the connectives they provide the grounds for. In particular, by using grounding rules, we will refine the notion of isomorphic formulas through the notion of hyper-isomorphic formulas. We will argue that it is actually the notion of hyper-isomorphic formulas that identify those formulas that have the same meaning. (shrink)

In this paper we present a study of adjectival/adverbial modification using modern type theories, i.e. type theories within the tradition of Martin-Löf. We present an account of various issues concerning adjectival/adverbial modification and argue that MTTs can be used as an adequate language for interpreting NL semantics. MTTs are not only expressive enough to deal with a range of modification phenomena, but are furthermore well-suited to perform reasoning tasks that can be easily implemented given their proof-theoretic nature. In MTT-semantics, common (...) nouns are interpreted as types rather than predicates. Therefore, in order to capture the semantics of adjectives adequately, one needs to meet the challenge of modeling CNs modified by adjectives as types. To explicate that this can be done successfully, we first look at the mainstream classification of adjectives, i.e. intersective, subsective and non-subsective adjectives. There, we show that the rich type structure available in MTTs, along with a suitable subtyping framework, offers an adequate mechanism to model these cases. In particular, this modelling naturally takes care of the characterising inferences associated with each class of adjectives. Then, more advanced issues on adjectival modification are discussed: degree adjectives, comparatives and multidimensional adjectives. There, it is shown that the use of indexed types can be usefully applied in order to deal with these cases. In the same vein, the issue of adverbial modification is discussed. We study two general typings for sentence and VP adverbs respectively. It is shown that the rich type structure in MTTs further provides useful organisational mechanisms in giving formal semantics for adverbs. In particular, we discuss the use of \-types to capture the veridicality/non-veridicality distinction and further discuss cases of intensional adverbs using the type theoretic notion of context. We also look at manner, subject and speech act adverbials and propose solutions using MTTs. Finally, we show that the current proof technology can help mechanically check the associated inferences. A number of our proposals concerning adjectival and adverbial modification have been formalised in the proof assistant Coq and many of the associated inference patterns are checked to be correctly captured. (shrink)

The problem of precise characterisation of traditional forms of reasoning applied in mathematics was independently investigated and successfully resolved by Jaśkowski and Gentzen in 1934. However, there are traces of earlier interests in this field exhibited by the members of the Lvov-Warsaw School. We focus on the results obtained by Jaśkowski and Leśniewski. Jaśkowski provided the first formal system of natural deduction in 1926. Leśniewski also demonstrated in some of his papers how to construct proofs in accordance with intuitively correct (...) principles. (shrink)

Several proof-theoretic notions of validity have been proposed in the literature, for which completeness of intuitionistic logic has been conjectured. We define validity for intuitionistic propositional logic in a way which is common to many of these notions, emphasizing that an appropriate notion of validity must be closed under substitution. In this definition we consider atomic systems whose rules are not only production rules, but may include rules that allow one to discharge assumptions. Our central result shows that Harrop’s rule (...) is valid under substitution, which refutes the completeness conjecture for intuitionistic logic. (shrink)

This paper studies the notions of conceptual grounding and conceptual explanation (which includes the notion of mathematical explanation), with an aim of clarifying the links between them. On the one hand, it analyses complex examples of these two notions that bring to the fore features that are easily overlooked otherwise. On the other hand, it provides a formal framework for modeling both conceptual grounding and conceptual explanation, based on the concept of proof. Inspiration and analogies are drawn with the recent (...) research in metaphysics on the pair metaphysical grounding–metaphysical explanation, and especially with the literature in philosophy of science on the pair causality-causal explanation. (shrink)

This paper aims to unite two seemingly disparate themes in the philosophy of mathematics and language respectively, namely ante rem structuralism and inferentialism. My analysis begins with describing both frameworks in accordance with their genesis in the work of Hilbert. I then draw comparisons between these philosophical views in terms of their similar motivations and similar objections to the referential orthodoxy. I specifically home in on two points of comparison, namely the role of norms and the relation of ontological dependence (...) in both accounts. Lastly, I show that insights from this purported connection can address certain objections to both theories respectively. (shrink)

A first-order language with a defined identity predicate is proposed whose apparatus for atomic predication is sensitive to grammatical categories of natural language. Subatomic natural deduction systems are defined for this naturalistic first-order language. These systems contain subatomic systems which govern the inferential relations which obtain between naturalistic atomic sentences and between their possibly composite components. As a main result it is shown that normal derivations in the defined systems enjoy the subexpression property which subsumes the subformula property with respect (...) to atomic and identity formulae as a special case. The systems admit a proof-theoretic semantics which does not only apply to logically compound but also to atomic and identity formulae—as well as to their components. The potential of the defined systems for a meticulous first-order analysis of natural inferences whose validity crucially depends on expressions of some of the aforementioned categories is demonstrated. (shrink)

We study the mathematical properties of bilateral state-based modal logic (BSML), a modal logic employing state-based semantics (also known as team semantics), which has been used to account for free choice inferences and related linguistic phenomena. This logic extends classical modal logic with a nonemptiness atom which is true in a state if and only if the state is nonempty. We introduce two extensions of BSML and show that the extensions are expressively complete, and develop natural deduction axiomatizations for the (...) three logics. (shrink)

In this paper we will consider the existing notions of bilateralism in the context of proof-theoretic semantics and propose, based on our understanding of bilateralism, an extension to logical multilateralism. This approach differs from what has been proposed under this name before in that we do not consider multiple speech acts as the core of such a theory but rather multiple consequence relations. We will argue that for this aim the most beneficial proof-theoretical realization is to use sequent calculi with (...) multiple sequent arrows satisfying some specific conditions, which we will lay out in this paper. We will unfold our ideas with the help of a case study in logical tetralateralism and present an extension of Almukdad and Nelson’s propositional constructive four-valued logic by unary operations of meaningfulness and nonsensicality. We will argue that in sequent calculi with multiple sequent arrows it is possible to maintain certain features that are desirable if we assume an understanding of the meaning of connectives in the spirit of proof-theoretic semantics. The use of multiple sequent arrows will be justified by the presence of congruentiality-breaking unary connectives. (shrink)

The paper introduces a new type of rules into Natural Deduction, elimination rules by composition. Elimination rules by composition replace usual elimination rules in the style of disjunction elimination and give a more direct treatment of additive disjunction, multiplicative conjunction, existence quantifier and possibility modality. Elimination rules by composition have an enormous impact on proof-structures of deductions: they do not produce segments, deduction trees remain binary branching, there is no vacuous discharge, there is only few need of permutations. This new (...) type of rules fits especially to substructural issues, so it is shown for Lambek Calculus, i.e. intuitionistic non-commutative linear logic and to its extensions by structural rules like permutation, weakening and contraction. Natural deduction formulated with elimination rules by composition from a complexity perspective is superior to other calculi. (shrink)

The operators of first-order logic, including negation, operate on whole formulae. This makes it unsuitable as a tool for the formal analysis of reasoning with non-sentential forms of negation such as predicate term negation. We extend its language with negation operators whose scope is more narrow than an atomic formula. Exploiting the usefulness of subatomic proof-theoretic considerations for the study of subatomic inferential structure, we define intuitionistic subatomic natural deduction systems which have several subatomic operators and an additional operator for (...) formula negation at their disposal. We establish normalization and subexpression property results for the systems. The normalization results allow us to formulate a proof-theoretic semantics for formulae composed of the subatomic operators. We illustrate the systems with applications to reasoning with combinations of sentential negation, predicate term negation, subject term negation, and antonymy. (shrink)

In this paper it is suggested to generalize our understanding of general (structural) proof theory and to consider it as a general theory of two kinds of derivations, namely proofs and dual proofs. The proposal is substantiated by (i) considerations on assertion, denial, and bi-lateralism, (ii) remarks on compositionality in proof-theoretic semantics, and (iii) comments on falsification and co-implication. The main formal result of the paper is a normal form theorem for the natural deduction proof system N2Int of the bi-intuitionistic (...) logic 2Int. The proof makes use of the faithful embedding of 2Int into intuitionistic logic with respect to validity and shows that conversions of dual proofs can be sidestepped. (shrink)

In the recent literature on proof-theoretic semantics, there is mention of a generality condition on defining rules. According to this condition, the schematic formulation of the defining rules must be maximally general, in the sense that no restrictions should be placed on the contexts of these rules. In particular, context variables must always be present in the schematic rules and they should range over arbitrary collections of formulae. I argue against imposing such a condition, by showing that it has undesirable (...) results and that it is ill-supported by the arguments brought in its favour. (shrink)

The paper develops a proof-theoretic semantics for belief reports by extending the constructive type-theoretical formalism presented in Więckowski with a specific kind of set-forming operator suited for the representation of belief attitudes. The extended formalism allows us to interpret constructions which involve, e.g., iteration of belief, quantifying into belief contexts, and anaphora in belief reports. Moreover, constructive solutions to canonical instances of the problem of hyperintensionality are suggested. The paper includes a discussion of Ranta’s constructive account of belief reports.

The hypothetical notion of consequence is normally understood as the transmission of a categorical notion from premisses to conclusion. In model-theoretic semantics this categorical notion is 'truth', in standard proof-theoretic semantics it is 'canonical provability'. Three underlying dogmas, (I) the priority of the categorical over the hypothetical, (II) the transmission view of consequence, and (III) the identification of consequence and correctness of inference are criticized from an alternative view of proof-theoretic semantics. It is argued that consequence is a basic semantical (...) concept which is directly governed by elementary reasoning principles such as definitional closure and definitional reflection, and not reduced to a categorical concept. This understanding of consequence allows in particular to deal with non-wellfounded phenomena as they arise from circular definitions. (shrink)