In this paper, we explore an under-investigated question concerning the class of formal models that aim at providing normative guidance. We call such models normative models. In particular, we examine the question of how normative models can successfully exert normative guidance. First, we highlight the absence of a discussion of this question – which is surprising given the extensive debate about the success conditions of descriptive models – and motivate its importance. Second, we introduce and discuss two potential accounts of (...) the success conditions of normative models. Our tentative conclusion is that the second account is more promising. (shrink)

In this paper, we explicate an underappreciated distinction between two conceptions of valuing. According to the first conception, which we call the surface-account, valuing something is exclusively a matter of having certain behavioral, cognitive, and emotional dispositions. In contrast, the second conception, which we call the layer-account, posits that valuing is constituted by the presence of certain representational mental states underlying those dispositions. In the first part of the paper, we introduce the distinction in proper detail and show that the (...) accounts have different implications regarding the valuings of agents. In the second part, we situate the accounts within the extant philosophical literature. First, we relate them to the recent debate between so-called dispositionalists and representationalists about the nature of beliefs and point out that this debate can help anticipate some of the main dialectical fault lines to be expected between surface- and layer-theorists. Second, we examine the contemporary meta-ethical debate on conceptualizing valuing, indicate that scholars have largely ignored the distinction introduced here, and outline that this oversight has substantial theoretical costs: as we show, key arguments within the meta-ethical debate require thorough re-evaluation in light of the proposed distinction. The third part of the paper illustrates the theoretical leverage of the distinction for practical research by exploring its implications for behavioral welfare economics. (shrink)

In this paper, I argue that the disjunction elimination rule presupposes the principle that a true disjunction contains at least one true disjunct. However, in some contexts such as supervaluationism or quantum logic, we have good reasons to reject this principle. Hence, disjunction elimination is restricted in at least one respect: it is not applicable to disjunctions for which this principle does not hold. The insight that disjunction elimination presupposes the principle that a true disjunction contains at least one true (...) disjunct is applied to two arguments which argue for this very principle. I show that these arguments are rule-circular since they rest on disjunction elimination. I claim that rule-circularity better explains why the arguments fail than the explanations provided by Rumfitt (2015), which, for instance, rely on controversial principles about truth. (shrink)

We extend the techniques of Jahn to show the index set of the major subsets to be ∑5-complete. This was a question left open in Lempp and its solution involves a level-4 construction. We also show how the measuring of e-states arises naturally out of our iterated-trees approach to breaking up requirements.

There seems to exist a general consensus on how to conceptualize cooperation in the field of international relations (IR). We argue that this impression is deceptive. In practice, scholars working on the causes of international cooperation have come to implicitly employ various understandings of what cooperation is. Yet, an explicit debate about the discipline's conceptual foundations never materialized, and whatever discussion occurred did so only latently and without much dialog across theoretical traditions. In this paper, we develop an updated conceptual (...) framework by exploring the nature of these differing understandings and situating them within broader theoretical conversations about the role of cooperation in IR. Drawing on an array of studies in IR and philosophy, our framework distinguishes between three distinct types of cooperative state interactions – cooperation through tacit policy coordination (‘minimal’ cooperation), cooperation through explicit policy coordination (‘thin’ cooperation), and cooperation based on joint action (‘thick’ cooperation). The framework contributes to better theorization about cooperation in two main ways: it allows scholars across theoretical traditions to identify important sources of disagreement and previously unnoticed theoretical common ground; and the conceptual disaggregation it provides grants scholars crucial theoretical leverage by enabling type-specific causal theorization. (shrink)

We employ techniques related to Lempp and Lerman's “iterated trees of strategies” to directly measure a Σ5-predicate and use this in showing the index set of the cuppable r.e. sets to be Σ5-complete. We also show how certain technical devices arise naturally out of the iterated-trees context, in particular, links arise as manifestations of a generalized notion of “stage”.

We prove that any speedable computably enumerable set may be split into a disjoint pair of speedable computably enumerable sets. This solves a longstanding question of J.B. Remmel concerning the behavior of computably enumerable sets in Blum's machine independent complexity theory. We specify dynamic requirements and implement a novel way of detecting speedability-by embedding the relevant measurements into the substage structure of the tree construction. Technical difficulties in satisfying the dynamic requirements lead us to implement "local" strategies that only look (...) down the tree. The (obvious) problems with locality are then resolved by placing an isomorphic copy of the entire priority tree below each strategy (yielding a self-similar tree). This part of the construction could be replaced by an application of the Recursion Theorem, but shows how to achieve the same effect with a more direct construction. (shrink)

We employ techniques related to Lempp and Lerman's “iterated trees of strategies” to directly measure a Σ5-predicate and use this in showing the index set of the cuppable r.e. sets to be Σ5-complete. We also show how certain technical devices arise naturally out of the iterated-trees context, in particular, links arise as manifestations of a generalized notion of “stage”.