منابع مشابه
Does Perceiving Entail Knowing?
This paper accomplishes two closely connected things. First, it refutes an influential view about the relationship between perception and knowledge. In particular, it demonstrates that perceiving does not entail knowing. Second, it leverages that refutation to demonstrate that knowledge is not the most general factive propositional attitude.
متن کاملDoes Compositionality Entail Complexity ?
The view that propositions are mereologically complex structured entities is the regnant paradigm in the philosophy of language and linguistics. As Steven Schiffer says, “Virtually every propositionalist accepts [compositionality] and rejects unstructured propositions”, and even the “new” theories of propositions defended by Peter Hanks, Jeffrey King, Scott Soames, and Jeff Speaks take proposit...
متن کاملDoes collective rationality entail efficiency?
Collective rationality in its ordinary sense is rationality’s extension to groups. It does not entail efficiency by definition. Showing that it entails efficiency requires a normative argument. Game theorists treating cooperative games generally assume that collective rationality entails efficiency, but formulating the reasoning that leads individuals to efficiency, and verifying the rationalit...
متن کاملDoes Conceivability Entail Possibility? 1
There is a long tradition in philosophy of using a priori methods to draw conclusions about what is possible and what is necessary, and often in turn to draw conclusions about matters of substantive metaphysics. Arguments like this typically have three steps: first an epistemic claim (about what can be known or conceived), from there to a modal claim (about what is possible or necessary), and f...
متن کاملDisjoint-Access Parallelism Does Not Entail Scalability
Disjoint Access Parallelism (DAP) stipulates that operations involving disjoint sets of memory words must be able to progress independently, without interfering with each other. In this work we argue towards revising the two decade old wisdom saying that DAP is a binary condition that splits concurrent programs into scalable and non-scalable. We first present situations where DAP algorithms sca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Noûs
سال: 2014
ISSN: 0029-4624
DOI: 10.1111/nous.12063