197 ideas
| 7490 | Because of Darwin, wisdom as a definite attainable state has faded [Watson] |
| 7461 | The three key ideas are the soul, Europe, and the experiment [Watson] |
| 7464 | The big idea: imitation, the soul, experiments, God, heliocentric universe, evolution? [Watson] |
| 18137 | Impredicative definitions are wrong, because they change the set that is being defined? [Bostock] |
| 7465 | Babylonian thinking used analogy, rather than deduction or induction [Watson] |
| 13439 | Venn Diagrams map three predicates into eight compartments, then look for the conclusion [Bostock] |
| 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] |
| 9738 | Each line of a truth table is a model [Fitting/Mendelsohn] |
| 9727 | Modal logic adds □ (necessarily) and ◊ (possibly) to classical logic [Fitting/Mendelsohn] |
| 9726 | We let 'R' be the accessibility relation: xRy is read 'y is accessible from x' [Fitting/Mendelsohn] |
| 9737 | The symbol ||- is the 'forcing' relation; 'Γ ||- P' means that P is true in world Γ [Fitting/Mendelsohn] |
| 13136 | The prefix σ names a possible world, and σ.n names a world accessible from that one [Fitting/Mendelsohn] |
| 13727 | A 'constant' domain is the same for all worlds; 'varying' domains can be entirely separate [Fitting/Mendelsohn] |
| 9734 | Modern modal logic introduces 'accessibility', saying xRy means 'y is accessible from x' [Fitting/Mendelsohn] |
| 9736 | A 'model' is a frame plus specification of propositions true at worlds, written < G,R,||- > [Fitting/Mendelsohn] |
| 9735 | A 'frame' is a set G of possible worlds, with an accessibility relation R, written < G,R > [Fitting/Mendelsohn] |
| 9741 | Accessibility relations can be 'reflexive' (self-referring), 'transitive' (carries over), or 'symmetric' (mutual) [Fitting/Mendelsohn] |
| 13149 | S5: a) if n ◊X then kX b) if n ¬□X then k ¬X c) if n □X then k X d) if n ¬◊X then k ¬X [Fitting/Mendelsohn] |
| 9740 | If a proposition is possibly true in a world, it is true in some world accessible from that world [Fitting/Mendelsohn] |
| 9739 | If a proposition is necessarily true in a world, it is true in all worlds accessible from that world [Fitting/Mendelsohn] |
| 13137 | Conj: a) if σ X∧Y then σ X and σ Y b) if σ ¬(X∧Y) then σ ¬X or σ ¬Y [Fitting/Mendelsohn] |
| 13140 | Bicon: a)if σ(X↔Y) then σ(X→Y) and σ(Y→X) b) [not biconditional, one or other fails] [Fitting/Mendelsohn] |
| 13139 | Implic: a) if σ ¬(X→Y) then σ X and σ ¬Y b) if σ X→Y then σ ¬X or σ Y [Fitting/Mendelsohn] |
| 13143 | Universal: a) if σ ¬◊X then σ.m ¬X b) if σ □X then σ.m X [m exists] [Fitting/Mendelsohn] |
| 13141 | Negation: if σ ¬¬X then σ X [Fitting/Mendelsohn] |
| 13138 | Disj: a) if σ ¬(X∨Y) then σ ¬X and σ ¬Y b) if σ X∨Y then σ X or σ Y [Fitting/Mendelsohn] |
| 13142 | Existential: a) if σ ◊X then σ.n X b) if σ ¬□X then σ.n ¬X [n is new] [Fitting/Mendelsohn] |
| 13144 | T reflexive: a) if σ □X then σ X b) if σ ¬◊X then σ ¬X [Fitting/Mendelsohn] |
| 13145 | D serial: a) if σ □X then σ ◊X b) if σ ¬◊X then σ ¬□X [Fitting/Mendelsohn] |
| 13146 | B symmetric: a) if σ.n □X then σ X b) if σ.n ¬◊X then σ ¬X [n occurs] [Fitting/Mendelsohn] |
| 13147 | 4 transitive: a) if σ □X then σ.n □X b) if σ ¬◊X then σ.n ¬◊X [n occurs] [Fitting/Mendelsohn] |
| 13148 | 4r rev-trans: a) if σ.n □X then σ □X b) if σ.n ¬◊X then σ ¬◊X [n occurs] [Fitting/Mendelsohn] |
| 9742 | The system K has no accessibility conditions [Fitting/Mendelsohn] |
| 13114 | □P → P is not valid in D (Deontic Logic), since an obligatory action may be not performed [Fitting/Mendelsohn] |
| 9743 | The system D has the 'serial' conditon imposed on its accessibility relation [Fitting/Mendelsohn] |
| 9744 | The system T has the 'reflexive' conditon imposed on its accessibility relation [Fitting/Mendelsohn] |
| 9746 | The system K4 has the 'transitive' condition on its accessibility relation [Fitting/Mendelsohn] |
| 9745 | The system B has the 'reflexive' and 'symmetric' conditions on its accessibility relation [Fitting/Mendelsohn] |
| 9747 | The system S4 has the 'reflexive' and 'transitive' conditions on its accessibility relation [Fitting/Mendelsohn] |
| 9748 | System S5 has the 'reflexive', 'symmetric' and 'transitive' conditions on its accessibility relation [Fitting/Mendelsohn] |
| 9404 | Modality affects content, because P→◊P is valid, but ◊P→P isn't [Fitting/Mendelsohn] |
| 13112 | In epistemic logic knowers are logically omniscient, so they know that they know [Fitting/Mendelsohn] |
| 13111 | Read epistemic box as 'a knows/believes P' and diamond as 'for all a knows/believes, P' [Fitting/Mendelsohn] |
| 13113 | F: will sometime, P: was sometime, G: will always, H: was always [Fitting/Mendelsohn] |
| 13728 | The Barcan says nothing comes into existence; the Converse says nothing ceases; the pair imply stability [Fitting/Mendelsohn] |
| 13729 | The Barcan corresponds to anti-monotonicity, and the Converse to monotonicity [Fitting/Mendelsohn] |
| 18122 | Classical interdefinitions of logical constants and quantifiers is impossible in intuitionism [Bostock] |
| 13846 | A 'free' logic can have empty names, and a 'universally free' logic can have empty domains [Bostock] |
| 18114 | There is no single agreed structure for set theory [Bostock] |
| 18107 | A 'proper class' cannot be a member of anything [Bostock] |
| 18115 | We could add axioms to make sets either as small or as large as possible [Bostock] |
| 18139 | The Axiom of Choice relies on reference to sets that we are unable to describe [Bostock] |
| 18105 | Replacement enforces a 'limitation of size' test for the existence of sets [Bostock] |
| 18108 | First-order logic is not decidable: there is no test of whether any formula is valid [Bostock] |
| 18109 | The completeness of first-order logic implies its compactness [Bostock] |
| 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] |
| 13623 | The syntactic turnstile |- φ means 'there is a proof of φ' or 'φ is a theorem' [Bostock] |
| 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] |
| 13614 | MPP: 'If Γ|=φ and Γ|=φ→ψ then Γ|=ψ' (omit Γs for Detachment) [Bostock] |
| 13617 | MPP is a converse of Deduction: If Γ |- φ→ψ then Γ,φ|-ψ [Bostock] |
| 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] |
| 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] |
| 9725 | 'Predicate abstraction' abstracts predicates from formulae, giving scope for constants and functions [Fitting/Mendelsohn] |
| 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] |
| 18123 | Substitutional quantification is just standard if all objects in the domain have a name [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] |
| 18120 | The Deduction Theorem is what licenses a system of natural deduction [Bostock] |
| 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] |
| 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] |
| 18125 | Berry's Paradox considers the meaning of 'The least number not named by this name' [Bostock] |
| 18101 | Each addition changes the ordinality but not the cardinality, prior to aleph-1 [Bostock] |
| 18100 | ω + 1 is a new ordinal, but its cardinality is unchanged [Bostock] |
| 18102 | A cardinal is the earliest ordinal that has that number of predecessors [Bostock] |
| 18106 | Aleph-1 is the first ordinal that exceeds aleph-0 [Bostock] |
| 18095 | Instead of by cuts or series convergence, real numbers could be defined by axioms [Bostock] |
| 18099 | The number of reals is the number of subsets of the natural numbers [Bostock] |
| 18093 | For Eudoxus cuts in rationals are unique, but not every cut makes a real number [Bostock] |
| 7466 | Mesopotamian numbers applied to specific things, and then became abstract [Watson] |
| 18110 | Infinitesimals are not actually contradictory, because they can be non-standard real numbers [Bostock] |
| 18156 | Modern axioms of geometry do not need the real numbers [Bostock] |
| 18097 | The Peano Axioms describe a unique structure [Bostock] |
| 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] |
| 18148 | Hume's Principle is a definition with existential claims, and won't explain numbers [Bostock] |
| 18145 | Many things will satisfy Hume's Principle, so there are many interpretations of it [Bostock] |
| 18149 | There are many criteria for the identity of numbers [Bostock] |
| 18143 | Frege makes numbers sets to solve the Caesar problem, but maybe Caesar is a set! [Bostock] |
| 18116 | Numbers can't be positions, if nothing decides what position a given number has [Bostock] |
| 18117 | Structuralism falsely assumes relations to other numbers are numbers' only properties [Bostock] |
| 18141 | Nominalism about mathematics is either reductionist, or fictionalist [Bostock] |
| 18157 | Nominalism as based on application of numbers is no good, because there are too many applications [Bostock] |
| 18150 | Actual measurement could never require the precision of the real numbers [Bostock] |
| 18158 | Ordinals are mainly used adjectively, as in 'the first', 'the second'... [Bostock] |
| 18127 | Simple type theory has 'levels', but ramified type theory has 'orders' [Bostock] |
| 18144 | Neo-logicists agree that HP introduces number, but also claim that it suffices for the job [Bostock] |
| 18147 | Neo-logicists meet the Caesar problem by saying Hume's Principle is unique to number [Bostock] |
| 18146 | If Hume's Principle is the whole story, that implies structuralism [Bostock] |
| 18129 | Many crucial logicist definitions are in fact impredicative [Bostock] |
| 18111 | Treating numbers as objects doesn't seem like logic, since arithmetic fixes their totality [Bostock] |
| 18159 | Higher cardinalities in sets are just fairy stories [Bostock] |
| 18155 | A fairy tale may give predictions, but only a true theory can give explanations [Bostock] |
| 18140 | The best version of conceptualism is predicativism [Bostock] |
| 18138 | Conceptualism fails to grasp mathematical properties, infinity, and objective truth values [Bostock] |
| 18131 | If abstracta only exist if they are expressible, there can only be denumerably many of them [Bostock] |
| 18134 | Predicativism makes theories of huge cardinals impossible [Bostock] |
| 18135 | If mathematics rests on science, predicativism may be the best approach [Bostock] |
| 18136 | If we can only think of what we can describe, predicativism may be implied [Bostock] |
| 18132 | The predicativity restriction makes a difference with the real numbers [Bostock] |
| 18133 | The usual definitions of identity and of natural numbers are impredicative [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] |
| 13847 | If non-existent things are self-identical, they are just one thing - so call it the 'null object' [Bostock] |
| 13730 | The Indiscernibility of Identicals has been a big problem for modal logic [Fitting/Mendelsohn] |
| 13820 | The idea that anything which can be proved is necessary has a problem with empty names [Bostock] |
| 13725 | □ must be sensitive as to whether it picks out an object by essential or by contingent properties [Fitting/Mendelsohn] |
| 13731 | Objects retain their possible properties across worlds, so a bundle theory of them seems best [Fitting/Mendelsohn] |
| 13726 | Counterpart relations are neither symmetric nor transitive, so there is no logic of equality for them [Fitting/Mendelsohn] |
| 20657 | There are 23 core brain functions, with known circuit, transmitters, genes and behaviour [Watson] |
| 20656 | Traditional ideas of the mind were weakened in the 1950s by mind-influencing drugs [Watson] |
| 13363 | A (modern) predicate is the result of leaving a gap for the name in a sentence [Bostock] |
| 18121 | In logic a proposition means the same when it is and when it is not asserted [Bostock] |
| 20655 | Humans have been hunter-gatherers for 99.5% of their existence [Watson] |
| 7477 | Modern democracy is actually elective oligarchy [Watson] |
| 7478 | Greek philosophers invented the concept of 'nature' as their special subject [Watson] |
| 20650 | The Uncertainty Principle implies that cause and effect can't be measured [Watson] |
| 20649 | The interference of light through two slits confirmed that it is waves [Watson] |
| 20661 | Electrons rotate in hyrogen atoms 10^13 times per second [Watson] |
| 20647 | Quantum theory explains why nature is made up of units, such as elements [Watson] |
| 20654 | Only four particles are needed for matter: up and down quark, electron, electron-neutrino [Watson] |
| 20651 | The shape of molecules is important, as well as the atoms and their bonds [Watson] |
| 20652 | In 1828 the animal substance urea was manufactured from inorganic ingredients [Watson] |
| 20658 | Information is physical, and living can be seen as replicating and preserving information [Watson] |
| 7462 | DNA mutation suggests humans and chimpanzees diverged 6.6 million years ago [Watson] |
| 7470 | During the rise of civilizations, the main gods changed from female to male [Watson] |
| 7474 | Hinduism has no founder, or prophet, or creed, or ecclesiastical structure [Watson] |
| 7479 | Modern Judaism became stabilised in 200 CE [Watson] |
| 7481 | The Israelites may have asserted the uniqueness of Yahweh to justify land claims [Watson] |
| 7480 | Monotheism was a uniquely Israelite creation within the Middle East [Watson] |
| 7471 | The Gathas (hymns) of Zoroastrianism date from about 1000 BCE [Watson] |
| 7473 | Zoroaster conceived the afterlife, judgement, heaven and hell, and the devil [Watson] |
| 7484 | Jesus never intended to start a new religion [Watson] |
| 7483 | Paul's early writings mention few striking episodes from Jesus' life [Watson] |
| 7475 | Confucius revered the spiritual world, but not the supernatural, or a personal god, or the afterlife [Watson] |
| 7476 | Taoism aims at freedom from the world, the body, the mind, and nature [Watson] |
| 7463 | The three basic ingredients of religion are: the soul, seers or priests, and ritual [Watson] |
| 7468 | In ancient Athens the souls of the dead are received by the 'upper air' [Watson] |