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

Foundational or Basic Beliefs

College Depth 100 in the knowledge graph ☐ I know this ☆ Set as goal
9topics build on this
537prerequisites beneath it
See this on the map →
FoundationalismThe Justified True Belief Account of Knowledge→→The Foundationalist Regress and Epistemic SupportTransmission Failure and Epistemic Warrant
foundationalism basic-beliefs justification structure

Core Idea

Foundational or basic beliefs are those justified without requiring justification from other beliefs—they form the ground level of a foundationalist system. Classical candidates include self-evident truths, incorrigible propositions, and properly basic sensory beliefs. The theory must explain what makes a belief capable of self-justification and whether such beliefs can be defeated by other evidence.

How It's Best Learned

Examine candidates like direct sensory experiences ('I see red'), self-evident truths ('All bachelors are unmarried'), and incorrigible beliefs about mental states. Test each against the requirement that basic beliefs be self-justifying or justified without further premises.

Common Misconceptions

Explainer

From your study of foundationalism, you know the core picture: justification has a structure, and not all beliefs can be justified by appeal to other beliefs without generating an infinite regress or vicious circle. Foundationalism resolves this by positing a base level — basic beliefs — that do not require support from other beliefs because they are in some way self-justifying. But what makes a belief capable of justifying itself? This is the central question that any theory of basic beliefs must answer.

The classical answer, associated with Descartes and later with sense-datum theorists, appealed to incorrigibility: a belief is basic if it cannot be corrected or doubted from the inside. Descartes's candidate for the most certain belief was his own existence as a thinking thing — "cogito ergo sum" — immune to even extreme skeptical scenarios. Sense-datum theorists extended this to immediate appearances: "It seems to me as though I see red" cannot be wrong, even if there is no actual red thing before me. Notice the careful hedging — the incorrigible belief is not "I see a red apple" (which could be false if I'm hallucinating) but "I seem to see something red" (which reports only how things appear). The retreat from object to appearance is the price of incorrigibility. You are giving up claims about the world to gain certainty about your inner states.

Contemporary foundationalists often accept fallible basic beliefs instead. A belief can be basic — not inferred from other beliefs — while still being defeasible by other evidence. Your perceptual belief that there is a cup on the desk arises directly from perceptual experience rather than from inference; it can nonetheless be overridden if you learn you've been drugged or are hallucinating. This moderate foundationalism, associated with philosophers like Roderick Chisholm and William Alston, preserves the regress-stopping function of basic beliefs without requiring the implausibly strong claim that they are infallible. The key distinction — which the misconceptions highlight — is between a belief's being non-inferentially justified (not derived from other beliefs) and its being indefeasible (immune to defeat by any evidence). Basic beliefs need only the first property. Understanding this distinction lets you see that the foundationalist project can survive the recognition that even our most immediate beliefs are fallible, as long as they provide a genuine starting point for justificatory chains that doesn't itself require further justification.

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 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 → Introduction to Propositional Logic → Introduction to Predicate Logic (First-Order Logic) → First-Order Logic Syntax → Terms and Atomic Formulas in FOL → Variable Binding and Scope → Open and Closed Formulas in First-Order Logic → Variable Substitution and Capture-Avoidance in First-Order Logic → Quantifier Instantiation Rules in First-Order Proof Systems → Universal Quantification: Meaning and Scope → Free Variables and Bound Variables → Substitution and Instantiation in Predicate Logic → Terms and Atomic Formulas → Formulas and Well-Formed Expressions → Structures and Interpretations → Model Interpretation and Satisfaction → Interpretation, Truth, and Satisfaction of Formulas → Logical Consequence and Entailment → Soundness Theorem and Validity of Proof Systems → Deductive Reasoning and Formal Proof Systems → First-Order Resolution → Propositional Resolution → Semantic Tableaux (Propositional) → Semantic Tableaux (First-Order) → Decidable Fragments of First-Order Logic → Gödel's Completeness Theorem for First-Order Logic → Gödel's Incompleteness Theorems → Introduction to Intuitionistic Logic → Introduction to Modal Logic → A Priori and A Posteriori Knowledge → Rationalism vs. Empiricism → Foundationalism → Foundational or Basic Beliefs

Longest path: 101 steps · 537 total prerequisite topics

Prerequisites (2)

Leads To (2)