It is proven that the following statement: "there exists a club $C \subseteq \kappa$ such that every α ∈ C is an inaccessible cardinal in L and, for every δ a limit point of C, C ∩ δ is almost contained in every club of δ of L" is equiconsistent with a weakly compact cardinal if κ = ℵ 1 , and with a weakly compact cardinal of order 1 if κ = ℵ 2.

We prove a number of consistency results complementary to the ZFC results from our paper [J. Cummings, M. Foreman, M. Magidor, Canonical structure in the universe of set theory: part one, Annals of Pure and Applied Logic 129 211–243]. We produce examples of non-tightly stationary mutually stationary sequences, sequences of cardinals on which every sequence of sets is mutually stationary, and mutually stationary sequences not concentrating on a fixed cofinality. We also give an alternative proof for the consistency of (...) the existence of stationarily many non-good points, show that diagonal Prikry forcing preserves certain stationary reflection properties, and study the relationship between some simultaneous reflection principles. Finally we show that the least cardinal where square fails can be the least inaccessible, and show that weak square is incompatible in a strong sense with generic supercompactness. (shrink)

If $\omega_n$ has the tree property for all $2 \leq n < \omega$ and $2^{<\aleph_{\omega}} = \aleph_{\omega}$, then for all $X \in H_{\aleph_{\omega}}$ and $n < \omega, M^#_n$ exists.

It is proved (Theorem 1) that if 0♯ exists, then any constructible forcing property which over L adds no reals, over V collapses an uncountable L-cardinal to cardinality ω. This improves a theorem of Foreman, Magidor, and Shelah. Also, a method for approximating this phenomenon generically is found (Theorem 2). The strategy is first to reduce the problem of `disabling' forcing properties to that of specializing certain trees in a weak sense.

Let κ be a regular uncountable cardinal and λ be a cardinal greater than κ. We show that if 2 <κ ≤ M(κ, λ), then ◇ κ,λ holds, where M(κ, λ) equals $\lambda ^{\aleph }0$ if cf(λ) ≥ κ, and $(\lambda ^{+})^{\aleph _{0}}$ otherwise.

We prove that the logics of Magidor-Malitz and their generalization by Rubin are distinct even for PC classes. Let $M \models Q^nx_1 \cdots x_n \varphi(x_1 \cdots x_n)$ mean that there is an uncountable subset A of |M| such that for every $a_1, \ldots, a_n \in A, M \models \varphi\lbrack a_1, \ldots, a_n\rbrack$ . Theorem 1.1 (Shelah) $(\diamond_{\aleph_1})$ . For every n ∈ ω the class $K_{n + 1} = \{\langle A, R\rangle \mid \langle A, R\rangle \models \neg Q^{n + (...) 1} x_1 \cdots x_{n + 1} R(x_1, \ldots, x_{n + 1})\}$ is not an ℵ 0 -PC-class in the logic L n , obtained by closing first order logic under Q 1 , ..., Q n . I.e. for no countable L n -theory T, is K n + 1 the class of reducts of the models of T. Theorem 1.2 (Rubin) $(\diamond_{\aleph_1}).^3$ . Let $M \models Q^E x y\varphi(x, y)$ mean that there is $A \subseteq |M|$ such that $E_{A, \varphi} = \{\langle a, b \rangle \mid a, b \in A$ and $M \models \varphi\lbrack a, b\rbrack\}$ is an equivalence relation on A with uncountably many equivalence classes, and such that each equivalence class is uncountable. Let $K^E = \{\langle A, R\rangle\mid \langle A, R\rangle\models \neg Q^Exy R(x, y)\}$ . Then K E is not an ℵ 0 -PC-class in the logic gotten by closing first order logic under the set of quantifiers {Q n ∣ n ∈ ω} which were defined in Theorem 1.1. (shrink)

This study described the relationships between academic class and student moral sensitivity and reasoning and between curriculum design components for ethics education and student moral sensitivity and reasoning. The data were collected from freshman (n = 506) and senior students (n = 440) in eight baccalaureate nursing programs in South Korea by survey; the survey consisted of the Korean Moral Sensitivity Questionnaire and the Korean Defining Issues Test. The results showed that moral sensitivity scores in patient-oriented care and conflict were (...) higher in senior students than in freshman students. Furthermore, more hours of ethics content were associated with higher principled thinking scores of senior students. Nursing education in South Korea may have an impact on developing student moral sensitivity. Planned ethics content in nursing curricula is necessary to improve moral sensitivity and moral reasoning of students. (shrink)

Two fundamental rules of reasoning are Universal Generalisation and Existential Instantiation. Applications of these rules involve stipulations such as ‘Let n be an arbitrary number’ or ‘Let John be an arbitrary Frenchman’. Yet the semantics underlying such stipulations are far from clear. What, for example, does ‘n’ refer to following the stipulation that n be an arbitrary number? In this paper, we argue that ‘n’ refers to a number—an ordinary, particular number such as 58 or 2,345,043. Which one? We do (...) not and cannot know, because the reference of ‘n’ is fixed arbitrarily. Underlying this proposal is a more general thesis: Arbitrary Reference : It is possible to fix the reference of an expression arbitrarily. When we do so, the expression receives its ordinary kind of semantic-value, though we do not and cannot know which value in particular it receives. Our aim in this paper is defend AR. In particular, we argue that AR can be used to provide an account of instantial reasoning, and we suggest that AR can also figure in offering new solutions to a range of difficult philosophical puzzles. (shrink)

Category mistakes are sentences such as 'Green ideas sleep furiously' or 'Saturday is in bed'. They strike us as highly infelicitous but it is hard to explain precisely why this is so. Ofra Magidor explores four approaches to category mistakes in philosophy of language and linguistics, and develops and defends an original, presuppositional account.

One of the central debates in contemporary metaphysics has been the debate between endurantism and perdurantism about persistence. In this paper I argue that much of this debate has been misconstrued: most of the arguments in the debate crucially rely on theses which are strictly orthogonal to the endurantism/perdurantism debate. To show this, I note that the arguments in the endurantism/perdurantism debate typically take the following form: one presents a challenge that endurantists allegedly have some trouble addressing, and to which (...) perdurantism apparently has a straightforward response. I argue, however, that in each case, there are versions of endurantism that can offer precisely the same response to the challenge, and thus the ability to provide this particular solution does not directly tell in favour of one the two views. In §1, I elaborate two views which will be particularly prominent in the discussion: liberal endurantism and restrictive perdurantism. In §2–6 I discuss in turn the central pro-perdurantism arguments: the argument from anthropocentricism, the argument from vagueness, the argument from recombination, the argument from temporary intrinsics, and the argument from coincidence. In §7–8, I discuss the main pro-endurantism arguments: the arguments from motion, and the argument from permanent coincidence. Finally, in §9, I discuss what conclusion can be drawn from this discussion. (shrink)

Assuming some large cardinals, a model of ZFC is obtained in which $\aleph_{\omega+1}$ carries no Aronszajn trees. It is also shown that if $\lambda$ is a singular limit of strongly compact cardinals, then $\lambda^+$ carries no Aronszajn trees.

We prove that the statement "For every pair A, B, stationary subsets of ω 2 , composed of points of cofinality ω, there exists an ordinal α such that both A ∩ α and $B \bigcap \alpha$ are stationary subsets of α" is equiconsistent with the existence of weakly compact cardinal. (This completes results of Baumgartner and Harrington and Shelah.) We also prove, assuming the existence of infinitely many supercompact cardinals, the statement "Every stationary subset of ω ω + 1 (...) has a stationary initial segment.". (shrink)

Category mistakes are sentences such as ‘Colourless green ideas sleep furiously’ or ‘The theory of relativity is eating breakfast’. Such sentences are highly anomalous, and this has led a large number of linguists and philosophers to conclude that they are meaningless (call this ‘the meaninglessness view’). In this paper I argue that the meaninglessness view is incorrect and category mistakes are meaningful. I provide four arguments against the meaninglessness view: in Sect. 2, an argument concerning compositionality with respect to category (...) mistakes; in Sect. 3 an argument concerning synonymy facts of category mistakes; in Sect. 4 concerning embeddings of category mistakes in propositional attitude ascriptions; and in Sect. 5 concerning the uses of category mistakes in metaphors. Having presented these arguments, in Sect. 6 I briefly discuss some of the positive motivations for accepting the meaninglessness view and argue that they are unconvincing. I conclude that the meaninglessness view ought to be rejected. (shrink)

This is a survey paper giving a self-contained account of Shelah's theory of the pcf function pcf={cf:D is an ultrafilter on a}, where a is a set of regular cardinals such that a

Logic and Philosophy of Logic

Logic and Philosophy of Logic, Miscellaneous in Logic and Philosophy of Logic

Model Theory in Logic and Philosophy of Logic

Direct download (4 more)  

 

Export citation  

 

Bookmark   32 citations  

Leibniz’s Law (or as it sometimes called, ‘the Indiscerniblity of Identicals’) is a widely accepted principle governing the notion of numerical identity. The principle states that if a is identical to b, then any property had by a is also had by b. Leibniz’s Law may seem like a trivial principle, but its apparent consequences are far from trivial. The law has been utilised in a wide range of arguments in metaphysics, many leading to substantive and controversial conclusions. This article (...) discusses the applications of Leibniz’s Law to arguments in metaphysics. It begins by presenting a variety of central arguments in metaphysics which appeal to the law. The article then proceeds to discuss a range of strategies that can be drawn upon in resisting an argument by Leibniz’s Law. These strategies divide into three categories: (i) denying Leibniz’s Law; (ii) denying that the argument in question involves a genuine application of the law; and (iii) denying that the argument’s premises are true. Strategies falling under each of these three categories are discussed in turn. (shrink)

Epistemic externalism offers one of the most prominent responses to the sceptical challenge. Externalism has commonly been interpreted as postulating a crucial asymmetry between the actual-world agent and their brain-in-a-vat counterpart: while the actual agent is in a position to know she is not envatted, her biv counterpart is not in a position to know that she is envatted, or in other words, only the former is in a position to know whether or not she is envatted. In this paper, (...) I argue that there is in fact no such asymmetry: assuming epistemic externalism, both the actual world agent and their biv counterpart are in a position to know whether or not they are envatted. After an introduction, I present the main argument. I examine to what extent the argument survives when one accepts additional externalist-friendly commitments: semantic externalism, a sensitivity condition on knowledge, and epistemic contextualism. Finally, I discuss the implications of my conclusion to a variety of debates in epistemology. (shrink)

In his seminal paper 'Assertion', Robert Stalnaker distinguishes between the semantic content of a sentence on an occasion of use and the content asserted by an utterance of that sentence on that occasion. While in general the assertoric content of an utterance is simply its semantic content, the mechanisms of conversation sometimes force the two apart. Of special interest in this connection is one of the principles governing assertoric content in the framework, one according to which the asserted content ought (...) to be identical at each world in the context set. In this paper, we present a problem for Stalnaker's meta-semantic framework, by challenging the plausibility of the Uniformity principle. We argue that the interaction of the framework with facts about epistemic accessibility - in particular, failures of epistemic transparency - cause problems for the Uniformity principle and thus for Stalnaker's framework more generally. (shrink)

This paper consists of two parts. The first concerns the logic of vagueness. The second concerns a prominent debate in metaphysics. One of the most widely accepted principles governing the ‘definitely’ operator is the principle of Distribution: if ‘p’ and ‘if p then q’ are both definite, then so is ‘q’. I argue however, that epistemicists about vagueness should reject this principle. The discussion also helps to shed light on the elusive question of what, on this framework, it takes for (...) a sentence to be borderline or definite. In the second part of the paper, I apply this result to a prominent debate in metaphysics. One of the most influential arguments in favour of Universalism about composition is the Lewis-Sider argument from vagueness. An interesting question, however, is whether epistemicists have any particular reasons to resist the argument. I show that there is no obvious reason why epistemicists should resist the argument but there is a non-obvious one: the rejection of Distribution argued for in the first part of the paper provides epistemicists with a unique way of resisting the argument from vagueness. (shrink)

In this paper I discuss a certain kind of 'type confusion' which involves use of expressions of the wrong grammatical category, as in the string 'runs eats'. It is (nearly) universally accepted that such strings are meaningless. My purpose in this paper is to question this widespread assumption (or as I call it, 'the last dogma'). I discuss a range of putative reasons for accepting the last dogma: in §II, semantic and metaphysical reasons; in §III, logical reasons; and in §IV, (...) syntactic reasons. I argue that none of these reasons is conclusive, and that consequently we should be willing to question this last dogma of type confusions. (shrink)

Call an argument a ‘happy sorites’ if it is a sorites argument with true premises and a false conclusion. It is a striking fact that although most philosophers working on the sorites paradox find it at prima facie highly compelling that the premises of the sorites paradox are true and its conclusion false, few (if any) of the standard theories on the issue ultimately allow for happy sorites arguments. There is one philosophical view, however, that appears to allow for at (...) least some happy sorites arguments: strict finitism in the philosophy of mathematics. My aim in this paper is to explore to what extent this appearance is accurate. As we shall see, this question is far from trivial. In particular, I will discuss two arguments that threaten to show that strict finitism cannot consistently accept happy sorites arguments, but I will argue that (given reasonable assumptions on strict finitistic logic) these arguments can ultimately be avoided, and the view can indeed allow for happy sorites arguments. (shrink)

Since the work of Gödel and Cohen, which showed that Hilbert's First Problem was independent of the usual assumptions of mathematics, there have been a myriad of independence results in many areas of mathematics. These results have led to the systematic study of several combinatorial principles that have proven effective at settling many of the important independent statements. Among the most prominent of these are the principles diamond and square discovered by Jensen. Simultaneously, attempts have been made to find suitable (...) natural strengthenings of ZFC, primarily by Large Cardinal or Reflection Axioms. These two directions have tension between them in that Jensen's principles, which tend to suggest a rather rigid mathematical universe, are at odds with reflection properties. A third development was the discovery by Shelah of "PCF Theory", a generalization of cardinal arithmetic that is largely determined inside ZFC. In this paper we consider interactions between these three theories in the context of singular cardinals, focusing on the various implications between square and scales, and on consistency results between relatively strong forms of square and stationary set reflection. (shrink)

A vast and interesting family of natural semantics for belief revision is defined. Suppose one is given a distance d between any two models. One may then define the revision of a theory K by a formula α as the theory defined by the set of all those models of α that are closest, by d, to the set of models of K. This family is characterized by a set of rationality postulates that extends the AGM postulates. The new postulates (...) describe properties of iterated revisions. (shrink)