Combining Texts

All the ideas for 'The Individuation of Events', 'Propositions' and 'A Mathematical Introduction to Logic (2nd)'

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


45 ideas

3. Truth / A. Truth Problems / 5. Truth Bearers
Are the truth-bearers sentences, utterances, ideas, beliefs, judgements, propositions or statements? [Cartwright,R]
Logicians take sentences to be truth-bearers for rigour, rather than for philosophical reasons [Cartwright,R]
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 / 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]
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 / G. Quantification / 2. Domain of Quantification
Davidson controversially proposed to quantify over events [Davidson, by Engelbretsen]
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]
7. Existence / B. Change in Existence / 4. Events / b. Events as primitive
You can't identify events by causes and effects, as the event needs to be known first [Dummett on Davidson]
Events can only be individuated causally [Davidson, by Schaffer,J]
We need events for action statements, causal statements, explanation, mind-and-body, and adverbs [Davidson, by Bourne]
7. Existence / B. Change in Existence / 4. Events / c. Reduction of events
The claim that events are individuated by their causal relations to other events is circular [Lowe on Davidson]
9. Objects / F. Identity among Objects / 4. Type Identity
A token isn't a unique occurrence, as the case of a word or a number shows [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]
19. Language / A. Nature of Meaning / 1. Meaning
For any statement, there is no one meaning which any sentence asserting it must have [Cartwright,R]
People don't assert the meaning of the words they utter [Cartwright,R]
19. Language / D. Propositions / 1. Propositions
We can pull apart assertion from utterance, and the action, the event and the subject-matter for each [Cartwright,R]
'It's raining' makes a different assertion on different occasions, but its meaning remains the same [Cartwright,R]
19. Language / D. Propositions / 4. Mental Propositions
We can attribute 'true' and 'false' to whatever it was that was said [Cartwright,R]
To assert that p, it is neither necessary nor sufficient to utter some particular words [Cartwright,R]
19. Language / F. Communication / 2. Assertion
Assertions, unlike sentence meanings, can be accurate, probable, exaggerated, false.... [Cartwright,R]