Not knowing a cat is a cat: analyticity and knowledge ascriptions

It is a natural assumption in mainstream epistemological theory that ascriptions of knowledge of a proposition p track strength of epistemic position vis-à-vis p. It is equally natural to assume that the strength of one’s epistemic position is maximally high in cases where p concerns a simple analytic truth (as opposed to an empirical truth). For instance, it seems reasonable to suppose that one's epistemic position vis-à-vis “a cat is a cat” is harder to improve than one's position vis-à-vis “a cat is on the mat”, and consequently, that the former is at least as unambiguous a case of knowledge as the latter. The current paper, however, presents empirical evidence which challenges this intuitive line of reasoning. Our study on the epistemic intuitions of hundreds of academic philosophers supports the idea that simple and uncontroversial analytic propositions are less likely to qualify as knowledge than empirical ones. We show that our results, though at odds with orthodox theories of knowledge in mainstream epistemology, can be explained in a way consistent with Wittgenstein's remarks on 'hinge propositions' or with Stalnaker's pragmatics of assertion. We then present and evaluate a number of lines of response mainstream theories of knowledge could appeal to in accommodating our results. Finally, we show how each line of response runs into some prima facie difficulties. Thus, our observed asymmetry between knowing “a cat is a cat” and knowing “a cat is on the mat” presents a puzzle which mainstream epistemology needs to resolve

Asymptotically almost all \lambda-terms are strongly normalizing

We present quantitative analysis of various (syntactic and behavioral) properties of random \lambda-terms. Our main results are that asymptotically all the terms are strongly normalizing and that any fixed closed term almost never appears in a random term. Surprisingly, in combinatory logic (the translation of the \lambda-calculus into combinators), the result is exactly opposite. We show that almost all terms are not strongly normalizing. This is due to the fact that any fixed combinator almost always appears in a random combinator