66 ideas
17713 | After 1903, Husserl avoids metaphysical commitments [Mares] |
18781 | Inconsistency doesn't prevent us reasoning about some system [Mares] |
9724 | Until the 1960s the only semantics was truth-tables [Enderton] |
18789 | Intuitionist logic looks best as natural deduction [Mares] |
18790 | Intuitionism as natural deduction has no rule for negation [Mares] |
18787 | Three-valued logic is useful for a theory of presupposition [Mares] |
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] |
13201 | ∈ says the whole set is in the other; ⊆ says the members of the subset are in the other [Enderton] |
13206 | A 'linear or total ordering' must be transitive and satisfy trichotomy [Enderton] |
13204 | The 'ordered pair' <x,y> is defined to be {{x}, {x,y}} [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] |
13200 | Note that {Φ} =/= Φ, because Φ ∈ {Φ} but Φ ∉ Φ [Enderton] |
13199 | The empty set may look pointless, but many sets can be constructed from it [Enderton] |
13203 | The singleton is defined using the pairing axiom (as {x,x}) [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] |
13202 | Fraenkel added Replacement, to give a theory of ordinal numbers [Enderton] |
13205 | We can only define functions if Choice tells us which items are involved [Enderton] |
9722 | Inference not from content, but from the fact that it was said, is 'conversational implicature' [Enderton] |
18793 | Material implication (and classical logic) considers nothing but truth values for implications [Mares] |
18784 | In classical logic the connectives can be related elegantly, as in De Morgan's laws [Mares] |
9718 | Validity is either semantic (what preserves truth), or proof-theoretic (following procedures) [Enderton] |
18780 | Standard disjunction and negation force us to accept the principle of bivalence [Mares] |
18786 | Excluded middle standardly implies bivalence; attacks use non-contradiction, De M 3, or double negation [Mares] |
18782 | The connectives are studied either through model theory or through proof theory [Mares] |
18783 | Many-valued logics lack a natural deduction system [Mares] |
18792 | Situation semantics for logics: not possible worlds, but information in situations [Mares] |
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] |
18785 | Consistency is semantic, but non-contradiction is syntactic [Mares] |
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] |
17715 | The truth of the axioms doesn't matter for pure mathematics, but it does for applied [Mares] |
17716 | Mathematics is relations between properties we abstract from experience [Mares] |
18788 | For intuitionists there are not numbers and sets, but processes of counting and collecting [Mares] |
9723 | Sentences with 'if' are only conditionals if they can read as A-implies-B [Enderton] |
17703 | Light in straight lines is contingent a priori; stipulated as straight, because they happen to be so [Mares] |
17714 | Aristotelians dislike the idea of a priori judgements from pure reason [Mares] |
17705 | Empiricists say rationalists mistake imaginative powers for modal insights [Mares] |
17700 | The most popular view is that coherent beliefs explain one another [Mares] |
17704 | Operationalism defines concepts by our ways of measuring them [Mares] |
17710 | Aristotelian justification uses concepts abstracted from experience [Mares] |
17706 | The essence of a concept is either its definition or its conceptual relations? [Mares] |
18791 | In 'situation semantics' our main concepts are abstracted from situations [Mares] |
17701 | Possible worlds semantics has a nice compositional account of modal statements [Mares] |
17702 | Unstructured propositions are sets of possible worlds; structured ones have components [Mares] |
20930 | The existence of law is one thing, its merits and demerits another [Austin,J] |
17708 | Maybe space has points, but processes always need regions with a size [Mares] |