Combining Texts

All the ideas for 'Intro to G��del's Theorems', 'The Limits of Reason' and 'The Moral Problem'

expand these ideas     |    start again     |     specify just one area for these texts


73 ideas

1. Philosophy / F. Analytic Philosophy / 4. Conceptual Analysis
Analysis aims to express the full set of platitudes surrounding a given concept [Smith,M]
2. Reason / D. Definition / 1. Definitions
Defining a set of things by paradigms doesn't pin them down enough [Smith,M]
3. Truth / B. Truthmakers / 11. Truthmaking and Correspondence
The vagueness of truthmaker claims makes it easier to run anti-realist arguments [Button]
3. Truth / D. Coherence Truth / 1. Coherence Truth
The coherence theory says truth is coherence of thoughts, and not about objects [Button]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / a. Axioms for sets
There cannot be a set theory which is complete [Smith,P]
5. Theory of Logic / A. Overview of Logic / 7. Second-Order Logic
Second-order arithmetic can prove new sentences of first-order [Smith,P]
5. Theory of Logic / E. Structures of Logic / 5. Functions in Logic
A 'partial function' maps only some elements to another set [Smith,P]
A 'total function' maps every element to one element in another set [Smith,P]
An argument is a 'fixed point' for a function if it is mapped back to itself [Smith,P]
The 'range' of a function is the set of elements in the output set created by the function [Smith,P]
Two functions are the same if they have the same extension [Smith,P]
5. Theory of Logic / E. Structures of Logic / 7. Predicates in Logic
The Comprehension Schema says there is a property only had by things satisfying a condition [Smith,P]
5. Theory of Logic / E. Structures of Logic / 8. Theories in Logic
A 'theorem' of a theory is a sentence derived from the axioms using the proof system [Smith,P]
5. Theory of Logic / H. Proof Systems / 4. Natural Deduction
A 'natural deduction system' has no axioms but many rules [Smith,P]
5. Theory of Logic / I. Semantics of Logic / 2. Formal Truth
No nice theory can define truth for its own language [Smith,P]
5. Theory of Logic / J. Model Theory in Logic / 1. Logical Models
Permutation Theorem: any theory with a decent model has lots of models [Button]
5. Theory of Logic / J. Model Theory in Logic / 2. Isomorphisms
A 'bijective' function has one-to-one correspondence in both directions [Smith,P]
A 'surjective' ('onto') function creates every element of the output set [Smith,P]
An 'injective' ('one-to-one') function creates a distinct output element from each original [Smith,P]
5. Theory of Logic / K. Features of Logics / 3. Soundness
If everything that a theory proves is true, then it is 'sound' [Smith,P]
Soundness is true axioms and a truth-preserving proof system [Smith,P]
A theory is 'sound' iff every theorem is true (usually from true axioms and truth-preservation) [Smith,P]
5. Theory of Logic / K. Features of Logics / 4. Completeness
A theory is 'negation complete' if it proves all sentences or their negation [Smith,P]
'Complete' applies both to whole logics, and to theories within them [Smith,P]
A theory is 'negation complete' if one of its sentences or its negation can always be proved [Smith,P]
5. Theory of Logic / K. Features of Logics / 5. Incompleteness
Two routes to Incompleteness: semantics of sound/expressible, or syntax of consistency/proof [Smith,P]
5. Theory of Logic / K. Features of Logics / 7. Decidability
'Effective' means simple, unintuitive, independent, controlled, dumb, and terminating [Smith,P]
A theory is 'decidable' if all of its sentences could be mechanically proved [Smith,P]
Any consistent, axiomatized, negation-complete formal theory is decidable [Smith,P]
5. Theory of Logic / K. Features of Logics / 8. Enumerability
A set is 'enumerable' is all of its elements can result from a natural number function [Smith,P]
A set is 'effectively enumerable' if a computer could eventually list every member [Smith,P]
A finite set of finitely specifiable objects is always effectively enumerable (e.g. primes) [Smith,P]
The set of ordered pairs of natural numbers <i,j> is effectively enumerable [Smith,P]
The thorems of a nice arithmetic can be enumerated, but not the truths (so they're diffferent) [Smith,P]
5. Theory of Logic / K. Features of Logics / 9. Expressibility
Being 'expressible' depends on language; being 'capture/represented' depends on axioms and proof system [Smith,P]
6. Mathematics / A. Nature of Mathematics / 3. Nature of Numbers / a. Numbers
For primes we write (x not= 1 ∧ ∀u∀v(u x v = x → (u = 1 ∨ v = 1))) [Smith,P]
6. Mathematics / A. Nature of Mathematics / 3. Nature of Numbers / g. Real numbers
The reals contain the naturals, but the theory of reals doesn't contain the theory of naturals [Smith,P]
6. Mathematics / A. Nature of Mathematics / 4. Using Numbers / f. Arithmetic
The truths of arithmetic are just true equations and their universally quantified versions [Smith,P]
6. Mathematics / B. Foundations for Mathematics / 4. Axioms for Number / a. Axioms for numbers
The number of Fs is the 'successor' of the Gs if there is a single F that isn't G [Smith,P]
All numbers are related to zero by the ancestral of the successor relation [Smith,P]
6. Mathematics / B. Foundations for Mathematics / 4. Axioms for Number / b. Baby arithmetic
Baby arithmetic covers addition and multiplication, but no general facts about numbers [Smith,P]
Baby Arithmetic is complete, but not very expressive [Smith,P]
6. Mathematics / B. Foundations for Mathematics / 4. Axioms for Number / c. Robinson arithmetic
Robinson Arithmetic 'Q' has basic axioms, quantifiers and first-order logic [Smith,P]
Robinson Arithmetic (Q) is not negation complete [Smith,P]
6. Mathematics / B. Foundations for Mathematics / 4. Axioms for Number / d. Peano arithmetic
Natural numbers have zero, unique successors, unending, no circling back, and no strays [Smith,P]
6. Mathematics / B. Foundations for Mathematics / 4. Axioms for Number / f. Mathematical induction
The logic of arithmetic must quantify over properties of numbers to handle induction [Smith,P]
6. Mathematics / B. Foundations for Mathematics / 4. Axioms for Number / g. Incompleteness of Arithmetic
Multiplication only generates incompleteness if combined with addition and successor [Smith,P]
Incompleteness results in arithmetic from combining addition and successor with multiplication [Smith,P]
7. Existence / D. Theories of Reality / 2. Realism
Realists believe in independent objects, correspondence, and fallibility of all theories [Button]
7. Existence / D. Theories of Reality / 4. Anti-realism
Indeterminacy arguments say if a theory can be made true, it has multiple versions [Button]
An ideal theory can't be wholly false, because its consistency implies a true model [Button]
8. Modes of Existence / A. Relations / 4. Formal Relations / c. Ancestral relation
The 'ancestral' of a relation is a new relation which creates a long chain of the original relation [Smith,P]
13. Knowledge Criteria / D. Scepticism / 2. Types of Scepticism
Cartesian scepticism doubts what is true; Kantian scepticism doubts that it is sayable [Button]
14. Science / A. Basis of Science / 4. Prediction
Predictions give the 'content' of theories, which can then be 'equivalent' or 'adequate' [Button]
18. Thought / A. Modes of Thought / 5. Rationality / a. Rationality
Capturing all the common sense facts about rationality is almost impossible [Smith,M]
19. Language / A. Nature of Meaning / 4. Meaning as Truth-Conditions
A sentence's truth conditions are all the situations where it would be true [Button]
20. Action / C. Motives for Action / 1. Acting on Desires
A pure desire could be criticised if it were based on a false belief [Smith,M]
A person can have a desire without feeling it [Smith,M]
In the Humean account, desires are not true/false, or subject to any rational criticism [Smith,M]
Subjects may be fallible about the desires which explain their actions [Smith,M]
Humeans (unlike their opponents) say that desires and judgements can separate [Smith,M]
If first- and second-order desires conflict, harmony does not require the second-order to win [Smith,M]
Objective reasons to act might be the systematic desires of a fully rational person [Smith,M]
Goals need desires, and so only desires can motivate us [Smith,M]
20. Action / C. Motives for Action / 3. Acting on Reason / a. Practical reason
Motivating reasons are psychological, while normative reasons are external [Smith,M]
Humeans take maximising desire satisfaction as the normative reasons for actions [Smith,M]
We cannot expect even fully rational people to converge on having the same desires for action [Smith,M]
22. Metaethics / A. Ethics Foundations / 1. Nature of Ethics / h. Against ethics
'Externalists' say moral judgements are not reasons, and maybe not even motives [Smith,M]
A person could make a moral judgement without being in any way motivated by it [Smith,M]
22. Metaethics / A. Ethics Foundations / 2. Source of Ethics / b. Rational ethics
Moral internalism says a judgement of rightness is thereby motivating [Smith,M]
'Rationalism' says the rightness of an action is a reason to perform it [Smith,M]
22. Metaethics / A. Ethics Foundations / 2. Source of Ethics / h. Expressivism
Expressivists count attitudes as 'moral' if they concern features of things, rather than their mere existence [Smith,M]
22. Metaethics / B. Value / 1. Nature of Value / a. Nature of value
Is valuing something a matter of believing or a matter of desiring? [Smith,M]