51 found
Order:
  1. (1 other version)A theorem about infinite-valued sentential logic.Robert McNaughton - 1951 - Journal of Symbolic Logic 16 (1):1-13.
  2.  28
    Infinite games played on finite graphs.Robert McNaughton - 1993 - Annals of Pure and Applied Logic 65 (2):149-184.
    The concept of an infinite game played on a finite graph is perhaps novel in the context of an rather extensive recent literature in which infinite games are generally played on an infinite game tree. We claim two advantages for our model, which is admittedly more restrictive. First, our games have a more apparent resemblance to ordinary parlor games in spite of their infinite duration. Second, by distinguishing those nodes of the graph that determine the winning and losing of the (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  3.  53
    (1 other version)A metrical concept of happiness.Robert McNaughton - 1953 - Philosophy and Phenomenological Research 14 (2):172-183.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  4.  38
    Conceptual schemes in set theory.Robert McNaughton - 1957 - Philosophical Review 66 (1):66-80.
    No categories
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  5. (1 other version)Axiomatic systems, conceptual schemes, and the consistency of mathematical theories.Robert McNaughton - 1954 - Philosophy of Science 21 (1):44-53.
    Lately, an increased interest in formal devices has led to an attempt on the part of some mathematicians to do without those aspects of mathematics which require intuition. One consequence of this movement has been a new conception of pure mathematics as a science of axiomatic systems. According to this conception, there is no reality beyond an axiomatic system which the statements of mathematics are about; the fact that a statement is a theorem in the system is all that is (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  6.  22
    Complete Decoding Nets: General Theory and Minimality.Arthur W. Burks, Robert Mcnaughton, Carl H. Pollmar, Don W. Warren & Jesse B. Wright - 1956 - Journal of Symbolic Logic 21 (2):210-210.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  7.  73
    The Folded Tree.Arthur W. Burks, Robert Mcnaughton, Carl H. Pollmar, Don W. Warren & Jesse B. Wright - 1956 - Journal of Symbolic Logic 21 (3):334-334.
  8.  18
    Automata, Formal Languages, Abstracts Switching, and Computability in a Ph.D. Computer Science Program.Robert Mcnaughton - 1969 - Journal of Symbolic Logic 34 (4):656-656.
    Direct download  
     
    Export citation  
     
    Bookmark  
  9.  38
    Bing Kurt. On simplifying truth-functional formulas.Robert McNaughton - 1957 - Journal of Symbolic Logic 22 (2):221-221.
  10.  13
    Contradiction, the Logical Counterpart to Conflict.Robert Mcnaughton - 1957 - Journal of Symbolic Logic 22 (4):401-401.
  11.  22
    Logical and Combinatorial Problems in Computer Design.Robert Mcnaughton - 1957 - Journal of Symbolic Logic 22 (2):222-222.
    Direct download  
     
    Export citation  
     
    Bookmark  
  12.  49
    Mostowski A.. On models of axiomatic systems. Fundamenta mathematicae, vol. 39 , pp. 133–158.Robert McNaughton - 1954 - Journal of Symbolic Logic 19 (3):220-221.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  13.  55
    McCluskey E. J. Jr. Minimization of Boolean functions. The Bell System technical journal, vol. 35 , pp. 1417–1444.Robert McNaughton - 1958 - Journal of Symbolic Logic 23 (2):235-235.
  14.  46
    Nerode A.. Linear automaton transformations. Proceedings of the American Mathematical Society, vol. 9 , pp. 541–544.Robert McNaughton - 1963 - Journal of Symbolic Logic 28 (2):173-174.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  15.  45
    Nelson Raymond J.. Weak simplest normal truth functions.Robert McNaughton - 1956 - Journal of Symbolic Logic 21 (3):330-331.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  16.  55
    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.
  17.  28
    Rose Alan. Some self-dual primitive functions for propositional calculi. Mathematische Annalen, vol. 126 , pp. 144–148.Robert McNaughton - 1954 - Journal of Symbolic Logic 19 (4):294-295.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  18.  44
    Rosser J. Barkley. Axiomatization of infinite valued logics. Logique et analyse , n.s. vol. 3 , pp. 137–153.Robert McNaughton - 1962 - Journal of Symbolic Logic 27 (1):111-112.
  19.  30
    (1 other version)Some formal relative consistency proofs.Robert McNaughton - 1953 - Journal of Symbolic Logic 18 (2):136-144.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  20.  20
    The Theory of Automata, a Survey.Robert Mcnaughton - 1972 - Journal of Symbolic Logic 37 (4):760-760.
    Direct download  
     
    Export citation  
     
    Bookmark  
  21.  13
    Undefinability of addition from one Unary Operator.Robert Mcnaughton - 1966 - Journal of Symbolic Logic 31 (2):270-270.
  22.  10
    Unate Truth Functions.Robert Mcnaughton - 1967 - Journal of Symbolic Logic 32 (2):263-263.
  23.  32
    Wang Hao. The irreducibility of impredicative principles. Mathematische Annalen, vol. 125 no. 1 , pp. 56–66.Robert McNaughton - 1953 - Journal of Symbolic Logic 18 (3):265-266.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  24.  13
    Les systèmes axiomatiques de la théorie des ensembles.Hao Wang, Robert Mcnaughton, Jaakko Hintikka & J. Barkley Rosser - 1953 - E. Nauwelaerts.
    Direct download  
     
    Export citation  
     
    Bookmark  
  25.  14
    Les Systèmes Axiomatiques de la Théorie des Ensembles.Hao Wang, Robert Mcnaughton & P. Destouches-Fevrier - 1954 - Journal of Symbolic Logic 19 (1):64-64.
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  26.  43
    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.
  27.  45
    Introduction to Mathematical Logic. [REVIEW]Robert McNaughton - 1958 - Philosophical Review 67 (1):116-118.
  28. oΘΩn ΠϒΛΑΡΙΝΟΣ. Ἡ ἀξιωματιϰὴ μέθοδος . Ἐϰδοτιϰὸς Οἴϰος I. ϰαὶ Π. Ζαχαροπύλου, Athens1948, 32 pp. - S. Jaśkowski. Une modification des définitions fondamentales de la géométrie des corps de M.A. Tarski. Annates de la Société Polonaise de Mathématique, vol. 21 , pp. 298–301. [REVIEW]Robert McNaughton - 1954 - Journal of Symbolic Logic 19 (4):298-298.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark  
  29.  19
    Fraenkel Abraham A.. Abstract set theory. Studies in logic and the foundations of mathematics. North-Holland Publishing Company, Amsterdam 1953, XII + 479 pp. [REVIEW]Robert McNaughton - 1955 - Journal of Symbolic Logic 20 (2):164-165.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  30.  22
    (1 other version)Arden Dean N.. Delayed-logic and finite-state machines. Switching circuit theory and logical design, Proceedings of the Second Annual Symposium, Detroit, Mich., October 17–20, 1961, and papers from the First Annual Symposium, Chicago, III., October 9–14,1960, American Institute of Electrical Engineers, New York 1961, pp. 133–151. [REVIEW]Robert McNaughton - 1971 - Journal of Symbolic Logic 36 (1):151-151.
  31.  24
    A. W. Burks and J. B. Wright. Sequence generators and digital computers. Recursive function theory, Proceedings of symposia in pure mathematics, vol. 5, American Mathematical Society, Providence 1962, pp. 139–199. - Arthur W. Burks and Jesse B. Wright. Sequence generators, graphs, and formal languages. Information and control, vol. 5 , pp. 204–212. [REVIEW]Robert McNaughton - 1964 - Journal of Symbolic Logic 29 (4):210-212.
  32.  50
    Burks Arthur W. and Copi Irving M.. The logical design of an idealized general-purpose computer. Journal of the Franklin Institute, vol. 261 , pp. 299–314, 421–436. [REVIEW]Robert McNaughton - 1957 - Journal of Symbolic Logic 22 (3):332-332.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  33.  39
    Elgot C. C.. Decision problems of finite automata design and related arithmetics. Transactions of the American Mathematical Society, vol. 98 , pp. 21–51. [REVIEW]Robert McNaughton - 1969 - Journal of Symbolic Logic 34 (3):509-510.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  34.  29
    Frederic B. Fitch. Representation of sequential circuits in combinatory logic. Philosophy of science, vol. 25 , pp. 263–279. [REVIEW]Robert McNaughton - 1965 - Journal of Symbolic Logic 30 (3):380.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  35.  31
    Friedman Joyce. Some results in Church's restricted recursive arithmetic. [REVIEW]Robert McNaughton - 1959 - Journal of Symbolic Logic 24 (3):241-242.
  36.  31
    Gene F. Rose. Output completeness in sequential machines. Proceedings of the American Mathematical Society, vol. 13 , pp. 611–614. [REVIEW]Robert McNaughton - 1966 - Journal of Symbolic Logic 31 (1):140-140.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  37.  19
    Joyce Friedman. A decision procedure for computations of finite automata. Journal of the Association for Computing Machinery, vol. 9 , pp. 315–323. [REVIEW]Robert McNaughton - 1965 - Journal of Symbolic Logic 30 (2):248-249.
  38.  36
    Konéčnyé avlomaty - B. A. Trahténbrot and Á. M. Barzdin′. Konéčnyé avlomaty . Izdatél′stvo “Nauka,”Moscow1970, 400 pp. [REVIEW]Robert McNaughton - 1977 - Journal of Symbolic Logic 42 (1):111-112.
  39.  50
    Kleene S. C.. Permutability of inferences in Gentzen's calculi LK and LJ. Two papers on the predicate calculus, by Kleene S. C. , lithographed, Providence 1952, pp. 1–26.Kleene S. C.. Finite axiomatizability of theories in the predicate calculus using additional predicate symbols. Two papers on the predicate calculus, by Kleene S. C. , lithographed, Providence 1952, pp. 27–66.Kleene S. C.. Bibliography. Two papers on the predicate calculus, by Kleene S. C. , lithographed, Providence 1952, pp. 67–68.Craig William. On axiomatizability within a system. [REVIEW]Robert McNaughton - 1954 - Journal of Symbolic Logic 19 (1):62-63.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  40.  34
    McCluskey E. J. Jr. Detection of group invariance or total symmetry of a Boolean function. The Bell System technical journal, vol. 35 , pp. 1445–1453. [REVIEW]Robert McNaughton - 1958 - Journal of Symbolic Logic 23 (2):236-236.
  41.  60
    N. E. Kobrinskii and B. A. Trakhtenbrot. Introduction to the theory of finite automata. English translation of XXIX 97, edited by J. C. Shepherdson. Studies in logic and the foundations of mathematics. North-Holland Publishing Company, Amsterdam1965, x + 337 pp. [REVIEW]Robert McNaughton - 1968 - Journal of Symbolic Logic 33 (3):466.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  42.  49
    Nelson Raymond J.. Simplest normal truth functions. [REVIEW]Robert McNaughton - 1956 - Journal of Symbolic Logic 21 (3):328-330.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  43.  47
    Pugmire J. M. and Rose A.. Formulae corresponding to universal decision elements. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 4 , pp. 1–9.Rose A.. The use of universal decision elements as flip-flops. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 4 , pp. 169–174.Rose Alan. Nouvelle méthode pour déterminer les formules qui correspondent à des éléments universels de décision. Comptes rendus hebdomadaires des séances de l'Académie des Sciences , vol. 249 , pp. 870–872. [REVIEW]Robert McNaughton - 1962 - Journal of Symbolic Logic 27 (2):250-250.
  44.  12
    Rose Alan. Sur les éléments universels de décision. Comptes rendus hebdomadaires des séances de l'Académie des Sciences , vol. 244 , pp. 2343–2345. [REVIEW]Robert McNaughton - 1959 - Journal of Symbolic Logic 24 (3):256-256.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  45.  67
    J. Richard Büchi. Weak second-order arithmetic and finite automata. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 6 , pp. 66–92. - J. Richard Büchi. On a decision method in restricted second order arithmetic. Logic, methodology and philosophy of science, Proceedings of the 1960 International Congress, edited by Ernest Nagel, Patrick Suppes, and Alfred Tarski, Stanford University Press, Stanford, Calif., 1962, pp. 1–11. [REVIEW]Robert McNaughton - 1963 - Journal of Symbolic Logic 28 (1):100-102.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  46.  53
    Ryll-Nardzewski C.. The role of the axiom of induction in elementary arithmetic. Fundamenta mathematicae, vol. 39 , pp. 239–263. [REVIEW]Robert McNaughton - 1954 - Journal of Symbolic Logic 19 (4):287-288.
  47.  22
    R. E. Stearns and J. Hartmanis. Regularity preserving modifications of regular expressions. Information and control, vol. 6 , pp. 55–69. [REVIEW]Robert McNaughton - 1966 - Journal of Symbolic Logic 31 (2):265.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  48.  59
    Nelson R. J.. Introduction to automata. John Wiley & Sons, Inc., New York-London-Sydney 1968, xii + 400 pp. [REVIEW]Robert McNaughton - 1971 - Journal of Symbolic Logic 36 (1):151-152.
  49.  56
    (1 other version)Raphael M. Robinson. Restricted set-theoretical definitions in arithmetic. Proceedings of the American Mathematical Society, vol. 9 , 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. [REVIEW]Robert McNaughton - 1966 - Journal of Symbolic Logic 31 (4):659-660.
  50.  32
    Routledge N. A.. Logic on electronic computers: A practical method for reducing expressions to conjunctive normal form. Proceedings of the Cambridge Philosophical Society, vol. 52 , pp. 161–173. [REVIEW]Robert McNaughton - 1959 - Journal of Symbolic Logic 24 (3):255-255.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
1 — 50 / 51