Gene F. Rose. Output completeness in sequential machines. Proceedings of the American Mathematical Society, vol. 13 , pp. 611–614 [Book Review]

Journal of Symbolic Logic 31 (1):140-140 (1966)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

1996

DOI

10.2307/2270681

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,752

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

Review: Gene F. Rose, Output Completeness in Sequential Machines. [REVIEW]Robert McNaughton - 1966 - Journal of Symbolic Logic 31 (1):140-140.
Seymour Ginsburg. Some remarks on abstract machines. Transactions of the American Mathematical Society, vol. 96 , pp. 400–444. - Seymour Ginsburg and Gene F. Rose. A comparison of the work done by generalized sequential machines and Turing machines. Transactions of the American Mathematical Society, vol. 103 , pp. 394–402. [REVIEW]Lars Löfgren - 1972 - Journal of Symbolic Logic 37 (2):411.
Rose Alan. The degree of completeness of the ℵ0-valued Łukasiewicz propositional calculus. The journal of the London Mathematical Society, vol. 28 , pp. 176–184. [REVIEW]Gene F. Rose - 1956 - Journal of Symbolic Logic 21 (3):328-328.
Rose Alan. The degree of completeness of the m-valued Łukasiewicz propositional calculus, Correction and addendum. Journal of the London Mathematical Society, vol. 44 , pp. 587–591. [REVIEW]Gene F. Rose - 1974 - Journal of Symbolic Logic 39 (2):350-350.
Durst L. K.. On certain subsets of finite Boolean algebras. Proceedings of the American Mathematical Society, vol. 6 , pp. 695–697. [REVIEW]Gene F. Rose - 1959 - Journal of Symbolic Logic 24 (3):255-255.
Rose Alan. Many-valued logical machines. Proceedings of the Cambridge Philosophical Society, vol. 54 , pp. 307–321.Robert McNaughton - 1962 - Journal of Symbolic Logic 27 (2):250-250.
Rose Gene F.. Propositional calculus and realizability. Transactions of the American Mathematical Society, vol. 75 , pp. 1–19. [REVIEW]David Nelson - 1954 - Journal of Symbolic Logic 19 (2):126-126.
The constructive completion of the space?Satoru Yoshida - 2005 - Mathematical Logic Quarterly 51 (1):77-82.
A. R. Turquette. Solution to a problem of Rose and Rosser. Proceedings of the American Mathematical Society, vol. 12 , pp. 253–255. [REVIEW]Louise Hay - 1966 - Journal of Symbolic Logic 31 (4):664-665.
Review: Alan Rose, The Degree of Completeness of the $aleph_0$-valued Lukasiewicz Propositional Calculus. [REVIEW]Gene F. Rose - 1956 - Journal of Symbolic Logic 21 (3):328-328.
J. Richard Buchi and Lawrence H. Landweber. Solving sequential conditions by finite-state strategies. Transactions of the American Mathematical Society, vol. 138 , pp. 295–311. [REVIEW]Robert McNaughton - 1972 - Journal of Symbolic Logic 37 (1):200-201.
Alan Rose and J. Barkley Rosser. Fragments of many-valued statement calculi. Transactions of the American Mathematical Society, vol. 87 , pp. 1–53. - C. A. Meredith. The dependence of an axiom of Łukasiewicz. Transactions of the American Mathematical Society, vol. 87 , p. 54. - C. C. Chang. Proof of an axiom of Łukasiewicz. Transactions of the American Mathematical Society, vol. 87 , pp. 55–56. [REVIEW]Atwell R. Turquette - 1959 - Journal of Symbolic Logic 24 (3):248-249.
Review: Alan Rose, The Degree of Completeness of the $m$-Valued Lukasiewicz Propositional Calculus, Correction and Addendum. [REVIEW]Gene F. Rose - 1974 - Journal of Symbolic Logic 39 (2):350-350.
Rose Alan. Systems of logic whose truth-values form lattices. Mathematische Annalen, vol. 123 , pp. 152–165.Rose Alan. A lattice-theoretic characterisation of the ℵ0-valued Propositional Calculus. Mathematische Annalen, vol. 123 , pp. 285–287.Rose Alan. The degree of completeness of some Łukasiewicz-Tarski propositional calculi. The journal of the London Mathematical Society, vol. 26 , pp. 47–49. [REVIEW]A. R. Turquette - 1952 - Journal of Symbolic Logic 17 (2):147-148.
Rose Alan. A note on the use of logical computers to determine the most efficient method of using factory machines. Proceedings of the Cambridge Philosophical Society, vol. 56 part 2 , pp. 186–188.Rose Alan. A high speed parallel adder. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 5 , pp. 240–249. [REVIEW]A. A. Mullin - 1962 - Journal of Symbolic Logic 27 (2):251-251.

Analytics

Added to PP
2014-04-01

Downloads
10 (#1,189,467)

6 months
5 (#628,512)

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