Combining Texts

All the ideas for 'Intro to G��del's Theorems', 'The Raft and the Pyramid' and 'Review of Husserl's 'Phil of Arithmetic''

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


65 ideas

2. Reason / A. Nature of Reason / 6. Coherence
The negation of all my beliefs about my current headache would be fully coherent [Sosa]
2. Reason / D. Definition / 2. Aims of Definition
A definition need not capture the sense of an expression - just get the reference right [Frege, by Dummett]
4. Formal Logic / B. Propositional Logic PL / 2. Tools of Propositional Logic / e. Axioms of PL
Since every definition is an equation, one cannot define equality itself [Frege]
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 / 2. Isomorphisms
An 'injective' ('one-to-one') function creates a distinct output element from each original [Smith,P]
A 'surjective' ('onto') function creates every element of the output set [Smith,P]
A 'bijective' function has one-to-one correspondence in both directions [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 / e. Counting by correlation
Counting rests on one-one correspondence, of numerals to objects [Frege]
Husserl rests sameness of number on one-one correlation, forgetting the correlation with numbers themselves [Frege]
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
All numbers are related to zero by the ancestral of the successor relation [Smith,P]
The number of Fs is the 'successor' of the Gs if there is a single F that isn't G [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) is not negation complete [Smith,P]
Robinson Arithmetic 'Q' has basic axioms, quantifiers and first-order logic [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]
6. Mathematics / B. Foundations for Mathematics / 5. Definitions of Number / c. Fregean numbers
In a number-statement, something is predicated of a concept [Frege]
6. Mathematics / C. Sources of Mathematics / 1. Mathematical Platonism / a. For mathematical platonism
Our concepts recognise existing relations, they don't change them [Frege]
Numbers are not real like the sea, but (crucially) they are still objective [Frege]
6. Mathematics / C. Sources of Mathematics / 4. Mathematical Empiricism / c. Against mathematical empiricism
The naïve view of number is that it is like a heap of things, or maybe a property of a heap [Frege]
7. Existence / C. Structure of Existence / 7. Abstract/Concrete / b. Levels of abstraction
If objects are just presentation, we get increasing abstraction by ignoring their properties [Frege]
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]
12. Knowledge Sources / E. Direct Knowledge / 1. Common Sense
There are very few really obvious truths, and not much can be proved from them [Sosa]
13. Knowledge Criteria / B. Internal Justification / 4. Foundationalism / e. Pro-foundations
A single belief can trail two regresses, one terminating and one not [Sosa]
13. Knowledge Criteria / B. Internal Justification / 4. Foundationalism / f. Foundationalism critique
If mental states are not propositional, they are logically dumb, and cannot be foundations [Sosa]
Mental states cannot be foundational if they are not immune to error [Sosa]
13. Knowledge Criteria / C. External Justification / 2. Causal Justification
Vision causes and justifies beliefs; but to some extent the cause is the justification [Sosa]
18. Thought / A. Modes of Thought / 1. Thought
Many people have the same thought, which is the component, not the private presentation [Frege]
18. Thought / E. Abstraction / 3. Abstracta by Ignoring
Disregarding properties of two cats still leaves different objects, but what is now the difference? [Frege]
How do you find the right level of inattention; you eliminate too many or too few characteristics [Frege]
18. Thought / E. Abstraction / 8. Abstractionism Critique
Number-abstraction somehow makes things identical without changing them! [Frege]
19. Language / A. Nature of Meaning / 2. Meaning as Mental
Psychological logicians are concerned with sense of words, but mathematicians study the reference [Frege]
Identity baffles psychologists, since A and B must be presented differently to identify them [Frege]