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)

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)

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.

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)

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

The purpose of this note is to formulate some weaker versions of the so called Ramsey test that do not entail the following unacceptable consequenceIf A and C are already accepted in K, then if A, then C is also accepted in K. and to show that these versions still lead to the same triviality result when combined with a preservation criterion.

David Lewis introduced a new kind of reductio ad absurdum style of argument: while the claims, suitably formalized, do not lead to outright contradiction, he showed they are tenable only in trivial ways. Lewis proved what are known as triviality results against the claims. The claims are "Probabilities of conditionals are conditional probabilities." "Desires are beliefs about what is good." The author argues that the tenuous connections between the claims go considerably further still: the claims give rise to (...) debates that display a remarkably parallel structure. He brings out their many similarities to illuminate both of them, and to point the way to some promising avenues for future research. He displays structural similarities between the fluctuating fortunes of Stalnaker's Thesis, and those of Desire‐as‐Belief. Lewis concludes telegraphically by saying that Desire by Necessity is "a form of anti‐Humeanism, sure enough, but not the right form of anti‐Humeanism"; and that's it. (shrink)

In a recent pair of publications, Richard Bradley has offered two novel no-go theorems involving the principle of Preservation for conditionals, which guarantees that one’s prior conditional beliefs will exhibit a certain degree of inertia in the face of a change in one’s non-conditional beliefs. We first note that Bradley’s original discussions of these results—in which he finds motivation for rejecting Preservation, first in a principle of Commutativity, then in a doxastic analogue of the rule of modus ponens —are (...) problematic in a significant number of respects. We then turn to a recent U-turn on his part, in which he winds up rescinding his commitment to modus ponens, on the grounds of a tension with the rule of Import-Export for conditionals. Here we offer an important positive contribution to the literature, settling the following crucial question that Bradley leaves unanswered: assuming that one gives up on full-blown modus ponens on the grounds of its incompatibility with Import-Export, what weakened version of the principle should one be settling for instead? Our discussion of the issue turns out to unearth an interesting connection between epistemic undermining and the apparent failures of modus ponens in McGee’s famous counterexamples. (shrink)

Several studies suggest that pain is a trigger for challenging behaviour in older adults with cognitive impairment. However, such measured relationships might be confounded due to item overlap as instruments share similar or identical items. The purpose of this study was to examine whether the frequently observed association between pain and challenging behaviour might be traced back to item overlap. This multicentre cross‐sectional study was conducted in 13 nursing homes and examined pain (measure: Pain Assessment in Advanced Dementia Scale) and (...) challenging behaviour (measure: Cohen‐Mansfield Agitation Inventory) in 150 residents with severe cognitive impairment. The extent of item overlap was determined by juxtaposition of both measures’ original items. As expected, comparison between these instruments revealed an extensive item overlap. The statistical relationship between the two phenomena can be traced back mainly to the contribution of the overlapping items, which renders the frequently stated relationship between pain and challenging behaviour trivial. The status quo of measuring such associations must be contested: constructs’ discrimination and instruments’ discrimination have to be discussed critically as item overlap may lead to biased conclusions and assumptions in research as well as to inadequate care measures in nursing practice. (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)

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)

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.

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)

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)

PCCP is the much discussed claim that the probability of a conditional A → B is conditional probability. Triviality results purport to show that PCCP – as a general claim – is false. A particularly interesting proof has been presented in (Hájek, 2011), who shows that – even if a probability distribution P initially satisfied PCCP – a rational update can produce a non-PCCP probability distribution. We argue that the notion of rational update in this argumentation is construed (...) in much too broad a way. In order to make the argumentation precise, we discuss the general rules for modeling conditionals in probability spaces and present formalized version(s) of PCCP and of minimal assumptions concerning the appropriate spaces. Using the introduced apparatus we give a detailed analysis of Hájek’s (2011) triviality proof and show that it is based on an application of revision rules which allow one to construct probability distributions violating not only PCCP, but also fundamental properties of conditionals. This means that they do not really provide arguments against PCCP, properly formalized. We also discuss a Dutch Book argument which shows that the updated belief system is not coherent. This gives an additional, strong argument against accepting the update rules. We also discuss the Converse Dutch Book theorem and argue, that even if the produced probability measure seems to violate it, it cannot serve as the counterexample, as it is not an appropriate model for conditionals. Ultimately, we show that important arguments against PCCP fail. (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.

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)

It is often claimed that credences are not reducible to ordinary beliefs about probabilities. Such a reduction appears to be decisively ruled out by certain sorts of triviality results–analogous to those often discussed in the literature on conditionals. I show why these results do not, in fact, rule out the view. They merely give us a constraint on what such a reduction could look like. In particular they show that there is no single proposition belief in which (...) suffices for having a particular credence, regardless of one’s evidence. But if we allow such propositions to vary with evidence–as we should–then the results do not rule out a reduction. So, at least on this count, credences might very well just be beliefs about probabilities. (shrink)

ABSTRACT A trivalent theory of indicative conditionals automatically enforces Stalnaker's thesis – the equation between probabilities of conditionals and conditional probabilities. This result holds because the trivalent semantics requires, for principled reasons, a modification of the ratio definition of conditional probability in order to accommodate the possibility of undefinedness. I explain how this modification is motivated and how it allows the trivalent semantics to avoid a number of well-known triviality results, in the process clarifying why these results (...) hold for many bivalent theories. In short, the slew of triviality results published in the last 40-odd years need not be viewed as an argument against Stalnaker's thesis: it can be construed instead as an argument for abandoning the bivalent requirement that indicative conditionals somehow be assigned a truth-value in worlds in which their antecedents are false. (shrink)

This paper outlines a non-reductive counterfactual account of grounding along interventionist lines, and uses the account to argue that taking grounding seriously requires ascribing non-trivial truth-conditions to a range of counterpossible counterfactuals. This result allows for a diagnosis of a route to scepticism about grounding, as deriving at least in part from scepticism about non-trivial counterpossible truth and falsity.

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)

The paper generalizes Van McGee's well-known result that there are many maximal consistent sets of instances of Tarski's schema to a number of non-classical theories of truth. It is shown that if a non-classical theory rejects some classically valid principle in order to avoid the truth-theoretic paradoxes, then there will be many maximal non-trivial sets of instances of that principle that the non-classical theorist could in principle endorse. On the basis of this it is argued that the idea of classical (...) recapture, which plays such an important role for non-classical logicians, can only be pushed so far. (shrink)

CM-triviality of a stable theory is a notion introduced by Hrushovski [1]. The importance of this property is first that it holds of Hrushovski's new non 1-based strongly minimal sets, and second that it is still quite a restrictive property, and forbids the existence of definable fields or simple groups (see [2]). In [5], Frank Wagner posed some questions aboutCM-triviality, asking in particular whether a structure of finite rank, which is “coordinatized” byCM-trivial types of rank 1, is itselfCM-trivial. (...) (Actually Wagner worked in a slightly more general context, adapting the definitions to a certain “local” framework, in which algebraic closure is replaced byP-closure, forPsome family of types. We will, however, remain in the standard context, and will just remark here that it is routine to translate our results into Wagner's framework, as well as to generalise to the superstable theory/regular type context.) In any case we answer Wagner's question positively. Also in an attempt to put forward some concrete conjectures about the possible geometries of strongly minimal sets (or stable theories) we tentatively suggest a hierarchy of geometric properties of forking, the first two levels of which correspond to 1-basedness andCM-triviality respectively. We do not know whether this is a strict hierarchy (or even whether these are the “right” notions), but we conjecture that it is, and moreover that a counterexample to Cherlin's conjecture can be found at level three in the hierarchy. (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 (...) class='Hi'>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)

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)

In the present paper I analyse the modularity thesis and, more specifically, the thesis of domain-specificity of processing. I argue that this thesis is not trivial only under the assumption of a variety of processes which differ from each other at the implementation level; otherwise, the variety of cognitive processes can only be explained as emergent on the basic mechanism of associative activation in that it operates on domain-specific representations, which is something that no one would deny. But that assumption (...) is untenable: there are no other processes than associative activation (and inhibition) at the implementation level. Any claim to the contrary is the result of a conceptual confusion between two senses of “associative”: a behavioural one, relative to which there are cognitive processes that exceed the ability to code elementary spatio-temporal contingencies, and one that lies instead at the implementation level. Since the assumption of a plurality of processes at the implementation level is untenable, the only viable interpretation of modularism (as far as domain-specificity is concerned) is a trivial one. By this I do not mean that the thesis is devoid of any content. However, its content is scarcely debatable, and far less thrilling than the debate has suggested so far. (shrink)

We present a way of classifying the logically possible ways out of Gärdenfors' inconsistency or triviality result on belief revision with conditionals. For one of these ways—conditionals which are not descriptive but which only have an inferential role as being given by the Ramsey test—we determine which of the assumptions in three different versions of Gärdenfors' theorem turn out to be false. This is done by constructing ranked models in which such Ramsey-test conditionals are evaluated and which are subject (...) to natural postulates on belief revision and acceptability sets for conditionals. Along the way we show that in contrast with what Gärdenfors himself proposed, there is no dichotomy of the form: either the Ramsey test has to be given up or the Preservation condition. Instead, both of them follow from our postulates. (shrink)

Your replica is created on Mars and you, on Earth, are destroyed. Parfit claims that your replica may still have what prudentially matters for you – provided that you are psychologically connected and continuous with your replica. If someone accidentally destroys the tapes containing your psychological profile used in the production of your replica and this same action fortuitously produces a functionally equivalent tape, Ehring claims that Parfit should maintain that the resulting new individual may still have what matters. Nihilism (...) about what matters follows, or so Ehring claims. I argue that Ehring is wrong and that the difference between the two ways of creating a replica is not trivial – there is no trivial survival. (shrink)

A possible way out to Kripke’s Puzzle About Belief could start from the rejection of the notion of epistemic transparency. Epistemic transparency seems, indeed, irremediably incompatible with an externalist conception of mental content. However, Brandom’s inferentialism could be considered a version of externalism that allows, at least in some cases, to save the principle of transparency. Appealing to a normative account of the content of our beliefs, from the inferentialist’s standpoint, it is possible to state that a content is transparent (...) when name-components of that content are a priori associated with some application conditions and, at the same time, reflection alone provides an a priori access to those application conditions, with no need of any empirical investigation. Nevertheless, such requirements are only met in trivial cases. The aim of this paper is to argue that some application conditions of that sort, albeit trivial, can be ontologically ampliative. As a result, the related contents can be regarded as transparent in a substantial and rich way. (shrink)

"Making Sense of Nonsense: Trivial Remarks on the Nature of Language" is an inquiry into the nature and significance of nonsense for philosophers and other human beings. Philosophers have been accused of indulging in nonsense. Wittgenstein complains that philosophers take language on holiday. If an utterance is nonsense in virtue of being on holiday, we might expect meaningful utterances to be meaningful in virtue of their being at work, at home. When we look at language at home, we find that, (...) despite the tribute philosophers of language ordinarily pay to the a priori, meaning is a most contingent and subjective family of phenomena. On the rough ground of everyday discourse, we find language stamped with the desires and agendas of certain groups of mammals. Language shows us its rough edges when we clear away the unarticulated presuppositions smuggled in by dominant philosophical methodology. There are a number of strategies for attaining an unclouded vantage point on language. One is to imagine oneself into the position of someone to whom our language and way of life is unfamiliar. Another is to actually occupy a point of view from which the language and way of life we take for granted begins to seem strange. ;The theory of meaning that emerges from the kind of attention to language here described can be stated thus: meaning is grounded in concernful engagement with the world. Or, to put it another way: we talk about what we care about. As a result, language can serve as a deep reserve of human history. What it tells us about ourselves is not always pleasant. As the language reveals the concerns and agendas of speakers, it reveals the imbalances and abuses of power among those speakers. Insofar as language constructs the worlds we inhabit, the injustices and prejudices we find in language are mirror images of reality as we know it. The good news is the liberatory potential of our realization of the extent to which meaning, and hence reality, are "man-made." This potential is realized in the work of many radical lesbian feminist philosophers. (shrink)

Recent work in formal semantics suggests that the language system includes not only a structure building device, as standardly assumed, but also a natural deductive system which can determine when expressions have trivial truth-conditions (e.g., are logically true/false) and mark them as unacceptable. This hypothesis, called the `logicality of language', accounts for many acceptability patterns, including systematic restrictions on the distribution of quantifiers. To deal with apparent counter-examples consisting of acceptable tautologies and contradictions, the logicality of language is often paired (...) with an additional assumption according to which logical forms are radically underspecified: i.e., the language system can see functional terms but is `blind' to open class terms to the extent that different tokens of the same term are treated as if independent. This conception of logical form has profound implications: it suggests an extreme version of the modularity of language, and can only be paired with non-classical---indeed quite exotic---kinds of deductive systems. The aim of this paper is to show that we can pair the logicality of language with a different and ultimately more traditional account of logical form. This framework accounts for the basic acceptability patterns which motivated the logicality of language, can explain why some tautologies and contradictions are acceptable, and makes better predictions in key cases. As a result, we can pursue versions of the logicality of language in frameworks compatible with the view that the language system is not radically modular vis-a-vis its open class terms and employs a deductive system that is basically classical. (shrink)

Suppose you’re certain that a claim—say, ‘Frida is tall’—does not have a determinate truth value. What attitude should you take towards it? This is the question of the cognitive role of indeterminacy. This paper presents a puzzle for theories of cognitive role. Many of these theories vindicate a seemingly plausible principle: if you are fully certain that A, you are rationally required to be fully certain that A is determinate. Call this principle ‘Certainty’. We show that Certainty, in combination with (...) some minimal side premises, entails a very implausible claim: whenever you’re certain that it’s indeterminate whether A, it is rationally required that you reject A. This is a surprising result, which requires abandoning at least some intuitive views about indeterminacy and cognitive role. (shrink)

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.

The Adams Thesis holds for a conditional → and a probability assignment P if and only if P=P whenever P>0. The restriction ensures that P is well defined by the classical formula P=P/P. Drawing on deep results of Maharam on measure algebras, it is shown that, notwithstanding well-known triviality results, any probability space can be extended to a probability space with a new conditional satisfying the Adams Thesis and satisfying a number of axioms for conditionals. This puts (...) significant limits on how far triviality results can go. (shrink)

Famous results by David Lewis show that plausible-sounding constraints on the probabilities of conditionals or evaluative claims lead to unacceptable results, by standard probabilistic reasoning. Existing presentations of these results rely on stronger assumptions than they really need. When we strip these arguments down to a minimal core, we can see both how certain replies miss the mark, and also how to devise parallel arguments for other domains, including epistemic “might,” probability claims, claims about comparative value, and (...) so on. A popular reply to Lewis's results is to claim that conditional claims, or claims about subjective value, lack truth conditions. For this strategy to have a chance of success, it needs to give up basic structural principles about how epistemic states can be updated—in a way that is strikingly parallel to the commitments of the project of dynamic semantics. (shrink)

This paper argues that several leading theories of subjunctive conditionals are incompatible with ordinary intuitions about what credences we ought to have in subjunctive conditionals. In short, our theory of subjunctives should intuitively display semantic humility, i.e. our semantic theory should deliver the truth conditions of sentences without pronouncing on whether those conditions actually obtain. In addition to describing intuitions about subjunctive conditionals, I argue that we can derive these ordinary intuitions from justified premises, and I answer a possible worry (...) for my derivation by refuting a subjunctive triviality result modeled on (Lewis 1976). I conclude that the debate over the correct theory of subjunctive conditionals requires settling meta-philosophical questions about the relative value of various virtues of first-order theories of subjunctive conditionals. (shrink)

We give two new characterizations of K-triviality. We show that if for all Y such that Ω is Y-random, Ω is -random, then A is K-trivial. The other direction was proved by Stephan and Yu, giving us the first titular characterization of K-triviality and answering a question of Yu. We also prove that if A is K-trivial, then for all Y such that Ω is Y-random, ≡LRY. This answers a question of Merkle and Yu. The other direction is (...) immediate, so we have the second characterization of K-triviality.The proof of the first characterization uses a new cupping result. We prove that if A≰LRB, then for every set X there is a B-random set Y such that X is computable from Y⊕A. (shrink)

This paper expounds a simple and non-trivial Ramsey Test. Drawing on the work of Peter Gärdenfors, it aims to help establish an epistemic alternative to the semantics of variably strict conditionals by Robert Stalnaker (in: Rescher (ed), Studies in logical theory, Blackwell, Oxford, 1968) and David Lewis (Counterfactuals, Blackwell, Oxford, 1973). The novelty of the present contribution lies in considering the framework of Preferred Subtheories as model of belief change upon which conditionals are defined. The resulting semantics avoids triviality (...) in the sense that a major premise of the proof of Gärdenfors’ triviality theorem is violated. (shrink)

Theories of content are at the centre of philosophical semantics. The most successful general theory of content takes contents to be sets of possible worlds. But such contents are very coarse-grained, for they cannot distinguish between logically equivalent contents. They draw intensional but not hyperintensional distinctions. This is often remedied by including impossible as well as possible worlds in the theory of content. Yet it is often claimed that impossible worlds are metaphysically obscure; and it is sometimes claimed that their (...) use results in a trivial theory of content. In this paper, I set out the need for impossible worlds in a theory of content; I briefly sketch a metaphysical account of their nature; I argue that worlds in general must be very fine-grained entities; and, finally, I argue that the resulting conception of impossible worlds is not a trivial one. (shrink)

Dave Ripley has recently argued against the plausibility of multiset consequence relations and of contraction-free approaches to paradox. For Ripley, who endorses a nontransitive theory, the best arguments that buttress transitivity also push for contraction—whence it is wiser for the substructural logician to go nontransitive from the start. One of Ripley’s allegations is especially insidious, since it assumes the form of a trivialisation result: it is shown that if a multiset consequence relation can be associated to a closure operator in (...) the expected way, then it necessarily contracts. We counter Ripley’s objection by presenting an approach to multiset consequence that escapes this trap. This approach is multiple-conclusioned in a heterodox way, for multiple succedents are given a conjunctive, rather than a disjunctive reading. Finally, we address a further objection by French and Ripley to the effect that the informational interpretation of sequents in linear logic does not motivate cut. (shrink)

It is a commonplace in the philosophy of physics that any local physical theory can be represented using arbitrary coordinates, simply by using tensor calculus. On the other hand, the physics literature often claims that spinors \emph{as such} cannot be represented in coordinates in a curved space-time. These commonplaces are inconsistent. What general covariance means for theories with fermions, such as electrons, is thus unclear. In fact both commonplaces are wrong. Though it is not widely known, Ogievetsky and Polubarinov constructed (...) spinors in coordinates in 1965, enhancing the unity of physics and helping to spawn particle physicists' concept of nonlinear group representations. Roughly and locally, these spinors resemble the orthonormal basis or "tetrad" formalism in the symmetric gauge, but they are conceptually self-sufficient and more economical. The typical tetrad formalism is de-Ockhamized, with six extra field components and six compensating gauge symmetries to cancel them out. The Ogievetsky-Polubarinov formalism, by contrast, is Ockhamized, with most of the fluff removed. As developed nonperturbatively by Bilyalov, it admits any coordinates at a point, but "time" must be listed first. Here "time" is defined in terms of an eigenvalue problem involving the metric components and the matrix $diag$, the product of which must have no negative eigenvalues in order to yield a real symmetric square root that is a function of the metric. Thus even formal general covariance requires reconsideration; the atlas of admissible coordinate charts should be sensitive to the types and \emph{values} of the fields involved. Apart from coordinate order and the usual spinorial two-valuedness, Ogievetsky-Polubarinov spinors form, with the metric, a nonlinear geometric object, for which important results on Lie and covariant differentiation are recalled. Such spinors avoid a spurious absolute object in the Anderson-Friedman analysis of substantive general covariance. They also permit the gauge-invariant localization of the infinite-component gravitational energy in General Relativity. Density-weighted spinors exploit the conformal invariance of the massless Dirac equation to show that the volume element is absent. Thus instead of an arbitrary nonsingular matrix with 16 components, 6 of which are gauged away by a new local $O$ gauge group and one of which is irrelevant due to conformal covariance, one can, and presumably should, use density-weighted Ogievetsky-Polubarinov spinors coupled to the 9-component symmetric square root of the part of the metric that fixes null cones. Thus $\frac{7}{16}$ of the orthonormal basis is eliminated as surplus structure. Greater unity between spinors and tensors and the like is achieved, such as regarding conservation laws. Regarding the conventionality of simultaneity, an unusually wide range of $\epsilon$ values is admissible, but some extreme values are inadmissible. Standard simultaneity uniquely makes the spinor transformation law linear and independent of the metric, because transformations among the standard Cartesian coordinate systems fall within the conformal group, for which the spinor transformation law is linear. The surprising mildness of the restrictions on coordinate order as applied to the Schwarzschild solution is exhibited. (shrink)

The paraconsistent system CPQ-ZFC/F is defined. It is shown using strong non-finitary methods that the theorems of CPQ-ZFC/F are exactly the theorems of classical ZFC minus foundation. The proof presented in the paper uses the assumption that a strongly inaccessible cardinal exists. It is then shown using strictly finitary methods that CPQ-ZFC/F is non-trivial. CPQ-ZFC/F thus provides a formulation of set theory that has the same deductive power as the corresponding classical system but is more reliable in that non-triviality (...) is provable by strictly finitary methods. This result does not contradict Gödel's incompleteness theorem because the proof of the deductive equivalence of the paraconsistent and classical systemss use non-finitary methods. (shrink)

It is a commonplace in the philosophy of physics that any local physical theory can be represented using arbitrary coordinates, simply by using tensor calculus. On the other hand, the physics literature often claims that spinors \emph{as such} cannot be represented in coordinates in a curved space-time. These commonplaces are inconsistent. What general covariance means for theories with fermions, such as electrons, is thus unclear. In fact both commonplaces are wrong. Though it is not widely known, Ogievetsky and Polubarinov constructed (...) spinors in coordinates in 1965, enhancing the unity of physics and helping to spawn particle physicists' concept of nonlinear group representations. Roughly and locally, these spinors resemble the orthonormal basis or "tetrad" formalism in the symmetric gauge, but they are conceptually self-sufficient and more economical. The typical tetrad formalism is de-Ockhamized, with six extra field components and six compensating gauge symmetries to cancel them out. The Ogievetsky-Polubarinov formalism, by contrast, is Ockhamized, with most of the fluff removed. As developed nonperturbatively by Bilyalov, it admits any coordinates at a point, but "time" must be listed first. Here "time" is defined in terms of an eigenvalue problem involving the metric components and the matrix $diag$, the product of which must have no negative eigenvalues in order to yield a real symmetric square root that is a function of the metric. Thus even formal general covariance requires reconsideration; the atlas of admissible coordinate charts should be sensitive to the types and \emph{values} of the fields involved. Apart from coordinate order and the usual spinorial two-valuedness, Ogievetsky-Polubarinov spinors form, with the metric, a nonlinear geometric object, for which important results on Lie and covariant differentiation are recalled. Such spinors avoid a spurious absolute object in the Anderson-Friedman analysis of substantive general covariance. They also permit the gauge-invariant localization of the infinite-component gravitational energy in General Relativity. Density-weighted spinors exploit the conformal invariance of the massless Dirac equation to show that the volume element is absent. Thus instead of an arbitrary nonsingular matrix with 16 components, 6 of which are gauged away by a new local $O$ gauge group and one of which is irrelevant due to conformal covariance, one can, and presumably should, use density-weighted Ogievetsky-Polubarinov spinors coupled to the 9-component symmetric square root of the part of the metric that fixes null cones. Thus $\frac{7}{16}$ of the orthonormal basis is eliminated as surplus structure. Greater unity between spinors and tensors and the like is achieved, such as regarding conservation laws. Regarding the conventionality of simultaneity, an unusually wide range of $\epsilon$ values is admissible, but some extreme values are inadmissible. Standard simultaneity uniquely makes the spinor transformation law linear and independent of the metric, because transformations among the standard Cartesian coordinate systems fall within the conformal group, for which the spinor transformation law is linear. The surprising mildness of the restrictions on coordinate order as applied to the Schwarzschild solution is exhibited. (shrink)

We study automorphism groups of trivial strongly minimal structures. First we give a characterization of structures of bounded valency through their groups of automorphisms. Then we characterize the triplets of groups which can be realized as the automorphism group of a non algebraic component, the subgroup stabilizer of a point and the subgroup of strong automorphisms in a trivial strongly minimal structure, and also we give a reconstruction result. Finally, using HNN extensions we show that any profinite group can be (...) realized as the stabilizer of a point in a strongly minimal structure of bounded valency. (shrink)

Recent work in formal semantics suggests that the language system includes not only a structure building device, as standardly assumed, but also a natural deductive system which can determine when expressions have trivial truth‐conditions (e.g., are logically true/false) and mark them as unacceptable. This hypothesis, called the ‘logicality of language’, accounts for many acceptability patterns, including systematic restrictions on the distribution of quantifiers. To deal with apparent counter‐examples consisting of acceptable tautologies and contradictions, the logicality of language is often paired (...) with an additional assumption according to which logical forms are radically underspecified: i.e., the language system can see functional terms but is ‘blind’ to open class terms to the extent that different tokens of the same term are treated as if independent. This conception of logical form has profound implications: it suggests an extreme version of the modularity of language, and can only be paired with non‐classical—indeed quite exotic—kinds of deductive systems. The aim of this paper is to show that we can pair the logicality of language with a different and ultimately more traditional account of logical form. This framework accounts for the basic acceptability patterns which motivated the logicality of language, can explain why some tautologies and contradictions are acceptable, and makes better predictions in key cases. As a result, we can pursue versions of the logicality of language in frameworks compatible with the view that the language system is not radically modular vis‐á‐vis its open class terms and employs a deductive system that is basically classical. (shrink)

We prove: Theorem. A complete first order theory in a countable language which is strictly stable, trivial and which admits finite coding has 2 ℵ 0 nonisomorphic countable models. Combined with the corresponding result or superstable theories from [4] our result confirms the Vaught conjecture for trivial theories which admit finite coding.

In this paper we examine the thesis that the probability of the conditional is the conditional probability. Previous work by a number of authors has shown that in standard numerical probability theories, the addition of the thesis leads to triviality. We introduce very weak, comparative conditional probability structures and discuss some extremely simple constraints. We show that even in such a minimal context, if one adds the thesis that the probability of a conditional is the conditional probability, then one (...) trivializes the theory. Another way of stating the result is that the conditional of conditional probability cannot be represented in the object language on pain of trivializing the theory. (shrink)

It is a commonplace in the philosophy of physics that any local physical theory can be represented using arbitrary coordinates, simply by using tensor calculus. On the other hand, the physics literature often claims that spinors \emph{as such} cannot be represented in coordinates in a curved space-time. These commonplaces are inconsistent. What general covariance means for theories with fermions, such as electrons, is thus unclear. In fact both commonplaces are wrong. Though it is not widely known, Ogievetsky and Polubarinov constructed (...) spinors in coordinates in 1965, enhancing the unity of physics and helping to spawn particle physicists' concept of nonlinear group representations. Roughly and locally, these spinors resemble the orthonormal basis or "tetrad" formalism in the symmetric gauge, but they are conceptually self-sufficient and more economical. The typical tetrad formalism is de-Ockhamized, with six extra field components and six compensating gauge symmetries to cancel them out. The Ogievetsky-Polubarinov formalism, by contrast, is Ockhamized, with most of the fluff removed. As developed nonperturbatively by Bilyalov, it admits any coordinates at a point, but "time" must be listed first. Here "time" is defined in terms of an eigenvalue problem involving the metric components and the matrix $diag$, the product of which must have no negative eigenvalues in order to yield a real symmetric square root that is a function of the metric. Thus even formal general covariance requires reconsideration; the atlas of admissible coordinate charts should be sensitive to the types and \emph{values} of the fields involved. Apart from coordinate order and the usual spinorial two-valuedness, Ogievetsky-Polubarinov spinors form, with the metric, a nonlinear geometric object, for which important results on Lie and covariant differentiation are recalled. Such spinors avoid a spurious absolute object in the Anderson-Friedman analysis of substantive general covariance. They also permit the gauge-invariant localization of the infinite-component gravitational energy in General Relativity. Density-weighted spinors exploit the conformal invariance of the massless Dirac equation to show that the volume element is absent. Thus instead of an arbitrary nonsingular matrix with 16 components, 6 of which are gauged away by a new local $O$ gauge group and one of which is irrelevant due to conformal covariance, one can, and presumably should, use density-weighted Ogievetsky-Polubarinov spinors coupled to the 9-component symmetric square root of the part of the metric that fixes null cones. Thus $\frac{7}{16}$ of the orthonormal basis is eliminated as surplus structure. Greater unity between spinors and tensors and the like is achieved, such as regarding conservation laws. Regarding the conventionality of simultaneity, an unusually wide range of $\epsilon$ values is admissible, but some extreme values are inadmissible. Standard simultaneity uniquely makes the spinor transformation law linear and independent of the metric, because transformations among the standard Cartesian coordinate systems fall within the conformal group, for which the spinor transformation law is linear. The surprising mildness of the restrictions on coordinate order as applied to the Schwarzschild solution is exhibited. (shrink)

It is known that a number of inference principles can be used to trivialise the axioms of naïve comprehension - the axioms underlying the naïve theory of sets. In this paper we systematise and extend these known results, to provide a number of general classes of axioms responsible for trivialising naïve comprehension.