The Journal of Symbolic Logic, Volumes 6-12Association for Symbolic Logic., 1944 - Electronic journals Vol. 1, no. 4 (Dec. 1936) consists of a bibliography of symbolic logic for the period 1666-1935, by Alonzo Church (with additions and corrections in v. 3, no. 4). |
From inside the book
Results 1-3 of 70
Page 84
... element of S , and a and ẞ are any sentences of L , then Sn ( α.B ) = Sn ( α ) · Sn ( B ) . A. The element s1 of S is such that , for every sentence a of L , 81 ( a ) = α . A4 . If sm and s , are any two elements of S , then there is an ...
... element of S , and a and ẞ are any sentences of L , then Sn ( α.B ) = Sn ( α ) · Sn ( B ) . A. The element s1 of S is such that , for every sentence a of L , 81 ( a ) = α . A4 . If sm and s , are any two elements of S , then there is an ...
Page 103
... elements 0 , 1 , j are assumed for the three operations , with 01 , 1 j , j 0 , 10 = 1. And finally it is assumed that for every element ƒ there is an element -f such that ƒ + −ƒ = 0 . The three binary operations are not assumed to be ...
... elements 0 , 1 , j are assumed for the three operations , with 01 , 1 j , j 0 , 10 = 1. And finally it is assumed that for every element ƒ there is an element -f such that ƒ + −ƒ = 0 . The three binary operations are not assumed to be ...
Page 29
... element a such that both a and a ' are even , then 2 = 1 , and hence every element is even . Perhaps the authors mean by saying that the even elements " form a Boolean algebra , " merely that the set consisting of the even elements ...
... element a such that both a and a ' are even , then 2 = 1 , and hence every element is even . Perhaps the authors mean by saying that the even elements " form a Boolean algebra , " merely that the set consisting of the even elements ...
Contents
On the restricted ordinal theorem By R L GOODSTEIN | 33 |
On the number of complete extensions of the Lewis systems of sentential | 42 |
Representations of calculi By FREDERIC B FITCH | 56 |
4 other sections not shown
Other editions - View all
Common terms and phrases
a₁ abstract algebra ALONZO CHURCH ANDRZEJ MOSTOWSKI applied assertion Association for Symbolic axioms B₁ basic Boolean Boolean algebra Carnap concept contains deductive defined definition denote derive disjunction equations equivalent ERNEST NAGEL expressions finite formal formula free variables Gödel Hence Ibid identity individual induction inference integers interpretation intuitionistic JOURNAL L-true language LÁSZLÓ KALMÁR Lemma mathematics Mathematik matrix MAX BLACK means method modal modal logic natural numbers notion occurrences operations ordinal P₁ paper PAUL BERNAYS philosophy postulates predicate primitive recursive Princeton probability problem Prof proof proposition propositional calculus proved quantifiers Quine's recursive functions reference relation replaced result RÓZSA PÉTER rules rules of inference Russell's schema semantics sense sentences sequence statement subst substitution symbolic logic syntactical T₁ Tarski theorem theory tion true truth truth-value U-expression University valeurs valid W. V. QUINE York Yr+1