In this paper non-normal worlds semantics is presented as a basic, general, and unifying approach to epistemic logic. The semantical framework of non-normal worlds is compared to the model theories of several logics for knowledge and belief that were recently developed in Artificial Intelligence (AI). It is shown that every model for implicit and explicit belief (Levesque), for awareness, general awareness, and local reasoning (Fagin and Halpern), and for awareness and principles (van der Hoek and Meyer) induces a non-normal worlds (...) model validating precisely the same formulas (of the language in question). (shrink)

The topic of identity of proofs was put on the agenda of general (or structural) proof theory at an early stage. The relevant question is: When are the differences between two distinct proofs (understood as linguistic entities, proof figures) of one and the same formula so inessential that it is justified to identify the two proofs? The paper addresses another question: When are the differences between two distinct formulas so inessential that these formulas admit of identical proofs? The question appears (...) to be especially natural if the idea of working with more than one kind of derivations is taken seriously. If a distinction is drawn between proofs and disproofs (or refutations) as primitive entities, it is quite conceivable that a proof of one formula amounts to a disproof of another formula, and vice versa. A notion of inherited identity of derivations is introduced for derivations in a cut-free sequent system for Almukdad and Nelson’s constructive paraconsistent logic N4 with strong negation. The notion is obtained by identifying sequent rules the application of which has no effect on the identity of derivations. Then the notion of inherited identity is used to define a bilateralist notion of synonymy between formulas, which is a relation drawing more fine-grained distinctions between formulas than strong equivalence. (shrink)

Over the past ten years, the community researching connexive logics is rapidly growing and a number of papers have been published. However, when it comes to the terminology used in connexive logic, it seems to be not without problems. In this introduction, we aim at making a contribution towards both unifying and reducing the terminology. We hope that this can help making it easier to survey and access the field from outside the community of connexive logicians. Along the way, we (...) will make clear the context to which the papers in this special issue on Frontiers of Connexive Logic belong and contribute. (shrink)

In this paper we discuss Gabbay's idea of basing nonmonotonic deduction on semantic consequence in intuitionistic logic extended by a consistency operator and Turner's suggestion of replacing the intuitionistic base system by Kleene's three-valued logic. It is shown that a certain counterintuitive feature of these approaches can be avoided by using Nelson's constructive logic N instead of intuitionistic logic or Kleene's system. Moreover, in N a more general notion of consistency can be defined and nonmonotonic deduction can thus be based (...) on a logical system satisfying the Deduction Theorem. (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)

Imagination has recently attracted considerable attention from epistemologists and is recognized as a source of belief and even knowledge. One remarkable feature of imagination is that it is often and typically agentive: agents decide to imagine. In cases in which imagination results in a belief, the agentiveness of imagination may be taken to give rise to indirect doxastic control and epistemic responsibility. This observation calls for a proper understanding of agentive imagination. In particular, it calls for the development of a (...) semantics of imagination ascriptions. In the present paper an earlier suggestion by Ilkka Niiniluoto for a logic of imagination is considered. This proposal does not capture the agentive nature of imagination, and an alternative semantics is suggested. The new semantics combines the modal logic of agency with the neighbourhood semantics from alethic modal logic. (shrink)

The present monograph is a slightly revised version of my Habilitations schrift Proof-theoretic Aspects of Intensional and Non-Classical Logics, successfully defended at Leipzig University, November 1997. It collects work on proof systems for modal and constructive logics I have done over the last few years. The main concern is display logic, a certain refinement of Gentzen's sequent calculus developed by Nuel D. Belnap. This book is far from offering a comprehensive presentation of generalized sequent systems for modal logics broadly conceived. (...) The proof-theory of non-classical logics is a rapidly developing field, and even the generalizations of the ordinary notion of sequent listed in Chapter 1 can hardly be presented in great detail within a single volume. In addition to further investigating the various approaches toward generalized Gentzen systems, it is important to compare them and to discuss their relative advantages and disadvantages. An initial attempt at bringing together work on different kinds of proof systems for modal logics has been made in [188]. Another step in the same direction is [196]. Since Chapter 1 contains introductory considerations and, moreover, every remaining chapter begins with some surveying or summarizing remarks, in this preface I shall only emphasize a relation to philosophy that is important to me, register the sources of papers that have entered this book in some form or another, and acknowledge advice and support. (shrink)

This paper presents an overview of the methods of hypersequents and display sequents in the proof theory of non-classical logics. In contrast with existing surveys dedicated to hypersequent calculi or to display calculi, our aim is to provide a unified perspective on these two formalisms highlighting their differences and similarities and discussing applications and recent results connecting and comparing them.

In this paper, Graham Priest’s understanding of dialetheism, the view that there exist true contradictions, is discussed, and various kinds of metaphysical dialetheism are distinguished between. An alternative to dialetheism is presented, namely a thesis called ‘dimathematism’. It is pointed out that dimathematism enables one to escape a slippery slope argument for dialetheism that has been put forward by Priest. Moreover, dimathematism is presented as a thesis that is helpful in rejecting the claim that logic is a normative discipline.

In this paper, we shall consider the so-called cancellation view of negation and the inferential role of contradictions. We will discuss some of the problematic aspects of negation as cancellation, such as its original presentation by Richard and Valery Routley and its role in motivating connexive logic. Furthermore, we will show that the idea of inferential ineffectiveness of contradictions can be conceptually separated from the cancellation model of negation by developing a system we call qLPm, a combination of Graham Priest’s (...) minimally inconsistent Logic of Paradox with q-entailment as introduced by Grzegorz Malinowski. (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)

In a recent article, Mario Günther presented a conditional that is claimed to be connexive. The aim of this short discussion note is to show that Günther’s claim is not without problems.

In this paper, a family of paraconsistent propositional logics with constructive negation, constructive implication, and constructive co-implication is introduced. Although some fragments of these logics are known from the literature and although these logics emerge quite naturally, it seems that none of them has been considered so far. A relational possible worlds semantics as well as sound and complete display sequent calculi for the logics under consideration are presented.

We consider an approach to propositional synonymy in proof-theoretic semantics that is defined with respect to a bilateral G3-style sequent calculus \(\mathtt{SC2Int}\) for the bi-intuitionistic logic \(\mathtt{2Int}\). A distinctive feature of \(\mathtt{SC2Int}\) is that it makes use of two kind of sequents, one representing proofs, the other representing refutations. The structural rules of \(\mathtt{SC2Int}\), in particular its cut rules, are shown to be admissible. Next, interaction rules are defined that allow transitions from proofs to refutations, and vice versa, mediated through (...) two different negation connectives, the well-known implies-falsity negation and the less well-known coimplies-truth negation of \(\mathtt{2Int}\). By assuming that the interaction rules have no impact on the identity of derivations, the concept of inherited identity between derivations in \(\mathtt{SC2Int}\) is introduced and the notions of positive and negative synonymy of formulas are defined. Several examples are given of distinct formulas that are either positively or negatively synonymous. It is conjectured that the two conditions cannot be satisfied simultaneously. (shrink)

This chapter is concerned with logical aspects of negation, i.e. with the role of negation in valid inferences and hence with the contribution negation makes to the truth and falsity conditions of declarative expressions. Negation is an important philosophical and logical concept. Often differences between logical systems can ‐ at least partially ‐ be described as differences between the notions of negation used in these logics.

The knowability paradox is an instance of a remarkable reasoning pattern (actually, a pair of such patterns), in the course of which an occurrence of the possibility operator, the diamond, disappears. In the present paper, it is pointed out how the unwanted disappearance of the diamond may be escaped. The emphasis is not laid on a discussion of the contentious premise of the knowability paradox, namely that all truths are possibly known, but on how from this assumption the conclusion is (...) derived that all truths are, in fact, known. Nevertheless, the solution offered is in the spirit of the constructivist attitude usually maintained by defenders of the anti-realist premise. In order to avoid the paradoxical reasoning, a paraconsistent constructive relevant modal epistemic logic with strong negation is defined semantically. The system is axiomatized and shown to be complete. (shrink)

According to Suszko’s Thesis, there are but two logical values, true and false. In this paper, R. Suszko’s, G. Malinowski’s, and M. Tsuji’s analyses of logical twovaluedness are critically discussed. Another analysis is presented, which favors a notion of a logical system as encompassing possibly more than one consequence relation. [A] fundamental problem concerning many-valuedness is to know what it really is. [13, p. 281].

This is a purely conceptual paper. It aims at presenting and putting into perspective the idea of a proof-theoretic semantics of the logical operations. The first section briefly surveys various semantic paradigms, and Section 2 focuses on one particular paradigm, namely the proof-theoretic semantics of the logical operations.

The book presents a thoroughly elaborated logical theory of generalized truth-values understood as subsets of some established set of truth values. After elucidating the importance of the very notion of a truth value in logic and philosophy, we examine some possible ways of generalizing this notion. The useful four-valued logic of first-degree entailment by Nuel Belnap and the notion of a bilattice constitute the basis for further generalizations. By doing so we elaborate the idea of a multilattice, and most notably, (...) a trilattice of truth values – a specific algebraic structure with information ordering and two distinct logical orderings, one for truth and another for falsity. Each logical order not only induces its own logical vocabulary, but determines also its own entailment relation. We consider both semantic and syntactic ways of formalizing these relations and construct various logical calculi. (shrink)

In this introduction, we offer an overview of main systems developed in the growing literature on connexive logic, and also point to a few topics that seem to be collecting attention of many of those interested in connexive logic. We will also make clear the context to which the papers in this special issue belong and contribute.

In this introduction to the special issue “40 years of FDE”, we offer an overview of the field and put the papers included in the special issue into perspective. More specifically, we first present various semantics and proof systems for FDE, and then survey some expansions of FDE by adding various operators starting with constants. We then turn to unary and binary connectives, which are classified in a systematic manner. First-order FDE is also briefly revisited, and we conclude by listing (...) some open problems for future research. (shrink)

Curry’s paradox is well known. The original version employed a conditional connective, and is not forthcoming if the conditional does not satisfy contraction. A newer version uses a validity predicate, instead of a conditional, and is not forthcoming if validity does not satisfy structural contraction. But there is a variation of the paradox which uses “external validity”. And since external validity contracts, one might expect the appropriate version of the Curry paradox to be inescapable. In this paper we show that (...) this is not the case. We consider two ways of formalising the notion of external validity, and show that in both of these the paradox is not forthcoming without the appropriate forms of contraction. (shrink)

The properties of negation, in combination with those of other logical operations and structural features of the deductibility relation, serve as gateways among logical systems. Negation therefore plays an important role in selecting logical systems for particular applications. This volume provides a thorough treatment of this concept, based on contributions written by authors from various branches of logic. The resulting 14 research papers address a variety of topics including negation in relevant logics; a defense of dialetheic theory of negation; stable (...) negation in logic programming; antirealism and falsity; and negation, denial, and language change in philosophical logic. Suited to scholars and graduate students in the fields of philosophy, logic mathematics, computer science, and linguistics. Annotation copyrighted by Book News, Inc., Portland, OR. (shrink)

In Belnap's useful 4-valued logic, the set 2 = {T, F} of classical truth values is generalized to the set 4 = ������(2) = {Ø, {T}, {F}, {T, F}}. In the present paper, we argue in favor of extending this process to the set 16 = ᵍ (4) (and beyond). It turns out that this generalization is well-motivated and leads from the bilattice FOUR₂ with an information and a truth-and-falsity ordering to another algebraic structure, namely the trilattice SIXTEEN₃ with an (...) information ordering together with a truth ordering and a (distinct) falsity ordering. Interestingly, the logics generated separately by the algebraic operations under the truth order and under the falsity order in SIXTEEN₃ coincide with the logic of FOUR₂, namely first degree entailment. This observation may be taken as a further indication of the significance of first degree entailment. In the present setting, however, it becomes rather natural to consider also logical systems in the language obtained by combining the vocabulary of the logic of the truth order and the falsity order. We semantically define the logics of the two orderings in the extended language and in both cases axiomatize a certain fragment comprising three unary operations: a negation, an involution, and their combination. We also suggest two other definitions of logics in the full language, including a bi-consequence system. In other words, in addition to presenting first degree entailment as a useful 16-valued logic, we define further useful 16-valued logics for reasoning about truth and (non-)falsity. We expect these logics to be an interesting and useful instrument in information processing, especially when we deal with a net of hierarchically interconnected computers. We also briefly discuss Arieli's and Avron's notion of a logical bilattice and state a number of open problems for future research. (shrink)

Francesco Berto proposed a logic for imaginative episodes. The logic establishes certain (in)validities concerning episodic imagination. They are not all equally plausible as principles of episodic imagination. The logic also does not model that the initial input of an imaginative episode is deliberately chosen.Stit-imagination logic models the imagining agent’s deliberate choice of the content of their imagining. However, the logic does not model the episodic nature of imagination. The present paper combines the two logics, thereby modelling imaginative episodes with deliberately (...) chosen initial input. We use a combination ofstit-imagination logic and a content-sensitive variably strict conditional à la Berto, for which we give a Chellas–Segerberg semantics. The proposed semantics has the following advantages over Berto’s: (i) we model thedeliberate choiceof initial input of imaginative episodes (in a multi-agent setting), (ii) we showframe correspondencesfor axiomatic analogues of Berto’s validities, which (iii) allows thepossibility to disregard axiomsthat might be considered not plausible as principles concerning imaginative episodes. We do not take a definite stance on whether theseshouldbe disregarded but give reasons for why one might want to disregard them. Finally, we compare our semantics briefly with recent work, which aims to model voluntary imagination, and argue that our semantics models different aspects. (shrink)

This edited volume collects essays on the four-valued logic known as Belnap-Dunn logic, or first-degree entailment logic. It also looks at various formal systems closely related to it. These include the strong Kleene logic and the Logic of Paradox. Inside, readers will find reprints of seminal papers written by the fathers of the field: Nuel Belnap and Michael Dunn. In addition, the collection also features a well-known but previously unpublished manuscript of Dunn, an interview with Belnap, and a new essay (...) by Dunn. Besides the original, monumental papers, the book also includes research by leading scholars. They consider the extraordinary importance of Belnap-Dunn logic from several perspectives. They look at how, philosophically, it has served as a basic system of inconsistency-tolerant reasoning, as the core of underlying logics for theories based on dialetheism, and, more recently, for theories based on Buddhist philosophy. Coverage also explores its contributions to computer science, such as knowledge representation and information processing. This mix of seminal papers and insightful analysis by top scholars offers readers a comprehensive outlook on Belnap-Dunn logic and its related expansions, which have been agenda setting for the debate on philosophical logic as well as philosophy of logic. The book will also enhance further discussion on the philosophical issues related to nonclassical logics in general. (shrink)

Many logical systems are such that the addition of Prior's binary connective tonk to them leads to triviality, see [1, 8]. Since tonk is given by some introduction and elimination rules in natural deduction or sequent rules in Gentzen's sequent calculus, the unwanted effects of adding tonk show that some kind of restriction has to be imposed on the acceptable operational inferences rules, in particular if these rules are regarded as definitions of the operations concerned. In this paper, a number (...) of simple observations is made showing that the unwanted phenomenon exemplified by tonk in some logics also occurs in contexts in which tonk is acceptable. In fact, in any non-trivial context, the acceptance of arbitrary introduction rules for logical operations permits operations leading to triviality. Connectives that in all non-trivial contexts lead to triviality will be called non-trivially trivializing connectives. (shrink)

A version of strong negation is introduced into Categorial Grammar. The resulting syntactic calculi turn out to be systems of connexive logic.

This paper deals with various substructural propositional logics, in particular with substructural subsystems of Nelson's constructive propositional logics N– and N. Doen's groupoid semantics is extended to these constructive systems and is provided with an informational interpretation in terms of information pieces and operations on information pieces.

Graham Priest takes the relation of identity to be non-transitive. In this paper, we are going to discuss several consequences of identity as a non-transitive relation. We will consider the Henkin-style completeness proof for classical first-order logic with a non-transitive “identity” predicate, Leibniz-identity in Priest’s second-order minimal logic of paradox, and the question whether or not identity of individuals should be defined as Leibniz-identity.

Justification stit logic is a logic for reasoning about proving as a certain kind of activity, namely seeing to it that a proof is publicly available. It merges the semantical analysis of deliberatively seeing-to-it-that from stit theory and the semantics of the epistemic logic with justification from. In this paper, after recalling its language and basic semantical definitions, various ramifications and refinements of justification stit logic are presented and discussed: imposing natural restrictions upon the class of models under consideration, making (...) use of modalities that assert the existence of a proof, introducing a variant of justification stit logic based on a semantics introduced by M. Fitting, and adding variable-binding operators and extending the set of proof polynomials. (shrink)

A prominent issue in mainstream epistemology is the controversy about doxastic obligations and doxastic voluntarism. In the present paper it is argued that this discussion can benefit from forging links with formal epistemology, namely the combined modal logic of belief, agency, and obligation. A stit-theory-based semantics for deontic doxastic logic is suggested, and it is claimed that this is helpful and illuminating in dealing with the mentioned intricate and important problems from mainstream epistemology. Moreover, it is argued that this linking (...) is of mutual benefit. The discussion of doxastic voluntarism directs the attention of doxastic logicians to the notion of belief formation and thus to dynamic aspects of beliefs that have hitherto been neglected. The development of a formal language and semantics for ascriptions of belief formation may contribute to clarifying the contents and the implications of voluntaristic claims. A simple observation concerning other-agent nestings of stit-operators, for instance, may help illuminating the notions of making belief and responsibility for beliefs of others. In this way, stit-theory may serve as a bridge between mainstream and formal epistemology. (shrink)

In Philosophical Logic, the Liar Paradox has been used to motivate the introduction of both truth value gaps and truth value gluts. Moreover, in the light of “revenge Liar” arguments, also higher-order combinations of generalized truth values have been suggested to account for so-called hyper-contradictions. In the present paper, Graham Priest's treatment of generalized truth values is scrutinized and compared with another strategy of generalizing the set of classical truth values and defining an entailment relation on the resulting sets of (...) higher-order values. This method is based on the concept of a multilattice. If the method is applied to the set of truth values of Belnap's “useful four-valued logic”, one obtains a trilattice, and, more generally, structures here called Belnap-trilattices. As in Priest's case, it is shown that the generalized truth values motivated by hyper-contradictions have no effect on the logic. Whereas Priest's construction in terms of designated truth values always results in his Logic of Paradox, the present construction in terms of truth and falsity orderings always results in First Degree Entailment. However, it is observed that applying the multilattice-approach to Priest's initial set of truth values leads to an interesting algebraic structure of a “bi-and-a-half” lattice which determines seven-valued logics different from Priest's Logic of Paradox. (shrink)

Model-theoretic proofs of functional completenes along the lines of [McCullough 1971, Journal of Symbolic Logic 36, 15–20] are given for various constructive modal propositional logics with strong negation.

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)

Despite the tendency to be otherwise, some non-classical logics are known to validate formulas that are invalid in classical logic. A subclass of such systems even possesses pairs of a formula and its negation as theorems, without becoming trivial. How should these provable contradictions be understood? The present paper aims to shed light on aspects of this phenomenon by taking as samples the constructive connexive logic C, which is obtained by a simple modification of a system of constructible falsity, namely (...) N4, as well as its non-constructive extension C3. For these systems, various observations concerning provable contradictions are made, using mainly a proof-theoretic approach. The topics covered in this paper include: how new contradictions are found from parts of provable contradictions; how to characterise provable contradictions in C3 that are constructive; how contradictions can be seen from the relative viewpoint of strong implication; and as an appendix an attempt at generating provable contradictions in C3. (shrink)