Relativism offers a nifty way of accommodating most of our intuitions about epistemic modals, predicates of personal taste, color expressions, future contingents, and conditionals. But in spite of its manifest merits relativism is squarely at odds with epistemic value monism: the view that truth is the highest epistemic goal. I will call the argument from relativism to epistemic value pluralism the trivial argument for epistemic value pluralism. After formulating the argument, I will look at three possible ways to refute (...) it. I will then argue that two of these are unsuccessful, and defend the third, which involves denying that there are any genuinely relative truths. (shrink)

I present two Triviality results for Kratzer's standard “restrictor” analysis of indicative conditionals. I both refine and undermine the common claim that problems of Triviality do not arise for Kratzer conditionals since they are not strictly conditionals at all.

A pervasive and influential argument appeals to trivial truths to demonstrate that the aim of inquiry is not the acquisition of truth. But the argument fails, for it neglects to distinguish between the complexity of the sentence used to express a truth and the complexity of the truth expressed by a sentence.

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)

I defend a new account of constitutive essence on which an entity’s constitutively essential properties are its most fundamental, nontrivial necessary properties. I argue that this account accommodates the Finean counterexamples to classic modalism about essence, provides an independently plausible account of constitutive essence, and does not run into clear counterexamples. I conclude that this theory provides a promising way forward for attempts to produce an adequate nonprimitivist, modalist account of essence. As both triviality and fundamentality in the account are (...) understood in terms of grounding, the theory also potentially has important implications for the relation between essence and grounding. (shrink)

Presentism is typically characterised as the thesis that everything is present, and therefore there are no dinosaurs or Martian presidential inaugurations. Putting aside the vexed question of exactly what it is to be present in this context, this thesis seems quite straightforward. However, a number of authors—such as Merricks, Lombard, Meyer, Tallant and Sakon —have argued that Presentism so characterised is either trivially true or false even by Presentist lights. This is the so-called Triviality Argument against Presentism. In this paper (...) I show that three of the four premises of the Triviality Argument are plausibly false. I conclude that Presentists have nothing to fear from the Triviality Argument. (shrink)

Conditional probability is often used to represent the probability of the conditional. However, triviality results suggest that the thesis that the probability of the conditional always equals conditional probability leads to untenable conclusions. In this paper, I offer an interpretation of this thesis in a possible worlds framework, arguing that the triviality results make assumptions at odds with the use of conditional probability. I argue that these assumptions come from a theory called the operator theory and that the rival restrictor (...) theory can avoid these problematic assumptions. In doing so, I argue that recent extensions of the triviality arguments to restrictor conditionals fail, making assumptions which are only justified on the operator theory. (shrink)

This paper investigates the link between informational consequence and credence. I first suggest a natural constraint, namely that informational consequence should preserve certainty: on any rational credence distribution, when the premises of an informational inferences have credence 1, the conclusion also has credence 1. Then I show that the certainty‐preserving constraint leads to triviality. In particular, the following three claims are incompatible: (i) informational consequence is extensionally distinct from classical consequence; (ii) informational inferences preserve certainty; (iii) credences obey (a subset (...) of) classical Bayesian constraints. The proof is straightforward, but the theoretical implications are substantial. Informational theorists need to either give up the idea that credence applies to epistemic discourse, or develop a nonclassical theory of credence and credal update. Moreover, the result also suggests that there is a connection between informational consequence and triviality results, including classical triviality results like Lewis's. (shrink)

“Triviality arguments” against functionalism in the philosophy of mind hold that the claim that some complex physical system exhibits a given functional organization is either trivial or has much less content than is usually supposed. I survey several earlier arguments of this kind, and present a new one that overcomes some limitations in the earlier arguments. Resisting triviality arguments is possible, but requires functionalists to revise popular views about the “autonomy” of functional description.

I here present and defend what I call the Triviality Theory of Truth, to be understood in analogy with Matti Eklund’s Inconsistency Theory of Truth. A specific formulation of is defended and compared with alternatives found in the literature. A number of objections against the proposed notion of meaning-constitutivity are discussed and held inconclusive. The main focus, however, is on the problem, discussed at length by Gupta and Belnap, that speakers do not accept epistemically neutral conclusions of Curry derivations. I (...) first argue that the facts about speakers’ reactions to such Curry derivations do not constitute a problem for the Triviality Theory specifically. Rather, they follow from independent, uncontroversial facts. I then propose a solution which coheres with the theory as I understand it. Finally, I consider a normative reading of their objection and offer a response. (shrink)

The thesis that probabilities of conditionals are conditional probabilities has putatively been refuted many times by so-called ‘triviality results’, although it has also enjoyed a number of resurrections. In this paper I assault it yet again with a new such result. I begin by motivating the thesis and discussing some of the philosophical ramifications of its fluctuating fortunes. I will canvas various reasons, old and new, why the thesis seems plausible, and why we should care about its fate. I will (...) look at some objections to Lewis’s famous triviality results, and thus some reasons for the pursuit of further triviality results. I will generalize Lewis’s results in ways that meet the objections. I will conclude with some reflections on the demise of the thesis—or otherwise. (shrink)

Opponents of the computational theory of mind have held that the theory is devoid of explanatory content, since whatever computational procedures are said to account for our cognitive attributes will also be realized by a host of other ‘deviant’ physical systems, such as buckets of water and possibly even stones. Such ‘triviality’ claims rely on a simple mapping account of physical implementation. Hence defenders of CTM traditionally attempt to block the trivialization critique by advocating additional constraints on the implementation relation. (...) However, instead of attempting to ‘save’ CTM by constraining the account of physical implementation, I argue that the general form of the triviality argument is invalid. I provide a counterexample scenario, and show that SMA is in fact consistent with empirically rich and theoretically plausible versions of CTM. This move requires rejection of the computational sufficiency thesis, which I argue is scientifically unjustified in any case. By shifting the ‘burden of explanatory force’ away from the concept of physical implementation, and instead placing it on salient aspects of the target phenomenon to be explained, it’s possible to retain a maximally liberal and unfettered view of physical implementation, and at the same time defuse the triviality arguments that have motivated defenders of CTM to impose various theory-laden constraints on SMA. (shrink)

This paper challenges defenders/advocates of the semantic-completeness route towards gluts to explain, in simple and plausible terms, why the ‘trivializer paradox’, framed in terms of closure relatives on theories, fails to undermine their argument.

In this paper we explain that the paraconsistent logic LP promoted by Graham Priest can only be supported by trivial dialetheists, i.e., those who believe that all sentences are dialetheias.

In recent years, a number of theorists have claimed that beliefs about probability are transparent. To believe probably p is simply to have a high credence that p. In this paper, I prove a variety of triviality results for theses like the above. I show that such claims are inconsistent with the thesis that probabilistic modal sentences have propositions or sets of worlds as their meaning. Then I consider the extent to which a dynamic semantics for probabilistic modals can capture (...) theses connecting belief, certainty, credence, and probability. I show that although a dynamic semantics for probabilistic modals does allow one to validate such theses, it can only do so at a cost. I prove that such theses can only be valid if probabilistic modals do not satisfy the axioms of the probability calculus. (shrink)

After indicating why this is needed, the paper proves a non-triviality result for paraconsistent theory containing arithmetic, naive truth and denotation predicates, and descriptions. The result is obtained by dualising a construction of Kroon. Its most notable feature is that there is a trivial object- one that has every property.

A triviality result for what Lewis called “the Desire by Necessity Thesis” and Broome : 265–267, 1991) called “the Desire as Expectation Thesis” is presented. The result shows that this thesis and three other reasonable conditions can be jointly satisfied only in trivial cases. Some meta-ethical implications of the result are discussed. The discussion also highlights several issues regarding Lewis ’ original triviality result for “the Desire as Belief Thesis” that have not been properly understood in the literature.

We study the theory of the structure induced by parameter free formulas on a “dense” algebraically independent subset of a model of a geometric theory T. We show that while being a trivial geometric theory, inherits most of the model theoretic complexity of T related to stability, simplicity, rosiness, the NIP and the NTP2. In particular, we show that T is strongly minimal, supersimple of SU‐rank 1, has the NIP or the NTP2 exactly when has these properties. We show (...) that if T is superrosy of thorn rank 1, then so is, and that the converse holds if T satisfies acl = dcl. (shrink)

Suppose that people in the affluent countries can easily save the lives of the starving needy in poor countries. Then, three points seem to follow. First, it is wrong for these people not to make the easy rescue . Second, it is wrong to stop making the easy rescue even if they have made many rescues already . Third, if we accept the first two points, the demands of morality are super-extreme. That is, people have to keep making trivial (...) sacrifices until there is no more trivial sacrifices to make . Here, predictably, our commonsense will resist the third point. However, I argue in this paper that, since the first two points are harder to refute, we have to accept the third point anyway. (shrink)

This paper clarifies the relationship between the Triviality Results for the conditional and the Restrictor Theory of the conditional. On the understanding of Triviality proposed here, it is implausible—pace many proponents of the Restrictor Theory—that Triviality rests on a syntactic error. As argued here, Triviality arises from simply mistaking the feature a claim has when that claim is logically unacceptable for the feature a claim has when that claim is unsatisfiable. Triviality rests on a semantic confusion—one which some semantic theories, (...) but not others, are prone to making. On the interpretation proposed here, Triviality Results thus play a theoretically constructive role in the project of natural language semantics. (shrink)

According to Stalnaker’s Thesis, the probability of a conditional is the conditional probability. Under some mild conditions, the thesis trivialises probabilities and conditionals, as initially shown by David Lewis. This article asks the following question: does still lead to triviality, if the probability function in is replaced by a probability-like function? The article considers plausibility functions, in the sense of Friedman and Halpern, which additionally mimic probabilistic additivity and conditionalisation. These quasi probabilities comprise Friedman–Halpern’s conditional plausibility spaces, as well as (...) other known representations of conditional doxastic states. The paper proves Lewis’ triviality for quasi probabilities and discusses how this has implications for three other prominent strategies to avoid Lewis’ triviality: Adams’ thesis, where the probability function on the left in is replaced by a probability-like function, abandoning conditionalisation, where probability conditionalisation on the right in is replaced by another propositional update procedure and the approximation thesis, where equality in is replaced by approximation. The paper also shows that Lewis’ triviality result is really about ‘additiveness’ and ‘conditionality’. (shrink)

I argue that Gold & Stoljar's “trivial neuron doctrine” is not in fact trivial. Many familiar positions in the philosophy of mind run afoul of it, and it is unclear that even those whom Gold & Stoljar identify as adherents of the trivial neuron doctrine can be comfortably described as such.

We give several characterizations of Schnorr trivial sets, including a new lowness notion for Schnorr triviality based on truth-table reducibility. These characterizations allow us to see not only that some natural classes of sets, including maximal sets, are composed entirely of Schnorr trivials, but also that the Schnorr trivial sets form an ideal in the truth-table degrees but not the weak truth-table degrees. This answers a question of Downey, Griffiths and LaForte.

I formulate a counterfactual version of the notorious ‘Ramsey Test’. Whereas the Ramsey Test for indicative conditionals links credence in indicatives to conditional credences, the counterfactual version links credence in counterfactuals to expected conditional chance. I outline two forms: a Ramsey Identity on which the probability of the conditional should be identical to the corresponding conditional probability/expectation of chance; and a Ramsey Bound on which credence in the conditional should never exceed the latter. Even in the weaker, bound, form, the (...) counterfactual Ramsey Test makes counterfactuals subject to the very argument that Lewis used to argue against the indicative version of the Ramsey Test. I compare the assumptions needed to run each, pointing to assumptions about the time‐evolution of chances that can replace the appeal to Bayesian assumptions about credence update in motivating the assumptions of the argument. I finish by outlining two reactions to the discussion: to indicativize the debate on counterfactuals; or to counterfactualize the debate on indicatives. (shrink)

I. Non-Trivial Counterpossibles On Lewis’ account, a subjunctive of the form ‘if it were the case that p, it would be the case that q’ (represented as ‘p → q’) is to be given the following rough meta-linguistic truth-conditions1.

On an influential line of thinking tracing back to Ramsey, conditionals are closely linked to the attitude of supposition. When applied to counterfactuals, this view suggests a subjunctive version of the so-called Ramsey test: the probability of a counterfactual If A, would B ought to be equivalent to the probability of B, under the subjunctive supposition that A. I present a collapse result for any view that endorses the subjunctive version of the Ramsey test. Starting from plausible assumptions, the result (...) shows that one’s rational credence in a would-counterfactual and in the corresponding might-counterfactual have to be identical. (shrink)

According to physicalism, everything is physical, namely there are no entities (or no more restricted sorts of entities) that are not physical. In this paper, I shall examine the truth of this thesis by presenting a triviality objection against physicalism that is somehow similar to the one advanced against presentism. Firstly, I shall distinguish between two different definitions of the physical (roughly, every entity is physical-1 iff it has some feature F, such as impenetrability or exact spatio-temporal location, while every (...) entity is physical-2 iff it is accepted by some ideal, true and complete physical theory) and between unrestricted and restricted versions of physicalism (according to the former ones, physicalism is true for every entity while, according to the latter ones, it is true only with regard to some restricted domain of entities). Secondly, I shall argue that physicalists have to deal with six different problems: the triviality of some versions of physicalism, the content-indeterminacy of the physical and the justification of the “faith” according to which we will formulate some ideal, true and complete physical theory (given the definition of the physical-2), the restricted domain problem (so that restricted versions of physicalism seem not to exclude the existence of seemingly non-physical entities), the (possible and plausible) incompatibility between the two different definitions of the physical, the extension of the physical investigation problem. (shrink)

This paper uses the framework of Popper and Miller's work on axiom systems for conditional probabilities to explore Adams' thesis concerning the probabilities of conditionals. It is shown that even very weak axiom systems have only a very restricted set of models satisfying a natural generalisation of Adams' thesis, thereby casting severe doubt on the possibility of developing a non-Boolean semantics for conditionals consistent with it.

The origin of Paraconsistent Logic is closely related with the argument that from the assertion of two mutually contradictory statements any other statement can be deduced, which can be referred to as ex contradict!one sequitur quodlibet (ECSQ). Despite its medieval origin, only in the 1930s did it become the main reason for the unfeasibility of having contradictions in a deductive system. The purpose of this paper is to study what happened before: from Principia Mathematica to that time, when it became (...) well established. The main historical claims that I am going to advance are the following: the first explicit use of ECSQ as the main argument for supporting the necessity of excluding any contradiction from deductive systems is to be found in the first edition (1928) of the book Grundzüge der theoretischen Logik by Hilbert and Ackermann. At the end, I will suggest that the aim of the 20th century usage of ECSQ was to change from the centuries long philosophical discussion about contradictions to a more "technical" one. But with Paraconsistent Logic viewed as a technical solution to this restriction, the philosophical problem revives, but now with an improved understanding of it at one's disposal. (shrink)

The strongest possible Lewisian triviality result for the indicative conditional is proven.

We study the connection between Schnorr triviality and genericity. We show that while no 2-generic is Turing equivalent to a Schnorr trivial and no 1-generic is tt-equivalent to a Schnorr trivial, there is a 1-generic that is Turing equivalent to a Schnorr trivial. However, every such 1-generic must be high. As a corollary, we prove that not all K-trivials are Schnorr trivial. We also use these techniques to extend a previous result and show that the bases (...) of cones of Schnorr trivial Turing degrees are precisely those whose jumps are at least 0". (shrink)

I formulate a counterfactual version of the notorious 'Ramsey Test'. Whereas the Ramsey Test for indicative conditionals links credence in indicatives to conditional credences, the counterfactual version links credence in counterfactuals to expected conditional chance. I outline two forms: a Ramsey Identity on which the probability of the conditional should be identical to the corresponding conditional probabihty/expectation of chance; and a Ramsey Bound on which credence in the conditional should never exceed the latter.Even in the weaker, bound, form, the counterfactual (...) Ramsey Test makes counterfactuals subject to the very argument that Lewis used to argue against the indicative version of the Ramsey Test. I compare the assumptions needed to run each, pointing to assumptions about the time-evolution of chances that can replace the appeal to Bayesian assumptions about credence update in motivating the assumptions of the argument.I finish by outlining two reactions to the discussion: to indicativize the debate on counterfactuals; or to counterfactualize the debate on indicatives. (shrink)

We show that any relational generic structure whose theory has finite closure and amalgamation over closed sets is stable CM-trivial with weak elimination of imaginaries.

We show that any relational generic structure whose theory has finite closure and amalgamation over closed sets is stable CM-trivial with weak elimination of imaginaries.

Let T be the theory of dense cyclically ordered sets with at least two elements. We determine the classifying space of $\mathsf {Mod}(T)$ to be homotopically equivalent to $\mathbb {CP}^\infty $. In particular, $\pi _2(\lvert \mathsf {Mod}(T)\rvert )=\mathbb {Z}$, which answers a question in our previous work. The computation is based on Connes’ cycle category $\Lambda $.

Continuing work of Baldwin and Shi 1), we study non-ω-saturated generic structures of the ab initio Hrushovski construction with amalgamation over closed sets. We show that they are CM-trivial with weak elimination of imaginaries. Our main tool is a new characterization of non-forking in these theories.

We define a generalized version of CM-triviality, and show that in the presence of enough regular types, or solubility, a stable CM-trivial group is nilpotent-by-finite. A torsion-free small CM-trivial stable group is abelian and connected. The first result makes use of a generalized version of the analysis of bad groups.

Many philosophers believe there to be a fundamental difference between the present and past and future times, but they tend to disagree amongst themselves about what this difference is. Some think that the present is singled out by consciousness, while others believe that it marks the position to which the flow of time has advanced. According to presentism, the current moment is ontologically privileged: nothing exists that is not present. My aim in this chapter is to argue that this particular (...) attempt at distinguishing the present from other times is unsuccessful. (shrink)

The purpose of this paper is to reassess some mathematical examples in Plato’s dialogues which at a first glance may appear to be nothing more than trivial puzzles. In order to provide the necessary background for this analysis, I shall begin by sketching a brief overview of Plato’s mathematical passages and discuss the criteria for aptly selecting them. Second, I shall explain what I mean by ‘mathematical examples,’ and reflect on their function in light of the discussion on παραδείγματα (...) outlined in theSophistand theStatesman. Against this framework, I shall move to a close examination of specific examples drawn from theTheaetetus(154c–55d), theRepublic(523c–24d), and thePhaedo(96d–97b, 100e–101d). By placing these examples in the broader context of pre-Euclidean mathematics, I shall show that their mathematical content is often less elementary than might appear at first sight. Moreover, by placing emphasis on the specific philosophical concerns that motivated their introduction, I shall argue that the examples are not merely nonsensical jokes. Even if their illustrative purpose is not always immediately clear, and even if they can sound playful and bizarre, they in fact fulfil an important function: by virtue of their power to generate wonder or confusion, they serve as exercises and act as a trigger with respect to the difficult philosophical issues they are intended to clarify. (shrink)

As it stands, Frege’s semantic theory does not provide sufficient general keys for interpreting assertible sentences at different levels of complexity, such as (a) counterfactual-modal-intensional sentences and (b) extensional sentences. It is possible to devise that general key by adding non-classical parameters such as possible worlds, which allow sentences with a high degree of non-extensional complexity to occupy a trivial place in Tarski’s hierarchy as T-scheme-eligible substitutes. The paper argues that finding these non-false (if true) conditions under which complex (...) propositions can be trivially treated as eligible T-scheme substitutes is not trivial. It is a challenge that requires several consistency improvements to deal with various competing extensions of the predicate “true”. We will conclude that Frege-Tarski’s semantic conception (enriched by non- classical presuppositions), misrepresents that challenge. It distorts the problem we face in daily practice to strengthen our assertion systems, plan successful assertion strategies, and protect our assertions from semantic value reversals. The true challenge for us is pragmatic and cannot confuse (1) complicated scientific and empirical conditions of assertiveness with (2) the rewardable scoring-conditions under which one learns to use sentences in his native language. (shrink)

Suppose that you're certain that a certain sentence, e.g. "Frida is tall", lacks a determinate truth value. What cognitive attitude should you take towards it—reject it, suspend judgment, or what else? We show that, by adopting a seemingly plausible principle connecting credence in A and Determinately A, we can prove a very implausible answer to this question: i.e., all indeterminate claims should be assigned credence zero. The result is striking similar to so-called triviality results in the literature on modals and (...) conditionals. (shrink)

In this paper I argue that there are some sentences whose truth makes no demands on the world, being trivially true in that their truth-conditions are trivially met. I argue that this does not amount to their truth-conditions being met necessarily: we need a non-modal understanding of the notion of the demands the truth of a sentence makes, lest we be blinded to certain conceptual possibilities. I defend the claim that the truths of pure mathematics and set theory are trivially (...) true, and hence accepting their truth brings no ontological commitment; I further defend the claim that the truths of applied mathematics and set theory do not demand the existence of numbers or sets. While the notion of a demand must not be reduced to anything modal, I nonetheless argue that sentences that are trivially true must also be necessary, lest we violate a very weak version of the principle that truth depends on the world. I further argue that all necessary truths are trivially true, lest we admit unexplained necessities. I end by showing one important consequence of this: I argue that if there are truthmakers for intrinsic predications, they must be states of affairs rather than tropes. (shrink)