Combining Texts

All the ideas for 'Against Structural Universals', 'Outline of a Theory of Truth' and 'A Mathematical Introduction to Logic (2nd)'

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


52 ideas

3. Truth / F. Semantic Truth / 2. Semantic Truth
Kripke's semantic theory has actually inspired promising axiomatic theories [Kripke, by Horsten]
Kripke offers a semantic theory of truth (involving models) [Kripke, by Horsten]
3. Truth / G. Axiomatic Truth / 1. Axiomatic Truth
The Tarskian move to a metalanguage may not be essential for truth theories [Kripke, by Gupta]
Certain three-valued languages can contain their own truth predicates [Kripke, by Gupta]
3. Truth / G. Axiomatic Truth / 3. KF Truth Axioms
Kripke classified fixed points, and illuminated their use for clarifications [Kripke, by Halbach]
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 / 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]
8. Modes of Existence / B. Properties / 4. Intrinsic Properties
If you think universals are immanent, you must believe them to be sparse, and not every related predicate [Lewis]
8. Modes of Existence / B. Properties / 5. Natural Properties
I assume there could be natural properties that are not instantiated in our world [Lewis]
8. Modes of Existence / B. Properties / 13. Tropes / a. Nature of tropes
Tropes are particular properties, which cannot recur, but can be exact duplicates [Lewis]
8. Modes of Existence / D. Universals / 2. Need for Universals
Universals are meant to give an account of resemblance [Lewis]
8. Modes of Existence / E. Nominalism / 5. Class Nominalism
We can add a primitive natural/unnatural distinction to class nominalism [Lewis]
9. Objects / C. Structure of Objects / 1. Structure of an Object
The 'magical' view of structural universals says they are atoms, even though they have parts [Lewis]
If 'methane' is an atomic structural universal, it has nothing to connect it to its carbon universals [Lewis]
The 'pictorial' view of structural universals says they are wholes made of universals as parts [Lewis]
The structural universal 'methane' needs the universal 'hydrogen' four times over [Lewis]
Butane and Isobutane have the same atoms, but different structures [Lewis]
Structural universals have a necessary connection to the universals forming its parts [Lewis]
We can't get rid of structural universals if there are no simple universals [Lewis]
9. Objects / C. Structure of Objects / 5. Composition of an Object
Composition is not just making new things from old; there are too many counterexamples [Lewis]
9. Objects / C. Structure of Objects / 8. Parts of Objects / c. Wholes from parts
A whole is distinct from its parts, but is not a further addition in ontology [Lewis]
Different things (a toy house and toy car) can be made of the same parts at different times [Lewis]
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]
15. Nature of Minds / C. Capacities of Minds / 3. Abstraction by mind
Maybe abstraction is just mereological subtraction [Lewis]
18. Thought / E. Abstraction / 7. Abstracta by Equivalence
Mathematicians abstract by equivalence classes, but that doesn't turn a many into one [Lewis]