Citations of:
Add citations
You must login to add citations.


I consider a serious objection to the knowledge account of assertion and develop a response. In the process I introduce important new data on prompting assertion, which all theorists working in the area should take note of. 

(No abstract is available for this citation). 



Is it logically possible to perform a "superfeat"? That is, is it logically possible to complete, in a finite time, an infinite sequence of distinct acts? In opposition to the received view, I argue that all physical superfeats have kinematic features that make them logically impossible. 

In this paper, I present a discrete solution for the paradox of Achilles and the tortoise. I argue that Achilles overtakes the tortoise after a finite number of steps of Zeno’s argument if time is represented as discrete. I then answer two objections that could be made against this solution. First, I argue that the discrete solution is not an ad hoc solution. It is embedded in a discrete formulation of classical mechanics. Second, I show that the discrete solution cannot (...) 

Infinite time Turing machines extend the operation of ordinary Turing machines into transfinite ordinal time. By doing so, they provide a natural model of infinitary computability, a theoretical setting for the analysis of the power and limitations of supertask algorithms. 

The goal is to sketch a nominalist approach to mathematics which just like neologicism employs abstraction principles, but unlike neologicism is not committed to the idea that mathematical objects exist and does not insist that abstraction principles establish the reference of abstract terms. It is wellknown that neologicism runs into certain philosophical problems and faces the technical difficulty of finding appropriate acceptability criteria for abstraction principles. I will argue that a modal and iterative nominalist approach to abstraction principles circumvents those (...) 