27 found
Order:
  1.  21
    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.  4
    Recursively enumerable classes and their application to recursive sequences of formal theories.Marian Boykan Pour-El & Hilary Putnam - 1965 - Archive for Mathematical Logic 8 (3-4):104-121.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   5 citations  
  3.  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  
  4.  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.
  5.  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  
     
    Export citation  
     
    Bookmark   2 citations  
  6.  23
    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.
  7.  2
    A Comparison of Five “Computable” Operators.Marian Boykan Pour-El - 1960 - Mathematical Logic Quarterly 6 (15‐22):325-340.
  8. Review: Donald A. Martin, A Theorem on Hyperhypersimple Sets. [REVIEW]Marian Boykan Pour-El - 1966 - Journal of Symbolic Logic 31 (1):139-139.
  9. 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.
  10.  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  
  11.  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.
  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.  15
    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.
  14.  13
    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.
  15.  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.
  16.  14
    A Recursion‐theoretic View of Axiomatizable Theories.Marian Boykan Pour-El - 1970 - Dialectica 24 (4):267-276.
  17.  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.
  18.  10
    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.
  19.  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  
     
    Export citation  
     
    Bookmark   1 citation  
  20. Review: Gerald E. Sacks, On the Degrees Less than 0'. [REVIEW]Marian Boykan Pour-El - 1964 - Journal of Symbolic Logic 29 (1):60-60.
  21.  9
    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.
  22. Review: J. S. Ullian, Splinters of Recursive Functions. [REVIEW]Marian Boykan Pour-El - 1966 - Journal of Symbolic Logic 31 (1):138-139.
  23.  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)  
     
    Export citation  
     
    Bookmark  
  24.  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  
     
    Export citation  
     
    Bookmark   2 citations  
  25.  17
    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)  
     
    Export citation  
     
    Bookmark   1 citation  
  26.  14
    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.
  27.  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.