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

Defining Consciousness

College Depth 98 in the knowledge graph ☐ I know this ☆ Set as goal
29topics build on this
631prerequisites beneath it
See this on the map →
Introduction to Philosophy of MindRelational Accounts of Consciousness→→Access Consciousness: Information AvailabilityPhenomenal Consciousness and Qualia
consciousness definition properties

Core Idea

Consciousness is the subjective, first-person aspect of mental life—what it is like to have an experience. Philosophers distinguish phenomenal consciousness (subjective feeling) from access consciousness (information availability) and debate whether consciousness is a unified phenomenon or involves multiple distinct properties.

Explainer

Consciousness is the phenomenon that makes everything else in philosophy of mind worth caring about. When you see a ripe tomato, your visual system processes wavelength information — but there is also *something it is like* to see red. That felt redness, that inner glow of experience, is what philosophers call phenomenal consciousness. It is the first-person, subjective character of experience, sometimes captured by the phrase "what it is like" (coined by Thomas Nagel). A camera detects the same wavelengths without any felt experience — and that difference is the entire puzzle.

Not all uses of "conscious" track phenomenal experience, though. When psychologists say you are "conscious" of a danger or that information is "consciously accessible," they often mean something different: the information is globally available for reasoning, reporting, and guiding behavior. Ned Block called this access consciousness — the functional availability of mental content. You can be access-conscious of something without having rich phenomenal experience of it, and in some theories phenomenal consciousness might come apart from access entirely. Keeping these two senses distinct prevents a great deal of confusion in philosophy of mind debates.

Why is consciousness so hard to explain? From your introduction to philosophy of mind, you learned that mental states can be characterized by their functional roles — their causal relations to inputs, outputs, and other states. Functionalism handles access consciousness well: we can describe what information is available and how it influences behavior. But phenomenal consciousness resists this treatment. You can specify all the functional properties of a system processing red-wavelength light and still not have explained why there is a felt redness at all. This is what David Chalmers called the hard problem of consciousness — explaining not just what the brain does, but why doing it feels like anything.

The debate over whether consciousness is unified or multiple is equally important. Some philosophers argue phenomenal and access consciousness always go together; others think they can dissociate (blindsight patients, for instance, respond accurately to stimuli they report not seeing). There are also questions about whether consciousness comes in degrees, whether non-human animals are conscious, and whether artificial systems could be. Each of these questions turns on what exactly we mean by "consciousness" — which is why getting the definition right at this stage sets the foundation for everything that follows: accounts of qualia, debates about physicalism, and the question of whether consciousness can be explained at all.

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.

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Boolean Algebra → Boolean Type and Truth Values → Comparison Operators and Boolean Tests → Logical Operators and Boolean Algebra → Boolean Algebra and Fundamental Laws → Logic Gates Fundamentals → Implementing Boolean Functions with Gates → Karnaugh Map Simplification → Combinational Circuit Design → Flip-Flops and Latches → Finite State Machines (FSMs) → Deterministic Finite Automata (DFA) → Nondeterministic Finite Automata (NFA) → Two-Way Finite Automata → NFA to DFA Conversion (Subset Construction) → DFA Properties and Minimization Algorithms → Regular Languages: Definition and Characterization → Context-Free Grammars (CFGs) → Pushdown Automata (PDA) → Equivalence of CFGs and Pushdown Automata → Closure Properties of Context-Free Languages → Limitations of Context-Free Languages → Pumping Lemma for Context-Free Languages → Turing Machines → Variants of Turing Machines and Equivalence → Universal Turing Machine and Self-Simulation → Church-Turing Thesis and Computability → Functionalism → Representationalism and Mental Representation → Relational Accounts of Consciousness → Defining Consciousness

Longest path: 99 steps · 631 total prerequisite topics

Prerequisites (2)

Leads To (2)