The strong law of large numbers and considerations concerning additional information strongly suggest that Beauty upon awakening has probability 1/3 to be in a heads-awakening but should still believe the probability that the coin landed heads in the Sunday toss to be 1/2. The problem is that she is in a heads-awakening if and only if the coin landed heads. So, how can she rationally assign different probabilities or credences to propositions she knows imply each other? This is the problem (...) I address in this article. I suggest that ‘p whenever q and vice versa’ may be consistent with p and q having different probabilities if one of them refers to a sample space containing ordinary possible worlds and the other to a sample space containing centred possible worlds, because such spaces may fail to combine into one composite probability space and, as a consequence, ‘whenever’ may not be well defined; such is the main contribution of this article. 1The Sleeping Beauty Game2Groisman’s and Peter Lewis’s Approaches3Discussing Beauty’s Credences4The Principle of Equivalence's Failure5Making Sense of the Principle of Equivalence's Failure6Elga’s and Lewis’s Approaches7ConclusionAppendix. (shrink)

Cantor’s proof that the powerset of the set of all natural numbers is uncountable yields a version of Richard’s paradox when restricted to the full definable universe, that is, to the universe containing all objects that can be defined not just in one formal language but by means of the full expressive power of natural language: this universe seems to be countable on one account and uncountable on another. We argue that the claim that definitional contexts impose restrictions on the (...) scope of quantifiers reveals a natural way out. (shrink)

The Monist’s call for papers for this issue ended: “if formalism is true, then it must be possible in principle to mechanize meaning in a conscious thinking and language-using machine; if intentionalism is true, no such project is intelligible”. We use the Grelling-Nelson paradox to show that natural language is indefinitely extensible, which has two important consequences: it cannot be formalized and model theoretic semantics, standard for formal languages, is not suitable for it. We also point out that object-object mapping (...) theories of semantics, the usual account for the possibility of non intentional semantics, doesn’t seem able to account for the indefinitely extensible productivity of natural language. (shrink)

We model infinite regress structures -not arguments- by means of ungrounded recursively defined functions in order to show that no such structure can perform the task of providing determination to the items composing it, that is, that no determination process containing an infinite regress structure is successful.

We propose certain clases that seem unable to form a completed totality though they are very small, finite, in fact. We suggest that the existence of such clases lends support to an interpretation of the existence of proper clases in terms of availability, not size.