51 ideas
| 16877 | A 'constructive' (as opposed to 'analytic') definition creates a new sign [Frege] |
| 11219 | Frege suggested that mathematics should only accept stipulative definitions [Frege, by Gupta] |
| 16878 | We must be clear about every premise and every law used in a proof [Frege] |
| 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] |
| 16867 | Logic not only proves things, but also reveals logical relations between them [Frege] |
| 16863 | Does some mathematical reasoning (such as mathematical induction) not belong to logic? [Frege] |
| 16862 | The closest subject to logic is mathematics, which does little apart from drawing inferences [Frege] |
| 9718 | Validity is either semantic (what preserves truth), or proof-theoretic (following procedures) [Enderton] |
| 16865 | 'Theorems' are both proved, and used in proofs [Frege] |
| 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] |
| 16866 | Tracing inference backwards closes in on a small set of axioms and postulates [Frege] |
| 16868 | The essence of mathematics is the kernel of primitive truths on which it rests [Frege] |
| 16871 | A truth can be an axiom in one system and not in another [Frege] |
| 16870 | Axioms are truths which cannot be doubted, and for which no proof is needed [Frege] |
| 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] |
| 16869 | To create order in mathematics we need a full system, guided by patterns of inference [Frege] |
| 16864 | If principles are provable, they are theorems; if not, they are axioms [Frege] |
| 9388 | Every concept must have a sharp boundary; we cannot allow an indeterminate third case [Frege] |
| 9723 | Sentences with 'if' are only conditionals if they can read as A-implies-B [Enderton] |
| 16876 | We need definitions to cram retrievable sense into a signed receptacle [Frege] |
| 16875 | We use signs to mark receptacles for complex senses [Frege] |
| 16879 | A sign won't gain sense just from being used in sentences with familiar components [Frege] |
| 16873 | Thoughts are not subjective or psychological, because some thoughts are the same for us all [Frege] |
| 16872 | A thought is the sense expressed by a sentence, and is what we prove [Frege] |
| 16874 | The parts of a thought map onto the parts of a sentence [Frege] |
| 467 | A virtue is a combination of intelligence, strength and luck [Ion] |