Graduate studies at Western
Analysis 62 (3):182-87 (2002)
|Abstract||Iteration presents opposing puzzles for a theory of the imagination. The first puzzle, noted by David Lewis, is that when a person pretends to pretend, the iteration is often preserved. Let’s call this the puzzle of ‘pre- served iteration’. At the other pole, Gregory Currie has noted that very often when we pretend to pretend, the iteration does collapse. We might call this the puzzle of ‘collapsed iteration’. Somehow a theory of the imagination must be able to address these two puzzles. I argue that an empirically inspired cognitive theory of the imagination (Nichols & Stich 2000) can accommodate both puzzles.|
|Keywords||Imagination Iteration Metaphysics Pretence Lewis, D|
|Categories||categorize this paper)|
Similar books and articles
Kendall Lewis Walton (2006). On the (so-Called) Puzzle of Imaginative Resistance. In Shaun Nichols (ed.), The Architecture of the Imagination. Oxford University Press.
Robert Goldblatt (1982). The Semantics of HOARE's Iteration Rule. Studia Logica 41 (2-3):141 - 158.
Ralph Matthes (2002). Tarski's Fixed-Point Theorem and Lambda Calculi with Monotone Inductive Types. Synthese 133 (1-2):107 - 129.
Shaun Nichols (2004). Imagining and Believing: The Promise of a Single Code. Journal of Aesthetics and Art Criticism 62 (2):129-39.
Shaun Nichols (ed.) (2006). The Architecture of the Imagination: New Essays on Pretence, Possibility, and Fiction. Oxford University Press.
Jakub Szymanik (2010). Almost All Complex Quantifiers Are Simple. In C. Ebert, G. Jäger, M. Kracht & J. Michaelis (eds.), Mathematics of Language 10/11, Lecture Notes in Computer Science 6149. Springer.
Jonathan M. Weinberg & Aaron Meskin (2006). Puzzling Over the Imagination: Philosophical Problems, Architectural Solutions. In Shaun Nichols (ed.), The Architecture of the Imagination: New Essays on Pretence, Possibility, and Fiction. Oxford.
Janusz Pawlikowski (1990). Finite Support Iteration and Strong Measure Zero Sets. Journal of Symbolic Logic 55 (2):674-677.
Itay Neeman & John Steel (1999). A Weak Dodd-Jensen Lemma. Journal of Symbolic Logic 64 (3):1285-1294.
Alessandro Andretta (1991). Building Iteration Trees. Journal of Symbolic Logic 56 (4):1369-1384.
Added to index2009-01-28
Total downloads26 ( #53,623 of 739,404 )
Recent downloads (6 months)7 ( #13,426 of 739,404 )
How can I increase my downloads?