display all the ideas for this combination of philosophers
49 ideas
| 11211 | If a sound conclusion comes from two errors that cancel out, the path of the argument must matter [Rumfitt] |
| 18815 | Logic is higher-order laws which can expand the range of any sort of deduction [Rumfitt] |
| 9390 | Logic guides thinking, but it isn't a substitute for it [Rumfitt] |
| 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] |
| 10616 | Second-order arithmetic can prove new sentences of first-order [Smith,P] |
| 12195 | Soundness in argument varies with context, and may be achieved very informally indeed [Rumfitt] |
| 12199 | There is a modal element in consequence, in assessing reasoning from suppositions [Rumfitt] |
| 12201 | We reject deductions by bad consequence, so logical consequence can't be deduction [Rumfitt] |
| 18813 | Logical consequence is a relation that can extended into further statements [Rumfitt] |
| 18808 | Normal deduction presupposes the Cut Law [Rumfitt] |
| 18840 | When faced with vague statements, Bivalence is not a compelling principle [Rumfitt] |
| 12194 | Contradictions include 'This is red and not coloured', as well as the formal 'B and not-B' [Rumfitt] |
| 11210 | Standardly 'and' and 'but' are held to have the same sense by having the same truth table [Rumfitt] |
| 18802 | In specifying a logical constant, use of that constant is quite unavoidable [Rumfitt] |
| 11212 | The sense of a connective comes from primitively obvious rules of inference [Rumfitt] |
| 10075 | A 'partial function' maps only some elements to another set [Smith,P] |
| 10074 | A 'total function' maps every element to one element in another set [Smith,P] |
| 10612 | An argument is a 'fixed point' for a function if it is mapped back to itself [Smith,P] |
| 10076 | The 'range' of a function is the set of elements in the output set created by the function [Smith,P] |
| 10605 | Two functions are the same if they have the same extension [Smith,P] |
| 10615 | The Comprehension Schema says there is a property only had by things satisfying a condition [Smith,P] |
| 10595 | A 'theorem' of a theory is a sentence derived from the axioms using the proof system [Smith,P] |
| 12198 | Geometrical axioms in logic are nowadays replaced by inference rules (which imply the logical truths) [Rumfitt] |
| 10602 | A 'natural deduction system' has no axioms but many rules [Smith,P] |
| 18800 | Introduction rules give deduction conditions, and Elimination says what can be deduced [Rumfitt] |
| 10613 | No nice theory can define truth for its own language [Smith,P] |
| 18809 | Logical truths are just the assumption-free by-products of logical rules [Rumfitt] |
| 10078 | An 'injective' ('one-to-one') function creates a distinct output element from each original [Smith,P] |
| 10077 | A 'surjective' ('onto') function creates every element of the output set [Smith,P] |
| 10079 | A 'bijective' function has one-to-one correspondence in both directions [Smith,P] |
| 10070 | If everything that a theory proves is true, then it is 'sound' [Smith,P] |
| 10086 | Soundness is true axioms and a truth-preserving proof system [Smith,P] |
| 10596 | A theory is 'sound' iff every theorem is true (usually from true axioms and truth-preservation) [Smith,P] |
| 10598 | A theory is 'negation complete' if it proves all sentences or their negation [Smith,P] |
| 10597 | 'Complete' applies both to whole logics, and to theories within them [Smith,P] |
| 10069 | A theory is 'negation complete' if one of its sentences or its negation can always be proved [Smith,P] |
| 10609 | Two routes to Incompleteness: semantics of sound/expressible, or syntax of consistency/proof [Smith,P] |
| 10080 | 'Effective' means simple, unintuitive, independent, controlled, dumb, and terminating [Smith,P] |
| 10087 | A theory is 'decidable' if all of its sentences could be mechanically proved [Smith,P] |
| 10088 | Any consistent, axiomatized, negation-complete formal theory is decidable [Smith,P] |
| 10081 | A set is 'enumerable' is all of its elements can result from a natural number function [Smith,P] |
| 10083 | A set is 'effectively enumerable' if a computer could eventually list every member [Smith,P] |
| 10084 | A finite set of finitely specifiable objects is always effectively enumerable (e.g. primes) [Smith,P] |
| 10085 | The set of ordered pairs of natural numbers <i,j> is effectively enumerable [Smith,P] |
| 10601 | The thorems of a nice arithmetic can be enumerated, but not the truths (so they're diffferent) [Smith,P] |
| 10600 | Being 'expressible' depends on language; being 'capture/represented' depends on axioms and proof system [Smith,P] |
| 18807 | Monotonicity means there is a guarantee, rather than mere inductive support [Rumfitt] |