Results for 'Mcnaughton, Robert'

999 found
Order:
  1.  88
    A theorem about infinite-valued sentential logic.Robert McNaughton - 1951 - Journal of Symbolic Logic 16 (1):1-13.
  2.  12
    A Theorem About Infinite-Valued Sentential Logic.Robert Mcnaughton - 1951 - Journal of Symbolic Logic 16 (3):227-228.
    Direct download  
     
    Export citation  
     
    Bookmark   18 citations  
  3.  7
    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  
  4.  18
    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   5 citations  
  5.  39
    Introduction to Mathematical Logic. [REVIEW]Robert McNaughton - 1958 - Philosophical Review 67 (1):116-118.
  6.  44
    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  
  7.  26
    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  
  8. 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  
  9.  12
    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  
  10.  2
    A Metrical Concept of Happiness.Robert Mcnaughton - 1958 - Journal of Symbolic Logic 23 (3):351-352.
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  11.  8
    Axiomatic Systems, Conceptual Schemes, and the Consistency of Mathematical Theories.Robert Mcnaughton - 1962 - Journal of Symbolic Logic 27 (2):221-222.
    Direct download  
     
    Export citation  
     
    Bookmark  
  12.  21
    Bing Kurt. On simplifying truth-functional formulas.Robert McNaughton - 1957 - Journal of Symbolic Logic 22 (2):221-221.
  13.  9
    Contradiction, the Logical Counterpart to Conflict.Robert Mcnaughton - 1957 - Journal of Symbolic Logic 22 (4):401-401.
  14.  21
    Logical and Combinatorial Problems in Computer Design.Robert Mcnaughton - 1957 - Journal of Symbolic Logic 22 (2):222-222.
    Direct download  
     
    Export citation  
     
    Bookmark  
  15.  21
    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 (3 more)  
     
    Export citation  
     
    Bookmark  
  16.  25
    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.
  17.  12
    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.
  18.  18
    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  
  19.  22
    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.
  20.  13
    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  
  21.  24
    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.
  22.  17
    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  
  23.  9
    Some Formal Relative Consistency Proofs.Robert Mcnaughton - 1960 - Journal of Symbolic Logic 25 (4):353-354.
    Direct download  
     
    Export citation  
     
    Bookmark  
  24.  17
    The Theory of Automata, a Survey.Robert Mcnaughton - 1972 - Journal of Symbolic Logic 37 (4):760-760.
    Direct download  
     
    Export citation  
     
    Bookmark  
  25.  7
    Undefinability of addition from one Unary Operator.Robert Mcnaughton - 1966 - Journal of Symbolic Logic 31 (2):270-270.
  26.  8
    Unate Truth Functions.Robert Mcnaughton - 1967 - Journal of Symbolic Logic 32 (2):263-263.
  27.  17
    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  
  28.  12
    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  
  29.  18
    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  
  30.  58
    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.
  31.  40
    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.
  32. Review: Alan Rose, Sur les Elements Universels de Decision. [REVIEW]Robert McNaughton - 1959 - Journal of Symbolic Logic 24 (3):256-256.
     
    Export citation  
     
    Bookmark  
  33. Review: A. W. Burks, J. B. Wright, Sequence Generators and Digital Computers; Arthur W. Burks, Jesse B. Wright, Sequence Generators, Graphs, and Formal Languages. [REVIEW]Robert McNaughton - 1964 - Journal of Symbolic Logic 29 (4):210-212.
  34.  14
    Review: B. A. Trakhtenbrot, Ya. M. Barzdin, Finite Automata. Behavior and Synthesis. [REVIEW]Robert McNaughton - 1977 - Journal of Symbolic Logic 42 (1):111-112.
  35.  9
    Review: C. C. Elgot, Decision Problems of Finite Automata Design and Related Arithmetics. [REVIEW]Robert McNaughton - 1969 - Journal of Symbolic Logic 34 (3):509-510.
  36.  14
    Review: Dean N. Arden, Delayed-Logic and Finite-State Machines. [REVIEW]Robert McNaughton - 1971 - Journal of Symbolic Logic 36 (1):151-151.
  37. Review: Frederic B. Fitch, (Sintez cifrovyh avtomatov):Representation of Sequential Circuits in Combinatory Logic. [REVIEW]Robert McNaughton - 1965 - Journal of Symbolic Logic 30 (3):380-380.
     
    Export citation  
     
    Bookmark  
  38.  6
    Review: Gene F. Rose, Output Completeness in Sequential Machines. [REVIEW]Robert McNaughton - 1966 - Journal of Symbolic Logic 31 (1):140-140.
  39. Review: Joyce Friedman, A Decision Procedure for Computations of Finite Automata. [REVIEW]Robert McNaughton - 1965 - Journal of Symbolic Logic 30 (2):248-249.
     
    Export citation  
     
    Bookmark  
  40.  20
    Review: N. E. Kobrinskii, B. A. Trakhtenbrot, Introduction to the Theory of Finite Automata. [REVIEW]Robert McNaughton - 1968 - Journal of Symbolic Logic 33 (3):466-466.
  41. Review: R. E. Stearns, J. Hartmanis, Regularity Preserving Modifications of Regular Expressions. [REVIEW]Robert McNaughton - 1966 - Journal of Symbolic Logic 31 (2):265-265.
  42.  16
    Review: R. J. Nelson, Introduction to Automata. [REVIEW]Robert McNaughton - 1971 - Journal of Symbolic Logic 36 (1):151-152.
  43.  32
    Review: Raphael M. Robinson, Restricted Set-Theoretical Definitions in Arithmetic. [REVIEW]Robert McNaughton - 1966 - Journal of Symbolic Logic 31 (4):659-660.
  44.  11
    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  
  45.  16
    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.
  46.  15
    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.
  47.  21
    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  
  48.  16
    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 (3 more)  
     
    Export citation  
     
    Bookmark  
  49.  25
    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  
  50.  14
    Friedman Joyce. Some results in Church's restricted recursive arithmetic. [REVIEW]Robert McNaughton - 1959 - Journal of Symbolic Logic 24 (3):241-242.
1 — 50 / 999