Switch to: Citations

Add references

You must login to add references.
  1. (1 other version)Review: Alfred Tarski, Undecidable Theories. [REVIEW]Martin Davis - 1959 - Journal of Symbolic Logic 24 (2):167-169.
    Download  
     
    Export citation  
     
    Bookmark   68 citations  
  • Arithmetical definability of field elements.Raphael M. Robinson - 1951 - Journal of Symbolic Logic 16 (2):125-126.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Finite sequences of classes.Raphael M. Robinson - 1945 - Journal of Symbolic Logic 10 (4):125-126.
    Consider an axiomatic set theory in which there is a distinction between “sets” and “classes,” only sets being allowable as elements. How can one define a finite sequence of classes? This problem was proposed to me by A. Tarski, and a solution is given in this note. We shall assume the axiom system Σ used by Godei in his study of the continuum hypothesis, and shall use the same notation.1.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Arithmetical representation of recursively enumerable sets.Raphael M. Robinson - 1956 - Journal of Symbolic Logic 21 (2):162-186.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • (1 other version)The undecidability of pure transcendental extensions of real fields.Raphael M. Robinson - 1964 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 10 (18):275-282.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • The theory of classes A modification of von Neumann's system.Raphael M. Robinson - 1937 - Journal of Symbolic Logic 2 (1):29-36.
    1. The theory of classes presented in this paper is a simplification of that presented by J. von Neumann in his paper Die Axiomatisierung der Mengenlehre. However, this paper is written so that it can be read independently of von Neumann's. The principal modifications of his system are the following.(1) The idea of ordered pair is defined in terms of the other primitive concepts of the system. (See Axiom 4.3 below.)(2) A much simpler proof of the well-ordering theorem, based on (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Some representations of diophantine sets.Raphael M. Robinson - 1972 - Journal of Symbolic Logic 37 (3):572-578.
    Download  
     
    Export citation  
     
    Bookmark   1 citation