81 ideas
| 22271 | Aristotle was the first to use schematic letters in logic [Aristotle, by Potter] |
| 11060 | Aristotelian syllogisms are three-part, subject-predicate, existentially committed, with laws of thought [Aristotle, by Hanna] |
| 18909 | Aristotelian sentences are made up by one of four 'formative' connectors [Aristotle, by Engelbretsen] |
| 8080 | Aristotelian identified 256 possible syllogisms, saying that 19 are valid [Aristotle, by Devlin] |
| 13912 | Aristotle replaced Plato's noun-verb form with unions of pairs of terms by one of four 'copulae' [Aristotle, by Engelbretsen/Sayward] |
| 8071 | Aristotle listed nineteen valid syllogisms (though a few of them were wrong) [Aristotle, by Devlin] |
| 13819 | Aristotle's said some Fs are G or some Fs are not G, forgetting that there might be no Fs [Bostock on Aristotle] |
| 9403 | There are three different deductions for actual terms, necessary terms and possible terms [Aristotle] |
| 10073 | There cannot be a set theory which is complete [Smith,P] |
| 10616 | Second-order arithmetic can prove new sentences of first-order [Smith,P] |
| 11148 | Deduction is when we suppose one thing, and another necessarily follows [Aristotle] |
| 18896 | Aristotle places terms at opposite ends, joined by a quantified copula [Aristotle, by Sommers] |
| 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] |
| 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] |
| 3300 | Aristotle's logic is based on the subject/predicate distinction, which leads him to substances and properties [Aristotle, by Benardete,JA] |
| 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] |
| 11149 | Affirming/denying sentences are universal, particular, or indeterminate [Aristotle] |
| 8079 | Aristotelian logic has two quantifiers of the subject ('all' and 'some') [Aristotle, by Devlin] |
| 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] |
| 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] |
| 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] |
| 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] |
| 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] |
| 10848 | Multiplication only generates incompleteness if combined with addition and successor [Smith,P] |
| 10604 | Incompleteness results in arithmetic from combining addition and successor with multiplication [Smith,P] |
| 10617 | The 'ancestral' of a relation is a new relation which creates a long chain of the original relation [Smith,P] |
| 14641 | A deduction is necessary if the major (but not the minor) premise is also necessary [Aristotle] |
| 6346 | The main epistemological theories are foundationalist, coherence, probabilistic and reliabilist [Pollock/Cruz] |
| 6351 | Most people now agree that our reasoning proceeds defeasibly, rather than deductively [Pollock/Cruz] |
| 6374 | To believe maximum truths, believe everything; to have infallible beliefs, believe nothing [Pollock/Cruz] |
| 6355 | Direct realism says justification is partly a function of pure perceptual states, not of beliefs [Pollock/Cruz] |
| 6359 | Phenomenalism offered conclusive perceptual knowledge, but conclusive reasons no longer seem essential [Pollock/Cruz] |
| 6366 | Perception causes beliefs in us, without inference or justification [Pollock/Cruz] |
| 6362 | Sense evidence is not beliefs, because they are about objective properties, not about appearances [Pollock/Cruz] |
| 6371 | Bayesian epistemology is Bayes' Theorem plus the 'simple rule' (believe P if it is probable) [Pollock/Cruz] |
| 6373 | Internalism says if anything external varies, the justifiability of the belief does not vary [Pollock/Cruz] |
| 6353 | People rarely have any basic beliefs, and never enough for good foundations [Pollock/Cruz] |
| 6361 | Foundationalism requires self-justification, not incorrigibility [Pollock/Cruz] |
| 6357 | Reason cannot be an ultimate foundation, because rational justification requires prior beliefs [Pollock/Cruz] |
| 6363 | Foundationalism is wrong, because either all beliefs are prima facie justified, or none are [Pollock/Cruz] |
| 6365 | Negative coherence theories do not require reasons, so have no regress problem [Pollock/Cruz] |
| 6354 | Coherence theories fail, because they can't accommodate perception as the basis of knowledge [Pollock/Cruz] |
| 6367 | Coherence theories isolate justification from the world [Pollock/Cruz] |
| 6370 | Externalism comes as 'probabilism' (probability of truth) and 'reliabilism' (probability of good cognitive process) [Pollock/Cruz] |
| 6358 | One belief may cause another, without being the basis for the second belief [Pollock/Cruz] |
| 6364 | We can't start our beliefs from scratch, because we wouldn't know where to start [Pollock/Cruz] |
| 6352 | Enumerative induction gives a universal judgement, while statistical induction gives a proportion [Pollock/Cruz] |
| 6372 | Since every tautology has a probability of 1, should we believe all tautologies? [Pollock/Cruz] |
| 6360 | Scientific confirmation is best viewed as inference to the best explanation [Pollock/Cruz] |
| 18911 | Linguistic terms form a hierarchy, with higher terms predicable of increasing numbers of things [Aristotle, by Engelbretsen] |