116 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] |
| 13439 | Venn Diagrams map three predicates into eight compartments, then look for the conclusion [Bostock] |
| 18803 | Semantics for propositions: 1) validity preserves truth 2) non-contradition 3) bivalence 4) truth tables [Rumfitt] |
| 13421 | 'Disjunctive Normal Form' is ensuring that no conjunction has a disjunction within its scope [Bostock] |
| 13422 | 'Conjunctive Normal Form' is ensuring that no disjunction has a conjunction within its scope [Bostock] |
| 13355 | 'Disjunction' says that Γ,φ∨ψ|= iff Γ,φ|= and Γ,ψ|= [Bostock] |
| 13350 | 'Assumptions' says that a formula entails itself (φ|=φ) [Bostock] |
| 13351 | 'Thinning' allows that if premisses entail a conclusion, then adding further premisses makes no difference [Bostock] |
| 13356 | The 'conditional' is that Γ|=φ→ψ iff Γ,φ|=ψ [Bostock] |
| 13352 | 'Cutting' allows that if x is proved, and adding y then proves z, you can go straight to z [Bostock] |
| 13353 | 'Negation' says that Γ,¬φ|= iff Γ|=φ [Bostock] |
| 13354 | 'Conjunction' says that Γ|=φ∧ψ iff Γ|=φ and Γ|=ψ [Bostock] |
| 13610 | A logic with ¬ and → needs three axiom-schemas and one rule as foundation [Bostock] |
| 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] |
| 13846 | A 'free' logic can have empty names, and a 'universally free' logic can have empty domains [Bostock] |
| 18830 | Most set theorists doubt bivalence for the Continuum Hypothesis, but still use classical logic [Rumfitt] |
| 18843 | The iterated conception of set requires continual increase in axiom strength [Rumfitt] |
| 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] |
| 18815 | Logic is higher-order laws which can expand the range of any sort of deduction [Rumfitt] |
| 13346 | Truth is the basic notion in classical logic [Bostock] |
| 13545 | Elementary logic cannot distinguish clearly between the finite and the infinite [Bostock] |
| 13822 | Fictional characters wreck elementary logic, as they have contradictions and no excluded middle [Bostock] |
| 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] |
| 13623 | The syntactic turnstile |- φ means 'there is a proof of φ' or 'φ is a theorem' [Bostock] |
| 18808 | Normal deduction presupposes the Cut Law [Rumfitt] |
| 13347 | Validity is a conclusion following for premises, even if there is no proof [Bostock] |
| 13348 | It seems more natural to express |= as 'therefore', rather than 'entails' [Bostock] |
| 13349 | Γ|=φ is 'entails'; Γ|= is 'is inconsistent'; |=φ is 'valid' [Bostock] |
| 13617 | MPP is a converse of Deduction: If Γ |- φ→ψ then Γ,φ|-ψ [Bostock] |
| 13614 | MPP: 'If Γ|=φ and Γ|=φ→ψ then Γ|=ψ' (omit Γs for Detachment) [Bostock] |
| 18840 | When faced with vague statements, Bivalence is not a compelling principle [Rumfitt] |
| 13799 | The sign '=' is a two-place predicate expressing that 'a is the same thing as b' (a=b) [Bostock] |
| 13800 | |= α=α and α=β |= φ(α/ξ ↔ φ(β/ξ) fix identity [Bostock] |
| 13803 | If we are to express that there at least two things, we need identity [Bostock] |
| 13357 | Truth-functors are usually held to be defined by their truth-tables [Bostock] |
| 18802 | In specifying a logical constant, use of that constant is quite unavoidable [Rumfitt] |
| 13812 | A 'zero-place' function just has a single value, so it is a name [Bostock] |
| 13811 | A 'total' function ranges over the whole domain, a 'partial' function over appropriate inputs [Bostock] |
| 13360 | In logic, a name is just any expression which refers to a particular single object [Bostock] |
| 13361 | An expression is only a name if it succeeds in referring to a real object [Bostock] |
| 13814 | Definite desciptions resemble names, but can't actually be names, if they don't always refer [Bostock] |
| 13816 | Because of scope problems, definite descriptions are best treated as quantifiers [Bostock] |
| 13817 | Definite descriptions are usually treated like names, and are just like them if they uniquely refer [Bostock] |
| 13848 | We are only obliged to treat definite descriptions as non-names if only the former have scope [Bostock] |
| 13813 | Definite descriptions don't always pick out one thing, as in denials of existence, or errors [Bostock] |
| 13815 | Names do not have scope problems (e.g. in placing negation), but Russell's account does have that problem [Bostock] |
| 13438 | 'Prenex normal form' is all quantifiers at the beginning, out of the scope of truth-functors [Bostock] |
| 13818 | If we allow empty domains, we must allow empty names [Bostock] |
| 13801 | An 'informal proof' is in no particular system, and uses obvious steps and some ordinary English [Bostock] |
| 13619 | Quantification adds two axiom-schemas and a new rule [Bostock] |
| 13622 | Axiom systems from Frege, Russell, Church, Lukasiewicz, Tarski, Nicod, Kleene, Quine... [Bostock] |
| 13615 | 'Conditonalised' inferences point to the Deduction Theorem: If Γ,φ|-ψ then Γ|-φ→ψ [Bostock] |
| 13620 | Proof by Assumptions can always be reduced to Proof by Axioms, using the Deduction Theorem [Bostock] |
| 13621 | The Deduction Theorem and Reductio can 'discharge' assumptions - they aren't needed for the new truth [Bostock] |
| 13616 | The Deduction Theorem greatly simplifies the search for proof [Bostock] |
| 18800 | Introduction rules give deduction conditions, and Elimination says what can be deduced [Rumfitt] |
| 13753 | Natural deduction takes proof from assumptions (with its rules) as basic, and axioms play no part [Bostock] |
| 13755 | Excluded middle is an introduction rule for negation, and ex falso quodlibet will eliminate it [Bostock] |
| 13758 | In natural deduction we work from the premisses and the conclusion, hoping to meet in the middle [Bostock] |
| 13754 | Natural deduction rules for → are the Deduction Theorem (→I) and Modus Ponens (→E) [Bostock] |
| 13611 | Tableau proofs use reduction - seeking an impossible consequence from an assumption [Bostock] |
| 13613 | A completed open branch gives an interpretation which verifies those formulae [Bostock] |
| 13612 | Non-branching rules add lines, and branching rules need a split; a branch with a contradiction is 'closed' [Bostock] |
| 13761 | In a tableau proof no sequence is established until the final branch is closed; hypotheses are explored [Bostock] |
| 13757 | Unlike natural deduction, semantic tableaux have recipes for proving things [Bostock] |
| 13756 | A tree proof becomes too broad if its only rule is Modus Ponens [Bostock] |
| 13762 | Tableau rules are all elimination rules, gradually shortening formulae [Bostock] |
| 13759 | Each line of a sequent calculus is a conclusion of previous lines, each one explicitly recorded [Bostock] |
| 13760 | A sequent calculus is good for comparing proof systems [Bostock] |
| 13364 | Interpretation by assigning objects to names, or assigning them to variables first [Bostock, by PG] |
| 18809 | Logical truths are just the assumption-free by-products of logical rules [Rumfitt] |
| 13821 | Extensionality is built into ordinary logic semantics; names have objects, predicates have sets of objects [Bostock] |
| 13362 | If an object has two names, truth is undisturbed if the names are swapped; this is Extensionality [Bostock] |
| 13541 | For 'negation-consistent', there is never |-(S)φ and |-(S)¬φ [Bostock] |
| 13542 | A proof-system is 'absolutely consistent' iff we don't have |-(S)φ for every formula [Bostock] |
| 13540 | A set of formulae is 'inconsistent' when there is no interpretation which can make them all true [Bostock] |
| 13544 | Inconsistency or entailment just from functors and quantifiers is finitely based, if compact [Bostock] |
| 13618 | Compactness means an infinity of sequents on the left will add nothing new [Bostock] |
| 18807 | Monotonicity means there is a guarantee, rather than mere inductive support [Rumfitt] |
| 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] |
| 13358 | Ordinary or mathematical induction assumes for the first, then always for the next, and hence for all [Bostock] |
| 13359 | Complete induction assumes for all numbers less than n, then also for n, and hence for all numbers [Bostock] |
| 13543 | A relation is not reflexive, just because it is transitive and symmetrical [Bostock] |
| 13802 | Relations can be one-many (at most one on the left) or many-one (at most one on the right) [Bostock] |
| 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] |
| 13847 | If non-existent things are self-identical, they are just one thing - so call it the 'null object' [Bostock] |
| 18816 | Metaphysical modalities respect the actual identities of things [Rumfitt] |
| 13820 | The idea that anything which can be proved is necessary has a problem with empty names [Bostock] |
| 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] |
| 9264 | Persons are distinguished by a capacity for second-order desires [Frankfurt] |
| 9266 | A person essentially has second-order volitions, and not just second-order desires [Frankfurt] |
| 9267 | Free will is the capacity to choose what sort of will you have [Frankfurt] |
| 18817 | We understand conditionals, but disagree over their truth-conditions [Rumfitt] |
| 13363 | A (modern) predicate is the result of leaving a gap for the name in a sentence [Bostock] |
| 18829 | The truth grounds for 'not A' are the possibilities incompatible with truth grounds for A [Rumfitt] |
| 9265 | The will is the effective desire which actually leads to an action [Frankfurt] |
| 20015 | Freedom of action needs the agent to identify with their reason for acting [Frankfurt, by Wilson/Schpall] |
| 9270 | A 'wanton' is not a person, because they lack second-order volitions [Frankfurt] |
| 9269 | A person may be morally responsible without free will [Frankfurt] |