10 ideas
8920 | Equivalence relations are reflexive, symmetric and transitive, and classify similar objects [Lipschutz] |
8758 | We could talk of open sentences, instead of sets [Chihara, by Shapiro] |
11022 | Gentzen introduced a natural deduction calculus (NK) in 1934 [Gentzen, by Read] |
11065 | The inferential role of a logical constant constitutes its meaning [Gentzen, by Hanna] |
11023 | The logical connectives are 'defined' by their introduction rules [Gentzen] |
11213 | Each logical symbol has an 'introduction' rule to define it, and hence an 'elimination' rule [Gentzen] |
10067 | Gentzen proved the consistency of arithmetic from assumptions beyond arithmetic [Gentzen, by Musgrave] |
10265 | Chihara's system is a variant of type theory, from which he can translate sentences [Chihara, by Shapiro] |
8759 | We can replace type theory with open sentences and a constructibility quantifier [Chihara, by Shapiro] |
10264 | Introduce a constructibility quantifiers (Cx)Φ - 'it is possible to construct an x such that Φ' [Chihara, by Shapiro] |