Combining Texts

All the ideas for 'works', 'A Mathematical Introduction to Logic (2nd)' and 'Truthmakers and Converse Barcan Formula'

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


44 ideas

3. Truth / B. Truthmakers / 5. What Makes Truths / b. Objects make truths
The truthmaker principle requires some specific named thing to make the difference [Williamson]
3. Truth / B. Truthmakers / 7. Making Modal Truths
Truthmaker is incompatible with modal semantics of varying domains [Williamson]
The converse Barcan formula will not allow contingent truths to have truthmakers [Williamson]
4. Formal Logic / B. Propositional Logic PL / 3. Truth Tables
Until the 1960s the only semantics was truth-tables [Enderton]
4. Formal Logic / D. Modal Logic ML / 3. Modal Logic Systems / h. System S5
If metaphysical possibility is not a contingent matter, then S5 seems to suit it best [Williamson]
4. Formal Logic / D. Modal Logic ML / 7. Barcan Formula
If the domain of propositional quantification is constant, the Barcan formulas hold [Williamson]
Converse Barcan: could something fail to meet a condition, if everything meets that condition? [Williamson]
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 / 1. Quantification
Not all quantification is either objectual or substitutional [Williamson]
5. Theory of Logic / G. Quantification / 4. Substitutional Quantification
Substitutional quantification is metaphysical neutral, and equivalent to a disjunction of instances [Williamson]
5. Theory of Logic / G. Quantification / 7. Unorthodox Quantification
Not all quantification is objectual or substitutional [Williamson]
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 / D. Theories of Reality / 8. Facts / a. Facts
If 'fact' is a noun, can we name the fact that dogs bark 'Mary'? [Williamson]
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]
10. Modality / E. Possible worlds / 3. Transworld Objects / e. Possible Objects
Our ability to count objects across possibilities favours the Barcan formulas [Williamson]
28. God / B. Proving God / 2. Proofs of Reason / b. Ontological Proof critique
A thing can't be the only necessary existent, because its singleton set would be as well [Williamson]
29. Religion / B. Monotheistic Religion / 4. Christianity / d. Heresy
Philosophers are the forefathers of heretics [Tertullian]
29. Religion / D. Religious Issues / 1. Religious Commitment / e. Fideism
I believe because it is absurd [Tertullian]