What people are saying - Write a review
We haven't found any reviews in the usual places.
S Iliminability of abstractions S Identity 4 Abstractions as classes
The ordered ntuple
3 other sections not shown
abstractionless transform additional primitives assume the theorem Axiom PI become bound bound occurrence bound variables circumflexed variable completes the proof contains no circumflexes Cornell University definition of Identity denote EXISTENCE THEOREM F(xp Founda free occurrences free or bound free variables gives hypothesis of induction ified induction assume inversely stratified Jour list of variables logical operators logical system low assume Mathematical Logic maximum number noun obtain our theorem occur free occurrences of x ordered n-tuple potency Prooft Assume propositional calculus quantifier Quine relative replaced resulting proposition right-hand side Rosser set of axioms set theory strat stricted predicate calculus subscript attached Theorem 4.5 theorem follows theorem true tion-potency transform of R2 type assignment xsyq yaxq