31 ideas
18781 | Inconsistency doesn't prevent us reasoning about some system [Mares] |
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] |
10775 | The axiom of choice now seems acceptable and obvious (if it is meaningful) [Tharp] |
10766 | Logic is either for demonstration, or for characterizing structures [Tharp] |
10767 | Elementary logic is complete, but cannot capture mathematics [Tharp] |
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] |
10769 | Second-order logic isn't provable, but will express set-theory and classic problems [Tharp] |
18786 | Excluded middle standardly implies bivalence; attacks use non-contradiction, De M 3, or double negation [Mares] |
18780 | Standard disjunction and negation force us to accept the principle of bivalence [Mares] |
18782 | The connectives are studied either through model theory or through proof theory [Mares] |
10762 | In sentential logic there is a simple proof that all truth functions can be reduced to 'not' and 'and' [Tharp] |
10776 | The main quantifiers extend 'and' and 'or' to infinite domains [Tharp] |
10774 | There are at least five unorthodox quantifiers that could be used [Tharp] |
18783 | Many-valued logics lack a natural deduction system [Mares] |
18792 | Situation semantics for logics: not possible worlds, but information in situations [Mares] |
10777 | Skolem mistakenly inferred that Cantor's conceptions were illusory [Tharp] |
10773 | The Löwenheim-Skolem property is a limitation (e.g. can't say there are uncountably many reals) [Tharp] |
18785 | Consistency is semantic, but non-contradiction is syntactic [Mares] |
10765 | Soundness would seem to be an essential requirement of a proof procedure [Tharp] |
10763 | Completeness and compactness together give axiomatizability [Tharp] |
10770 | If completeness fails there is no algorithm to list the valid formulas [Tharp] |
10771 | Compactness is important for major theories which have infinitely many axioms [Tharp] |
10772 | Compactness blocks infinite expansion, and admits non-standard models [Tharp] |
10764 | A complete logic has an effective enumeration of the valid formulas [Tharp] |
10768 | Effective enumeration might be proved but not specified, so it won't guarantee knowledge [Tharp] |
18788 | For intuitionists there are not numbers and sets, but processes of counting and collecting [Mares] |
17319 | There are 'conceptual' explanations, with their direction depending on complexity [Schnieder] |
18791 | In 'situation semantics' our main concepts are abstracted from situations [Mares] |