Combining Philosophers

All the ideas for Dougherty,T/Rysiew,P, Peter Smith and Stephen Yablo

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


83 ideas

3. Truth / A. Truth Problems / 5. Truth Bearers
A statement S is 'partly true' if it has some wholly true parts [Yablo]
4. Formal Logic / A. Syllogistic Logic / 2. Syllogistic Logic
An 'enthymeme' is an argument with an indispensable unstated assumption [Yablo]
4. Formal Logic / D. Modal Logic ML / 4. Alethic Modal Logic
The main modal logics disagree over three key formulae [Yablo]
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 / G. Formal Mereology / 3. Axioms of Mereology
y is only a proper part of x if there is a z which 'makes up the difference' between them [Yablo]
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 '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 / F. Referring in Logic / 1. Naming / e. Empty names
'Pegasus doesn't exist' is false without Pegasus, yet the absence of Pegasus is its truthmaker [Yablo]
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]
5. Theory of Logic / L. Paradox / 6. Paradoxes in Language / a. The Liar paradox
An infinite series of sentences asserting falsehood produces the paradox without self-reference [Yablo, by Sorensen]
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]
If 'the number of Democrats is on the rise', does that mean that 50 million is on the rise? [Yablo]
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
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' 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
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 / 3. Mathematical Nominalism
A nominalist can assert statements about mathematical objects, as being partly true [Yablo]
6. Mathematics / C. Sources of Mathematics / 4. Mathematical Empiricism / b. Indispensability of mathematics
We must treat numbers as existing in order to express ourselves about the arrangement of planets [Yablo]
6. Mathematics / C. Sources of Mathematics / 6. Logicism / c. Neo-logicism
Mathematics is both necessary and a priori because it really consists of logical truths [Yablo]
6. Mathematics / C. Sources of Mathematics / 9. Fictional Mathematics
Platonic objects are really created as existential metaphors [Yablo]
Putting numbers in quantifiable position (rather than many quantifiers) makes expression easier [Yablo]
7. Existence / C. Structure of Existence / 7. Abstract/Concrete / a. Abstract/concrete
Concrete objects have few essential properties, but properties of abstractions are mostly essential [Yablo]
We are thought to know concreta a posteriori, and many abstracta a priori [Yablo]
7. Existence / D. Theories of Reality / 7. Fictionalism
For me, fictions are internally true, without a significant internal or external truth-value [Yablo]
Make-believe can help us to reason about facts and scientific procedures [Yablo]
'The clouds are angry' can only mean '...if one were attributing emotions to clouds' [Yablo]
We quantify over events, worlds, etc. in order to make logical possibilities clearer [Yablo]
Fictionalism allows that simulated beliefs may be tracking real facts [Yablo]
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]
8. Modes of Existence / E. Nominalism / 1. Nominalism / c. Nominalism about abstracta
Philosophers keep finding unexpected objects, like models, worlds, functions, numbers, events, sets, properties [Yablo]
9. Objects / B. Unity of Objects / 3. Unity Problems / c. Statue and clay
A statue is essentially the statue, but its lump is not essentially a statue, so statue isn't lump [Yablo, by Rocca]
9. Objects / C. Structure of Objects / 8. Parts of Objects / a. Parts of objects
Parthood lacks the restriction of kind which most relations have [Yablo]
10. Modality / E. Possible worlds / 2. Nature of Possible Worlds / b. Worlds as fictions
Governing possible worlds theory is the fiction that if something is possible, it happens in a world [Yablo]
11. Knowledge Aims / A. Knowledge / 2. Understanding
It is nonsense that understanding does not involve knowledge; to understand, you must know [Dougherty/Rysiew]
To grasp understanding, we should be more explicit about what needs to be known [Dougherty/Rysiew]
11. Knowledge Aims / A. Knowledge / 7. Knowledge First
Rather than knowledge, our epistemic aim may be mere true belief, or else understanding and wisdom [Dougherty/Rysiew]
13. Knowledge Criteria / A. Justification Problems / 1. Justification / a. Justification issues
Don't confuse justified belief with justified believers [Dougherty/Rysiew]
13. Knowledge Criteria / A. Justification Problems / 1. Justification / b. Need for justification
If knowledge is unanalysable, that makes justification more important [Dougherty/Rysiew]
13. Knowledge Criteria / A. Justification Problems / 2. Justification Challenges / b. Gettier problem
Gettier says you don't know if you are confused about how it is true [Yablo]
14. Science / B. Scientific Theories / 2. Aim of Science
A theory need not be true to be good; it should just be true about its physical aspects [Yablo]
14. Science / C. Induction / 5. Paradoxes of Induction / b. Raven paradox
If sentences point to different evidence, they must have different subject-matter [Yablo]
Most people say nonblack nonravens do confirm 'all ravens are black', but only a tiny bit [Yablo]
18. Thought / E. Abstraction / 7. Abstracta by Equivalence
A sentence should be recarved to reveal its content or implication relations [Yablo]
19. Language / A. Nature of Meaning / 4. Meaning as Truth-Conditions
Sentence-meaning is the truth-conditions - plus factors responsible for them [Yablo]
19. Language / C. Assigning Meanings / 2. Semantics
Entailment is modelled in formal semantics as set inclusion (where 'mammals' contains 'cats') [Dougherty/Rysiew]
19. Language / C. Assigning Meanings / 4. Compositionality
The content of an assertion can be quite different from compositional content [Yablo]
19. Language / C. Assigning Meanings / 6. Truth-Conditions Semantics
Truth-conditions as subject-matter has problems of relevance, short cut, and reversal [Yablo]
19. Language / F. Communication / 3. Denial
Not-A is too strong to just erase an improper assertion, because it actually reverses A [Yablo]
19. Language / F. Communication / 6. Interpreting Language / d. Metaphor
Hardly a word in the language is devoid of metaphorical potential [Yablo]