78 ideas
10482 | The logic of ZF is classical first-order predicate logic with identity [Boolos] |
10492 | A few axioms of set theory 'force themselves on us', but most of them don't [Boolos] |
10073 | There cannot be a set theory which is complete [Smith,P] |
18192 | Do the Replacement Axioms exceed the iterative conception of sets? [Boolos, by Maddy] |
7785 | The use of plurals doesn't commit us to sets; there do not exist individuals and collections [Boolos] |
10485 | Naïve sets are inconsistent: there is no set for things that do not belong to themselves [Boolos] |
10484 | The iterative conception says sets are formed at stages; some are 'earlier', and must be formed first [Boolos] |
13547 | Limitation of Size is weak (Fs only collect is something the same size does) or strong (fewer Fs than objects) [Boolos, by Potter] |
10699 | Does a bowl of Cheerios contain all its sets and subsets? [Boolos] |
14249 | Boolos reinterprets second-order logic as plural logic [Boolos, by Oliver/Smiley] |
10225 | Monadic second-order logic might be understood in terms of plural quantifiers [Boolos, by Shapiro] |
10830 | Second-order logic metatheory is set-theoretic, and second-order validity has set-theoretic problems [Boolos] |
10736 | Boolos showed how plural quantifiers can interpret monadic second-order logic [Boolos, by Linnebo] |
10780 | Any sentence of monadic second-order logic can be translated into plural first-order logic [Boolos, by Linnebo] |
10616 | Second-order arithmetic can prove new sentences of first-order [Smith,P] |
10829 | A sentence can't be a truth of logic if it asserts the existence of certain sets [Boolos] |
10697 | Identity is clearly a logical concept, and greatly enhances predicate calculus [Boolos] |
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] |
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] |
10832 | '∀x x=x' only means 'everything is identical to itself' if the range of 'everything' is fixed [Boolos] |
13671 | Second-order quantifiers are just like plural quantifiers in ordinary language, with no extra ontology [Boolos, by Shapiro] |
10267 | We should understand second-order existential quantifiers as plural quantifiers [Boolos, by Shapiro] |
10698 | Plural forms have no more ontological commitment than to first-order objects [Boolos] |
7806 | Boolos invented plural quantification [Boolos, by Benardete,JA] |
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] |
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] |
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] |
10834 | Weak completeness: if it is valid, it is provable. Strong: it is provable from a set of sentences [Boolos] |
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] |
13841 | Why should compactness be definitive of logic? [Boolos, by Hacking] |
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] |
6007 | If you know your father, but don't recognise your father veiled, you know and don't know the same person [Eubulides, by Dancy,R] |
6006 | If you say truly that you are lying, you are lying [Eubulides, by Dancy,R] |
6008 | Removing one grain doesn't destroy a heap, so a heap can't be destroyed [Eubulides, by Dancy,R] |
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] |
10491 | Infinite natural numbers is as obvious as infinite sentences in English [Boolos] |
10483 | Mathematics and science do not require very high orders of infinity [Boolos] |
10618 | All numbers are related to zero by the ancestral of the successor relation [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] |
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] |
10833 | Many concepts can only be expressed by second-order logic [Boolos] |
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] |
10490 | Mathematics isn't surprising, given that we experience many objects as abstract [Boolos] |
10700 | First- and second-order quantifiers are two ways of referring to the same things [Boolos] |
10617 | The 'ancestral' of a relation is a new relation which creates a long chain of the original relation [Smith,P] |
10488 | It is lunacy to think we only see ink-marks, and not word-types [Boolos] |
10487 | I am a fan of abstract objects, and confident of their existence [Boolos] |
10489 | We deal with abstract objects all the time: software, poems, mistakes, triangles.. [Boolos] |
8693 | An 'abstraction principle' says two things are identical if they are 'equivalent' in some respect [Boolos] |