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.

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)

A real is Martin-Löf (Schnorr) random if it does not belong to any effectively presented null ${\Sigma^0_1}$ (recursive) class of reals. Although these randomness notions are very closely related, the set of Turing degrees containing reals that are K-trivial has very different properties from the set of Turing degrees that are Schnorr trivial. Nies proved in (Adv Math 197(1):274–305, 2005) that all K-trivial reals are low. In this paper, we prove that if ${{\bf h'} \geq_T (...) {\bf 0''}}$ , then h contains a Schnorr trivial real. Since this concept appears to separate computational complexity from computational strength, it suggests that Schnorr trivial reals should be considered in a structure other than the Turing degrees. (shrink)

We investigate the relationship between lowness for Schnorr randomness and Schnorr triviality. We show that a real is low for Schnorr randomness if and only if it is Schnorr trivial and hyperimmune free.

Schnorr randomness is a notion of algorithmic randomness for real numbers closely related to Martin-Löf randomness. After its initial development in the 1970s the notion received considerably less attention than Martin-Löf randomness, but recently interest has increased in a range of randomness concepts. In this article, we explore the properties of Schnorr random reals, and in particular the c.e. Schnorr random reals. We show that there are c.e. reals that are Schnorr random but not Martin-Löf random, (...) and provide a new characterization of Schnorr random real numbers in terms of prefix-free machines. We prove that unlike Martin-Löf random c.e. reals, not all Schnorr random c.e. reals are Turing complete, though all are in high Turing degrees. We use the machine characterization to define a notion of "Schnorr reducibility" which allows us to calibrate the Schnorr complexity of reals. We define the class of "Schnorr trivial" reals, which are ones whose initial segment complexity is identical with the computable reals, and demonstrate that this class has non-computable members. (shrink)

We examine the randomness and triviality of reals using notions arising from martingales and prefix-free machines.

Schnorr randomness and computable randomness are natural concepts of random sequences. However van Lambalgen’s Theorem fails for both randomnesses. In this paper we define truth-table Schnorr randomness and truth-table reducible randomness, for which we prove that van Lambalgen's Theorem holds. We also show that the classes of truth-table Schnorr random reals relative to a high set contain reals Turing equivalent to the high set. It follows that each high Schnorr random real is half of a real (...) for which van Lambalgen's Theorem fails. Moreover we establish the coincidence between triviality and lowness notions for truth-table Schnorr randomness. © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim. (shrink)

Levin and Schnorr (independently) introduced the monotone complexity, Km(α), of a binary string α. We use monotone complexity to define the relative complexity (or relative randomness) of reals. We define a partial ordering ≤Km on 2ω by α ≤Km β iff there is a constant c such that Km(α ↾ n) ≤ Km(β ↾ n) + c for all n. The monotone degree of α is the set of all β such that α ≤Km β and β ≤Km α. (...) We show the monotone degrees contain an antichain of size 2N0, a countable dense linear ordering (of degrees of cardinality 2N0), and a minimal pair. Downey, Hirschfeldt, LaForte, Nies and others have studied a similar structure, the K -degrees, where K is the prefix-free Kolmogorov complexity. A minimal pair of K -degrees was constructed by Csima and Montalbán. Of particular interest are the noncomputable trivial reals, first constructed by Solovay. We define a real to be (Km, K)-trivial if for some constant c, Km(α ↾ n) ≤ K(n)+c for all n. It is not known whether there is a Km-minimal real, but we show that any such real must be (Km, K)-trivial. Finally, we consider the monotone degrees of the computably enumerable (c.e.) and strongly computably enumerable (s.c.e.) reals. We show there is no minimal c.e. monotone degree and that Solovay reducibility does not imply monotone reducibility on the c.e. reals. We also show the s.c.e. monotone degrees contain an infinite antichain and a countable dense linear ordering. (shrink)

We formalise the notion of those infinite binary sequences z that admit a single program P which expresses the entire algorithmical structure of z. Such a program P minimizes the information which must be used in a relative computation for z. We propose two concepts with different strength for this notion, the learnable and the super-learnable sequences. We establish three different equivalent characterizations of learnable (super-learnable, resp.) sequences. In particular, we prove that a sequences z is learnable (super-learnable, resp.) if (...) and only if there is a computable probability measure p such that p is Schnorr (Martin-Lof, resp.) p-random. There is a recursively enumerable sequence which is not learnable. The learnable sequences are invariant with respect to all total and effective transformations of infinite binary sequences. (shrink)

A investigação operou por meio dos Ateliês de Escrileituras: Conatus e Rabiscos de sensações na produção de um corpo crianceiro. O trabalho teve por objetivo fazer “escrever a n-1”, segundo um agenciamento rizomático de saberes. Produziram-se escrituras a partir de elementos extraídos da arte, da filosofia e da ciência. Destacam-se os Ateliês na proposta de uma escrita que extraí a unidade da multiplicidade, de uma vida potente e saudável.

Na presente investigação, objetivou-se analisar, a partir do referencial teórico e metodológico pós-estruturalista, os conceitos de Ciência, Tecnologia e Sociedade na trama com a educação e o ensino de Ciências. Como substrato teórico são utilizadas obras de Michel Foucault, Gilles Deleuze e Felix Guattari, ofertando pistas para ampliar a discussão destes conceitos. Na reunião dos saberes investigados, afirma-se um pensamento científico que desenvolve a produção de sentidos para a educação. Diante do exposto, pensa-se em um ensino, que crie estratégias de (...) existências, que reivindique a trama de teorias e práticas, operando os conteúdos científicos na Sociedade. (shrink)

Como a filosofia da diferença pode impregnar a formação de professores nesta contemporaneidade por intermédio de arranjos múltiplos, da disseminação de saberes diversos, dos encontros variados e das composições inéditas, a partir dos passeios urbanos? Eis a questão norteadora da escrita deste texto, iniciada na pesquisa-intervenção denominada Tramas e usos do passeio urbano: por uma estética professoral . Entendendo que os saberes estão sempre se transformando e se relacionando, objetivamos tecer tramas entre a filosofia da diferença, as ciências educativas e (...) a arte contemporânea a fim de realizar fissuras na maneira tradicional que está sendo trabalhado os procedimentos formativos. Justifica-se a importância do texto ao considerar as tantas indicações sobre como ser e fazer – enquanto uma demanda modulada por experts educacionais – acabando-se por perder a análise sobre as próprias condições de vida, ficando-se alheio ao poder de gerenciar a existência. O método cartográfico foi utilizado sugerindo uma investigação sobre o processo da produção dos dados. Trabalhar conceitos filosóficos, artísticos e educacionais, possibilitou o enfrentamento do pensamento caótico acionado em função da experimentação de dispositivos singulares. Podemos dizer que a intervenção proposta pulverizou a Educação, através das experimentações no passeio urbano, possibilitando que conexões na prática professoral tenham se formado e territórios docentes desconstituídos ou reforçados. O inédito prevaleceu à repetição do mesmo. Por isso, se aposta nesse modo educacional que age no indivíduo, que faz acontecer alguma coisa com os sujeitos envolvidos. Não há escapatória. É condição sobre a qual o pensamento é colocado a pensar, exigindo uma didática que põe alguma coisa a funcionar. (shrink)

A Schnorr test relative to some oracle A may informally be called “universal” if it covers all Schnorr tests. Since no true universal Schnorr test exists, such an A cannot be computable. We prove that the sets with this property are exactly those with high Turing degree. Our method is closely related to the proof of Terwijn and Zambella’s characterization of the oracles which are low for Schnorr tests. We also consider the oracles which compute relativized (...) Schnorr tests with the weaker property of covering all computable reals. The degrees of these oracles strictly include the hyperimmune degrees and are strictly included in the degrees not computably traceable. (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 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)

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.

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)

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)

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.

The first formal definition of randomness, seen as a property of sequences of events or experimental outcomes, dates back to Richard von Mises' work in the foundations of probability and statistics. The randomness notion introduced by von Mises is nowadays widely regarded as being too weak. This is, to a large extent, due to the work of Jean Ville, which is often described as having dealt the death blow to von Mises' approach, and which was integral to the development of (...) algorithmic randomness—the now-standard theory of randomness for elements of a probability space. The main goal of this article is to trace the history and provide an in-depth appraisal of two lesser-known, yet historically and methodologically notable proposals for how to modify von Mises' definition so as to avoid Ville's objection. The first proposal is due to Abraham Wald, while the second one is due to Claus-Peter Schnorr. We show that, once made precise in a natural way using computability theory, Wald's proposal constitutes a much more radical departure from von Mises' framework than intended. Schnorr's proposal, on the other hand, does provide a partial vindication of von Mises' approach: it demonstrates that it is possible to obtain a satisfactory randomness notion—indeed, a canonical algorithmic randomness notion—by characterizing randomness in terms of the invariance of limiting relative frequencies. More generally, we argue that Schnorr's proposal, together with a number of little-known related results, reveals that there is more continuity than typically acknowledged between von Mises' approach and algorithmic randomness. Even though von Mises' exclusive focus on limiting relative frequencies did not survive the passage to the theory of algorithmic randomness, another crucial aspect of his conception of randomness did endure; namely, the idea that randomness amounts to a certain type of stability or invariance under an appropriate class of transformations. (shrink)

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

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)

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.

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)

Bypassing Lewis’ Triviality Results. A Kripke-Style Partial Semantics for Compounds of Adams’ Conditionals Alberto Mura University of Sassari Abstract According to Lewis’ Triviality Results (LTR), conditionals cannot satisfy the equa­tion (E) P(C if A) = P(C | A), except in trivial cases. Ernst Adams (1975), however, provided a probabilistic semantics for the so-called simple conditionals that also sat­isfies equation (E) and provides a probabilistic counterpart of logical consequence (called p-entailment). Adams’ probabilistic semantics is coextensive to Stalnaker­Thomason’s (1970) and Lewis’ (...) (1973) semantics as far as simple conditionals are concerned. A theorem, proved in McGee 1981, shows that no truth-functional many-valued logic allows a relation of logical consequence coextensive with Adams’ p-entailment. This paper presents a modified modal (Kripke-style) version of de Finetti’s se­mantics that escapes McGee’s result and provides a general truth-conditional se­mantics for indicative conditionals. It agrees with Adams’ logic and is not affected by LTR. The new framework encompasses and extends Adams’ probabilistic se­mantics (APS) to compounds of conditionals. A generalised set of axioms for prob­ability over the set of tri-events is provided, which coincide with the standard axioms over the set of the two-valued ordinary sentences. -/- Keywords: Conditionals, Probability logic, de Finetti, Tri-events, Adams’ logic, Stal­naker’s thesis, Partial logic, Lewis’ triviality results, Ramsey test. (shrink)

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.

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.

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)

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)

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 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 the Sophist and the Statesman. Against this framework, I shall move to a close examination of specific examples drawn from the Theaetetus (154c–55d), the Republic (523c–24d), and the Phaedo (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)

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)

According to contextualism, a gender term such as ‘woman’ does not invariantly refer to a specific social or biological kind. Instead, gender terms have different extensions depending on the context of utterance. Contextualism accommodates that speakers are perfectly able to use gender terms in very different ways and still be coherent and successful in their communicative exchanges. However, while the flexibility of contextualism is its primary asset, it has also turned out to be its potential demise. The worry is that (...) the view not only makes trans-including claims true but also allows that trans-excluding claims can be true and therefore, does justice to the claims of trans people only in a trivial sense. This paper defends the view that contextualists can respond to this worry by showing why trans-excluding claims are often morally problematic even in contexts where they are true. Contextualists are well-equipped to say that when speakers insist on using gender terms in trans-excluding ways, they engage in a meta-linguistic negotiation about how gender terms ought to be used – where using them trans-excluding is treated as normatively superior. This constitutes a kind of epistemic injustice. (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.

In this study, we used Terrance L. Furin’s concept of transformational countering to examine six Holocaust education resources designed to address Holocaust trivialization and antisemitism. While academic comparisons are useful to helping students understand challenging content, superficial Holocaust analogies for political purposes are identified as Holocaust trivialization. Given that the current context consists of a growing white nationalist movement characterized by authoritarianism, antisemitism, and conspiracy theories, we enter the study understanding that Holocaust trivialization and far-right extremism must be understood together. (...) We, therefore, examined the type of support teachers receive from Holocaust and human rights organizations in countering extremism and Holocaust trivialization. After analyzing the six resources, our findings demonstrate that resources produced to counter Holocaust trivialization become quickly outdated given the rapid evolution of extremism. Also, findings indicate that teachers receive stronger support in countering extremism and Holocaust trivialization from organizations that focus broadly on supporting human rights compared to the organizations that focus exclusively on Holocaust education. (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.

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)

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)

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.