Combining Texts

All the ideas for 'On the Philosophy of Logic', 'Intro to Gdel's Theorems' and 'The Nature of Mathematical Knowledge'

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


86 ideas

2. Reason / A. Nature of Reason / 1. On Reason
We reach 'reflective equilibrium' when intuitions and theory completely align [Fisher]
4. Formal Logic / E. Nonclassical Logics / 2. Intuitionist Logic
Intuitionists rely on assertability instead of truth, but assertability relies on truth [Kitcher]
4. Formal Logic / E. Nonclassical Logics / 3. Many-Valued Logic
Three-valued logic says excluded middle and non-contradition are not tautologies [Fisher]
4. Formal Logic / E. Nonclassical Logics / 4. Fuzzy Logic
Fuzzy logic has many truth values, ranging in fractions from 0 to 1 [Fisher]
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 / 6. Classical Logic
Classical logic is: excluded middle, non-contradiction, contradictions imply all, disjunctive syllogism [Fisher]
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 / C. Ontology of Logic / 2. Platonism in Logic
Logic formalizes how we should reason, but it shouldn't determine whether we are realists [Fisher]
5. Theory of Logic / E. Structures of Logic / 5. Functions in Logic
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]
Two functions are the same if they have the same extension [Smith,P]
A 'partial function' maps only some elements to another set [Smith,P]
The 'range' of a function is the set of elements in the output set created by the function [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
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
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]
'Effective' means simple, unintuitive, independent, controlled, dumb, and terminating [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 / 1. Mathematics
The interest or beauty of mathematics is when it uses current knowledge to advance undestanding [Kitcher]
The 'beauty' or 'interest' of mathematics is just explanatory power [Kitcher]
Kitcher says maths is an idealisation of the world, and our operations in dealing with it [Kitcher, by Resnik]
Mathematical a priorism is conceptualist, constructivist or realist [Kitcher]
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]
Real numbers stand to measurement as natural numbers stand to counting [Kitcher]
6. Mathematics / A. Nature of Mathematics / 3. Nature of Numbers / j. Complex numbers
Complex numbers were only accepted when a geometrical model for them was found [Kitcher]
6. Mathematics / A. Nature of Mathematics / 4. Using Numbers / a. Units
A one-operation is the segregation of a single object [Kitcher]
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 / A. Nature of Mathematics / 4. Using Numbers / g. Applying mathematics
The old view is that mathematics is useful in the world because it describes the world [Kitcher]
6. Mathematics / A. Nature of Mathematics / 5. The Infinite / k. Infinitesimals
With infinitesimals, you divide by the time, then set the time to zero [Kitcher]
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) 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
Incompleteness results in arithmetic from combining addition and successor with multiplication [Smith,P]
Multiplication only generates incompleteness if combined with addition and successor [Smith,P]
6. Mathematics / C. Sources of Mathematics / 2. Intuition of Mathematics
Mathematical intuition is not the type platonism needs [Kitcher]
If mathematics comes through intuition, that is either inexplicable, or too subjective [Kitcher]
Intuition is no basis for securing a priori knowledge, because it is fallible [Kitcher]
6. Mathematics / C. Sources of Mathematics / 4. Mathematical Empiricism / a. Mathematical empiricism
Mathematical knowledge arises from basic perception [Kitcher]
My constructivism is mathematics as an idealization of collecting and ordering objects [Kitcher]
We derive limited mathematics from ordinary things, and erect powerful theories on their basis [Kitcher]
The defenders of complex numbers had to show that they could be expressed in physical terms [Kitcher]
6. Mathematics / C. Sources of Mathematics / 6. Logicism / d. Logicism critique
Analyticity avoids abstract entities, but can there be truth without reference? [Kitcher]
6. Mathematics / C. Sources of Mathematics / 10. Constructivism / a. Constructivism
Arithmetic is made true by the world, but is also made true by our constructions [Kitcher]
Arithmetic is an idealizing theory [Kitcher]
We develop a language for correlations, and use it to perform higher level operations [Kitcher]
Constructivism is ontological (that it is the work of an agent) and epistemological (knowable a priori) [Kitcher]
6. Mathematics / C. Sources of Mathematics / 10. Constructivism / c. Conceptualism
Conceptualists say we know mathematics a priori by possessing mathematical concepts [Kitcher]
If meaning makes mathematics true, you still need to say what the meanings refer to [Kitcher]
7. Existence / D. Theories of Reality / 10. Vagueness / g. Degrees of vagueness
We could make our intuitions about heaps precise with a million-valued logic [Fisher]
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]
9. Objects / A. Existence of Objects / 2. Abstract Objects / b. Need for abstracta
Abstract objects were a bad way of explaining the structure in mathematics [Kitcher]
9. Objects / B. Unity of Objects / 3. Unity Problems / e. Vague objects
Vagueness can involve components (like baldness), or not (like boredom) [Fisher]
10. Modality / B. Possibility / 1. Possibility
We can't explain 'possibility' in terms of 'possible' worlds [Fisher]
10. Modality / B. Possibility / 8. Conditionals / c. Truth-function conditionals
If all truths are implied by a falsehood, then not-p might imply both q and not-q [Fisher]
10. Modality / B. Possibility / 8. Conditionals / d. Non-truthfunction conditionals
In relevance logic, conditionals help information to flow from antecedent to consequent [Fisher]
12. Knowledge Sources / A. A Priori Knowledge / 1. Nature of the A Priori
A priori knowledge comes from available a priori warrants that produce truth [Kitcher]
12. Knowledge Sources / A. A Priori Knowledge / 6. A Priori from Reason
In long mathematical proofs we can't remember the original a priori basis [Kitcher]
12. Knowledge Sources / A. A Priori Knowledge / 9. A Priori from Concepts
Knowledge is a priori if the experience giving you the concepts thus gives you the knowledge [Kitcher]
12. Knowledge Sources / A. A Priori Knowledge / 10. A Priori as Subjective
We have some self-knowledge a priori, such as knowledge of our own existence [Kitcher]
13. Knowledge Criteria / A. Justification Problems / 1. Justification / a. Justification issues
A 'warrant' is a process which ensures that a true belief is knowledge [Kitcher]
13. Knowledge Criteria / A. Justification Problems / 1. Justification / c. Defeasibility
If experiential can defeat a belief, then its justification depends on the defeater's absence [Kitcher, by Casullo]
15. Nature of Minds / C. Capacities of Minds / 6. Idealisation
Idealisation trades off accuracy for simplicity, in varying degrees [Kitcher]