Combining Philosophers

All the ideas for Lynch,MP/Glasgow,JM, Shaughan Lavine and Peter Smith

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


81 ideas

4. Formal Logic / F. Set Theory ST / 1. Set Theory
Second-order set theory just adds a version of Replacement that quantifies over functions [Lavine]
4. Formal Logic / F. Set Theory ST / 2. Mechanics of Set Theory / b. Terminology of ST
An 'upper bound' is the greatest member of a subset; there may be several of these, so there is a 'least' one [Lavine]
4. Formal Logic / F. Set Theory ST / 3. Types of Set / a. Types of set
Collections of things can't be too big, but collections by a rule seem unlimited in size [Lavine]
4. Formal Logic / F. Set Theory ST / 3. Types of Set / d. Infinite Sets
Those who reject infinite collections also want to reject the Axiom of Choice [Lavine]
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]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / g. Axiom of Powers VI
The Power Set is just the collection of functions from one collection to another [Lavine]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / h. Axiom of Replacement VII
Replacement was immediately accepted, despite having very few implications [Lavine]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / i. Axiom of Foundation VIII
Foundation says descending chains are of finite length, blocking circularity, or ungrounded sets [Lavine]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / j. Axiom of Choice IX
Pure collections of things obey Choice, but collections defined by a rule may not [Lavine]
The controversy was not about the Axiom of Choice, but about functions as arbitrary, or given by rules [Lavine]
4. Formal Logic / F. Set Theory ST / 5. Conceptions of Set / c. Logical sets
The 'logical' notion of class has some kind of definition or rule to characterise the class [Lavine]
4. Formal Logic / F. Set Theory ST / 5. Conceptions of Set / e. Iterative sets
The iterative conception of set wasn't suggested until 1947 [Lavine]
The iterative conception needs the Axiom of Infinity, to show how far we can iterate [Lavine]
The iterative conception doesn't unify the axioms, and has had little impact on mathematical proofs [Lavine]
4. Formal Logic / F. Set Theory ST / 5. Conceptions of Set / f. Limitation of Size
Limitation of Size: if it's the same size as a set, it's a set; it uses Replacement [Lavine]
4. Formal Logic / F. Set Theory ST / 6. Ordering in Sets
A collection is 'well-ordered' if there is a least element, and all of its successors can be identified [Lavine]
5. Theory of Logic / A. Overview of Logic / 7. Second-Order Logic
Second-order arithmetic can prove new sentences of first-order [Smith,P]
Second-order logic presupposes a set of relations already fixed by the first-order domain [Lavine]
5. Theory of Logic / D. Assumptions for Logic / 2. Excluded Middle
Mathematical proof by contradiction needs the law of excluded middle [Lavine]
5. Theory of Logic / E. Structures of Logic / 5. Functions in Logic
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]
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]
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 '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]
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 / 1. Mathematics
Mathematics is nowadays (thanks to set theory) regarded as the study of structure, not of quantity [Lavine]
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 / b. Types of number
Every rational number, unlike every natural number, is divisible by some other number [Lavine]
6. Mathematics / A. Nature of Mathematics / 3. Nature of Numbers / g. Real numbers
For the real numbers to form a set, we need the Continuum Hypothesis to be true [Lavine]
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 / 3. Nature of Numbers / h. Reals from Cauchy
Cauchy gave a necessary condition for the convergence of a sequence [Lavine]
6. Mathematics / A. Nature of Mathematics / 3. Nature of Numbers / i. Reals from cuts
The two sides of the Cut are, roughly, the bounding commensurable ratios [Lavine]
6. Mathematics / A. Nature of Mathematics / 4. Using Numbers / c. Counting procedure
Counting results in well-ordering, and well-ordering makes counting possible [Lavine]
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 / 5. The Infinite / a. The Infinite
The theory of infinity must rest on our inability to distinguish between very large sizes [Lavine]
The infinite is extrapolation from the experience of indefinitely large size [Lavine]
6. Mathematics / A. Nature of Mathematics / 5. The Infinite / c. Potential infinite
The intuitionist endorses only the potential infinite [Lavine]
6. Mathematics / A. Nature of Mathematics / 5. The Infinite / f. Uncountable infinities
'Aleph-0' is cardinality of the naturals, 'aleph-1' the next cardinal, 'aleph-ω' the ω-th cardinal [Lavine]
6. Mathematics / A. Nature of Mathematics / 5. The Infinite / h. Ordinal infinity
Ordinals are basic to Cantor's transfinite, to count the sets [Lavine]
Paradox: the class of all ordinals is well-ordered, so must have an ordinal as type - giving a bigger ordinal [Lavine]
6. Mathematics / A. Nature of Mathematics / 5. The Infinite / i. Cardinal infinity
Paradox: there is no largest cardinal, but the class of everything seems to be the largest [Lavine]
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 / 6. Mathematics as Set Theory / a. Mathematics is set theory
Set theory will found all of mathematics - except for the notion of proof [Lavine]
6. Mathematics / C. Sources of Mathematics / 1. Mathematical Platonism / b. Against mathematical platonism
Modern mathematics works up to isomorphism, and doesn't care what things 'really are' [Lavine]
6. Mathematics / C. Sources of Mathematics / 10. Constructivism / b. Intuitionism
Intuitionism rejects set-theory to found mathematics [Lavine]
7. Existence / C. Structure of Existence / 3. Levels of Reality
A necessary relation between fact-levels seems to be a further irreducible fact [Lynch/Glasgow]
7. Existence / C. Structure of Existence / 5. Supervenience / c. Significance of supervenience
If some facts 'logically supervene' on some others, they just redescribe them, adding nothing [Lynch/Glasgow]
7. Existence / D. Theories of Reality / 6. Physicalism
Nonreductive materialism says upper 'levels' depend on lower, but don't 'reduce' [Lynch/Glasgow]
The hallmark of physicalism is that each causal power has a base causal power under it [Lynch/Glasgow]
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]