Clifford Spector. Recursive ordinals and predicative set theory. Summaries of talks presented at the Summer Institute for Symbolic Logic, Cornell University, 1957, 2nd edn., Communications Research Division, Institute for Defense Analyses, Princeton, N.J., 1960, pp. 377–382.

D. A. Clarke

doi:10.2307/2270676

Clifford Spector. Recursive ordinals and predicative set theory. Summaries of talks presented at the Summer Institute for Symbolic Logic, Cornell University, 1957, 2nd edn., Communications Research Division, Institute for Defense Analyses, Princeton, N.J., 1960, pp. 377–382.

Journal of Symbolic Logic ◽

10.2307/2270676 ◽

1966 ◽

Vol 31 (1) ◽

pp. 138-138

Author(s):

D. A. Clarke

Keyword(s):

Set Theory ◽

Symbolic Logic ◽

Summer Institute ◽

Cornell University ◽

Research Division

Download Full-text

P. C. Gilmore. An alternative to set theory. The American mathematical monthly, vol. 67 (1960), pp. 621–632. - P. C. Gilmore. The monadic theory of types in the lower predicate calculus. Summaries of talks presented at the Summer Institute for Symbolic Logic, Cornell University, 1957, 2nd edn., Communications Research Division, Institute for Defense Analyses, Princeton, N.J., 1960, pp. 309–312.

Journal of Symbolic Logic ◽

10.2307/2272453 ◽

1972 ◽

Vol 37 (4) ◽

pp. 766-767

Author(s):

Bede Rundle

Keyword(s):

Set Theory ◽

Predicate Calculus ◽

Symbolic Logic ◽

Summer Institute ◽

Cornell University ◽

Research Division ◽

Monadic Theory

Download Full-text

Dana Scott. The notion of rank in set-theory. Summaries of talks presented at the Summer Institute for Symbolic Logic, Cornell University, 1957, 2nd edn., Communications Research Division, Institute for Defense Analyses, Princeton, N.J., 1960, pp. 267–269.

Journal of Symbolic Logic ◽

10.2307/2269729 ◽

1966 ◽

Vol 31 (4) ◽

pp. 662-663

Author(s):

A. Hajnal

Keyword(s):

Set Theory ◽

Symbolic Logic ◽

Summer Institute ◽

Cornell University ◽

Research Division

Download Full-text

M. O. Rabin. Computable algebraic systems. Summaries of talks presented at the Summer Institute for Symbolic Logic, Cornell University, 1957, 2nd edn., Communications Research Division, Institute for Defense Analyses, Princeton, N.J., 1960, pp. 134–138. - Michael O. Rabin. Computable algebra, general theory and theory of computable fields. Transactions of the American Mathematical Society, vol. 95 (1960), pp. 341–360.

Journal of Symbolic Logic ◽

10.2307/2270825 ◽

1967 ◽

Vol 32 (3) ◽

pp. 412-413

Author(s):

B. H. Mayoh

Keyword(s):

General Theory ◽

American Mathematical Society ◽

Mathematical Society ◽

Symbolic Logic ◽

Summer Institute ◽

Algebraic Systems ◽

Cornell University ◽

Research Division

Download Full-text

Hao Wang. Symbolic representations of calculating machines. Summaries of talks presented at the Summer Institute for Symbolic Logic, Cornell University, 1957, 2nd edn., Communications Research Division, Institute for Defense Analyses, Princeton, N.J., 1960, pp. 181–188.

Journal of Symbolic Logic ◽

10.2307/2963725 ◽

1962 ◽

Vol 27 (1) ◽

pp. 103-103

Author(s):

C. C. Elgot

Keyword(s):

Symbolic Logic ◽

Summer Institute ◽

Cornell University ◽

Symbolic Representations ◽

Research Division

Download Full-text

R. L. Vaught. Sentences true in all constructive models. Summaries of talks presented at the Summer Institute for Symbolic Logic, Cornell University, 1957, 2nd edn., Communications Research Division, Institute for Defense Analyses, Princeton, N.J., 1960, pp. 341–343. - R. L. Vaught. Sentences true in all constructive models. The journal of symbolic logic, vol. 25 no. 1 (for 1960, pub. 1961), pp. 39–53.

Journal of Symbolic Logic ◽

10.2307/2270666 ◽

1966 ◽

Vol 31 (1) ◽

pp. 132-132

Author(s):

S. Feferman

Keyword(s):

Symbolic Logic ◽

Summer Institute ◽

Cornell University ◽

Research Division ◽

Constructive Models

Download Full-text

R. M. Friedberg. The fine structure of degrees of unsolvability of recursively enumerable sets. Summaries of talks presented at the Summer Institute for Symbolic Logic, Cornell University, 1957, 2nd edn., Communications Research Division, Institute for Defense Analyses, Princeton, N.J., 1960, pp. 404–406.

Journal of Symbolic Logic ◽

10.2307/2271602 ◽

1963 ◽

Vol 28 (2) ◽

pp. 166-166 ◽

Cited By ~ 2

Author(s):

Gerald E. Sacks

Keyword(s):

Fine Structure ◽

Symbolic Logic ◽

Summer Institute ◽

Cornell University ◽

Research Division ◽

Recursively Enumerable ◽

Recursively Enumerable Sets ◽

Degrees Of Unsolvability

Download Full-text

G. Kreisel. Gödel's intepretation of Heyting's arithmetic. Summaries of talks presented at the Summer Institute for Symbolic Logic, Cornell University, 1957, 2nd edn., Communications Research Division, Institute for Defense Analyses, Princeton, N.J., 1960, pp. 125–133. - G. Kreisel. Relations between classes of constructive functional. Summaries of talks presented at the Summer Institute for Symbolic Logic, Cornell University, 1957, 2nd edn., Communications Research Division, Institute for Defense Analyses, Princeton, N.J., 1960, pp. 292–302. - Georg Kreisel. Interpretation of analysis by means of constructive functional of finite types. Constructivity in mathematics, Proceedings of the colloquium held at Amsterdam, 1957, edited by A. Heyting, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam1959, pp. 101–128.

Journal of Symbolic Logic ◽

10.2307/2271570 ◽

1971 ◽

Vol 36 (1) ◽

pp. 169-171

Author(s):

D. van Dalen

Keyword(s):

Publishing Company ◽

Foundations Of Mathematics ◽

Symbolic Logic ◽

Summer Institute ◽

North Holland Publishing Company ◽

Cornell University ◽

Research Division ◽

North Holland Publishing

Download Full-text

Raphael M. Robinson. Restricted set-theoretical definitions in arithmetic. Proceedings of the American Mathematical Society, vol. 9 (1958), pp. 238–242. - Raphael M. Robinson. Restricted set-theoretical definitions in arithmetic. Summaries of talks presented at the Summer Institute for Symbolic Logic, Cornell University, 1957, 2nd edn., Communications Research Division, Institute for Defense Analyses, Princeton, N.J., 1960, pp. 139–140.

Journal of Symbolic Logic ◽

10.2307/2269725 ◽

1966 ◽

Vol 31 (4) ◽

pp. 659-660

Author(s):

Robert McNaughton

Keyword(s):

American Mathematical Society ◽

Mathematical Society ◽

Symbolic Logic ◽

Summer Institute ◽

Cornell University ◽

Research Division

Download Full-text

R. Fridshal. The Quine algorithm. Summaries of talks presented at the Summer Institute for Symbolic Logic, Cornell University, 1957, 2nd edn., Communications Research Division, Institute for Defense Analyses, Princeton, N.J., 1960, pp. 211–212.

Journal of Symbolic Logic ◽

10.2307/2963727 ◽

1962 ◽

Vol 27 (1) ◽

pp. 103-103

Author(s):

Thomas H. Mott

Keyword(s):

Symbolic Logic ◽

Summer Institute ◽

Cornell University ◽

Research Division

Download Full-text

J. W. Addison. Hierarchies and the axiom of constructibility. Summaries of talks presented at the Summer Institute for Symbolic Logic, Cornell University, 1957, 2nd edn., Communications Research Division, Institute for Defense Analyses, Princeton, N.J., 1960, pp. 355–362.

Journal of Symbolic Logic ◽

10.2307/2270674 ◽

1966 ◽

Vol 31 (1) ◽

pp. 137-138

Author(s):

D. A. Clarke

Keyword(s):

Symbolic Logic ◽

Summer Institute ◽

Cornell University ◽

Research Division

Download Full-text