Meta-moral cognitive skills consist of identifying reasons behind ethical decisions, potential criticisms for such reasons, and constructing counterarguments for these criticisms. We assessed the relationship among these three elements of ethical judgment justification using ethical dilemmas. A mixed-methods research design was used to investigate university students from India and Japan. Critical thinking skills, knowledge of professional ethics, discipline, perspective-taking, common sense, and culture influenced the respondents’ meta-moral cognitive skills. There was a correlation between the number/strength of reasons and criticisms and (...) between criticisms and counterarguments. The respondents had difficulty connecting the reasons for their decisions and their counterarguments. The results imply that incorporating personal and professional cases as part of the ethics curriculum can improve meta-moral cognitive skills. (shrink)

According to an intuitive picture of relevant entailment, an entailment is relevant if all the formulas it contains contribute to its validity. In this paper, we provide a ground-theoretic analysis of this notion of contribution, and as a result of relevant entailment. We build a system of bilateral logical grounding within which we can derive classical entailment and analyze the contribution of premises and conclusions, in terms of a certain type of connection between their respective logical grounds. The resulting framework (...) is shown to have a strong unifying and explanatory power by bringing together the notions of grounding and relevance and explaining the commonalities and differences between alternative contribution-based accounts of relevance. (shrink)

What is the source of logical and mathematical truth? This book revitalizes conventionalism as an answer to this question. Conventionalism takes logical and mathematical truth to have their source in linguistic conventions. This was an extremely popular view in the early 20th century, but it was never worked out in detail and is now almost universally rejected in mainstream philosophical circles. Shadows of Syntax is the first book-length treatment and defense of a combined conventionalist theory of logic and mathematics. It (...) argues that our conventions, in the form of syntactic rules of language use, are perfectly suited to explain the truth, necessity, and a priority of logical and mathematical claims, as well as our logical and mathematical knowledge. (shrink)

In a series of works, Pablo Cobreros, Paul Égré, David Ripley and Robert van Rooij have proposed a nontransitive system (call it ‘_K__3__L__P_’) as a basis for a solution to the semantic paradoxes. I critically consider that proposal at three levels. At the level of the background logic, I present a conception of classical logic on which _K__3__L__P_ fails to vindicate classical logic not only in terms of structural principles, but also in terms of operational ones. At the level of (...) the theory of truth, I raise a cluster of philosophical difficulties for a _K__3__L__P_-based system of naive truth, all variously related to the fact that such a system proves things that would seem already by themselves repugnant, even in the absence of transitivity. At the level of the theory of validity, I consider an extension of the _K__3__L__P_-based system of naive validity that is supposed to certify that validity in that system does not fall short of naive validity, argue that such an extension is untenable in that its nontriviality depends on the inadmissibility of a certain irresistible instance of transitivity (whence the advertised “final cut”) and conclude on this basis that the _K__3__L__P_-based system of naive validity cannot coherently be adopted either. At all these levels, a crucial role is played by certain metaentailments and by the extra strength they afford over the corresponding entailments: on the one hand, such strength derives from considerations that would seem just as compelling in a general nontransitive framework, but, on the other hand, such strength wreaks havoc in the particular setting of _K__3__L__P_. (shrink)

I argue for a version of logical pluralism based on the plurality of legitimate formalizations of the logical vocabulary. In particular, I argue that the apparent rivalry between classical and relevant logic can be resolved, given that both logics capture and formalize normative and legitimate senses of logical consequence: classical logic encodes “follows from” as truth preservation and captures the truth conditions of the logical constants, while relevant logic encodes a notion of “follows from” which, apart from preserving truth, avoids (...) the violation of certain Gricean maxims and captures a different inferential role for the same logical constants, enriching their meaning pragmatically. (shrink)

The aim of this paper is to give a general solution to the paradoxes of the material conditional, including the paradoxes generated by embedded conditionals. The solution consists in a pragmatic reinterpretation of the formal languages of classical logic LK and relevant logic LR as presented in Paoli. In particular I argue that the material conditional in the classical logic LK captures the truth conditions of “if...then”, but ignores certain pragmatic enrichments that are associated to it, while relevant logic LR (...) can give a systematic diagnostic of the cases in which a conditional is pragmatically enriched and those cases in which it is not. This diagnostic shows the reason why the paradoxes seem unacceptable and why they are, nevertheless, truth-preserving. This reinterpretation will also cover the solution that Paoli gives to McGee’s paradoxes of the Modus Ponens. (shrink)

In this paper Grice's requirements for assertability are imposed on the disjunction of Classical Logic. Defining material implication in terms of negation and disjunction supplemented by assertability conditions, results in the disappearance of the most important paradoxes of material implication. The resulting consequence relation displays a very strong resemblance to Schurz's conclusion-relevant consequence relation.

In a recent paper on Truth, Knowability and Neutrality Timothy Kenyon sets out to defend the coherence of a putative anti-realist truth-predicate, superassertibility, due to Wright (1992, 1999), against a number of Wright’s critics. By his own admission, the success of Kenyon’s defensive strategies turns out to hinge upon a realist conception of absolute warrant which conflicts with the anti-realist character of the original proposal, based, as it was, on a notion of defeasible warrant. Kenyon’s potential success in resisting Wright’s (...) critics brings a pyrrhic victory: either way, realism wins. Here I argue that the link between superassertibility and defeasible warrant can be restored in a way which clarifies the consistency of the pair, provided that the notion of inference to superassertibility is properly understood in logical terms. As one might expect, the requisite notion is not classical in character. As one might not expect, the notion cannot be properly construed in intuitionist terms either. Hence, I propose an alternative logical framework which, I believe, is at least formally adequate to the representation of superassertibility on the basis of defeasible warrant. The price to be paid for rejecting the ‘third way’ proposed here in favour of either of the two more traditional logical options is precisely that indicated by Kenyon’s discussion. (shrink)

Logic has traditionally been construed as a normative discipline; it sets forth standards of correct reasoning. Explosion is a valid principle of classical logic. It states that an inconsistent set of propositions entails any proposition whatsoever. However, ordinary agents presumably do — occasionally, at least — have inconsistent belief sets. Yet it is false that such agents may, let alone ought to, believe any proposition they please. Therefore, our logic should not recognize explosion as a logical law. Call this the (...) ‘normative argument against explosion’. Arguments of this type play — implicitly or explicitly — a central role in motivating paraconsistent logics. Branden Fitelson, in a throwaway remark, has conjectured that there is no plausible ‘bridge principle’ articulating the normative link between logic and reasoning capable of supporting such arguments. This paper offers a critical evaluation of Fitelson’s conjecture, and hence of normative arguments for paraconsistency and the conceptions of logic’s normative status on which they repose. It is argued that Fitelson’s conjecture turns out to be correct: normative arguments for paraconsistency probably fail. (shrink)

There appears to be few, if any, limits on what sorts of logical connectives can be added to a given logic. One source of potential limitations is the motivating ideology associated with a logic. While extraneous to the logic, the motivating ideology is often important for the development of formal and philosophical work on that logic, as is the case with intuitionistic logic. One family of logics for which the philosophical ideology is important is the family of relevant logics. In (...) this paper, I explore the limits of what a relevant connective is, showing how some basic criteria motivated by the ideology of relevant logicians provide robust limits on potential connectives. These criteria provide some plausible necessary conditions on being a relevant connective. (shrink)

Anderson and Belnap presented indexed Fitch-style natural deduction systems for the relevant logics R, E, and T. This work was extended by Brady to cover a range of relevant logics. In this paper I present indexed tree natural deduction systems for the Anderson–Belnap–Brady systems and show how to translate proofs in one format into proofs in the other, which establishes the adequacy of the tree systems.

In Saving Truth from Paradox, Hartry Field presents and defends a theory of truth with a new conditional. In this paper, I present two criticisms of this theory, one concerning its assessments of validity and one concerning its treatment of truth-preservation claims. One way of adjusting the theory adequately responds to the truth-preservation criticism, at the cost of making the validity criticism worse. I show that in a restricted setting, Field has a way to respond to the validity criticism. I (...) close with some general considerations on the use of revision-theoretic methods in theories of truth. (shrink)

Mares and Goldblatt, 163–187, 2006) provided an alternative frame semantics for two quantified extensions of the relevant logic R. In this paper, I show how to extend the Mares-Goldblatt frames to accommodate identity. Simpler frames are provided for two zero-order logics en route to the full logic in order to clarify what is needed for identity and substitution, as opposed to quantification. I close with a comparison of this work with the Fine-Mares models for relevant logics with identity and a (...) discussion of constant and variable domains. (shrink)

In this paper, we build on earlier work by Standefer (Logic J IGPL 27(4):543–569, 2019) in investigating extensions of substructural logics, particularly relevant logics, with the machinery of justification logics. We strengthen a negative result from the earlier work showing a limitation with the canonical model method of proving completeness. We then show how to enrich the language with an additional operator for implicit commitment to circumvent these problems. We then extend the logics with axioms for D, 4, and 5, (...) which requires additional justification term operators, following the work of Pacuit (in proceedings of the fifth panhellenic logic symposium, 2005) and Rubtsova (in Grigoriev D, Harrison J (eds) Computer science—theory and applications, CSR 2006; J Logic Comput 16(5):671–684, 2006), and present the required modifications to the frame semantics. We present a simplification of the neighborhood frames from the earlier work and we close by investigating the distinctive contribution of the + operator to the logic. (shrink)

In this paper we elaborate a conception of entailment based on what we call the Ackermann principle, which explicates valid entailment through a logical connection between sentences depending on their informational content. We reconstruct Dunn’s informational semantics for entailment on the basis of Restall’s approach, with assertion and denial as two independent speech acts, by introducing the notion of a ‘position description’. We show how the machinery of position descriptions can effectively be used to define the positive and the negative (...) information carried by sentences of a given language and to present a formalized version of the Ackermann principle as an inclusion relationship between the informational contents of the conclusions and the premises of a valid entailment. Being so interpreted, the entailment relation exhibits certain properties, including the property of transitivity. Whereas properties such as Anderson and Belnap’s variable sharing property or Parry’s proscriptive principle are normally presented as imposing a relevance requirement on valid entailment, the suggested formalization of the Ackermann principle supports all of Gentzen’s structural rules, including weakening, a rule that is normally given up in sequent-style proof systems for relevance logics. In this way we propose an Ackermann-inspired explication of the nature of entailment as a relation between the informational contents of sentences. (shrink)

The is an old question over whether there is a substantial disagreement between advocates of different logics, as they simply attach different meanings to the crucial logical terminology. The purpose of this article is to revisit this old question in light a pluralism/relativism that regards the various logics as equally legitimate, in their own contexts. We thereby address the vexed notion of translation, as it occurs between mathematical theories. We articulate and defend a thesis that the notion of “same meaning” (...) is itself context-sensitive, depending on the purposes of a given conversation. (shrink)

In this paper, I use the cases of intuitionistic arithmetic with Church’s thesis, intuitionistic analysis, and smooth infinitesimal analysis to argue for a sort of pluralism or relativism about logic. The thesis is that logic is relative to a structure. There are classical structures, intuitionistic structures, and (possibly) paraconsistent structures. Each such structure is a legitimate branch of mathematics, and there does not seem to be an interesting logic that is common to all of them. One main theme of my (...) ante rem structuralism is that any coherent axiomatization describes a structure, or a class of structures. If one weakens the logic, then more axiomatizations become coherent. (shrink)

The article introduces substructural epistemic logics of belief supported by evidence. The logics combine normal modal epistemic logics with distributive substructural logics. Pieces of evidence are represented by points in substructural models and availability of evidence is modelled by a function on the point set. The main technical result is a general completeness theorem. Axiomatisations are provided by means of two-sorted Hilbert-style calculi. It is also shown that the framework presents a natural solution to the problem of logical omniscience.

Hartry Field's revised logic for the theory of truth in his new book, Saving Truth from Paradox , seeking to preserve Tarski's T-scheme, does not admit a full theory of negation. In response, Crispin Wright proposed that the negation of a proposition is the proposition saying that some proposition inconsistent with the first is true. For this to work, we have to show that this proposition is entailed by any proposition incompatible with the first, that is, that it is the (...) weakest proposition incompatible with the proposition whose negation it should be. To show that his proposal gave a full intuitionist theory of negation, Wright appealed to two principles, about incompatibility and entailment, and using them Field formulated a paradox of validity (or more precisely, of inconsistency). The medieval mathematician, theologian and logician, Thomas Bradwardine, writing in the fourteenth century, proposed a solution to the paradoxes of truth which does not require any revision of logic. The key principle behind Bradwardine's solution is a pluralist doctrine of meaning, or signification, that propositions can mean more than they explicitly say. In particular, he proposed that signification is closed under entailment. In light of this, Bradwardine revised the truth-rules, in particular, refining the T-scheme, so that a proposition is true only if everything that it signifies obtains. Thereby, he was able to show that any proposition which signifies that it itself is false, also signifies that it is true, and consequently is false and not true. I show that Bradwardine's solution is also able to deal with Field's paradox and others of a similar nature. Hence Field's logical revisions are unnecessary to save truth from paradox. (shrink)

One might poetically muse that computers have the essence both of logic and machines. Through the case of the history of Separation Logic, we explore how this assertion is more than idle poetry. Separation Logic works because it merges the software engineer’s conceptual model of a program’s manipulation of computer memory with the logical model that interprets what sentences in the logic are true, and because it has a proof theory which aids in the crucial problem of scaling the reasoning (...) task. Scalability is a central problem, and some would even say the central problem, in appli- cations of logic in computer science. Separation Logic is an interesting case because of its widespread success in verification tools. For these two senses of model—the engineering/conceptual and the logical—to merge in a genuine sense, each must maintain their norms of use from their home disciplines. When this occurs, both the logic and engineering benefit greatly. Seeking this intersection of two different senses of model provides a strategy for how computer scientists and logicians may be successful. Furthermore, the history of Separation Logic for analysing programs provides a novel case for philosophers of science of how software engineers and computer scientists develop models and the components of such models. We provide three contributions: an exploration of the extent of models merging that is necessary for success in computer science; an introduction to the technical details of Separation Logic, which can be used for reasoning about other exhaustible resources; and an introduction to the problems, process, and results of computer scientists for those outside the field. (shrink)

Logical consequence is a notion that every person who reasons must possess, at least implicitly. To give a precise and accurate characterization of this notion is the fundamental task of logic. In a similar way, the notion of effectivity is a concept that anyone with a basic training in mathematics possesses, and the most fundamental task of a theory of computability is to give a precise characterization of this notion. The problem concerning effectivity was solved in the 1930s, almost as (...) soon as it was raised, by the work of Turing, Church, and others. By contrast, the correct and precise characterization of logical consequence has been hotly contested through the two and a half thousand-year history of logic. (shrink)

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)

We introduce a logic BI in which a multiplicative (or linear) and an additive (or intuitionistic) implication live side-by-side. The propositional version of BI arises from an analysis of the proof-theoretic relationship between conjunction and implication; it can be viewed as a merging of intuitionistic logic and multiplicative intuitionistic linear logic. The naturality of BI can be seen categorically: models of propositional BI's proofs are given by bicartesian doubly closed categories, i.e., categories which freely combine the semantics of propositional intuitionistic (...) logic and propositional multiplicative intuitionistic linear logic. The predicate version of BI includes, in addition to standard additive quantifiers, multiplicative (or intensional) quantifiers ∀ new and ∃ new which arise from observing restrictions on structural rules on the level of terms as well as propositions. We discuss computational interpretations, based on sharing, at both the propositional and predicate levels. (shrink)

While there is now considerable experimental evidence that, on the one hand, participants assign to the indicative conditional as probability the conditional probability of consequent given antecedent and, on the other, they assign to the indicative conditional the “defective truth-table” in which a conditional with false antecedent is deemed neither true nor false, these findings do not in themselves establish which multi-premise inferences involving conditionals participants endorse. A natural extension of the truth-table semantics pronounces as valid numerous inference patterns that (...) do seem to be part of ordinary usage. However, coupled with something the probability account gives us—namely that when conditional-free ϕ entails conditional-free ψ, “if ϕ then ψ” is a trivial, uninformative truth—we have enough logic to derive the paradoxes of material implication. It thus becomes a matter of some urgency to determine which inference patterns involving indicative conditionals participants do endorse. Only thus will we be able to arrive at a realistic, systematic semantics for the indicative conditional. (shrink)

The validity of argument by disjunctive syllogism has been denied by proponents of relevant and paraconsistent logic. DS is stigmatised for its role in inferences — most notably C.I. Lewis's derivation of that fallacy of irrelevance ex falso quodlibet — that involve both it and other rules of inference governing disjunction, or, to speak more precisely, other rules of inference taken to apply to the very same disjunction that obeys DS. In avoiding these inferences the road less travelled is to (...) deny the identity rather than to deny DS: what follows is, then, an exercise in disjoining disjunctions. (shrink)

Three misrepresentations of informal and formal logic by two feminist writers are discussed. Andrea Nye's criticism that the semantics for formal logic abstracts from context is a misrepresentation of formal logic because Nye ignores the development of intensional logics. Second, Nye's criticism that informaIlogicians ignore the origins of arguments is a misrepresentation of fallacy theory. Prominent writers in the field specifiy numerous cases where the origins of an argument are relevant to its evaluation. Third, Valerie Plumwood's criticism that negation in (...) classical logic rests on an exclusivistic dualism that encourages the exclusion of women is shown to be false. (shrink)

Frege introduced the notion of pragmatic force as what distinguishes statements from questions. This distinction was elaborated by Wittgenstein in his later works, and systematised as an account of different kinds of speech acts in formal dialogue theory by Hamblin. It lies at the heart of the inferential semantics more recently developed by Brandom. The present paper attempts to sketch some of the relations between these developments.

There is a natural story about what logic is that sees it as tied up with two operations: a ‘throw things into a bag’ operation and a ‘closure’ operation. In a pair of recent papers, Jc Beall has fleshed out the account of logic this leaves us with in more detail. Using Beall’s exposition as a guide, this paper points out some problems with taking the second operation to be closure in the usual sense. After pointing out these problems, I (...) then turn to fixing them in a restricted case and modulo a few simplifying assumptions. In a followup paper, the simplifications and restrictions will be removed. (shrink)

This article introduces, studies, and applies a new system of logic which is called ‘HYPE’. In HYPE, formulas are evaluated at states that may exhibit truth value gaps and truth value gluts. Simple and natural semantic rules for negation and the conditional operator are formulated based on an incompatibility relation and a partial fusion operation on states. The semantics is worked out in formal and philosophical detail, and a sound and complete axiomatization is provided both for the propositional and the (...) predicate logic of the system. The propositional logic of HYPE is shown to contain first-degree entailment, to have the Finite Model Property, to be decidable, to have the Disjunction Property, and to extend intuitionistic propositional logic conservatively when intuitionistic negation is defined appropriately by HYPE’s logical connectives. Furthermore, HYPE’s first-order logic is a conservative extension of intuitionistic logic with the Constant Domain Axiom, when intuitionistic negation is again defined appropriately. The system allows for simple model constructions and intuitive Euler-Venn-like diagrams, and its logical structure matches structures well-known from ordinary mathematics, such as from optimization theory, combinatorics, and graph theory. HYPE may also be used as a general logical framework in which different systems of logic can be studied, compared, and combined. In particular, HYPE is found to relate in interesting ways to classical logic and various systems of relevance and paraconsistent logic, many-valued logic, and truthmaker semantics. On the philosophical side, if used as a logic for theories of type-free truth, HYPE is shown to address semantic paradoxes such as the Liar Paradox by extending non-classical fixed-point interpretations of truth by a conditional as well-behaved as that of intuitionistic logic. Finally, HYPE may be used as a background system for modal operators that create hyperintensional contexts, though the details of this application need to be left to follow-up work. (shrink)

The phenomenological movement begins in the Prolegomena to Husserl’s Logical Investigations as a philosophy of logic. Despite this, remarkably little attention has been paid to Husserl’s arguments in the Prolegomena in the contemporary philosophy of logic. In particular, the literature spawned by Gilbert Harman’s work on the normative status of logic is almost silent on Husserl’s contribution to this topic. I begin by raising a worry for Husserl’s conception of ‘pure logic’ similar to Harman’s challenge to explain the connection between (...) logic and reasoning. If logic is the study of the forms of all possible theories, it will include the study of many logical consequence relations; by what criteria, then, should we select one consequence relation as correct? I consider how Husserl might respond to this worry by looking to his late account of the ‘genealogy of logic’ in connection with Gurwitsch’s claim that ‘[i]t is to prepredicative perceptual experience … that one must return for a radical clarification and for the definitive justification of logic’. Drawing also on Sartre and Heidegger, I consider how prepredicative experience might constrain or guide our selection of a logical consequence relation and our understanding of connectives like implication and negation. (shrink)

There is a strong case to be made for thinking that an obscure logic, KR, is better than classical logic and better than any relevant logic. The argument for KR over relevant logics is that KR counts disjunctive syllogism valid, and this is the biggest complaint about relevant logics. The argument for KR over classical logic depends on the normativity of logic and the paradoxes of implication. The paradoxes of implication are taken by relevant logicians to justify relevant logic, but (...) considerations on the normativity of logic show that only some of the paradoxes of implication are genuine. KR avoids all the genuine paradoxes of implication, unlike classical logic. Overall, KR avoids the genuine paradoxes of implication and avoids the major objection to relevant logics. This combination of features provides strong reason to give KR a place in the conversation about the right logic. (shrink)

Reasoning about concurrent programs involves representing the information that concurrent processes manipulate disjoint portions of memory. In sophisticated applications, the division of memory between processes is not static. Through operations, processes can exchange the implied ownership of memory cells. In addition, processes can also share ownership of cells in a controlled fashion as long as they perform operations that do not interfere, e.g., they can concurrently read shared cells. Thus the traditional paradigm of distributed computing based on locations is replaced (...) by a paradigm of concurrent computing which is more tightly based on program structure. Concurrent Separation Logic with Permissions, developed by O’Hearn, Bornat et al., is able to represent sophisticated transfer of ownership and permissions between processes. We demonstrate how these ideas can be used to reason about fine-grained concurrent programs which do not employ explicit synchronization operations to control interference but cooperatively manipulate memory cells so that interference is avoided. Reasoning about such programs is challenging and appropriate logical tools are necessary to carry out the reasoning in a reliable fashion. We argue that Concurrent Separation Logic with Permissions provides such tools. We illustrate the logical techniques by presenting the proof of a concurrent garbage collector originally studied by Dijkstra et al., and extended by Lamport to handle multiple user processes. (shrink)

I introduce a novel and quite intuitive interpretation of the ternary relation that figures in the relational semantics of many relevance logics. Conceptually, my interpretation makes use only of incompatibility and parthood relations, defined over a set of states. In this way, the proposed interpretation—of the ternary relation and the conditional—extends Dunn’s and Restall’s works on negation and the Routley star operator. Therefore, the interpretation is unified, and hence not only intuitive but also parsimonious. Additionally, the interpretation provides us with (...) a cogent argument to the effect that a ternary relation is indispensable, and we cannot merely do with a binary relation. (shrink)

Restall set forth a "consecution" calculus in his "An Introduction to Substructural Logics." This is a natural deduction type sequent calculus where the structural rules play an important role. This paper looks at different ways of extending Restall's calculus. It is shown that Restall's weak soundness and completeness result with regards to a Hilbert calculus can be extended to a strong one so as to encompass what Restall calls proofs from assumptions. It is also shown how to extend the calculus (...) so as to validate the metainferential rule of reasoning by cases, as well as certain theory-dependent rules. (shrink)

The essay first makes some observations on the general interrelationship between the logical writings of Albert and Buridan. Second, it gives an account of a ‘semantic logical model’ for analyzing complex subject terms in some basic categorical propositions which is defended by Albert of Saxony, and briefly recounts Buridan's criticisms of that model. Finally, the essay maintains that the Albertian model is typically compatible with, and a further development of, what is called by a late-fourteenth century anonymous scholar ‘the English-Rule’ (...) but the ‘determinable/determinate’ grammatical model defended by Buridan is not. (shrink)

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)

Moore′s paradox came of age when John N. Williams gave us a simple paradoxical argument according to which the Moorean believer must hold false belief while believing contingent propositions. Simplicity was key; it was groundbreaking for the topic. On Williams′s account, given only the notions of inconsistency and self‐refutation, the thesis that belief distributes over conjunction, and a tiny bit of classical logic, we can derive a paradox from the Moorean propositional schemata. But, as argued here, it′s easy to overestimate (...) the significance of his argument to a proper understanding of the problem. His fundamental claim can be established in a way that shows how the paradox arises for any propositional attitude that distributes over conjunction, which gives us the opportunity to reconsider the problem we have been calling “Moore′s paradox”, and to conclude that all of the available analyses of the problem are, at best, incomplete. On this new approach, we lose a little formal simplicity vis‐à‐vis Williams′s approach, but make conceptual economy, as we gain a farther‐reaching problem than the one we have known. (shrink)

Stratified properties such as ‘happy unhappiness’, ‘ungrounded ground’, ‘fortunate misfortune’, and evidently ‘true falsity’ may generate dialetheias (true contradictions). The aim of the article is to show that if this is the case, then we will have a special, conjunctive, kind of dialetheia: a true state description of the form ‘Fa and not Fa’ (for some property F and object a), wherein the two conjuncts, separately taken, are to be held untrue. The particular focus of the article is on happy (...) unhappiness: people suffering from (or enjoying) happy unhappiness (if there is some situation or state of mind of this kind) cannot be truly said ‘happy’ or ‘unhappy’, but we can say they are both. In the first section three cases of conjunctive stratification are presented; in the second section the logic of stratified contradictions is explored. The last section focuses on eudemonistic ascriptions: stated that a is happy to be unhappy (or unhappy to be happy), should we say a is happy? unhappy? both? neither? (shrink)

This article is a preliminary presentation of conjunctive paraconsistency, the claim that there might be non-explosive true contradictions, but contradictory propositions cannot be considered separately true. In case of true ‘p and not p’, the conjuncts must be held untrue, Simplification fails. The conjunctive approach is dual to non-adjunctive conceptions of inconsistency, informed by the idea that there might be cases in which a proposition is true and its negation is true too, but the conjunction is untrue, Adjunction fails. While (...) non-adjunctivism is a well-known option, the other view is not so much studied nowadays, but it was not unknown in the tradition, and there are some positive suggestions, in recent literature, that the position is plausible and deserves to be developed. The article compares conjunctivism, non-adjunctivism and dialetheism, then focuses on some possible justifications, costs and benefits of the conjunctive view. (shrink)

The problem I address is: how are cogent inferences possible? In § 1 I distinguish three senses in which we say that one is “compelled” by an inference: automatic, seductive-rhetorical and epistemic compulsion. Cogency is epistemic compulsion: a cogent inference compels us to accept its conclusion, if we accept its premises and we aim at truth. In §§ 2–3 I argue that cogency is intelligible if we consider an inference as a compound linguistic act in which several component acts are (...) related to one another by a commitment that the premises support the conclusion. Non-automatic inferences are primarily public acts in an intersubjective context. But cogency arises in special contexts described in § 4, epistemic contexts, where the participants care for truth, i.e. are intellectually virtuous. An inference is cogent in an epistemic context if it stands up to all the objections raised in the context. In § 5 I consider three different kinds of cogent inferences. In § 6 I argue that in all three cases cogency is fallible and propose a fallibilist variety of inferentialism. In § 7 I distinguish context of utterance and contexts of evaluation. Cogency is relative to epistemic contexts of evaluation. However, validity, i.e. stable cogency, is transcontextual. (shrink)

When in classical formal logic the notions of deduction, valid inference and logical consequence are defined, causal language plays no role. The founder of western logic, Aristotle, identified ‘non-cause’, or ‘positing as cause what is not a cause’, as a logical fallacy. I argue that a systematic re-examination of Aristotle's analysis of NCF, and the related language of logical causality, in the Sophistical Refutations, Topics, Analytics and Rhetoric, helps us to understand his conception of. It reveals that Aristotle's syllogismhood is (...) non-monotonic, and thus narrower than classical validity as consisting in, or coextensive with, necessary truth-preservation. It also supports the conclusion that a syllogism is a form of relevant consequence: the premisses must be causes of the conclusion in the sense that they are not only sufficient but also necessary for the conclusion to follow. Close analysis of NCF also suggests that syllogistic relevance is not a semantic matter, but a syntactic.. (shrink)

Jc Beall has made several contributions to the theory of restricted quantification in relevant logics. This paper examines these contributions and proposes an alternative account of restricted universals. The alternative is not, however, a theory of relevant restricted universals in any real sense. It is, however, a theory of restricted universals phrased in the most plausible general quantificational theory for relevant logics—Kit Fine’s stratified semantics. The motivation both for choosing this semantic framework and for choosing the particular theory of restricted (...) quantification we use is because they are the best way of dealing with these topics from Beall’s theory-building theory picture of logic, establishing a second point of contact with Beall’s work. (shrink)

Although much technical and philosophical attention has been given to relevance logics, the notion of relevance itself is generally left at an intuitive level. It is difficult to find in the literature an explicit account of relevance in formal reasoning. In this article I offer a formal explication of the notion of relevance in deductive logic and argue that this notion has an interesting place in the study of classical logic. The main idea is that a premise is relevant to (...) an argument when it contributes to the validity of that argument. I then argue that the sequents which best embody this ideal of relevance are the so-called perfect sequents—that is, sequents which are valid but have no proper subsequents that are valid. Church’s theorem entails that there is no recursively axiomatizable proof-system that proves all and only the perfect sequents, so the project that emerges from studying perfection in classical logic is not one of finding a perfect subsystem of classical logic, but is rather a comparative study of classifying subsystems of classical logic according to how well they approximate the ideal of perfection. (shrink)

This paper shows that, for the Hertz–Gentzen Systems of 1933, extended by a classical rule T1 and using certain axioms, all derivations are analytic: every cut formula occurs as a subformula in the cut’s conclusion. Since the Stoic cut rules are instances of Gentzen’s Cut rule of 1933, from this we infer the decidability of the propositional logic of the Stoics. We infer the correctness for this logic of a “relevance criterion” and of two “balance criteria”, and hence that a (...) particular derivable sequent has no derivation that is “normal” in the sense that the first premiss of each cut is cut-free. We also infer that Cut is not admissible in the Stoic system, based on the standard Stoic axioms, the T1 rule and the instances of Cut with just two antecedent formulae in the first premiss. OPEN ACCESS. (shrink)