Search results for 'Gerald E. Sacks' (try it on Scholar)

1000+ found
Order:
  1.  3
    Gerald E. Sacks (1986). The Limits of E-Recursive Enumerability. Annals of Pure and Applied Logic 31 (1):87-120.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  2. Gerald E. Sacks (1996). Effective Forcing Versus Proper Forcing. Annals of Pure and Applied Logic 81 (1-3):171-185.
    , a notion of forcing over E, the E-closure of L, is said to be effective if every sideways -generic extension preserves E-closure. There are set notions of forcing in E that do not preserve E-closure. The main theorem below asserts that is effective if and only if it is locally proper, a weak variant of Shelah's notion of proper.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  3.  4
    Gerald E. Sacks (1972). Saturated Model Theory. Reading, Mass.,W. A. Benjamin.
    This book contains the material for a first course in pure model theory with applications to differentially closed fields.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   27 citations  
  4.  14
    G. Kreisel & Gerald E. Sacks (1965). Metarecursive Sets. Journal of Symbolic Logic 30 (3):318-338.
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography   13 citations  
  5.  16
    Gerald E. Sacks (2007). Bounds on Weak Scattering. Notre Dame Journal of Formal Logic 48 (1):5-31.
    The notion of a weakly scattered theory T is defined. T need not be scattered. For each a model of T, let sr() be the Scott rank of . Assume sr() ≤ ω\sp A \sb 1 for all a model of T. Let σ\sp T \sb 2 be the least Σ₂ admissible ordinal relative to T. If T admits effective k-splitting as defined in this paper, then θσ\cal Aθ\cal A$ a model of T.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  6. Manuel Lerman & Gerald E. Sacks (1972). Some Minimal Pairs of Α-Recursively Enumerable Degrees. Annals of Mathematical Logic 4 (4):415-442.
  7.  16
    Gerald E. Sacks (1961). On Suborderings of Degrees of Recursive Unsolvability. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 7 (1-5):46-56.
  8. Jessica Millar & Gerald E. Sacks (2008). Atomic Models Higher Up. Annals of Pure and Applied Logic 155 (3):225-241.
    There exists a countable structure of Scott rank where and where the -theory of is not ω-categorical. The Scott rank of a model is the least ordinal β where the model is prime in its -theory. Most well-known models with unbounded atoms below also realize a non-principal -type; such a model that preserves the Σ1-admissibility of will have Scott rank . Makkai [M. Makkai, An example concerning Scott heights, J. Symbolic Logic 46 301–318. [4]] produces a hyperarithmetical model of Scott (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  9.  7
    Timothy Smiley, Frederic B. Fitch, Shih-Chao Liu, S. C. Kleene, Keith Lehrer, Thomas E. Patton, Maria Kokoszynska, Arto Salomaa, Abraham Robinson & Gerald E. Sacks (2013). The Journal of Symbolic Logic Publishes Original Scholarly Work in Symbolic Logic. Founded in 1936, It has Become the Leading Research Journal in the Field. The Journal Aims to Represent Logic Broadly, Including its Connections with Mathematics and Philosophy as Well as Newer Aspects Related to Computer Science and Linguistics. [REVIEW] Journal of Symbolic Logic 175 (176).
    Direct download  
     
    Export citation  
     
    My bibliography  
  10. Gerald E. Sacks (1960). Review: Richard M. Friedberg, Hartley Rogers, Reducibility and Completeness for Sets of Integers. [REVIEW] Journal of Symbolic Logic 25 (4):362-363.
     
    Export citation  
     
    My bibliography  
  11.  3
    Gerald E. Sacks (1972). Review: J. R. Shoenfield, J. W. Addison, Leon Henkin, Alfred Tarski, Applications of Model Theory to Degrees of Unsolvability. [REVIEW] Journal of Symbolic Logic 37 (3):610-611.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  12.  1
    Gerald E. Sacks (1963). Review: R. M. Friedberg, The Fine Structure of Degrees of Unsolvability of Recursively Enumerable Sets. [REVIEW] Journal of Symbolic Logic 28 (2):166-166.
  13.  2
    Jens Erik Fenstad, R. O. Gandy & Gerald E. Sacks (eds.) (1978). Generalized Recursion Theory Ii: Proceedings of the 1977 Oslo Symposium. Sole Distributors for the U.S.A. And Canada, Elsevier North-Holland.
    GENERALIZED RECUBION THEORY II © North-Holland Publishing Company (1978) MONOTONE QUANTIFIERS AND ADMISSIBLE SETS Ion Barwise University of Wisconsin ...
    No categories
    Direct download  
     
    Export citation  
     
    My bibliography  
  14. Gerald E. Sacks & Shih-Chao Liu (1966). A Note on Many-One Reducibility. Journal of Symbolic Logic 31 (3):512.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  15. Gerald E. Sacks (1960). Friedberg Richard M. And Rogers Hartley Jr., Reducibility and Completeness for Sets of Integers. Zeitschrift Für Mathematische Logik Und Grundlagen der Mathematik, Vol. 5 , Pp. 117–125. [REVIEW] Journal of Symbolic Logic 25 (4):362-363.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  16. Gerald E. Sacks (1963). Friedberg R. M.. The Fine Structure of Degrees of Unsolvability of Recursively Enumerable Sets. 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. 404–406. [REVIEW] Journal of Symbolic Logic 28 (2):166.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  17. Gerald E. Sacks (1968). Ihrig Ann H.. The Post-Lineal Theorems for Arbitrary Recursively Enumerable Degrees of Unsolvability. Notre Dame Journal of Formal Logic, Vol. 6 No. 1 , Pp. 54–72. [REVIEW] Journal of Symbolic Logic 32 (4):529.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  18. Gerald E. Sacks (1996). Kreisel, Generalized. In Piergiorgio Odifreddi (ed.), Kreiseliana. About and Around Georg Kreisel. A K Peters 103.
  19. Gerald E. Sacks (1996). Liu Shih-Chao. On Many-One Degrees. Journal of Symbolic Logic 31 (3):512-513.
    Direct download  
     
    Export citation  
     
    My bibliography  
  20. Gerald E. Sacks (1969). Measure-Theoretic Uniformity. In Kurt Gödel, Jack J. Bulloff, Thomas C. Holyoke & Samuel Wilfred Hahn (eds.), Foundations of Mathematics. New York, Springer 51--57.
    No categories
    Direct download  
     
    Export citation  
     
    My bibliography  
  21. Gerald E. Sacks & Shih-Chao Liu (1966). On Many-One Degrees. Journal of Symbolic Logic 31 (3):512.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  22. Gerald E. Sacks (1972). Preface. Annals of Mathematical Logic 4 (4):341.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  23. Gerald E. Sacks (1967). Review: Ann H. Ihrig, The Post-Lineal Theorems for Arbitrary Recursively Enumerable Degrees of Unsolvability. [REVIEW] Journal of Symbolic Logic 32 (4):529-529.
     
    Export citation  
     
    My bibliography  
  24. Gerald E. Sacks (1971). Review: A. H. Lachlan, The Impossibility of Finding Relative Complements for Recursively Enumerable Degrees. [REVIEW] Journal of Symbolic Logic 36 (3):539-540.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  25. Gerald E. Sacks (1964). Review: J. R. Shoenfield, On Degrees of Unsolvability; J. R. Shoenfield, An Uncountable Set of Incomparable Degrees. [REVIEW] Journal of Symbolic Logic 29 (4):203-204.
     
    Export citation  
     
    My bibliography  
  26. Gerald E. Sacks (1966). Review: Shih-Chao Liu, A Note on Many-One Reducibility. [REVIEW] Journal of Symbolic Logic 31 (3):512-512.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  27. Gerald E. Sacks (1966). Review: Shih-Chao Liu, On Many-One Degrees. [REVIEW] Journal of Symbolic Logic 31 (3):512-513.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  28. Gerald E. Sacks (1964). Shoenfield J. R.. On Degrees of Unsolvability. Annals of Mathematics, Second Series, Vol. 69 , Pp. 644–653.Shoenfield J. R.. An Uncountable Set of Incomparable Degrees. Proceedings of the American Mathematical Society, Vol. 11 , Pp. 61–62. [REVIEW] Journal of Symbolic Logic 29 (4):203-204.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  29. Gerald E. Sacks (1972). Shoenheld J. R.. Applications of Model Theory to Degrees of Unsolvability. The Theory of Models, Proceedings of the 1963 International Symposium at Berkeley, Edited by Addison J. W., Henkin Leon, and Tarski Alfred, Studies in Logic and the Foundations of Mathematics, North-Holland Publishing Company, Amsterdam 1965, Pp. 359–363. [REVIEW] Journal of Symbolic Logic 37 (3):610-611.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  30.  1
    Gerald E. Sacks (1999). Selected Logic Papers. World Scientific.
  31. R. Bodei, G. M. Edelntann, F. Petrella, G. E. Rusconi & O. Sacks (1995). Quando uno psichiatra parla di psicosi ha già di fatto nella sua mente una distinzione, una scelta di campo, che esclude tutte le condizioni di disturbo psichico chiaramente connesse e derivanti da alterazioni organi-che del Sistema Nervoso e ovviamente il più spesso intrise di alterazioni delle funzioni mnestiche. La attenzione è cioè rivolta, in termini jasper. Iride: Filosofia e Discussione Pubblica 8:46.
    No categories
    Translate
     
     
    Export citation  
     
    My bibliography  
  32. C. E. M. Yates (1967). Review: Gerald E. Sacks, On a Theorem of Lachlan and Martin. [REVIEW] Journal of Symbolic Logic 32 (4):529-529.
     
    Export citation  
     
    My bibliography  
  33. Marian Boykan Pour-El (1964). Review: Gerald E. Sacks, On the Degrees Less Than 0'. [REVIEW] Journal of Symbolic Logic 29 (1):60-60.
     
    Export citation  
     
    My bibliography   1 citation  
  34.  2
    Michael Makkai (1975). Review: Gerald E. Sacks, Saturated Model Theory. [REVIEW] Journal of Symbolic Logic 40 (4):637-640.
    Direct download  
     
    Export citation  
     
    My bibliography  
  35. Donald L. Kreider (1964). Review: Gerald E. Sacks, Recursive Enumerability and the Jump Operator. [REVIEW] Journal of Symbolic Logic 29 (4):204-204.
     
    Export citation  
     
    My bibliography  
  36.  1
    J. R. Shoenfield (1974). Review: Gerald E. Sacks, Forcing with Perfect Closed Sets. [REVIEW] Journal of Symbolic Logic 39 (2):330-330.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  37.  1
    Robert W. Robinson (1969). Review: Gerald E. Sacks, A Minimal Degree Less Than O'. [REVIEW] Journal of Symbolic Logic 34 (2):295-295.
    Direct download  
     
    Export citation  
     
    My bibliography  
  38. K. Appel (1967). Review: Gerald E. Sacks, A Maximal Set Which is Not Complete. [REVIEW] Journal of Symbolic Logic 32 (4):528-528.
    Direct download  
     
    Export citation  
     
    My bibliography  
  39. D. A. Clarke (1974). Review: Gerald E. Sacks, Recursion in Objects of Finite Type. [REVIEW] Journal of Symbolic Logic 39 (2):343-344.
  40. Gustav B. Hensel (1964). Review: Gerald E. Sacks, On Suborderings of Degrees of Recursive Unsolvability. [REVIEW] Journal of Symbolic Logic 29 (4):203-203.
     
    Export citation  
     
    My bibliography  
  41. Gustav B. Hensel (1964). Review: Gerald E. Sacks, Degrees of Unsolvability. [REVIEW] Journal of Symbolic Logic 29 (4):202-203.
     
    Export citation  
     
    My bibliography  
  42. Dag Normann (1992). Review: Gerald E. Sacks, Higher Recursion Theory. [REVIEW] Journal of Symbolic Logic 57 (2):761-762.
    Direct download  
     
    Export citation  
     
    My bibliography  
  43. Richard A. Platek (1968). Review: G. Kreisel, Gerald E. Sacks, Metarecursive Sets. [REVIEW] Journal of Symbolic Logic 33 (4):622-623.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  44. C. E. M. Yates (1968). Sacks Gerald E.. On a Theorem of Lachlan and Martin. Proceedings of the American Mathematical Society, Vol. 18 , Pp. 140–141. [REVIEW] Journal of Symbolic Logic 32 (4):529.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  45.  1
    J. R. Shoenfield (1974). Sacks Gerald E.. Forcing with Perfect Closed Sets. Axiomatic Set Theory, Proceedings of Symposia in Pure Mathematics, Vol. 13 Part 1, American Mathematical Society, Providence, Rhode Island, 1971, Pp. 331–355. [REVIEW] Journal of Symbolic Logic 39 (2):330.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  46. K. Appel (1968). Sacks Gerald E.. A Maximal Set Which is Not Complete. Michigan Mathematical Journal, Vol. 11 , Pp. 193–205. Journal of Symbolic Logic 32 (4):528.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  47. D. A. Clarke (1974). Sacks Gerald E.. Recursion in Objects of Finite Type. Actes du Congrès International des Mathématiciens 1970, Gauthier-Villars, Paris 1971, Vol. 1, Pp. 251–254. [REVIEW] Journal of Symbolic Logic 39 (2):343-344.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  48. Gustav B. Hensel (1964). Sacks Gerald E.. Degrees of Unsolvability. Annals of Mathematics Studies, No. 55. Lithoprinted. Princeton University Press, Princeton 1963, Xii + 174 Pp. [REVIEW] Journal of Symbolic Logic 29 (4):202-203.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  49. Gustav B. Hensel (1964). Sacks Gerald E.. On Suborderings of Degrees of Recursive Unsolvability. Zeitschrift Für Mathematische Logik Und Grundlagen der Mathematik, Vol. 7 , Pp. 46–56. [REVIEW] Journal of Symbolic Logic 29 (4):203.
    Translate
      Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  50. Donald L. Kreider (1964). Sacks Gerald E.. Recursive Enumerability and the Jump Operator. Transactions of the American Mathematical Society, Vol. 108 , Pp. 223–239. [REVIEW] Journal of Symbolic Logic 29 (4):204.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
1 — 50 / 1000