This short essay seeks to identify and prevent a pitfall that attends less careful inquiries into “physiosemiosis.” It is emphasized that, in order to truly establish the presence of sign-action in the non-living world, all the components of a triadic sign - including the interpretant - would have to be abiotic (that is, not dependent on a living organism). Failure to heed this necessary condition can lead one to hastily confuse a natural sign (like smoke coming from fire) for an (...) instance of abiotic semiosis. A more rigorous and reserved approach to the topic is called for. (shrink)

The proof paradox results from conflicting intuitions concerning different types of fallible evidence in a court of law. We accept fallible individual evidence but reject fallible statistical evidence even when the conditional probability that the defendant is guilty given the evidence is the same, a seeming inconsistency. This paper defends a solution to the proof paradox, building on a sensitivity account of checking and settling a question. The proposed sensitivity account of legal proof not only requires (...) sensitivity simpliciter but sensitivity of each relevant step of the proof procedure and/or sensitivity concerning all relevant alternatives. This account avoids problems that have been identified for other sensitivity views of legal proof. Moreover, it is argued that sensitivity, rather than safety, is the crucial modal condition for legal proof. It is, finally, shown that the provided account can fruitfully support very different existing views on the relationship between knowledge and legal proof. (shrink)

Curry's paradox for "if.. then.." concerns the paradoxical features of sentences of the form "If this very sentence is true, then 2+2=5". Standard inference principles lead us to the conclusion that such conditionals have true consequents: so, for example, 2+2=5 after all. There has been a lot of technical work done on formal options for blocking Curry paradoxes while only compromising a little on the various central principles of logic and meaning that are under threat. -/- Once we have a (...) sense of the technical options, though, a philosophical choice remains. When dealing with puzzles in the logic of conditionals, a natural place to turn is independently motivated semantic theories of the behaviour of "if... then...". This paper argues that the closest-worlds approach outlined in Nolan 1997 offers a philosophically satisfying reason to deny conditional proof and so block the paradoxical Curry reasoning, and can give the verdict that standard Curry conditionals are false, along with related "contraction conditionals". (shrink)

Despite recent controversies surrounding the principle that knowledge entails truth (KT), this paper aims to prove that the principle is true. It offers a proof of (KT) in the following sense. It advances a deductively valid argument for (KT), whose premises are, by most lights, obviously true. Moreover, each premise is buttressed by at least two supporting arguments. And finally, all premises and supporting arguments can be rationally accepted by people who don’t already accept (KT).

How is the burden of proof to be distributed among individuals who are involved in resolving a particular issue? Under what conditions should the burden of proof be distributed unevenly? We distinguish attitudinal from dialectical burdens and argue that these questions should be answered differently, depending on which is in play. One has an attitudinal burden with respect to some proposition when one is required to possess sufficient evidence for it. One has a dialectical burden with respect to (...) some proposition when one is required to provide supporting arguments for it as part of a deliberative process. We show that the attitudinal burden with respect to certain propositions is unevenly distributed in some deliberative contexts, but in all of these contexts, establishing the degree of support for the proposition is merely a means to some other deliberative end, such as action guidance, or persuasion. By contrast, uneven distributions of the dialectical burden regularly further the aims of deliberation, even in contexts where the quest for truth is the sole deliberative aim, rather than merely a means to some different deliberative end. We argue that our distinction between these two burdens resolves puzzles about unevenness that have been raised in the literature. (shrink)

Bilateral proof systems, which provide rules for both affirming and denying sentences, have been prominent in the development of proof-theoretic semantics for classical logic in recent years. However, such systems provide a substantial amount of freedom in the formulation of the rules, and, as a result, a number of different sets of rules have been put forward as definitive of the meanings of the classical connectives. In this paper, I argue that a single general schema for bilateral (...) class='Hi'>proof rules has a reasonable claim to inferentially articulating the core meaning of all of the classical connectives. I propose this schema in the context of a bilateral sequent calculus in which each connective is given exactly two rules: a rule for affirmation and a rule for denial. Positive and negative rules for all of the classical connectives are given by a single rule schema, harmony between these positive and negative rules is established at the schematic level by a pair of elimination theorems, and the truth-conditions for all of the classical connectives are read off at once from the schema itself. (shrink)

This paper discusses and relates two puzzles for indicative conditionals: a puzzle about indeterminacy and a puzzle about triviality. Both puzzles arise because of Ramsey's Observation, which states that the probability of a conditional is equal to the conditional probability of its consequent given its antecedent. The puzzle of indeterminacy is the problem of reconciling this fact about conditionals with the fact that they seem to lack truth values at worlds where their antecedents are false. The puzzle of (...) triviality is the problem of reconciling Ramsey's Observation with various triviality proofs which establish that Ramsey's Observation cannot hold in full generality. In the paper, I argue for a solution to the indeterminacy puzzle and then apply the resulting theory to the triviality puzzle. On the theory I defend, the truth conditions of indicative conditionals are highly context dependent and such that an indicative conditional may be indeterminate in truth value at each possible world throughout some region of logical space and yet still have a nonzero probability throughout that region. (shrink)

There is a long tradition in formal epistemology and in the psychology of reasoning to investigate indicative conditionals. In psychology, the propositional calculus was taken for granted to be the normative standard of reference. Experimental tasks, evaluation of the participants’ responses and psychological model building, were inspired by the semantics of the material conditional. Recent empirical work on indicative conditionals focuses on uncertainty. Consequently, the normative standard of reference has changed. I argue why neither logic nor standard probability theory (...) provide appropriate rationality norms for uncertain conditionals. I advocate coherence based probability logic as an appropriate framework for investigating uncertain conditionals. Detailed proofs of the probabilistic non-informativeness of a paradox of the material conditional illustrate the approach from a formal point of view. I survey selected data on human reasoning about uncertain conditionals which additionally support the plausibility of the approach from an empirical point of view. (shrink)

In this paper we give some formal examples of ideas developed by Penco in two papers on the tension inside Frege's notion of sense (see Penco 2003). The paper attempts to compose the tension between semantic and cognitive aspects of sense, through the idea of sense as proof or procedure – not as an alternative to the idea of sense as truth condition, but as complementary to it (as it happens sometimes in the old tradition of procedural semantics).

This article presents an ontological proof that God is impossible.I define an ‘impossibility’ as a condition which is inconceivable due to its a priori characteristics (e.g. a ‘square circle’). Accordingly, said conditions will not ever become conceivable, as they could in instances of a posteriori inconceivability (e.g. the notion that someone could touch a star without being burned). As the basis of this argument, I refer to an a priori observation (Primus, 2019) regarding our inability to imagine inconsistency (difference) (...) within any point of space. This observation renders the notion of absolute power to be inconceivable, a priori.I briefly discuss the moral implications of religious faith in the context of Purism: a moral rationalist paradigm. I conclude that whilst belief in God can be aesthetically expressed it should not be possessed as a material purpose, due to the illogicality of the latter category of belief and/or expression. With this article I provide conceptual delineation between harmless religious belief and expression—which, I argue, should be protected from persecution, as per any other artistic expression— and religious belief and expression which is materially harmful to society. Whilst I aim to protect religious freedom of expression on one hand, I duly aim to reduce instances of material faith in God(s) on the other. Finally, I aim to bring hope in the possibility for human salvation via technology—such that they should exist indefinitely as ‘demigods,’ defined by conditional, relative power over their environment. (shrink)

An adequate semantics for generic sentences must stake out positions across a range of contested territory in philosophy and linguistics. For this reason the study of generic sentences is a venue for investigating different frameworks for understanding human rationality as manifested in linguistic phenomena such as quantification, classification of individuals under kinds, defeasible reasoning, and intensionality. Despite the wide variety of semantic theories developed for generic sentences, to date these theories have been almost universally model-theoretic and representational. This essay outlines (...) a range of proof-theoretic analyses for characterizing generics. Particular attention is given to an expressivist proof-theory that can be traced to 1) work on logical syntax that Carnap undertook prior to his turn toward truth-conditional model theory in the late 1930s, and 2) research on sequent calculi and natural deduction systems that originate in work from Gentzen and Prawitz.11 This essay offers a more precise exposition of some of the material discussed in the first two chapters of my dissertation (Stovall Citation2015a). These ideas developed in the context of a working group on non-monotonic logic run by Robert Brandom, and they were subsequently clarified through the work of Nissim Francez (particularly Francez Citation2015). I am indebted to many people for feedback and criticism on this essay, though I am sure none among them would agree with everything I say and do here. I would particularly like to thank Brandom, Francez, Ulf Hlobil, Daniel Kaplan, Jared Millson, Bernhard Nickel, Jaroslav Peregrin, Jeffry Pelletier, Thomas Ricketts, Mark Risjord, Shawn Standefer, and two reviewers for this journal. Work on this essay was supported by the joint Lead-Agency research grant between the Austrian Science Foundation (FWF) and the Czech Science Foundation (GAČR), Inferentialism and Collective Intentionality, GF17-33808L. It was substantially revised prior to its final submission. (shrink)

A novel argument is offered against the following popular condition on inferential knowledge: a person inferentially knows a conclusion only if they know each of the claims from which they essentially inferred that conclusion. The epistemology of conditional proof reveals that we sometimes come to know conditionals by inferring them from assumptions rather than beliefs. Since knowledge requires belief, cases of knowing via conditional proof refute the popular knowledge from knowledge condition. It also suggests more radical (...) cases against the condition and it brings to light the under-recognized category of inferential basic knowledge. (shrink)

I prove that the Boolean Prime Ideal Theorem is equivalent, under some weak set-theoretic assumptions, to what I will call the Cut-for-Formulas to Cut-for-Sets Theorem: for a set F and a binary relation |- on Power(F), if |- is finitary, monotonic, and satisfies cut for formulas, then it also satisfies cut for sets. I deduce the CF/CS Theorem from the Ultrafilter Theorem twice; each proof uses a different order-theoretic variant of the Tukey- Teichmüller Lemma. I then discuss relationships between (...) various cut-conditions in the absence of finitariness or of monotonicity. (shrink)

In some recent works, Crupi and Iacona have outlined an analysis of ‘if’ based on Chrysippus’ idea that a conditional holds whenever the negation of its consequent is incompatible with its antecedent. This paper presents a sound and complete system of conditional logic that accommodates their analysis. The soundness and completeness proofs that will be provided rely on a general method elaborated by Raidl, which applies to a wide range of systems of conditional logic.

In this paper, I develop a quasi-transcendental argument to justify Kant’s infamous claim “man is evil by nature.” The cornerstone of my reconstruction lies in drawing a systematic distinction between the seemingly identical concepts of “evil disposition” (böseGesinnung) and “propensity to evil” (Hang zumBösen). The former, I argue, Kant reserves to describe the fundamental moral outlook of a single individual; the latter, the moral orientation of the whole species. Moreover, the appellative “evil” ranges over two different types of moral failure: (...) while an “evil disposition” is a failure to realize the good (i.e., to adopt the motive of duty as limiting condition for all one’s desires), an “evil propensity” is a failure to realize the highest good (i.e., to engage in the collective project of transforming the legal order into an ethical community). This correlation between units of moral analysis and types of obligation suggests a way to offer a deduction of the universal propensity on behalf of Kant. It consists in tracing the source of radical evil to the same subjective necessity that gives rise to the doctrine of the highest good. For, at the basis of Kant’s two doctrines lies the same natural dialectic between happiness and morality. While the highest good brings about the critically acceptable resolution of this dialectic, the propensity to evil perpetuates and aggravates it. Instead of connecting happiness and morality in an objective relation, the human will subordinatesmorality to the pursuit of happiness according to the subjective order of association. If this reading is correct, it would explain why prior attempts at a transcendental deduction have failed: interpreters have looked for the key to the deduction in the body of Kant’s text, where it is not to be found, for it is tucked, instead, in the Preface to the first edition. (shrink)

The chapter is devoted to the probability and acceptability of indicative conditionals. Focusing on three influential theses, the Equation, Adams’ thesis, and the qualitative version of Adams’ thesis, Sikorski argues that none of them is well supported by the available empirical evidence. In the most controversial case of the Equation, the results of many studies which support it are, at least to some degree, undermined by some recent experimental findings. Sikorski discusses the Ramsey Test, and Lewis’s triviality proof, with (...) special attention dedicated to the popular ways of blocking it. Sikorski concludes that the role of the three theses in future studies of conditionals should be re-thought, and he presents alternative proposals. (shrink)

Our aim is to provide a sequent calculus whose external consequence relation coincides with the three-valued paracomplete logic `of nonsense' introduced by Dmitry Bochvar and, independently, presented as the weak Kleene logic K3W by Stephen C. Kleene. The main features of this calculus are (i) that it is non-reflexive, i.e., Identity is not included as an explicit rule (although a restricted form of it with premises is derivable); (ii) that it includes rules where no variable-inclusion conditions are attached; and (iii) (...) that it is hybrid, insofar as it includes both left and right operational introduction as well as elimination rules. (shrink)

Tsui and Weymark (Economic Theory, 1997) have shown that the only continuous social welfare orderings on the whole Euclidean space which satisfy the weak Pareto principle and are invariant to individual-specific similarity transformations of utilities are strongly dictatorial. Their proof relies on functional equation arguments which are quite complex. This note provides a simpler proof of their theorem.

Brogaard and Salerno (2005, Nous, 39, 123–139) have argued that antirealism resting on a counterfactual analysis of truth is flawed because it commits a conditional fallacy by entailing the absurdity that there is necessarily an epistemic agent. Brogaard and Salerno's argument relies on a formal proof built upon the criticism of two parallel proofs given by Plantinga (1982, "Proceedings and Addresses of the American Philosophical Association", 56, 47–70) and Rea (2000, "Nous," 34, 291–301). If this argument were conclusive, (...) antirealism resting on a counterfactual analysis of truth should probably be abandoned. I argue however that the antirealist is not committed to a controversial reading of counterfactuals presupposed in Brogaard and Salerno's proof, and that the antirealist can in principle adopt an alternative reading that makes this proof invalid. My conclusion is that no reductio of antirealism resting on a counterfactual analysis of truth has yet been provided. (shrink)

A new proof style adequate for modal logics is defined from the polynomial ring calculus. The new semantics not only expresses truth conditions of modal formulas by means of polynomials, but also permits to perform deductions through polynomial handling. This paper also investigates relationships among the PRC here defined, the algebraic semantics for modal logics, equational logics, the Dijkstra???Scholten equational-proof style, and rewriting systems. The method proposed is throughly exemplified for S 5, and can be easily extended to (...) other modal logics. (shrink)

The “four-color” theorem seems to be generalizable as follows. The four-letter alphabet is sufficient to encode unambiguously any set of well-orderings including a geographical map or the “map” of any logic and thus that of all logics or the DNA plan of any alive being. Then the corresponding maximally generalizing conjecture would state: anything in the universe or mind can be encoded unambiguously by four letters. That admits to be formulated as a “four-letter theorem”, and thus one can search for (...) a properly mathematical proof of the statement. It would imply the “four colour theorem”, the proof of which many philosophers and mathematicians believe not to be entirely satisfactory for it is not a “human proof”, but intermediated by computers unavoidably since the necessary calculations exceed the human capabilities fundamentally. It is furthermore rather unsatisfactory because it consists in enumerating and proving all cases one by one. Sometimes, a more general theorem turns out to be much easier for proving including a general “human” method, and the particular and too difficult for proving theorem to be implied as a corollary in certain simple conditions. The same approach will be followed as to the four colour theorem, i.e. to be deduced more or less trivially from the “four-letter theorem” if the latter is proved. References are only classical and thus very well-known papers: their complete bibliographic description is omitted. (shrink)

The Yang-Mills mass gap problem has stood as one of the most profound unresolved questions in theoretical physics for nearly half a century. Despite extensive efforts, a rigorous mathematical proof of the mass gap's existence in Yang-Mills theory has remained elusive—until now. -/- The proof presented in this work represents not merely a technical achievement, but a fundamental paradigm shift in our understanding of the mathematical structures underlying physical reality. By rigorously demonstrating that the mass gap arises as (...) a direct consequence of the gauge-invariant constraint structure of Yang-Mills theory, we overturn decades of conventional assumptions and reveal a startling truth: what we perceive as physical laws are in fact mathematically unavoidable necessities emerging from the very consistency conditions required for a well-defined quantum field theory. (shrink)

The aim of this essay is twofold. First, it outlines the concept of ontological frame. Secondly, two models are distinguished on this structure. The first one is connected to Kant’s concept of possible object and the second one relates to Leibniz’s. Leibniz maintains that the source of possibility is the mere logical consistency of the notions involved, so that possibility coincides with analytical possibility. Kant, instead, argues that consistency is only a necessary component of possibility. According to Kant, something is (...) possible if there is a cause capable of bringing it into existence; to this end consistency alone is not sufficient. Thus, while the Leibnizian notion of consistency is at the root of the concept of analytical possibility, the Kantian notion of possibility is the source of real possibility. This difference plays an important role in the discussion of Gödel’s ontological proof, which can be formally interpreted on the ontological frame of the pure perfections. While this proof, under some emendation condition, is conclusive in the context of Leibniz’s ontological model, it is not so within the Kantian one. This issue will be the subject of the second part of the present essay. (shrink)

According to the analysis of concessive conditionals suggested by Crupi and Iacona, a concessive conditional $$p{{\,\mathrm{\hookrightarrow }\,}}q$$ p ↪ q is adequately formalized as a conjunction of conditionals. This paper presents a sound and complete axiomatic system for concessive conditionals so understood. The soundness and completeness proofs that will be provided rely on a method that has been employed by Raidl, Iacona, and Crupi to prove the soundness and completeness of an analogous system for evidential conditionals.

Working in academia is challenging, even more so for those with limited resources and opportunities. Researchers around the world do not have equal working conditions. The paper presents the structure, operation method, and conceptual framework of the SM3D Portal's community coaching method, which is built to help Early Career Researchers (ECRs) and researchers in low-resource settings overcome the obstacle of inequality and start their career progress. The community coaching method is envisioned by three science philosophies (cost-effectiveness, transparency spirit, and proactive (...) attitude) and established and operated based on the Serendipity-Mindsponge-3D knowledge (SM3D) management framework (i.e., mindsponge thinking and Bayesian Mindsponge Framework analytics serve as the coaching program's foundational theory and analytical tools). The coaching method also embraces Open Science's values for lowering the cost of doing science and encouraging the trainees to be transparent, which is expected to facilitate the self-correcting mechanism of science through open data, open review, and open dialogue. Throughout the training process, members are central beneficiaries by gaining research knowledge and skills, acquiring publication as the training's product, and shifting their mindsets from “I can't do it” to “I can do it,” and at the same time transforming a mentee to be ready for a future mentor's role. The coaching method is thus one of the members, for the member, by the members. -/- • The paper provides the structure, operation method, and conceptual framework of the SM3D Portal's community coaching method, which is built to help Early Career Researchers (ECRs) and researchers in low-resource settings overcome the obstacle of inequality and start their career progress. • The paper presents three major science philosophies envisioning the establishment and operation of scholarly community coaching. • The paper employs the mindsponge theory and BMF analytics to construct a conceptual framework explaining how an environment is created to help shift members’ mindsets from “I can't do it” to “I can do it.”. (shrink)

It is a striking fact from reverse mathematics that almost all theorems of countable and countably representable mathematics are equivalent to just five subsystems of second order arithmetic. The standard view is that the significance of these equivalences lies in the set existence principles that are necessary and sufficient to prove those theorems. In this article I analyse the role of set existence principles in reverse mathematics, and argue that they are best understood as closure conditions on the powerset of (...) the natural numbers. (shrink)

Retributive theories of punishment argue that punishing a criminal for a crime she committed is sufficient reason for a justified and morally permissible punishment. But what about when the state gets lucky in its decision to punish? I argue that retributive theories of punishment are subject to “Gettier” style cases from epistemology. Such cases demonstrate that the state needs more than to just get lucky, and as these retributive theories of punishment stand, there is no anti-luck condition. I’ll argue that (...) Gettier-style cases demonstrate an impermissible instance of punishment, even though they meet the conditions of retributive theories of punishment. Retributive theories are, therefore, too weak. The safety condition from epistemology provides the anti-luck condition needed for permissible punishment. I argue that two forms of retributivism, rights-forfeiture and what I call standard retributivism, are both subject to Gettier-style cases. Unlike the literature on standards of proof, this paper argues that safety is a condition on punishment itself, i.e., in all nearby possible worlds, the accuser must correctly accuse the convicted for the crime they actually committed. (shrink)

Hegel's Science of Logic makes the just not low claim to be an absolute, ultimate-grounded knowledge. This project, which could not be more ambitious, has no good press in our post-metaphysical age. However: That absolute knowledge absolutely cannot exist, cannot be claimed without self-contradiction. On the other hand, there can be no doubt about the fundamental finiteness of knowledge. But can absolute knowledge be finite knowledge? This leads to the problem of a self-explication of logic (in the sense of Hegel) (...) and further, as will be shown, to a new definition of the dialectical procedure. The stringency of which results from the fact that always exactly that implicit content is explicated that was generated by the preceding explication step itself and is thus concretely comprehensible. At the same time, a new implicit content is generated by this act of explication, which requires a new explication step, and so forth. In the dialectical procedure reinterpreted in this way, dialectical arguments are not beheld, guessed at or even surreptitiously obtained, but are methodically accountable. Thereby dialectics is understood as a self-explication of logic by logical means and thus as a proof of the possibility of ultimate-grounding in the form of absolute and nevertheless finite – and thus also fallible – knowledge. (shrink)

Gödel's incompleteness theorems establish the stunning result that mathematics cannot be fully formalized and, further, that any formal system containing a modicum of number or set theory cannot establish its own consistency. Wilfried Sieg and Clinton Field, in their paper Automated Search for Gödel's Proofs, presented automated proofs of Gödel's theorems at an abstract axiomatic level; they used an appropriate expansion of the strategic considerations that guide the search of the automated theorem prover AProS. The representability conditions that allow the (...) syntactic notions of the metalanguage to be represented inside the object language were taken as axioms in the automated proofs. The concrete task I am taking on in this project is to extend the search by formally verifying these conditions. Using a formal metatheory defined in the language of binary trees, the syntactic objects of the metatheory lend themselves naturally to a direct encoding in Zermelo's theory of sets. The metatheoretic notions can then be inductively defined and shown to be representable in the object-theory using appropriate inductive arguments. Formal verification of the representability conditions is the first step towards an automated proof thereof which, in turn, brings the automated verification of Gödel's theorems one step closer to completion. (shrink)

This chapter investigates the precise ways in which Antonio Gramsci engaged with ancient philosophy. A brief examination of the longest discussion in the Prison Notebooks of any ancient philosopher or text, Plato’s Republic (Q8, §22), raises many questions about Gramsci’s approach to ancient philosophy. These questions motivate an investigation into Gramsci’s surprisingly minimal discussion of ancient philosophy and philosophers, which is best explained in the light of his theoretical commitments to his distinctive species of historical materialism. Rather than responding to (...) specific critical insights advanced about politics or human nature by ancient philosophers, such as Plato and Aristotle, Gramsci is shown to appropriate ancient philosophy into a broad-spectrum project of the history of philosophy, which interrogates the specific conditions under which historical epochs and the philosophical ideas that characterise them emerge. Tracking the conditions and characteristic ideas is revealed to be the project of the ‘specialist philosopher’, who must grasp both general methodological principles and particular historical examples. Gramsci’s treatment of ancient philosophy reveals more about his universal theories of history, and his engagement with the ideas of his contemporaries (including Benedetto Croce), than a special concern with ancient philosophy itself. (shrink)

This paper explores the relationship between propositional existence and the ontological status of fictional entities. It questions whether a proposition asserting the existence of fictional entities can truly exist. Through the analysis of the logical structure of existential propositions and their truth conditions, we explore whether a proposition like "Unicorns exist" can be meaningful within a strict logical framework. By integrating Quine’s theory of ontological commitment and Russell’s theory of descriptions, we argue that the existence of a proposition does not (...) necessarily entail the existence of its subject but instead its coherence within a logical system. We also present a thought experiment to illustrate the implications of fictional entities within classical logic and examine whether introducing a third truth value — "undefined" or "unknown" — challenges the law of excluded middle. (shrink)

Chains of causes appear when the existence of God is discussed. It is claimed by some that these chains must be finite and terminated by God. But these chains seem endless through our knowledge search. This endlessness for the physical reasons for any world event expresses the greatness and complexity of God’s creation and so the transcendence of God. So, only we can put our hands on physical reasons in an endless forage for knowledge. Yet, the endlessness of the physical (...) causes chains confirms the existence of God, and this is what our paper tries using Zorn’s lemma, an equivalent for one of the most celebrated axioms of mathematics, the Axiom of Choice. (shrink)

A consequence relation is strongly classical if it has all the theorems and entailments of classical logic as well as the usual meta-rules (such as Conditional Proof). A consequence relation is weakly classical if it has all the theorems and entailments of classical logic but lacks the usual meta-rules. The most familiar example of a weakly classical consequence relation comes from a simple supervaluational approach to modelling vague language. This approach is formally equivalent to an account of logical (...) consequence according to which α1, ..., αn entails β just in case □α1, ..., □αn entails □β in the modal logic S5. This raises a natural question: If we start with a different underlying modal logic, can we generate a strongly classical logic? This paper explores this question. In particular, it discusses four related technical issues: (1) Which base modal logics generate strongly classical logics and which generate weakly classical logics? (2) Which base logics generate themselves? (3) How can we directly characterize the logic generated from a given base logic? (4) Given a logic that can be generated, which base logics generate it? The answers to these questions have philosophical interest. They can help us to determine whether there is a plausible supervaluational approach to modelling vague language that yields the usual meta-rules. They can also help us to determine the feasibility of other philosophical projects that rely on an analogous formalism, such as the project of defining logical consequence in terms of the preservation of an epistemic status. (shrink)

Many classically valid meta-inferences fail in a standard supervaluationist framework. This allegedly prevents supervaluationism from offering an account of good deductive reasoning. We provide a proof system for supervaluationist logic which includes supervaluationistically acceptable versions of the classical meta-inferences. The proof system emerges naturally by thinking of truth as licensing assertion, falsity as licensing negative assertion and lack of truth-value as licensing rejection and weak assertion. Moreover, the proof system respects well-known criteria for the admissibility of inference (...) rules. Thus, supervaluationists can provide an account of good deductive reasoning. Our proof system moreover brings to light how one can revise the standard supervaluationist framework to make room for higher-order vagueness. We prove that the resulting logic is sound and complete with respect to the consequence relation that preserves truth in a model of the non-normal modal logic _NT_. Finally, we extend our approach to a first-order setting and show that supervaluationism can treat vagueness in the same way at every order. The failure of conditional proof and other meta-inferences is a crucial ingredient in this treatment and hence should be embraced, not lamented. (shrink)

In the literature on supervaluationism, a central source of concern has been the acceptability, or otherwise, of its alleged logical revisionism. I attack the presupposition of this debate: arguing that when properly construed, there is no sense in which supervaluational consequence is revisionary. I provide new considerations supporting the claim that the supervaluational consequence should be characterized in a ‘global’ way. But pace Williamson (1994) and Keefe (2000), I argue that supervaluationism does not give rise to counterexamples to familiar inference-patterns (...) such as reductio and conditional proof. (shrink)

PARC is an "appended numeral" system of natural deduction that I learned as an undergraduate and have taught for many years. Despite its considerable pedagogical strengths, PARC appears to have never been published. The system features explicit "tracking" of premises and assumptions throughout a derivation, the collapsing of indirect proofs into conditional proofs, and a very simple set of quantificational rules without the long list of exceptions that bedevil students learning existential instantiation and universal generalization. The system can be (...) used with any Copi-style set of inference rules, so it is quite adaptable to many mainstream symbolic logic textbooks. Consequently, PARC may be especially attractive to logic teachers who find Jaskowski/Gentzen-style introduction/elimination rules to be far less "natural" than Copi-style rules. The PARC system is also keyboard-friendly in comparison to the widely adopted Jaskowski-style graphical subproof system of natural deduction, viz., Fitch diagrams and Copi "bent arrow" diagrams. (shrink)

It is well known that the probabilistic relation of confirmation is not transitive in that even if E confirms H1 and H1 confirms H2, E may not confirm H2. In this paper we distinguish four senses of confirmation and examine additional conditions under which confirmation in different senses becomes transitive. We conduct this examination both in the general case where H1 confirms H2 and in the special case where H1 also logically entails H2. Based on these analyses, we argue that (...) the Screening-Off Condition is the most important condition for transitivity in confirmation because of its generality and ease of application. We illustrate our point with the example of Moore’s “proof” of the existence of a material world, where H1 logically entails H2, the Screening-Off Condition holds, and confirmation in all four senses turns out to be transitive. (shrink)

A Mathematical Review by John Corcoran, SUNY/Buffalo -/- Macbeth, Danielle Diagrammatic reasoning in Frege's Begriffsschrift. Synthese 186 (2012), no. 1, 289–314. ABSTRACT This review begins with two quotations from the paper: its abstract and the first paragraph of the conclusion. The point of the quotations is to make clear by the “give-them-enough-rope” strategy how murky, incompetent, and badly written the paper is. I know I am asking a lot, but I have to ask you to read the quoted passages—aloud if (...) possible. Don’t miss the silly attempt to recycle Kant’s quip “Concepts without intuitions are empty; intuitions without concepts are blind”. What the paper was aiming at includes the absurdity: “Proofs without definitions are empty; definitions without proofs are, if not blind, then dumb.” But the author even bollixed this. The editor didn’t even notice. The copy-editor missed it. And the author’s proof-reading did not catch it. In order not to torment you I will quote the sentence as it appears: “In a slogan: proofs without definitions are empty, merely the aimless manipulation of signs according to rules; and definitions without proofs are, if no blind, then dumb.”[sic] The rest of my review discusses the paper’s astounding misattribution to contemporary logicians of the information-theoretic approach. This approach was cruelly trashed by Quine in his 1970 Philosophy of Logic, and thereafter ignored by every text I know of. The paper under review attributes generally to modern philosophers and logicians views that were never espoused by any of the prominent logicians—such as Hilbert, Gödel, Tarski, Church, and Quine—apparently in an attempt to distance them from Frege: the focus of the article. On page 310 we find the following paragraph. “In our logics it is assumed that inference potential is given by truth-conditions. Hence, we think, deduction can be nothing more than a matter of making explicit information that is already contained in one’s premises. If the deduction is valid then the information contained in the conclusion must be contained already in the premises; if that information is not contained already in the premises […], then the argument cannot be valid.” Although the paper is meticulous in citing supporting literature for less questionable points, no references are given for this. In fact, the view that deduction is the making explicit of information that is only implicit in premises has not been espoused by any standard symbolic logic books. It has only recently been articulated by a small number of philosophical logicians from a younger generation, for example, in the prize-winning essay by J. Sagüillo, Methodological practice and complementary concepts of logical consequence: Tarski’s model-theoretic consequence and Corcoran’s information-theoretic consequence, History and Philosophy of Logic, 30 (2009), pp. 21–48. The paper omits definitions of key terms including ‘ampliative’, ‘explicatory’, ‘inference potential’, ‘truth-condition’, and ‘information’. The definition of prime number on page 292 is as follows: “To say that a number is prime is to say that it is not divisible without remainder by another number”. This would make one be the only prime number. The paper being reviewed had the benefit of two anonymous referees who contributed “very helpful comments on an earlier draft”. Could these anonymous referees have read the paper? -/- J. Corcoran, U of Buffalo, SUNY -/- PS By the way, if anyone has a paper that has been turned down by other journals, any journal that would publish something like this might be worth trying. (shrink)

Ian Rumfitt (2000) developed a bilateralist account of logic in which the meaning of the connectives is given by conditions on asserted and rejected sentences. An additional set of inference rules, the coordination principles, determines the interaction of assertion and rejection. Fernando Ferreira (2008) found this account defective, as Rumfitt must state the coordination principles for arbitrary complex sentences. Rumfitt (2008) has a reply, but we argue that the problem runs deeper than he acknowledges and is in fact related to (...) the challenge of establishing proof-theoretic harmony. We motivate a distinctively bilateral criterion for harmony and show how the bilateralist can meet it. This also resolves Ferreira's complaint. (shrink)

Inquiry into the meaning of logical terms in natural language (‘and’, ‘or’, ‘not’, ‘if’) has generally proceeded along two dimensions. On the one hand, semantic theories aim to predict native speaker intuitions about the natural language sentences involving those logical terms. On the other hand, logical theories explore the formal properties of the translations of those terms into formal languages. Sometimes, these two lines of inquiry appear to be in tension: for instance, our best logical investigation into conditional connectives (...) may show that there is no conditional operator that has all the properties native speaker intuitions suggest if has. Indicative conditionals have famously been the source of one such tension, ever since the triviality proofs of both Lewis (1976) and Gibbard (1981) established conclusions which are in prima facie tension with ordinary judgments about natural language indicative conditionals. In a recent series of papers, Branden Fitelson has strengthened both triviality results (Fitelson 2013, 2015, 2016), revealing a common culprit: a logical schema known as IMPORT-EXPORT. Fitelson’s results focus the tension between the logical results and ordinary judgments, since IMPORT-EXPORT seems to be supported by intuitions about natural language. In this paper, we argue that the intuitions which have been taken to support IMPORT-EXPORT are really evidence for a closely related, but subtly different, principle. We show that the two principles are independent by showing how, given a standard assumption about the conditional operator in the formal language in which IMPORT-EXPORT is stated, many existing theories of indicative conditionals validate one, but not the other. Moreover, we argue that once we clearly distinguish these principles, we can use propositional anaphora to show that IMPORT-EXPORT is in fact not valid for natural language indicative conditionals (given this assumption about the formal conditional operator). This gives us a principled and independently motivated way of rejecting a crucial premise in many triviality results, while still making sense of the speaker intuitions which appeared to motivate that premise. We suggest that this strategy has broad application and an important lesson: in theorizing about the logic of natural language, we must pay careful attention to the translation between the formal languages in which logical results are typically proved, and natural languages which are the subject matter of semantic theory. (shrink)

Proof by refutation of a geometry theorem that is not universally true produces a Gröbner basis whose elements, called side polynomials, may be used to give inequations that can be added to the hypotheses to give a valid theorem. We show that (in a certain sense) all possible subsidiary conditions are implied by those obtained from the basis; that what we call the kind of truth of the theorem may be derived from the basis; and that the side polynomials (...) may be classified in a useful way. We analyse the relationship between side polynomials and kinds of truth, and we give a unified algorithmic treatment of side polynomials, with examples generated by an implementation. (shrink)

It is shown that one common formulation of Stalnaker's semantics for conditionals is incomplete: it has no sound and (strongly) complete proof system. At first, this seems to conflict with well-known completeness results for this semantics (e.g., Stalnaker and Thomason 1967; Stalnaker 1970 and Lewis 1973, ch. 6). As it turns out, it does not: these completeness results rely on another closely-related formulation of the semantics that is provably complete. Specifically, the difference comes down to how the Limit Assumption (...) is stated. I close with some remarks about what this means for the logic of conditionals. (shrink)

The debate over Hypothetical Syllogism is locked in stalemate. Although putative natural language counterexamples to Hypothetical Syllogism abound, many philosophers defend Hypothetical Syllogism, arguing that the alleged counterexamples involve an illicit shift in context. The proper lesson to draw from the putative counterexamples, they argue, is that natural language conditionals are context-sensitive conditionals which obey Hypothetical Syllogism. In order to make progress on the issue, I consider and improve upon Morreau’s proof of the invalidity of Hypothetical Syllogism. The improved (...) proof relies upon the semantic claim that conditionals with antecedents irrelevant to the obtaining of an already true consequent are themselves true. Moreover, this semantic insight allows us to provide compelling counterexamples to Hypothetical Syllogism that are resistant to the usual contextualist response. (shrink)

We present a formal mechanical analysis using sweeping net methods to approximate surfacing singularities of saddle maps. By constructing densified sweeping subnets for individual vertices and integrating them, we create a comprehensive approximation of singularities. This approach utilizes geometric concepts, analytical methods, and theorems that demonstrate the robustness and stability of the nets under perturbations. Through detailed proofs and visualizations, we provide a new perspective on singularities and their approximations in analytic geometry.

We provide a direct method for proving Craig interpolation for a range of modal and intuitionistic logics, including those containing a "converse" modality. We demonstrate this method for classical tense logic, its extensions with path axioms, and for bi-intuitionistic logic. These logics do not have straightforward formalisations in the traditional Gentzen-style sequent calculus, but have all been shown to have cut-free nested sequent calculi. The proof of the interpolation theorem uses these calculi and is purely syntactic, without resorting to (...) embeddings, semantic arguments, or interpreted connectives external to the underlying logical language. A novel feature of our proof includes an orthogonality condition for defining duality between interpolants. (shrink)

The widely discussed "discursive dilemma" shows that majority voting in a group of individuals on logically connected propositions may produce irrational collective judgments. We generalize majority voting by considering quota rules, which accept each proposition if and only if the number of individuals accepting it exceeds a given threshold, where different thresholds may be used for different propositions. After characterizing quota rules, we prove necessary and sufficient conditions on the required thresholds for various collective rationality requirements. We also consider sequential (...) quota rules, which ensure collective rationality by adjudicating propositions sequentially and letting earlier judgments constrain later ones. Sequential rules may be path-dependent and strategically manipulable. We characterize path-independence and prove its essential equivalence to strategy-proofness. Our results shed light on the rationality of simple-, super-, and sub-majoritarian decision-making. (shrink)

This paper articulates and defends a conception of logical form as semantic form revealed by a compositional meaning theory. On this conception, the logical form of a sentence is determined by the semantic types of its primitive terms and their mode of combination as it relates to determining under what conditions it is true. We develop this idea in the framework of truth-theoretic semantics. We argue that the semantic form of a declarative sentence in a language L is revealed by (...) a (canonical) proof of its T- sentence in an interpretive truth theory for L. We give a precise characterization of sameness of logical form between any two declarative sentences in any two languages in terms of the notion of corresponding proofs in interpretive truth theories for the languages. We illustrate the utility of this approach with a number of examples. We then extend the characterization to non-declaratives in a generalization of truth-theoretic semantics that appeals to fulfillment conditions, of which truth conditions are one variety. On this approach, logical forms are not reified, and the notion of sameness of logical form is treated as conceptually basic. We discuss the relation of this conception of logical form to the project of identifying logical constants, reviewing two approaches, one of which takes topic neutrality as central, the other recursion. We argue that the project of identifying logical constants for the purposes of classifying together valid arguments is largely independent of that identifying logical form of sentences, and urge an ecumenical approach to extending talk of logical constants beyond where it is currently well-grounded. (shrink)

In “Proof-Theoretic Justification of Logic”, building on work by Dummett and Prawitz, I show how to construct use-based meaning-theories for the logical constants. The assertability-conditional meaning-theory takes the meaning of the logical constants to be given by their introduction rules; the consequence-conditional meaning-theory takes the meaning of the logical constants to be given by their elimination rules. I then consider the question: given a set of introduction rules \, what are the strongest elimination rules that are validated (...) by an assertability conditional meaning-theory based on \? I prove that the intuitionistic introduction rules are the strongest rules that are validated by the intuitionistic elimination rules. I then prove that intuitionistic logic is the strongest logic that can be given either an assertability-conditional or consequence-conditional meaning-theory. In “Grounding Grounding” I discuss the notion of grounding. My discussion revolves around the problem of iterated grounding-claims. Suppose that \ grounds \; what grounds that \ grounds that \? I argue that unless we can get a satisfactory answer to this question the notion of grounding will be useless. I discuss and reject some proposed accounts of iterated grounding claims. I then develop a new way of expressing grounding, propose an account of iterated grounding-claims and show how we can develop logics for grounding. In “Is the Vagueness Argument Valid?” I argue that the Vagueness Argument in favor of unrestricted composition isn’t valid. However, if the premisses of the argument are true and the conclusion false, mereological facts fail to supervene on non-mereological facts. I argue that this failure of supervenience is an artifact of the interplay between the necessity and determinacy operators and that it does not mean that mereological facts fail to depend on non-mereological facts. I sketch a deflationary view of ontology to establish this. (shrink)

The depth-bounded approach seeks to provide realistic models of reasoners. Recognizing that most useful logics are idealizations in that they are either undecidable or likely to be intractable, the approach accounts for how they can be approximated in practice by resource-bounded agents. The approach has been applied to Classical Propositional Logic (CPL), yielding a hierarchy of tractable depth-bounded approximations to that logic, which in turn has been based on a KE/KI system. -/- This Thesis shows that the approach can be (...) naturally extended to useful nonclassical logics such as First-Degree Entailment (FDE), the Logic of Paradox (LP), Strong Kleene Logic (K3 ) and Intuitionistic Propositional Logic (IPL). To do this, we introduce a KE/KI-style system for each of those logics such that: is formulated via signed formulae, consist of linear operational rules and branching structural rule(s), can be used as a direct-proof and a refutation method, and is interesting independently of the approach in that it has an exponential speed-up on its tableau system counterpart. The latter given that we introduce a new class of examples which we prove to be hard for all tableau systems sharing the V/& rules with the classical one, but easy for their analogous KE-style systems. Then we focus on showing that each of our KE/KI-style systems naturally yields a hierarchy of tractable depth-bounded approximations to the respective logic, in terms of the maximum number of allowed nested applications of the branching rule(s). The rule(s) express(es) a generalized rule of bivalence, is (are) essentially cut rule(s) and govern(s) the manipulation of virtual information, which is information that an agent does not hold but she temporarily assumes as if she held it. Intuitively, the more virtual information needs to be invoked via the branching rule(s), the harder the inference is for the agent. So, the nested application the branching rule(s) provides a sensible measure of inferential depth. We also show that each hierarchy approximating FDE, LP, and K3 , admits of a 5-valued non-deterministic semantics; whereas, paving the way for a semantical characterization of the hierarchy approximating IPL, we provide a 3-valued non-deterministic semantics for the full logic that fixes the meaning of the connectives without appealing to “structural” conditions. -/- Moreover, we show a super-polynomial lower bound for the strongest possible version of clausal tableaux on the well-known class of “truly fat” expressions (which are easy for KE), settling a problem left open in the literature. Further, we investigate a hierarchy of tractable depth-bounded approximations to CPL based only on KE. Finally, we propose a refinement of the p-simulation relation which is adequate to establish positive results about the superiority of a system over another with respect to proof-search. (shrink)

The problem analysed in this paper is whether we can gain knowledge by using valid inferences, and how we can explain this process from a model-theoretic perspective. According to the paradox of inference (Cohen & Nagel 1936/1998, 173), it is logically impossible for an inference to be both valid and its conclusion to possess novelty with respect to the premises. I argue in this paper that valid inference has an epistemic significance, i.e., it can be used by an agent to (...) enlarge his knowledge, and this significance can be accounted in model-theoretic terms. I will argue first that the paradox is based on an equivocation, namely, it arises because logical containment, i.e., logical implication, is identified with epistemological containment, i.e., the knowledge of the premises entails the knowledge of the conclusion. Second, I will argue that a truth-conditional theory of meaning has the necessary resources to explain the epistemic significance of valid inferences. I will explain this epistemic significance starting from Carnap’s semantic theory of meaning and Tarski’s notion of satisfaction. In this way I will counter (Prawitz 2012b)’s claim that a truth-conditional theory of meaning is not able to account the legitimacy of valid inferences, i.e., their epistemic significance. (shrink)