Elvin Rasof. The Carrollian Matrix. Notre Dame journal of formal logic, vol. 11 , pp. 497–504

Journal of Symbolic Logic 36 (4):689-689 (1971)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2272514

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 94,045

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

The Carrollian matrix.Elvin Rasof - 1970 - Notre Dame Journal of Formal Logic 11 (4):497-504.
George S. Boolos. A proof of the Löwenheim-Skolem theorem. Notre Dame journal of formal logic, vol. 11 , pp. 76–78.Warren D. Goldfarb - 1973 - Journal of Symbolic Logic 38 (3):519.
Bolesław Sobociński. Certain extensions of modal system S4. Notre Dame journal of formal logic, vol. 11 no. 3 , pp. 347–368. - Bolesław Sobociński. Concerning some extensions of S4. Notre Dame journal of formal logic, vol. 12 , pp. 363–370. - G. F. Schumm. Solutions to four modal problems of Sobocinski. Notre Dame journal of formal logic, vol. 12 , pp. 335–340. - J. Jay Zeman. A study of some systems in the neighborhood of S4.4. Notre Dame journal of formal logic, vol. 12 , pp. 341–357. - Bolesław Sobociński. A new class of modal systems. Notre Dame journal of formal logic, vol. 12 , pp. 371–377. - Bolesław Sobociński. A proper subsystem of S4.04. Notre Dame journal of formal logic, vol. 12 , pp. 381–384. [REVIEW]M. J. Cresswell - 1975 - Journal of Symbolic Logic 40 (4):602.
Blum Alex. The missing premiss. Notre Dame journal of formal logic, vol. 11 , pp. 203–204.Ann S. Ferebee - 1971 - Journal of Symbolic Logic 36 (4):689.
M. D. Gladstone. On the number of variables in the axioms. Notre Dame journal of formal logic, vol. 11 , pp. 1–15.Ronald Harrop - 1972 - Journal of Symbolic Logic 37 (4):755-756.
Summersbee S. and Walters A.. Programming the functions of formal logic, II . Notre Dame journal of formal logic, vol. 4 no. 4 , pp. 293–305. [REVIEW]Alan Rose - 1970 - Journal of Symbolic Logic 35 (4):596-597.
Richard L. Poss. A note on a lemma of J. W. Addison. Notre Dame journal of formal logic, vol. 11 , pp. 337–339.H. B. Enderton - 1973 - Journal of Symbolic Logic 38 (2):334-334.
Ihrig Ann H.. The Post-Lineal theorems for arbitrary recursively enumerable degrees of unsolvability. Notre Dame journal of formal logic, vol. 6 no. 1 , pp. 54–72. [REVIEW]Gerald E. Sacks - 1968 - Journal of Symbolic Logic 32 (4):529-529.
Gerald J. Massey. Binary closure-algebraic operations that are functionally complete. Notre Dame journal of formal logic, vol. 11 , pp. 340–342. [REVIEW]R. A. Bull - 1971 - Journal of Symbolic Logic 36 (4):691.
Ullian Joseph S.. A theorem on maximal sets. Notre Dame journal of formal logic, vol. 2 pp. 222–223.Steven Orey - 1962 - Journal of Symbolic Logic 27 (2):244-244.

Analytics

Added to PP
2013-11-03

Downloads
14 (#994,967)

6 months
13 (#276,041)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references