56 ideas
| 19199 | Some say metaphysics is a highly generalised empirical study of objects [Tarski] |
| 19193 | Disputes that fail to use precise scientific terminology are all meaningless [Tarski] |
| 19179 | For a definition we need the words or concepts used, the rules, and the structure of the language [Tarski] |
| 19178 | Definitions of truth should not introduce a new version of the concept, but capture the old one [Tarski] |
| 19177 | A definition of truth should be materially adequate and formally correct [Tarski] |
| 19186 | A rigorous definition of truth is only possible in an exactly specified language [Tarski] |
| 19194 | We may eventually need to split the word 'true' into several less ambiguous terms [Tarski] |
| 19180 | It is convenient to attach 'true' to sentences, and hence the language must be specified [Tarski] |
| 19181 | In the classical concept of truth, 'snow is white' is true if snow is white [Tarski] |
| 19196 | Scheme (T) is not a definition of truth [Tarski] |
| 19183 | Each interpreted T-sentence is a partial definition of truth; the whole definition is their conjunction [Tarski] |
| 19182 | Use 'true' so that all T-sentences can be asserted, and the definition will then be 'adequate' [Tarski] |
| 19198 | We don't give conditions for asserting 'snow is white'; just that assertion implies 'snow is white' is true [Tarski] |
| 19184 | The best truth definition involves other semantic notions, like satisfaction (relating terms and objects) [Tarski] |
| 19191 | Specify satisfaction for simple sentences, then compounds; true sentences are satisfied by all objects [Tarski] |
| 19188 | We can't use a semantically closed language, or ditch our logic, so a meta-language is needed [Tarski] |
| 19189 | The metalanguage must contain the object language, logic, and defined semantics [Tarski] |
| 10824 | If listing equivalences is a reduction of truth, witchcraft is just a list of witch-victim pairs [Field,H on Tarski] |
| 19190 | We need an undefined term 'true' in the meta-language, specified by axioms [Tarski] |
| 19197 | Truth can't be eliminated from universal claims, or from particular unspecified claims [Tarski] |
| 19185 | Semantics is a very modest discipline which solves no real problems [Tarski] |
| 19195 | Truth tables give prior conditions for logic, but are outside the system, and not definitions [Tarski] |
| 9724 | Until the 1960s the only semantics was truth-tables [Enderton] |
| 9703 | 'dom R' indicates the 'domain' of objects having a relation [Enderton] |
| 9705 | 'fld R' indicates the 'field' of all objects in the relation [Enderton] |
| 9704 | 'ran R' indicates the 'range' of objects being related to [Enderton] |
| 9710 | We write F:A→B to indicate that A maps into B (the output of F on A is in B) [Enderton] |
| 9707 | 'F(x)' is the unique value which F assumes for a value of x [Enderton] |
| 9712 | A relation is 'symmetric' on a set if every ordered pair has the relation in both directions [Enderton] |
| 9713 | A relation is 'transitive' if it can be carried over from two ordered pairs to a third [Enderton] |
| 9699 | The 'powerset' of a set is all the subsets of a given set [Enderton] |
| 9700 | Two sets are 'disjoint' iff their intersection is empty [Enderton] |
| 9702 | A 'domain' of a relation is the set of members of ordered pairs in the relation [Enderton] |
| 9701 | A 'relation' is a set of ordered pairs [Enderton] |
| 9706 | A 'function' is a relation in which each object is related to just one other object [Enderton] |
| 9708 | A function 'maps A into B' if the relating things are set A, and the things related to are all in B [Enderton] |
| 9709 | A function 'maps A onto B' if the relating things are set A, and the things related to are set B [Enderton] |
| 9711 | A relation is 'reflexive' on a set if every member bears the relation to itself [Enderton] |
| 9714 | A relation satisfies 'trichotomy' if all pairs are either relations, or contain identical objects [Enderton] |
| 9717 | A set is 'dominated' by another if a one-to-one function maps the first set into a subset of the second [Enderton] |
| 9715 | An 'equivalence relation' is a reflexive, symmetric and transitive binary relation [Enderton] |
| 9716 | We 'partition' a set into distinct subsets, according to each relation on its objects [Enderton] |
| 9722 | Inference not from content, but from the fact that it was said, is 'conversational implicature' [Enderton] |
| 9718 | Validity is either semantic (what preserves truth), or proof-theoretic (following procedures) [Enderton] |
| 19192 | The truth definition proves semantic contradiction and excluded middle laws (not the logic laws) [Tarski] |
| 9721 | A logical truth or tautology is a logical consequence of the empty set [Enderton] |
| 9994 | A truth assignment to the components of a wff 'satisfy' it if the wff is then True [Enderton] |
| 9719 | A proof theory is 'sound' if its valid inferences entail semantic validity [Enderton] |
| 9720 | A proof theory is 'complete' if semantically valid inferences entail proof-theoretic validity [Enderton] |
| 9995 | Proof in finite subsets is sufficient for proof in an infinite set [Enderton] |
| 9996 | Expressions are 'decidable' if inclusion in them (or not) can be proved [Enderton] |
| 9997 | For a reasonable language, the set of valid wff's can always be enumerated [Enderton] |
| 19187 | The Liar makes us assert a false sentence, so it must be taken seriously [Tarski] |
| 9723 | Sentences with 'if' are only conditionals if they can read as A-implies-B [Enderton] |
| 13304 | Learned men gain more in one day than others do in a lifetime [Posidonius] |
| 20820 | Time is an interval of motion, or the measure of speed [Posidonius, by Stobaeus] |