Combining Philosophers

All the ideas for Rescher,N/Oppenheim,P, Herbert B. Enderton and Gregory L. Murphy

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


63 ideas

4. Formal Logic / B. Propositional Logic PL / 3. Truth Tables
Until the 1960s the only semantics was truth-tables [Enderton]
4. Formal Logic / F. Set Theory ST / 2. Mechanics of Set Theory / a. Symbols of ST
'dom R' indicates the 'domain' of objects having a relation [Enderton]
'fld R' indicates the 'field' of all objects in the relation [Enderton]
'ran R' indicates the 'range' of objects being related to [Enderton]
We write F:A→B to indicate that A maps into B (the output of F on A is in B) [Enderton]
'F(x)' is the unique value which F assumes for a value of x [Enderton]
4. Formal Logic / F. Set Theory ST / 2. Mechanics of Set Theory / b. Terminology of ST
∈ says the whole set is in the other; ⊆ says the members of the subset are in the other [Enderton]
A relation is 'symmetric' on a set if every ordered pair has the relation in both directions [Enderton]
A relation is 'transitive' if it can be carried over from two ordered pairs to a third [Enderton]
The 'ordered pair' <x,y> is defined to be {{x}, {x,y}} [Enderton]
A 'linear or total ordering' must be transitive and satisfy trichotomy [Enderton]
The 'powerset' of a set is all the subsets of a given set [Enderton]
Two sets are 'disjoint' iff their intersection is empty [Enderton]
A 'domain' of a relation is the set of members of ordered pairs in the relation [Enderton]
A 'relation' is a set of ordered pairs [Enderton]
A 'function' is a relation in which each object is related to just one other object [Enderton]
A function 'maps A into B' if the relating things are set A, and the things related to are all in B [Enderton]
A function 'maps A onto B' if the relating things are set A, and the things related to are set B [Enderton]
A relation is 'reflexive' on a set if every member bears the relation to itself [Enderton]
A relation satisfies 'trichotomy' if all pairs are either relations, or contain identical objects [Enderton]
A set is 'dominated' by another if a one-to-one function maps the first set into a subset of the second [Enderton]
4. Formal Logic / F. Set Theory ST / 3. Types of Set / b. Empty (Null) Set
Note that {Φ} =/= Φ, because Φ ∈ {Φ} but Φ ∉ Φ [Enderton]
The empty set may look pointless, but many sets can be constructed from it [Enderton]
4. Formal Logic / F. Set Theory ST / 3. Types of Set / c. Unit (Singleton) Sets
The singleton is defined using the pairing axiom (as {x,x}) [Enderton]
4. Formal Logic / F. Set Theory ST / 3. Types of Set / e. Equivalence classes
An 'equivalence relation' is a reflexive, symmetric and transitive binary relation [Enderton]
We 'partition' a set into distinct subsets, according to each relation on its objects [Enderton]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / h. Axiom of Replacement VII
Fraenkel added Replacement, to give a theory of ordinal numbers [Enderton]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / j. Axiom of Choice IX
We can only define functions if Choice tells us which items are involved [Enderton]
5. Theory of Logic / A. Overview of Logic / 1. Overview of Logic
Inference not from content, but from the fact that it was said, is 'conversational implicature' [Enderton]
5. Theory of Logic / B. Logical Consequence / 2. Types of Consequence
Validity is either semantic (what preserves truth), or proof-theoretic (following procedures) [Enderton]
5. Theory of Logic / I. Semantics of Logic / 3. Logical Truth
A logical truth or tautology is a logical consequence of the empty set [Enderton]
5. Theory of Logic / I. Semantics of Logic / 4. Satisfaction
A truth assignment to the components of a wff 'satisfy' it if the wff is then True [Enderton]
5. Theory of Logic / K. Features of Logics / 3. Soundness
A proof theory is 'sound' if its valid inferences entail semantic validity [Enderton]
5. Theory of Logic / K. Features of Logics / 4. Completeness
A proof theory is 'complete' if semantically valid inferences entail proof-theoretic validity [Enderton]
5. Theory of Logic / K. Features of Logics / 6. Compactness
Proof in finite subsets is sufficient for proof in an infinite set [Enderton]
5. Theory of Logic / K. Features of Logics / 7. Decidability
Expressions are 'decidable' if inclusion in them (or not) can be proved [Enderton]
5. Theory of Logic / K. Features of Logics / 8. Enumerability
For a reasonable language, the set of valid wff's can always be enumerated [Enderton]
9. Objects / C. Structure of Objects / 8. Parts of Objects / c. Wholes from parts
A whole must have one characteristic, an internal relation, and a structure [Rescher/Oppenheim]
10. Modality / B. Possibility / 8. Conditionals / f. Pragmatics of conditionals
Sentences with 'if' are only conditionals if they can read as A-implies-B [Enderton]
12. Knowledge Sources / B. Perception / 5. Interpretation
Research shows perceptual discrimination is sharper at category boundaries [Murphy]
14. Science / C. Induction / 1. Induction
Induction is said to just compare properties of categories, but the type of property also matters [Murphy]
18. Thought / D. Concepts / 1. Concepts / a. Nature of concepts
The main theories of concepts are exemplar, prototype and knowledge [Murphy]
18. Thought / D. Concepts / 4. Structure of Concepts / c. Classical concepts
The theoretical and practical definitions for the classical view are very hard to find [Murphy]
The classical definitional approach cannot distinguish typical and atypical category members [Murphy]
Classical concepts follow classical logic, but concepts in real life don't work that way [Murphy]
Classical concepts are transitive hierarchies, but actual categories may be intransitive [Murphy]
The classical core is meant to be the real concept, but actually seems unimportant [Murphy]
18. Thought / D. Concepts / 4. Structure of Concepts / d. Concepts as prototypes
There is no 'ideal' bird or dog, and prototypes give no information about variability [Murphy]
Prototypes are unified representations of the entire category (rather than of members) [Murphy]
The prototype theory uses observed features, but can't include their construction [Murphy]
The prototype theory handles hierarchical categories and combinations of concepts well [Murphy]
Prototypes theory of concepts is best, as a full description with weighted typical features [Murphy]
Learning concepts is forming prototypes with a knowledge structure [Murphy]
18. Thought / D. Concepts / 4. Structure of Concepts / e. Concepts from exemplars
The most popular theories of concepts are based on prototypes or exemplars [Murphy]
The exemplar view of concepts says 'dogs' is the set of dogs I remember [Murphy]
Exemplar theory struggles with hierarchical classification and with induction [Murphy]
Children using knowing and essentialist categories doesn't fit the exemplar view [Murphy]
Conceptual combination must be compositional, and can't be built up from exemplars [Murphy]
The concept of birds from exemplars must also be used in inductions about birds [Murphy]
18. Thought / D. Concepts / 4. Structure of Concepts / f. Theory theory of concepts
We do not learn concepts in isolation, but as an integrated part of broader knowledge [Murphy]
Concepts with familiar contents are easier to learn [Murphy]
Some knowledge is involved in instant use of categories, other knowledge in explanations [Murphy]
People categorise things consistent with their knowledge, even rejecting some good evidence [Murphy]