You are not currently logged in.
Access your personal account or get JSTOR access through your library or other institution:
Ineffectual Foundations: Reply to Gwiazda
Vol. 119, No. 476 (October 2010), pp. 1125-1133
Stable URL: http://www.jstor.org/stable/23012206
Page Count: 9
Preview not available
In an earlier paper I argued that there are cases in which an infinite probabilistic chain can be completed (Peijnenburg 2007). According to Jeremy Gwiazda, however, I have merely shown that the chain in question can be computed, not that it can be completed (Gwiazda 2010). Gwiazda thereby discriminates between two terms that I used as synonyms. In the present paper I discuss to what extent computability and completability can be meaningfully distinguished.
Mind © 2010 Oxford University Press