Combining Texts

All the ideas for 'Some Remarks on Essentialism', 'A Mathematical Introduction to Logic (2nd)' and 'Frege versus Cantor and Dedekind'

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


42 ideas

1. Philosophy / F. Analytic Philosophy / 7. Limitations of Analysis
Analytic philosophy focuses too much on forms of expression, instead of what is actually said [Tait]
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
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 '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
The null set was doubted, because numbering seemed to require 'units' [Tait]
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 / 7. Natural Sets
We can have a series with identical members [Tait]
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 / D. Essence of Objects / 7. Essence and Necessity / a. Essence as necessary properties
Essentialism says some of a thing's properties are necessary, and could not be absent [Cartwright,R]
9. Objects / D. Essence of Objects / 14. Knowledge of Essences
The difficulty in essentialism is deciding the grounds for rating an attribute as essential [Cartwright,R]
9. Objects / D. Essence of Objects / 15. Against Essentialism
Essentialism is said to be unintelligible, because relative, if necessary truths are all analytic [Cartwright,R]
9. Objects / F. Identity among Objects / 3. Relative Identity
An act of ostension doesn't seem to need a 'sort' of thing, even of a very broad kind [Cartwright,R]
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]
18. Thought / E. Abstraction / 2. Abstracta by Selection
Abstraction is 'logical' if the sense and truth of the abstraction depend on the concrete [Tait]
Cantor and Dedekind use abstraction to fix grammar and objects, not to carry out proofs [Tait]
18. Thought / E. Abstraction / 7. Abstracta by Equivalence
Abstraction may concern the individuation of the set itself, not its elements [Tait]
18. Thought / E. Abstraction / 8. Abstractionism Critique
Why should abstraction from two equipollent sets lead to the same set of 'pure units'? [Tait]
If abstraction produces power sets, their identity should imply identity of the originals [Tait]