A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Representationalism and Mental Representation

College Depth 96 in the knowledge graph I know this Set as goal
46topics build on this
628prerequisites beneath it
See this on the map →
Intentionality and Mental ContentFirst-Order Logic Semantics and Structures+2 moreComputational Theory of MindExternalism about Mental Content+7 more
representationalism mental-representation content perception

Core Idea

Representationalism is the view that all mental states, including conscious experiences, are to be understood in terms of their representational content — what they represent the world as being like. On this view, the phenomenal character of an experience (its 'feel') is exhausted by or constituted by its representational content: seeing red is representing a surface as having a certain property. Strong representationalism claims phenomenal properties reduce to representational ones; weaker versions claim only that phenomenal states necessarily have representational content. This approach offers a promising route to naturalizing consciousness by building on naturalistic accounts of mental content.

Common Misconceptions

Explainer

You already know from your study of intentionality that mental states are 'about' things — beliefs, desires, and perceptions point beyond themselves to objects and states of affairs in the world. Representationalism takes this idea and extends it into territory many find surprising: it claims that even the phenomenal character of experience — the redness of seeing red, the painfulness of pain — is a matter of representational content.

Here is the core thought. When you see a ripe tomato, your visual experience has two aspects philosophers often discuss separately. First, there is the intentional content: your experience represents the tomato as red, round, and at arm's reach. Second, there is the phenomenal character: there is something it *is like* for you to see that red. The representationalist thesis is that these two aspects are not really separate — the phenomenal character just *is* the representational content, or at least is fully determined by it. To see red is to represent a surface as having a certain reflectance property. Change the content, and you change the experience.

Strong representationalism takes this as a full reduction: phenomenal properties are representational properties, and nothing more. If two experiences have the same representational content, they must feel the same — there is no further 'phenomenal residue' left over. This is a powerful thesis because it promises to naturalize consciousness: if we can explain how brain states acquire representational content (through causal or teleological relations to the world), we have explained phenomenal consciousness too.

The most powerful challenge comes from inverted qualia thought experiments. Imagine two people, A and B, who are functionally and representationally identical — their experiences have the same contents — but who have inverted phenomenal characters: where A sees red, B sees (from the inside) what A would call green. If this scenario is coherent, then same representational content does not guarantee same phenomenal character, and strong representationalism fails. Whether this thought experiment describes a genuine possibility is deeply contested.

Weak representationalism retreats to a safer claim: phenomenal states necessarily have representational content, but representational content does not fully exhaust the phenomenal. This preserves an important connection between mind and world without committing to full reduction. Your functionalism background is relevant here: functionalists already accept that mental states are defined by their causal and functional roles; representationalism adds the claim that the content of those roles — what the states are *about* — is central to understanding experience itself.

What did you take from this?

Topics in reflective domains aren't scored by quiz answers. Read, reflect, and mark when you've thought it through.

Quiz me anyway →

Prerequisite Chain

Understanding ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Number Bonds to 10Addition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts (0s, 1s, 2s, 5s, 10s)Multiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersIntroduction to ExponentsOrder of OperationsInteger Order of OperationsVariable ExpressionsThe Distributive PropertyVariables and Expressions ReviewIntroduction to PolynomialsAdding and Subtracting PolynomialsMultiplying PolynomialsFactorialPermutationsCombinationsCounting Principles: Addition and Multiplication RulesIntroduction to Graph TheoryPropositional Logic FoundationsLogical EquivalencesBoolean AlgebraBoolean Type and Truth ValuesComparison Operators and Boolean TestsLogical Operators and Boolean AlgebraBoolean Algebra and Fundamental LawsLogic Gates FundamentalsImplementing Boolean Functions with GatesKarnaugh Map SimplificationCombinational Circuit DesignFlip-Flops and LatchesFinite State Machines (FSMs)Deterministic Finite Automata (DFA)Nondeterministic Finite Automata (NFA)Two-Way Finite AutomataNFA to DFA Conversion (Subset Construction)DFA Properties and Minimization AlgorithmsRegular Languages: Definition and CharacterizationContext-Free Grammars (CFGs)Pushdown Automata (PDA)Equivalence of CFGs and Pushdown AutomataClosure Properties of Context-Free LanguagesLimitations of Context-Free LanguagesPumping Lemma for Context-Free LanguagesTuring MachinesVariants of Turing Machines and EquivalenceUniversal Turing Machine and Self-SimulationChurch-Turing Thesis and ComputabilityFunctionalismRepresentationalism and Mental Representation

Longest path: 97 steps · 628 total prerequisite topics

Prerequisites (4)

Leads To (9)