96 ideas
| 10073 | There cannot be a set theory which is complete [Smith,P] |
| 8625 | What physical facts could underlie 0 or 1, or very large numbers? [Frege on Mill] |
| 10616 | Second-order arithmetic can prove new sentences of first-order [Smith,P] |
| 17895 | Combining two distinct assertions does not necessarily lead to a single 'complex proposition' [Mill] |
| 10076 | The 'range' of a function is the set of elements in the output set created by the function [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] |
| 10605 | Two functions are the same if they have the same extension [Smith,P] |
| 10075 | A 'partial function' maps only some elements to another set [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] |
| 10427 | All names are names of something, real or imaginary [Mill] |
| 4944 | Mill says names have denotation but not connotation [Mill, by Kripke] |
| 7762 | Proper names are just labels for persons or objects, and the meaning is the object [Mill, by Lycan] |
| 10602 | A 'natural deduction system' has no axioms but many rules [Smith,P] |
| 10613 | No nice theory can define truth for its own language [Smith,P] |
| 10079 | A 'bijective' function has one-to-one correspondence in both directions [Smith,P] |
| 10077 | A 'surjective' ('onto') function creates every element of the output set [Smith,P] |
| 10078 | An 'injective' ('one-to-one') function creates a distinct output element from each original [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] |
| 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] |
| 10080 | 'Effective' means simple, unintuitive, independent, controlled, dumb, and terminating [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] |
| 10599 | For primes we write (x not= 1 ∧ ∀u∀v(u x v = x → (u = 1 ∨ v = 1))) [Smith,P] |
| 10610 | The reals contain the naturals, but the theory of reals doesn't contain the theory of naturals [Smith,P] |
| 9801 | Numbers must be assumed to have identical units, as horses are equalised in 'horse-power' [Mill] |
| 10619 | The truths of arithmetic are just true equations and their universally quantified versions [Smith,P] |
| 10608 | The number of Fs is the 'successor' of the Gs if there is a single F that isn't G [Smith,P] |
| 10618 | All numbers are related to zero by the ancestral of the successor relation [Smith,P] |
| 8742 | The only axioms needed are for equality, addition, and successive numbers [Mill, by Shapiro] |
| 10849 | Baby arithmetic covers addition and multiplication, but no general facts about numbers [Smith,P] |
| 10850 | Baby Arithmetic is complete, but not very expressive [Smith,P] |
| 10852 | Robinson Arithmetic (Q) is not negation complete [Smith,P] |
| 10851 | Robinson Arithmetic 'Q' has basic axioms, quantifiers and first-order logic [Smith,P] |
| 10068 | Natural numbers have zero, unique successors, unending, no circling back, and no strays [Smith,P] |
| 10603 | The logic of arithmetic must quantify over properties of numbers to handle induction [Smith,P] |
| 10604 | Incompleteness results in arithmetic from combining addition and successor with multiplication [Smith,P] |
| 10848 | Multiplication only generates incompleteness if combined with addition and successor [Smith,P] |
| 9800 | Arithmetic is based on definitions, and Sums of equals are equal, and Differences of equals are equal [Mill] |
| 5201 | Mill says logic and maths is induction based on a very large number of instances [Mill, by Ayer] |
| 9360 | If two black and two white objects in practice produced five, what colour is the fifth one? [Lewis,CI on Mill] |
| 9888 | Mill mistakes particular applications as integral to arithmetic, instead of general patterns [Dummett on Mill] |
| 9796 | Things possess the properties of numbers, as quantity, and as countable parts [Mill] |
| 9794 | There are no such things as numbers in the abstract [Mill] |
| 9795 | Numbers have generalised application to entities (such as bodies or sounds) [Mill] |
| 9798 | Different parcels made from three pebbles produce different actual sensations [Mill] |
| 9797 | '2 pebbles and 1 pebble' and '3 pebbles' name the same aggregation, but different facts [Mill] |
| 9799 | 3=2+1 presupposes collections of objects ('Threes'), which may be divided thus [Mill] |
| 9803 | We can't easily distinguish 102 horses from 103, but we could arrange them to make it obvious [Mill] |
| 9802 | Numbers denote physical properties of physical phenomena [Mill] |
| 9804 | Arithmetical results give a mode of formation of a given number [Mill] |
| 9805 | 12 is the cube of 1728 means pebbles can be aggregated a certain way [Mill] |
| 8741 | Numbers must be of something; they don't exist as abstractions [Mill] |
| 12411 | Mill is too imprecise, and is restricted to simple arithmetic [Kitcher on Mill] |
| 5656 | Empirical theories of arithmetic ignore zero, limit our maths, and need probability to get started [Frege on Mill] |
| 9624 | Numbers are a very general property of objects [Mill, by Brown,JR] |
| 10617 | The 'ancestral' of a relation is a new relation which creates a long chain of the original relation [Smith,P] |
| 9806 | Whatever is made up of parts is made up of parts of those parts [Mill] |
| 11156 | The essence is that without which a thing can neither be, nor be conceived to be [Mill] |
| 12190 | Necessity is what will be, despite any alternative suppositions whatever [Mill] |
| 22623 | Necessity can only mean what must be, without conditions of any kind [Mill] |
| 16859 | Most perception is one-tenth observation and nine-tenths inference [Mill] |
| 9082 | Clear concepts result from good observation, extensive experience, and accurate memory [Mill] |
| 16860 | Inductive generalisation is more reliable than one of its instances; they can't all be wrong [Mill] |
| 16843 | Mill's methods (Difference,Agreement,Residues,Concomitance,Hypothesis) don't nail induction [Mill, by Lipton] |
| 16845 | The whole theory of induction rests on causes [Mill] |
| 17086 | Surprisingly, empiricists before Mill ignore explanation, which seems to transcend experience [Mill, by Ruben] |
| 17091 | Explanation is fitting of facts into ever more general patterns of regularity [Mill, by Ruben] |
| 16805 | Causal inference is by spotting either Agreements or Differences [Mill, by Lipton] |
| 16835 | The Methods of Difference and of Agreement are forms of inference to the best explanation [Mill, by Lipton] |
| 9079 | We can focus our minds on what is common to a whole class, neglecting other aspects [Mill] |
| 9081 | We don't recognise comparisons by something in our minds; the concepts result from the comparisons [Mill] |
| 9078 | The study of the nature of Abstract Ideas does not belong to logic, but to a different science [Mill] |
| 9080 | General conceptions are a necessary preliminary to Induction [Mill] |
| 5996 | Critolaus redefined Aristotle's moral aim as fulfilment instead of happiness [Critolaus, by White,SA] |
| 8345 | A cause is the total of all the conditions which inevitably produce the result [Mill] |
| 10391 | Causes and conditions are not distinct, because we select capriciously from among them [Mill] |
| 14547 | The strict cause is the total positive and negative conditions which ensure the consequent [Mill] |
| 8377 | Causation is just invariability of succession between every natural fact and a preceding fact [Mill] |
| 14545 | A cause is an antecedent which invariably and unconditionally leads to a phenomenon [Mill] |
| 4773 | Mill's regularity theory of causation is based on an effect preceded by a conjunction of causes [Mill, by Psillos] |
| 4775 | In Mill's 'Method of Agreement' cause is the common factor in a range of different cases [Mill, by Psillos] |
| 4776 | In Mill's 'Method of Difference' the cause is what stops the effect when it is removed [Mill, by Psillos] |
| 9417 | What are the fewest propositions from which all natural uniformities could be inferred? [Mill] |