There are many classical connections between the proof-theoretic strength of systems of arithmetic and the provable totality of recursive functions. In this paper we study the provability strength of the totality of recursive functions by investigating the degree structure induced by the relative provability order of recursive algorithms. We prove several results about this proof-theoretic degree structure using recursion-theoretic techniques such as diagonalization and the Recursion Theorem.

Some well-known metaphysical arguments against relativism rest on the claim that relativity somehow must be accompanied by relationality. I argue otherwise, and trace the consequences for some prominent disputes between relativists and absolutists.

We consider a family of logical systems for representing entailment relations of various kinds. This family has its root in the logic of first-degree entailment formulated as a binary consequence system, i.e. a proof system dealing with the expressions of the form \, where both \ and \ are single formulas. We generalize this approach by constructing consequence systems that allow manipulating with sets of formulas, either to the right or left of the turnstile. In this way, it is (...) possible to capture proof-theoretically not only the entailment relation of the standard four-valued Belnap’s logic, but also its dual version, as well as some of their interesting extensions. The proof systems we propose are, in a sense, of a hybrid Hilbert–Gentzen nature. We examine some important properties of these systems and establish their completeness with respect to the corresponding entailment relations. (shrink)

Let d be a Turing degree, R[d] and Q[d] denote respectively classes of recursively enumerable (r.e.) and all degrees in which d is relatively enumerable. We proved in Ishmukhametov [1999] that there is a degree d containing differences of r.e.sets (briefly, d.r.e.degree) such that R[d] possess a least elementm $>$ 0. Now we show the existence of a d.r.e. d such that R[d] has no a least element. We prove also that for any REA-degree d below (...) 0 $'$ the class Q[d] cannot have a least element and more generally is not bounded below by a non-zero degree, except in the trivial cases. (shrink)

Following a line of research initiated in [4], we describe a general framework for turning reduction concepts of relative computability into diagrams forming an analogy with the Cichoń diagram for cardinal characteristics of the continuum. We show that working from relatively modest assumptions about a notion of reduction, one can construct a robust version of such a diagram. As an application, we define and investigate the Cichoń diagram for degrees of constructibility relative to a fixed inner model W. (...) Many analogies hold with the classical theory as well as some surprising differences. Along the way, we introduce a new axiom stating, roughly, that the constructibility diagram is as complex as possible. (shrink)

When considering the principle of medical confidentiality, disclosure of genetic information constitutes a special case because of the impact that this information can have on the health and the lives of relatives. The aim of this study is to explore the attitudes of Turkish physicians and patients about sharing information obtained from genetic tests.

A computable structure $\mathcal {A}$ is $\mathbf {x}$-computably categorical for some Turing degree $\mathbf {x}$ if for every computable structure $\mathcal {B}\cong\mathcal {A}$ there is an isomorphism $f:\mathcal {B}\to\mathcal {A}$ with $f\leq_{T}\mathbf {x}$. A degree $\mathbf {x}$ is a degree of categoricity if there is a computable structure $\mathcal {A}$ such that $\mathcal {A}$ is $\mathbf {x}$-computably categorical, and for all $\mathbf {y}$, if $\mathcal {A}$ is $\mathbf {y}$-computably categorical, then $\mathbf {x}\leq_{T}\mathbf {y}$. We construct a $\Sigma^{0}_{2}$ (...) set whose degree is not a degree of categoricity. We also demonstrate a large class of degrees that are not degrees of categoricity by showing that every degree of a set which is 2-generic relative to some perfect tree is not a degree of categoricity. Finally, we prove that every noncomputable hyperimmune-free degree is not a degree of categoricity. (shrink)

In this paper, we argue that there are more kinds of relative clause constructions between the linguistic heaven and earth than are dreamed of in the classical lore, which distinguishes just restrictive relative clauses and appositives. We start with degree relatives. Degree, or amount, relatives show restrictions in the relativizers they allow, in the determiners that can combine with them, and in their stacking possibilities. To account for these facts, we propose an analysis with two central, (...) and novel, features: First, we argue that the standard notion of degree (a number on a measuring scale) needs to be replaced by a notion of structured degree, which keeps track of the object measured. Second, we argue that at the CP-level of degree relatives an operation of (degree) maximalization takes place. We show that the observed facts concerning degree relatives follow from these assumptions. We then broaden the discussion to other relative clause constructions. We propose that the operation of maximalization takes place in relative clauses when the head noun is semantically interpreted CP-internally, while syntactically the CP is part of a DP that also contains CP-external material. Based on this, we argue that degree relatives form part of a linguistically coherent class of relative clause constructions -- we call them maximalizing relatives -- which all show restrictions similar to those observed for degree relatives, and which differ semantically (and often also syntactically) both from restrictive relative clauses and from appositives. We discuss free relatives, internally-headed relatives, and correlatives. (shrink)

We study the algorithmic complexity of embeddings between bi-embeddable equivalence structures. We define the notions of computable bi-embeddable categoricity, \ bi-embeddable categoricity, and degrees of bi-embeddable categoricity. These notions mirror the classical notions used to study the complexity of isomorphisms between structures. We show that the notions of \ bi-embeddable categoricity and relative \ bi-embeddable categoricity coincide for equivalence structures for \. We also prove that computable equivalence structures have degree of bi-embeddable categoricity \, or \. We furthermore (...) obtain results on the index set complexity of computable equivalence structure with respect to bi-embeddability. (shrink)

Any value statement belongs to a certain value code shared, to a certain degree, by a number of people. Is the value code itself relative or not? To solve this problem, one must assume that universal value statements and principles always have a prima‐facie character. Prima‐facie value propositions not only claim universality but can also be understood as universally valid in the following sense. First, their validity does not depend on an individual's free preferences. Second, although they are (...) culture‐bound, there is something all cultures must have in common. But such prima‐facie propositions do not logically imply a moral judgement in any particular case. They are merely a starting point of an evaluation procedure, i.e., of weighing and balancing, nothing more. On the other hand, the final (contextual, all things considered) evaluations are necessarily relative to a certain culture and, indeed, to individual preferences. When claiming universality of values, people see the first side of the problem. When endorsing relativism, they see only the second side. (shrink)

This article examines the epistemology of risk assessment in the context of financial modelling for the purposes of making loan underwriting decisions. A financing request for a company in the paper and pulp industry is considered in some detail. The paper and pulp industry was chosen because it is subject to some specific risks that have been identified and studied by bankers, investors and managers of paper and pulp companies and certain features of the industry enable analysts to quantify the (...) impact of specific risk events of a given dimension on a company's future financial performance. While companies in other industries may be subject to similar risk factors, the impact of risk events may be more difficult to gauge in those industries. The ability of financial analysts to model the impact of a risk event, and hence quantify a credit risk, increases the predictive accuracy of the model. I argue that bankers and regulators should recognise the uncertainty associated with unquantifiable credit risk in financial models, and they should view this uncertainty as a credit risk factor in and of itself. Evaluating the relative degree to which credit risk is quantifiable in financial models is a potentially significant yet largely unrecognised tool for credit risk management. I consider some possible applications of this assessment tool for managing risk within the banking industry. (shrink)

It has been repeatedly argued, most recently by Nicholas Maxwell, that the special theory of relativity is incompatible with the view that the future is in some degree undetermined; and Maxwell contends that this is a reason to reject that theory. In the present paper, an analysis is offered of the notion of indeterminateness (or "becoming") that is uniquely appropriate to the special theory of relativity, in the light of a set of natural conditions upon such a notion; and (...) reasons are given for regarding this conception as (not just formally consistent with relativity theory, but also) philosophically reasonable. The bearings upon Maxwell's program for quantum theory are briefly considered. (shrink)

Coherence is the property of propositions hanging or fitting together. Intuitively, adding a proposition to a set of propositions should be compatible with either increasing or decreasing the set’s degree of coherence. In this paper we show that probabilistic coherence measures based on relative overlap are in conflict with this intuitive verdict. More precisely, we prove that according to the naive overlap measure it is impossible to increase a set’s degree of coherence by adding propositions and that (...) according to the refined overlap measure no set’s degree of coherence exceeds the degree of coherence of its maximally coherent subset. We also show that this result carries over to all other subset-sensitive refinements of the naive overlap measure. As both results stand in sharp contrast to elementary coherence intuitions, we conclude that extant relative overlap measures of coherence are inadequate. (shrink)

A down-to-earth admission of abstract objects can be based on detailed explanation of where the objectivity of mathematics comes from, and how a ‘thin’ notion of object emerges from objective mathematical discourse or practices. We offer a sketch of arguments concerning both points, as a basis for critical scrutiny of the idea that mathematical and social objects are essentially of the same kind—which is criticized. Some authors have proposed that mathematical entities are indeed institutional objects, a product of our collective (...) imposition of function onto reality (the phrase comes from Searle) and of surrogation or hypostasis. Yet there are significant disanalogies between the typical social objects and mathemata, on which basis I argue that one should make a clear distinction between both. The comparison of mathematical with social objects helps understanding how non-physical objects can figure prominently in our explanations of reality. Yet mathematical objects have a different kind of cognitive grounding, and the more elementary of them emerge under relatively very simple sociocultural conditions. The differences are also reflected in the wide scope of use of mathematical concepts, and the much higher degree of variation found among social objects. On the basis of all of these features, I defend the thesis that one can significantly distinguish degrees of objectivity, and I use the distinction to articulate a graded ontology where one can locate the different kinds of mathematical and social objects. (shrink)

Visual information conveyed by iconic hand gestures and visible speech can enhance speech comprehension under adverse listening conditions for both native and non‐native listeners. However, how a listener allocates visual attention to these articulators during speech comprehension is unknown. We used eye‐tracking to investigate whether and how native and highly proficient non‐native listeners of Dutch allocated overt eye gaze to visible speech and gestures during clear and degraded speech comprehension. Participants watched video clips of an actress uttering a clear or (...) degraded (6‐band noise‐vocoded) action verb while performing a gesture or not, and were asked to indicate the word they heard in a cued‐recall task. Gestural enhancement was the largest (i.e., a relative reduction in reaction time cost) when speech was degraded for all listeners, but it was stronger for native listeners. Both native and non‐native listeners mostly gazed at the face during comprehension, but non‐native listeners gazed more often at gestures than native listeners. However, only native but not non‐native listeners' gaze allocation to gestures predicted gestural benefit during degraded speech comprehension. We conclude that non‐native listeners might gaze at gesture more as it might be more challenging for non‐native listeners to resolve the degraded auditory cues and couple those cues to phonological information that is conveyed by visible speech. This diminished phonological knowledge might hinder the use of semantic information that is conveyed by gestures for non‐native compared to native listeners. Our results demonstrate that the degree of language experience impacts overt visual attention to visual articulators, resulting in different visual benefits for native versus non‐native listeners. (shrink)

The determination of inertia by matter is looked at in general relativity, where inertia can be represented by affine or projective structure. The matter tensor T seems to underdetermine affine structure by ten degrees of freedom, eight of which can be eliminated by gauge choices, leaving two. Their physical meaning---which is bound up with that of gravitational waves and the pseudotensor t, and with the conservation of energy-momentum---is considered, along with the dependence of reality on invariance and of causal explanation (...) on conservation. (shrink)

Recall that B is PA relative to A if B computes a member of every nonempty $\Pi ^0_1(A)$ class. This two-place relation is invariant under Turing equivalence and so can be thought of as a binary relation on Turing degrees. Miller and Soskova [23] introduced the notion of a $\Pi ^0_1$ class relative to an enumeration oracle A, which they called a $\Pi ^0_1{\left \langle {A}\right \rangle }$ class. We study the induced extension of the relation B is (...) PA relative to A to enumeration oracles and hence enumeration degrees. We isolate several classes of enumeration degrees based on their behavior with respect to this relation: the PA bounded degrees, the degrees that have a universal class, the low for PA degrees, and the ${\left \langle {\text {self}\kern1pt}\right \rangle }$ -PA degrees. We study the relationship between these classes and other known classes of enumeration degrees. We also investigate a group of classes of enumeration degrees that were introduced by Kalimullin and Puzarenko [14] based on properties that are commonly studied in descriptive set theory. As part of this investigation, we give characterizations of three of their classes in terms of a special sub-collection of relativized $\Pi ^0_1$ classes—the separating classes. These three can then be seen to be direct analogues of three of our classes. We completely determine the relative position of all classes in question. (shrink)

We show that the Turing degrees are not sufficient to measure the complexity of continuous functions on [0, 1]. Computability of continuous real functions is a standard notion from computable analysis. However, no satisfactory theory of degrees of continuous functions exists. We introduce the continuous degrees and prove that they are a proper extension of the Turing degrees and a proper substructure of the enumeration degrees. Call continuous degrees which are not Turing degrees non-total. Several fundamental results are proved: a (...) continuous function with non-total degree has no least degree representation, settling a question asked by Pour-El and Lempp; every non-computable f $\epsilon \mathcal{C}[0, 1]$ computes a non-computable subset of $\mathbb{N}$ ; there is a non-total degree between Turing degrees $a _\eqslantless_{\tau}$ b iff b is a PA degree relative to a; $\mathcal{S} \subseteq 2^{\mathbb{N}}$ is a Scott set iff it is the collection of f-computable subsets of $\mathbb{N}$ for some f $\epsilon \mathcal{C}[O, 1]$ of non-total degree; and there are computably incomparable f, g $\epsilon \mathcal{C}[0, 1]$ which compute exactly the same subsets of $\mathbb{N}$ . Proofs draw from classical analysis and constructive analysis as well as from computability theory. (shrink)

Relatives’ presence in connection with cardiopulmonary resuscitation and sudden death at the intensive care unit Within Norwegian intensive care units it is common to focus on the needs of the next of kin of patients undergoing end‐of‐life care. Offering emotional and practical support to relatives is regarded as assisting them in the initial stages of their grief process. It has also become usual to encourage relatives to be present at the time of death of close relatives. How can dignified end‐of‐life (...) care coexist with the sometimes turbulent and dramatic character of intensive care in the highly technological environment of intensive care units? This paper describes a case study based on an incident that took place at the intensive care unit (ICU) of Trondheim University Hospital, Norway, in which the relatives of a newly deceased patient voiced unusually strong dissatisfaction with the way they were excluded in connection with cardiopulmonary resuscitation (CPR). The next of kin's criticism highlights an important paradox as well as a degree of inconsistency in lifesaving and end‐of‐life care at the ICU. I argue that an investigation of the multiple identities within medical practice can illuminate the potential for clashes between lifesaving and end‐of‐life care, as described and analysed in this paper. (shrink)

From the early-1950s on, F.A. Hayek was concerned with the development of a methodology of sciences that study systems of complex phenomena. Hayek argued that the knowledge that can be acquired about such systems is, in virtue of their complexity (and the comparatively narrow boundaries of human cognitive faculties), relatively limited. The paper aims to elucidate the implications of Hayek’s methodology with respect to the specific dimensions along which the scientist’s knowledge of some complex phenomena may be limited. Hayek’s fallibilism (...) was an essential (if not always explicit) aspect of his arguments against the defenders of both socialism ([1935] 1948, [1940] 1948) and countercyclical monetary policy ([1975] 1978); yet, despite the fact that his conceptions of both complex phenomena and the methodology appropriate to their investigation imply that ignorance might beset the scientist in multiple respects, he never explicated all of these consequences. The specificity of a scientific prediction depends on the extent of the scientist’s knowledge concerning the phenomena under investigation. The paper offers an account of the considerations that determine the extent to which a theory’s implications prohibit the occurrence of particular events in the relevant domain. This theory of “predictive degree” both expresses and – as the phenomena of scientific prediction are themselves complex in Hayek’s sense – exemplifies the intuition that the specificity of a scientific prediction depends on the relevant knowledge available. (shrink)

A set of natural numbers B is computably enumerable in and strictly above (or c.e.a. for short) another set C if C < T B and B is computably enumerable in C. A Turing degree b is c.e.a. c if b and c respectively contain B and C as above. In this paper, it is shown that if b is c.e.a. c then b is c.e.a. some 1-generic g.

We show that the intersection of the class of 2-REA degrees with that of the ω-r.e. degrees consists precisely of the class of d.r.e. degrees. We also include some applications and show that there is no natural generalization of this result to higher levels of the REA hierarchy.

Our aim is to propose a non-referential semantics for the principle of logical charity: neither logical universalism (one logic, one way of thinking), nor logical relativism (several logics, several ways of thinking) afford an adequate conceptual framework to interpret the meaning of any speech act. But neither of them is totally wrong, either. The point is to know to which extent each of these views is partly right, thus leading to a more consensual but paradoxical-sounding "relative principle of charity". (...) After recalling the theoretical background of logical charity, we suggest a four-valued logic of acceptance and rejection (hereafter: AR4); then we explain how such a non-referential semantics does justice both to the champions of logical charity and its opponents. While endorsing coherence as a precondition for rationality, we argue that such a criterion does not entail that classical logic is a necessary conceptual scheme to interpret the others' beliefs. A better application of charity should take account of the questions implicitly asked by a statement, and we bring these questions out in replacing Quine's truth-functions by Quine’s verdict functions while emphasizing upon their varying degrees of strength. (shrink)

In nonstandard mathematics, the predicate ‘x is standard’ is fundamental. Recently, ‘relative’ or ‘stratified’ nonstandard theories have been developed in which this predicate is replaced with ‘x is y -standard’. Thus, objects are not standard in an absolute sense, but standard relative to other objects and there is a whole stratified universe of ‘levels’ or ‘degrees’ of standardness. Here, we study stratified nonstandard arithmetic and the related transfer principle. Using the latter, we obtain the ‘reduction theorem’ which states (...) that arithmetical formulas can be reduced to equivalent bounded formulas. Surprisingly, the reduction theorem is also equivalent to the transfer principle. As applications, we obtain a truth definition for arithmetical sentences and we formalize Nelson's notion of impredicativity. (shrink)

In this paper, we present a contest success function, which is homogeneous of degree zero and in which the probability of winning the prize depends on the relative difference of efforts. In a simultaneous game with two players, we present a necessary and sufficient condition for the existence of a pure strategy Nash equilibrium. This equilibrium is unique and interior. This condition does not depend on the size of the valuations as in an absolute difference CSF. We prove (...) that several properties of Nash equilibrium with the Tullock CSF still hold in our framework. Finally, we consider the case of n\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n$$\end{document} players, generalize the previous condition and show that this condition is sufficient for the existence of a unique interior Nash equilibrium in pure strategies. For some parameter values of our CSF and when all players are identical, equilibrium entails full rent dissipation for any number of players. (shrink)

This paper aims to shed light on the terminological and conceptual area around linguistic relativity (nowadays a mostly empirically conceived problem), namely the relations with relativism as a philosophical position. Throughout history and up to now there has been a degree of confusion in handling the terms ‘linguistic relativity’, ‘linguistic relativism’, ‘linguistic determinism’ and the like, all in a more or less conscious fashion. Here it is clarified that linguistic relativity, at least as construed by the recent Neo-Whorfian literature (...) (but also in some important sense, from Whorf ’s own point of view as well) is not, by definition, the same as linguistic determinism, but neither is a form or relativism. On the other hand, relativism, maintains the recent philosophical literature, is a family of theses that share a number of common features even though a single defining core is not easily identifiable. While linguistic relativity does have some connections with some of those features, to make it collapse into an easily dismissible kind of relativism is a crucial misconception of the nature and scopes of such an idea, i.e., that different languages have a different bearing on speakers’ cognition and actions. (shrink)

Given two infinite binary sequences A,B we say that B can compress at least as well as A if the prefix-free Kolmogorov complexity relative to B of any binary string is at most as much as the prefix-free Kolmogorov complexity relative to A, modulo a constant. This relation, introduced in Nies [14] and denoted by A≤LKB, is a measure of relative compressing power of oracles, in the same way that Turing reducibility is a measure of relative (...) information. The equivalence classes induced by ≤LK are called LK degrees and there is a least degree containing the oracles which can only compress as much as a computable oracle, also called the ‘low for K’ sets. A well-known result from Nies [14] states that these coincide with the K-trivial sets, which are the ones whose initial segments have minimal prefix-free Kolmogorov complexity. We show that with respect to ≤LK, given any non-trivial sets X,Y there is a computably enumerable set A which is not K-trivial and it is below X,Y. This shows that the local structures of and Turing degrees are not elementarily equivalent to the corresponding local structures in the LK degrees. It also shows that there is no pair of sets computable from the halting problem which forms a minimal pair in the LK degrees; this is sharp in terms of the jump, as it is known that there are sets computable from which form a minimal pair in the LK degrees. We also show that the structure of LK degrees below the LK degree of the halting problem is not elementarily equivalent to the or structures of LK degrees. The proofs introduce a new technique of permitting below a set that is not K-trivial, which is likely to have wider applications. (shrink)

The computable Lipschitz reducibility was introduced by Downey, Hirschfeldt and LaForte under the name of strong weak truth-table reducibility [6]). This reducibility measures both the relative randomness and the relative computational power of real numbers. This paper proves that the computable Lipschitz degrees of computably enumerable sets are not dense. An immediate corollary is that the Solovay degrees of strongly c.e. reals are not dense. There are similarities to Barmpalias and Lewis’ proof that the identity bounded Turing degrees (...) of c.e. sets are not dense [2]), however the problem for the computable Lipschitz degrees is more complex. (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)

Contemporary research in compositional, truth-conditional semantics often takes judgments of the relative unacceptability of certain phrasal combinations as evidence for lexical semantics. For example, observing that completely full sounds perfectly natural whereas completely tall does not has been used to motivate a distinction whereby the lexical entry for full but not for tall specifies a scalar endpoint. So far, such inferences seem unobjectionable. In general, however, applying this methodology can lead to dubious conclusions. For example, observing that slightly bent (...) is natural but slightly cheap is not (that is, not without a “too cheap” interpretation) leads researchers to suggest that the interpretation of bent involves a scalar minimum but cheap does not, contra intuition—after all, one would think that what is minimally cheap is (just) free. Such claims, found in sufficient abundance, raise the question of how we can support semantic theories that posit properties of entities that those entities appear to lack. This paper argues, using theories of adjectival scale structure as a test case, that the (un)acceptability data recruited in semantic explanations reveals properties of a two-stage system of semantic interpretation that can support divergences between our semantic and metaphysical intuitions. (shrink)

This article provides an empirically based, interdisciplinary approach to the following two questions: Do animals possess behavioral and cognitive characteristics such as culture, language, and a theory of mind? And if so, what are the implications, when long-standing criteria used to justify differences in moral consideration between humans and animals are no longer considered indisputable? One basic implication is that the psychological needs of captive animals should be adequately catered for. However, for species such as great apes and dolphins with (...) whom we share major characteristics of personhood, welfare considerations alone may not suffice, and consideration of basic rights may be morally warranted—as for humans. Although characteristics supporting the status of personhood are present to differing degrees among the diverse array of animal species, this is a barrier to moral consideration only if anthropocentric, exclusive, and monolithic viewpoints about the necessary prerequisites for personhood are applied. We examine the flaws inherent within such positions and argue for inalienable species-appropriate rights. (shrink)

Wellbeing describes how good life is for the person living it. Wellbeing comes in degrees. Subjective theories of wellbeing maintain that for objects or states of affairs to benefit us, we need to have a positive attitude towards these objects or states of affairs: the Resonance Constraint. In this article, we investigate to what extent subjectivism can plausibly account for degrees of wellbeing. There is a vast literature on whether preference-satisfaction theory – one particular subjective theory – can account for (...) degrees of wellbeing. This is generally taken to be problematic. However, other subjective theories – namely, desire-satisfaction, judgment- and value-fulfillment theories – do not suffer from the same difficulties. We introduce two models of degrees of wellbeing a subjectivist can employ: the Relative and the Absolute Model, and defend the claim that both models face difficulties. In particular, we argue that a subjectivist theory should describe instances of depression as instances of low degrees of wellbeing. We also argue that a reduction of desires may sometimes improve one’s degree of wellbeing, an idea we call the Epicurean Intuition. We then argue that the Relative Model fails to account for the disbenefit of certain types of depression, while the Absolute Model fails to meet a central commitment of subjectivism – the Resonance Constraint – and is unable to accommodate the Epicurean Intuition. The upshot of the paper is that subjectivist theories cannot account for degrees of well-being in a plausible way. (shrink)

We prove, relative to suitable hypotheses, that it is consistent for there to be unboundedly many measurable cardinals each of which possesses a large degree of strong compactness, and that it is consistent to assume that the least measurable is partially strongly compact and that the second measurable is strongly compact. These results partially answer questions of Magidor on the relationship of strong compactness to measurability.

In the interesting discussion between Margenau and Werkmeister a baffling dilemma arises:If verification of constructs makes up reality, and if verifications work retroactively, several different realities may exist at the same time.The writer, who—as a positivist—cannot accept a transcendental reality, as Werkmeister seemingly does, is not disturbed by a multitude of realities. He identifies reality with the most familiar and most generalized cognition. As such it varies with the mechanism of cognition and with the type and degree of integration.

The purpose of the present paper is to develop kinematics of the special relativity with an anisotropy of the one-way speed of light. As distinct from a common approach, when the issue of anisotropy of the light propagation is placed into the context of conventionality of distant simultaneity, it is supposed that an anisotropy of the one-way speed of light is due to a real space anisotropy. In that situation, some assumptions used in developing the standard special relativity kinematics are (...) not valid so that the “anisotropic special relativity” kinematics should be developed based on the first principles, without refereeing to the relations of the standard relativity theory. In particular, using condition of invariance of the interval between two events becomes unfounded in the presence of anisotropy of space since the standard proofs drawing the interval invariance from the invariance of equation of light propagation are not valid in that situation. Instead, the invariance of the equation of light propagation, which is a physical law, should be taken as a first principle. A number of other physical requirements, associativity, reciprocity and so on are satisfied by the requirement that the transformations between the frames form a group. Finally, the correspondence principle is to be satisfied which implies that the coordinate transformations should turn into the Galilean transformations in the limit of small velocities. The above formulation based on the invariance and group property suggests applying the Lie group theory apparatus which includes the following steps: constructing determining equations for the infinitesimal group generators using the invariance condition; solving the determining equations; specifying the solutions using the correspondence principle; defining the finite transformations by solving the Lie equations; relating the group parameter to physical parameters. The transformations derived in such a way, as distinct from the transformations derived in the context of conventionality of distant simultaneity, cannot be converted into the standard Lorentz transformations by a coordinate change. The anisotropic nature of the presented transformations manifests itself in that they do not leave the interval invariant but only provide the conformal invariance of the interval. The relations that represent measurable effects include the conformal factor which depends on the relative velocity of the frames and the anisotropy degree. It is important to note the use of the correspondence principle as a heuristic principle which allows to relate the conformal factor to the anisotropy degree and thus completely specify the transformations and observable quantities. (shrink)

Relative overlap measures of coherence have recently been shown to have two devastating properties: according to the plain relative overlap measure, the degree of coherence of any set of propositions cannot be increased by adding further propositions, and according to the refined relative overlap measure, no set can be more coherent than its most coherent two-element subset. This result has been taken to rule out relative overlap as a foundation for a probabilistic explication of coherence. (...) The present paper shows that this view is premature: we propose a relative overlap measure that does not fall victim to the two properties. The guiding idea is to employ a well-established recipe for the construction of coherence measures and to adapt it to the idea of relative overlap. We show that this new measure keeps up with, or even outperforms, former overlap measures in a set of desiderata for coherence measures and a collection of popular test cases. This result re-establishes relative overlap as a candidate for a proper formalization of coherence. (shrink)

We establish the equiconsistency of a simple statement in definability theory with the failure of the GCH at all infinite cardinals. The latter was shown by Foreman and Woodin to be consistent, relative to the existence of large cardinals.

We prove that there is a structure, indeed a linear ordering, whose degree spectrum is the set of all non-hyperarithmetic degrees. We also show that degree spectra can distinguish measure from category.