56 ideas
| 9023 | If you say that a contradiction is true, you change the meaning of 'not', and so change the subject [Quine] |
| 9012 | Talk of 'truth' when sentences are mentioned; it reminds us that reality is the point of sentences [Quine] |
| 9011 | Truth is redundant for single sentences; we do better to simply speak the sentence [Quine] |
| 9013 | We can eliminate 'or' from our basic theory, by paraphrasing 'p or q' as 'not(not-p and not-q)' [Quine] |
| 9724 | Until the 1960s the only semantics was truth-tables [Enderton] |
| 9707 | 'F(x)' is the unique value which F assumes for a value of x [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] |
| 9703 | 'dom R' indicates the 'domain' of objects having a relation [Enderton] |
| 9710 | We write F:A→B to indicate that A maps into B (the output of F on A is in B) [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] |
| 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] |
| 9701 | A 'relation' is a set of ordered pairs [Enderton] |
| 9702 | A 'domain' of a relation is the set of members of ordered pairs in the relation [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] |
| 9706 | A 'function' is a relation in which each object is related to just one other object [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] |
| 9716 | We 'partition' a set into distinct subsets, according to each relation on its objects [Enderton] |
| 9715 | An 'equivalence relation' is a reflexive, symmetric and transitive binary relation [Enderton] |
| 9722 | Inference not from content, but from the fact that it was said, is 'conversational implicature' [Enderton] |
| 9020 | My logical grammar has sentences by predication, then negation, conjunction, and existential quantification [Quine] |
| 9028 | Maybe logical truth reflects reality, but in different ways in different languages [Quine] |
| 10014 | Quine rejects second-order logic, saying that predicates refer to multiple objects [Quine, by Hodes] |
| 10828 | Quantifying over predicates is treating them as names of entities [Quine] |
| 9718 | Validity is either semantic (what preserves truth), or proof-theoretic (following procedures) [Enderton] |
| 9024 | Excluded middle has three different definitions [Quine] |
| 10012 | Quantification theory can still be proved complete if we add identity [Quine] |
| 9016 | Names are not essential, because naming can be turned into predication [Quine] |
| 9015 | Universal quantification is widespread, but it is definable in terms of existential quantification [Quine] |
| 9025 | You can't base quantification on substituting names for variables, if the irrationals cannot all be named [Quine] |
| 9026 | Some quantifications could be false substitutionally and true objectually, because of nameless objects [Quine] |
| 10705 | Putting a predicate letter in a quantifier is to make it the name of an entity [Quine] |
| 9027 | A sentence is logically true if all sentences with that grammatical structure are true [Quine] |
| 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] |
| 9017 | Predicates are not names; predicates are the other parties to predication [Quine] |
| 9018 | A physical object is the four-dimensional material content of a portion of space-time [Quine] |
| 9019 | Four-d objects helps predication of what no longer exists, and quantification over items from different times [Quine] |
| 9014 | Some conditionals can be explained just by negation and conjunction: not(p and not-q) [Quine] |
| 9723 | Sentences with 'if' are only conditionals if they can read as A-implies-B [Enderton] |
| 9009 | Single words are strongly synonymous if their interchange preserves truth [Quine] |
| 9007 | It makes no sense to say that two sentences express the same proposition [Quine] |
| 9008 | There is no rule for separating the information from other features of sentences [Quine] |
| 9010 | We can abandon propositions, and just talk of sentences and equivalence [Quine] |
| 9021 | A good way of explaining an expression is saying what conditions make its contexts true [Quine] |
| 7903 | The six perfections are giving, morality, patience, vigour, meditation, and wisdom [Nagarjuna] |