59 ideas
| 18835 | Logic doesn't have a metaphysical basis, but nor can logic give rise to the metaphysics [Rumfitt] |
| 18819 | The idea that there are unrecognised truths is basic to our concept of truth [Rumfitt] |
| 18826 | 'True at a possibility' means necessarily true if what is said had obtained [Rumfitt] |
| 18803 | Semantics for propositions: 1) validity preserves truth 2) non-contradition 3) bivalence 4) truth tables [Rumfitt] |
| 18814 | 'Absolute necessity' would have to rest on S5 [Rumfitt] |
| 18798 | It is the second-order part of intuitionistic logic which actually negates some classical theorems [Rumfitt] |
| 18799 | Intuitionists can accept Double Negation Elimination for decidable propositions [Rumfitt] |
| 10888 | Sets can be defined by 'enumeration', or by 'abstraction' (based on a property) [Zalabardo] |
| 18830 | Most set theorists doubt bivalence for the Continuum Hypothesis, but still use classical logic [Rumfitt] |
| 10889 | The 'Cartesian Product' of two sets relates them by pairing every element with every element [Zalabardo] |
| 10890 | A 'partial ordering' is reflexive, antisymmetric and transitive [Zalabardo] |
| 18843 | The iterated conception of set requires continual increase in axiom strength [Rumfitt] |
| 10886 | Determinacy: an object is either in a set, or it isn't [Zalabardo] |
| 18836 | A set may well not consist of its members; the empty set, for example, is a problem [Rumfitt] |
| 18837 | A set can be determinate, because of its concept, and still have vague membership [Rumfitt] |
| 18845 | If the totality of sets is not well-defined, there must be doubt about the Power Set Axiom [Rumfitt] |
| 10887 | Specification: Determinate totals of objects always make a set [Zalabardo] |
| 18815 | Logic is higher-order laws which can expand the range of any sort of deduction [Rumfitt] |
| 10897 | A first-order 'sentence' is a formula with no free variables [Zalabardo] |
| 18804 | The case for classical logic rests on its rules, much more than on the Principle of Bivalence [Rumfitt] |
| 18805 | Classical logic rules cannot be proved, but various lines of attack can be repelled [Rumfitt] |
| 18827 | If truth-tables specify the connectives, classical logic must rely on Bivalence [Rumfitt] |
| 18813 | Logical consequence is a relation that can extended into further statements [Rumfitt] |
| 18808 | Normal deduction presupposes the Cut Law [Rumfitt] |
| 10893 | Γ |= φ for sentences if φ is true when all of Γ is true [Zalabardo] |
| 10899 | Γ |= φ if φ is true when all of Γ is true, for all structures and interpretations [Zalabardo] |
| 18840 | When faced with vague statements, Bivalence is not a compelling principle [Rumfitt] |
| 18802 | In specifying a logical constant, use of that constant is quite unavoidable [Rumfitt] |
| 10896 | Propositional logic just needs ¬, and one of ∧, ∨ and → [Zalabardo] |
| 18800 | Introduction rules give deduction conditions, and Elimination says what can be deduced [Rumfitt] |
| 10898 | The semantics shows how truth values depend on instantiations of properties and relations [Zalabardo] |
| 10902 | We can do semantics by looking at given propositions, or by building new ones [Zalabardo] |
| 10892 | We make a truth assignment to T and F, which may be true and false, but merely differ from one another [Zalabardo] |
| 18809 | Logical truths are just the assumption-free by-products of logical rules [Rumfitt] |
| 10895 | 'Logically true' (|= φ) is true for every truth-assignment [Zalabardo] |
| 10900 | Logically true sentences are true in all structures [Zalabardo] |
| 10894 | A sentence-set is 'satisfiable' if at least one truth-assignment makes them all true [Zalabardo] |
| 10901 | Some formulas are 'satisfiable' if there is a structure and interpretation that makes them true [Zalabardo] |
| 10903 | A structure models a sentence if it is true in the model, and a set of sentences if they are all true in the model [Zalabardo] |
| 18807 | Monotonicity means there is a guarantee, rather than mere inductive support [Rumfitt] |
| 13163 | Circles must be bounded, so cannot be infinite [Leibniz] |
| 18842 | Maybe an ordinal is a property of isomorphic well-ordered sets, and not itself a set [Rumfitt] |
| 18834 | Infinitesimals do not stand in a determinate order relation to zero [Rumfitt] |
| 18846 | Cantor and Dedekind aimed to give analysis a foundation in set theory (rather than geometry) [Rumfitt] |
| 10891 | If a set is defined by induction, then proof by induction can be applied to it [Zalabardo] |
| 18839 | An object that is not clearly red or orange can still be red-or-orange, which sweeps up problem cases [Rumfitt] |
| 18838 | The extension of a colour is decided by a concept's place in a network of contraries [Rumfitt] |
| 18816 | Metaphysical modalities respect the actual identities of things [Rumfitt] |
| 18825 | S5 is the logic of logical necessity [Rumfitt] |
| 18824 | Since possibilities are properties of the world, calling 'red' the determination of a determinable seems right [Rumfitt] |
| 18828 | If two possibilities can't share a determiner, they are incompatible [Rumfitt] |
| 18821 | Possibilities are like possible worlds, but not fully determinate or complete [Rumfitt] |
| 18831 | Medieval logicians said understanding A also involved understanding not-A [Rumfitt] |
| 18820 | In English 'evidence' is a mass term, qualified by 'little' and 'more' [Rumfitt] |
| 13162 | Sloth's Syllogism: either it can't happen, or it is inevitable without my effort [Leibniz] |
| 18817 | We understand conditionals, but disagree over their truth-conditions [Rumfitt] |
| 18829 | The truth grounds for 'not A' are the possibilities incompatible with truth grounds for A [Rumfitt] |
| 19339 | Evil is a negation of good, which arises from non-being [Leibniz] |
| 13164 | God only made sin possible because a much greater good can be derived from it [Leibniz] |