26 found
Order:
  1.  18
    On a Simple Definition of Computable Function of a Real Variable‐with Applications to Functions of a Complex Variable.Marian Boykan Pour-El & Jerome Caldwell - 1975 - Mathematical Logic Quarterly 21 (1):1-19.
  2.  23
    Gerald E. Sacks. On the Degrees Less Than 0′. Annals of Mathematics, Second Series, Vol. 77 , Pp. 211–231. - Gerald E. Sacks. Correction to “On the Degrees Less Than 0′.”Annals of Mathematics, Second Series, Vol. 78 , P. 204. [REVIEW]Marian Boykan Pour-El - 1964 - Journal of Symbolic Logic 29 (1):60.
  3.  22
    Donald A. Martin. A Theorem on Hyper Hypersimple Sets. The Journal of Symbolic Logic, Vol. 28 No. 4 , Pp. 273–278.Marian Boykan Pour-El - 1966 - Journal of Symbolic Logic 31 (1):139-139.
  4.  17
    Raymond M. Smullyan. Theory of Formal Systems. Annals of Mathematics Studies, No. 47. Princeton University Press, Princeton1961, Xi + 142 Pp. - Raymond M. Smullyan. Theory of Formal Systems. Revised Edition. Annals of Mathematics Studies, No. 47. Princeton University Press, Princeton1961, Xi + 147 Pp. [REVIEW]Marian Boykan Pour-El - 1965 - Journal of Symbolic Logic 30 (1):88-90.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  5.  31
    Independent Axiomatization and its Relation to the Hypersimple Set.Marian Boykan Pour-El - 1968 - Mathematical Logic Quarterly 14 (25-29):449-456.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  6.  13
    J. S. Ullian. Splinters of Recursive Functions. The Journal of Symbolic Logic, Vol. 25 No. 1 , Pp. 33–38.Marian Boykan Pour-El - 1966 - Journal of Symbolic Logic 31 (1):138-139.
  7.  25
    Effectively Extensible Theories.Marian Boykan Pour-El - 1968 - Journal of Symbolic Logic 33 (1):56-68.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  8.  20
    A Structural Criterion for Recursive Enumeration Without Repetition.Marian Boykan Pour-El & William A. Howard - 1964 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 10 (8):105-114.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  9.  14
    A Comparison of Five “Computable” Operators.Marian Boykan Pour-El - 1960 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 6 (15-22):325-340.
  10.  2
    A Comparison of Five “Computable” Operators.Marian Boykan Pour-El - 1960 - Mathematical Logic Quarterly 6 (15‐22):325-340.
  11.  11
    Recursively Enumerable Classes and Their Application to Recursive Sequences of Formal Theories.Marian Boykan Pour-el, Hilary Putnam, William A. Howard & A. H. Lachlan - 1973 - Journal of Symbolic Logic 38 (1):155-156.
  12.  23
    Review: Raymond M. Smullyan, Theory of Formal Systems. [REVIEW]Marian Boykan Pour-El - 1965 - Journal of Symbolic Logic 30 (1):88-90.
  13.  1
    A Structural Criterion for Recursive Enumeration Without Repetition.Marian Boykan Pour-El & William A. Howard - 1964 - Mathematical Logic Quarterly 10 (8):105-114.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  14.  13
    Friedberg Richard. The Uniqueness of Finite Division for Recursive Equivalence Types. Mathematische Zeitschrift, Vol. 75 , Pp. 3–7. [REVIEW]Marian Boykan Pour-El - 1960 - Journal of Symbolic Logic 25 (4):363-363.
  15.  14
    Review: William W. Boone, Partial Results Regarding Word Problems and Recursively Enumerable Degrees of Unsolvability. [REVIEW]Marian Boykan Pour-El - 1963 - Journal of Symbolic Logic 28 (4):292-292.
  16.  11
    Boone William W.. Partial Results Regarding Word Problems and Recursively Enumerable Degrees of Unsolvability. Bulletin of the American Mathematical Society, Vol. 68 , Pp. 616–623. [REVIEW]Marian Boykan Pour-El - 1963 - Journal of Symbolic Logic 28 (4):292-292.
  17.  16
    Review: Richard Friedberg, Un Contre-Exemple Relatif aux Fonctionnelles Recursives. [REVIEW]Marian Boykan Pour-El - 1959 - Journal of Symbolic Logic 24 (2):171-171.
    Direct download (4 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  18.  14
    A Recursion‐Theoretic View of Axiomatizable Theories.Marian Boykan Pour-El - 1970 - Dialectica 24 (4):267-276.
  19.  9
    Friedberg Richard M.. A Criterion for Completeness of Degrees of Unsolvability. [REVIEW]Marian Boykan Pour-El - 1960 - Journal of Symbolic Logic 25 (2):165-165.
  20.  7
    Review: Richard M. Friedberg, Three Theorems on Recursive Enumeration. I. Decomposition. II. Maximal Set. III. Enumeration Without Duplication. [REVIEW]Marian Boykan Pour-El - 1960 - Journal of Symbolic Logic 25 (2):165-166.
  21. Review: Gerald E. Sacks, On the Degrees Less Than 0'. [REVIEW]Marian Boykan Pour-El - 1964 - Journal of Symbolic Logic 29 (1):60-60.
  22.  6
    Friedberg Richard. Un contre-exemple relatif aux fonctionnelles récursives. Comptes rendus hebdomadaires des séances de l'Académie des Sciences , vol. 247 , pp. 852–854. [REVIEW]Marian Boykan Pour-El - 1959 - Journal of Symbolic Logic 24 (2):171-171.
    Direct download (3 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  23. Review: J. S. Ullian, Splinters of Recursive Functions. [REVIEW]Marian Boykan Pour-El - 1966 - Journal of Symbolic Logic 31 (1):138-139.
  24.  3
    Review: Richard Friedberg, The Uniqueness of Finite Division for Recursive Equivalence Types. [REVIEW]Marian Boykan Pour-El - 1960 - Journal of Symbolic Logic 25 (4):363-363.
  25. Review: Donald A. Martin, A Theorem on Hyperhypersimple Sets. [REVIEW]Marian Boykan Pour-El - 1966 - Journal of Symbolic Logic 31 (1):139-139.
  26. Review: Richard M. Friedberg, A Criterion for Completeness of Degrees of Unsolvability. [REVIEW]Marian Boykan Pour-El - 1960 - Journal of Symbolic Logic 25 (2):165-165.