Search results for 'Carl G. Jockusch Jr' (try it on Scholar)

323 found
Sort by:
  1. C. A. Herzog, Cade Jr, A. Caliendo, J. S. Cameron, A. Cantone, G. Capasso, D. Carl, J. A. Castillo-Lugo, R. Cestaro & M. Chelamcharla (2005). Herrera-Acosta, J., 19. In Alan F. Blackwell & David MacKay (eds.), Power. Cambridge University Press. 171.score: 810.0
    No categories
     
    My bibliography  
     
    Export citation  
  2. Richard G. Heck Jr (2000). Nonconceptual Content and the "Space of Reasons". Philosophical Review 109 (4):483 - 523.score: 240.0
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  3. Patricia Keith-Spiegel, Barbara G. Tabachnick, Bernard E. Whitley Jr & Jennifer Washburn (1998). Why Professors Ignore Cheating: Opinions of a National Sample of Psychology Instructors. Ethics and Behavior 8 (3):215 – 227.score: 240.0
    To understand better why evidence of student cheating is often ignored, a national sample of psychology instructors was sampled for their opinions. The 127 respondents overwhelmingly agreed that dealing with instances of academic dishonesty was among the most onerous aspects of their profession. Respondents cited insufficient evidence that cheating has occurred as the most frequent reason for overlooking student behavior or writing that might be dishonest. A factor analysis revealed 4 other clusters of reasons as to why cheating may be (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  4. Richard G. Heck Jr (1997). Finitude and Hume's Principle. Journal of Philosophical Logic 26 (6):589 - 617.score: 240.0
    The paper formulates and proves a strengthening of 'Frege's Theorem', which states that axioms for second-order arithmetic are derivable in second-order logic from Hume's Principle, which itself says that the number of Fs is the same as the number of Gs just in case the Fs and Gs are equinumerous. The improvement consists in restricting this claim to finite concepts, so that nothing is claimed about the circumstances under which infinite concepts have the same number. 'Finite Hume's Principle' also suffices (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  5. Richard G. Heck Jr (2004). Truth and Disquotation. Synthese 142 (3):317 - 352.score: 240.0
    Hartry Field has suggested that we should adopt at least a methodological deflationism: "[W]e should assume full-fledged deflationism as a working hypothesis. That way, if full-fledged deflationism should turn out to be inadequate, we will at least have a clearer sense than we now have of just where it is that inflationist assumptions... are needed". I argue here that we do not need to be methodological deflationists. More precisely, I argue that we have no need for a disquotational truth-predicate; that (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  6. Gordon G. Brittan Jr (1969). Measurability, Commonsensibility, and Primary Qualities. Australasian Journal of Philosophy 47 (1):15 – 24.score: 240.0
    No categories
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  7. Richard G. Heck Jr (1997). Tarski, Truth, and Semantics. Philosophical Review 106 (4):533 - 554.score: 240.0
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  8. Richard G. Heck Jr (2011). Ramified Frege Arithmetic. Journal of Philosophical Logic 40 (6):715 - 735.score: 240.0
    Øystein Linnebo has recently shown that the existence of successors cannot be proven in predicative Frege arithmetic, using Frege's definitions of arithmetical notions. By contrast, it is shown here that the existence of successor can be proven in ramified predicative Frege arithmetic.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  9. Lee C. Archie & B. G. Hurdle Jr (1978). A Self-Directed Graduate Seminar. Metaphilosophy 9 (1):86–94.score: 240.0
    No categories
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  10. Rayme Engel & M. G. Yoes Jr (1996). Exponentiating Entities by Necessity. Australasian Journal of Philosophy 74 (2):293 – 304.score: 240.0
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  11. Richard G. Heck Jr & Robert May (2011). The Composition of Thoughts. Noûs 45 (1):126 - 166.score: 240.0
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  12. Richard G. Heck Jr (1998). That There Might Be Vague Objects (So Far as Concerns Logic). The Monist 81 (2):274 - 296.score: 240.0
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  13. Vassiliki Betty Smocovitis (2006). Keeping Up with Dobzhansky: G. Ledyard Stebbins, Jr., Plant Evolution, and the Evolutionary Synthesis. History and Philosophy of the Life Sciences 28 (1):9 - 47.score: 216.0
    This paper explores the complex relationship between the plant evolutionist G. Ledyard Stebbins and the animal evolutionist Theodosius Dobzhansky. The manner in which the plant evolution was brought into line, synthesized, or rendered consistent with the understanding of animal evolution (and especially insect evolution) is explored, especially as it culminated with the publication of Stebbins's 1950 book Variation and Evolution in Plants. The paper explores the multi-directional traffic of influence between Stebbins and Dobzhansky, but also their social and professional networks (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  14. Damir D. Dzhafarov & Carl G. Jockusch Jr (2009). Ramsey's Theorem and Cone Avoidance. Journal of Symbolic Logic 74 (2):557 - 578.score: 210.0
    It was shown by Cholak, Jockusch, and Slaman that every computable 2-coloring of pairs admits an infinite low₂ homogeneous set H. We answer a question of the same authors by showing that H may be chosen to satisfy in addition $C\,\not \leqslant _T \,H$ , where C is a given noncomputable set. This is shown by analyzing a new and simplified proof of Seetapun's cone avoidance theorem for Ramsey's theorem. We then extend the result to show that every computable (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  15. Carl G. Jockusch Jr & James C. Owings Jr (1990). Weakly Semirecursive Sets. Journal of Symbolic Logic 55 (2):637-644.score: 201.0
    We introduce the notion of "semi-r.e." for subsets of ω, a generalization of "semirecursive" and of "r.e.", and the notion of "weakly semirecursive", a generalization of "semi-r.e.". We show that A is weakly semirecursive iff, for any n numbers x 1 ,...,x n , knowing how many of these numbers belong to A is equivalent to knowing which of these numbers belong to A. It is shown that there exist weakly semirecursive sets that are neither semi-r.e. nor co-semi-r.e. On the (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  16. Carl G. Jockusch Jr & Robert I. Soare (1994). Boolean Algebras, Stone Spaces, and the Iterated Turing Jump. Journal of Symbolic Logic 59 (4):1121 - 1138.score: 198.0
    We show, roughly speaking, that it requires ω iterations of the Turing jump to decode nontrivial information from Boolean algebras in an isomorphism invariant fashion. More precisely, if α is a recursive ordinal, A is a countable structure with finite signature, and d is a degree, we say that A has αth-jump degree d if d is the least degree which is the αth jump of some degree c such there is an isomorphic copy of A with universe ω in (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  17. Vassiliki Betty Smocovitis (1999). Living with Your Biographical Subject: Special Problems of Distance, Privacy and Trust in the Biography of G. Ledyard Stebbins Jr. Journal of the History of Biology 32 (3):421 - 438.score: 198.0
    This paper explores the special problems encountered by the biographer of a living scientific subject. In particular, it explores the complex of problems that emerges from the intense interpersonal dynamic involving issues of distance, privacy and trust. It also explores methodological problems having to do with oral history interviews and other supporting documentation. It draws on the personal experience of the author and the biographical subject of G. Ledyard Stebbins Jr., the botanist, geneticist and evolutionist. It also offers prescriptives and (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  18. Carl G. Jockusch Jr (1972). Ramsey's Theorem and Recursion Theory. Journal of Symbolic Logic 37 (2):268-280.score: 198.0
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  19. Tamara Hummel & Carl G. Jockusch Jr (1999). Generalized Cohesiveness. Journal of Symbolic Logic 64 (2):489-516.score: 198.0
    We study some generalized notions of cohesiveness which arise naturally in connection with effective versions of Ramsey's Theorem. An infinite set A of natural numbers is n-cohesive (respectively, n-r-cohesive) if A is almost homogeneous for every computably enumerable (respectively, computable) 2-coloring of the n-element sets of natural numbers. (Thus the 1-cohesive and 1-r-cohesive sets coincide with the cohesive and r-cohesive sets, respectively.) We consider the degrees of unsolvability and arithmetical definability levels of n-cohesive and n-r-cohesive sets. For example, we show (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  20. Carl G. Jockusch Jr & Robert I. Soare (1973). Encodability of Kleene's O. Journal of Symbolic Logic 38 (3):437 - 440.score: 198.0
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  21. Carl G. Jockusch Jr & Richard A. Shore (1984). Pseudo-Jump Operators. II: Transfinite Iterations, Hierarchies and Minimal Covers. Journal of Symbolic Logic 49 (4):1205 - 1236.score: 198.0
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  22. Carl G. Jockusch Jr & Robert I. Soare (1971). A Minimal Pair of Π0 1 Classes. Journal of Symbolic Logic 36 (1):66 - 78.score: 198.0
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  23. Carl G. Jockusch Jr & David B. Posner (1978). Double Jumps of Minimal Degrees. Journal of Symbolic Logic 43 (4):715 - 724.score: 198.0
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  24. Carl G. Jockusch Jr (2001). In Memoriam: Joseph R. Shoenfield, 1927-2000. Bulletin of Symbolic Logic 7 (3):393-396.score: 198.0
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  25. Carl G. Jockusch Jr, Robert I. Soare, William Tait & Gaisi Takeuti (1978). Meeting of the Association for Symbolic Logic: Chicago, 1977. Journal of Symbolic Logic 43 (3):614 - 619.score: 198.0
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  26. Nicholas Goodman, Harold T. Hodes, Carl G. Jockusch Jr & Kenneth McAloon (1988). Annual Meeting of the Association for Symbolic Logic, New York City, December 1987. Journal of Symbolic Logic 53 (4):1287 - 1299.score: 198.0
  27. Carl G. Jockusch Jr (1974). Π01 Classes and Boolean Combinations of Recursively Enumerable Sets. Journal of Symbolic Logic 39 (1):95 - 96.score: 198.0
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  28. Carl G. Jockusch Jr & Robert I. Soare (1973). Post's Problem and His Hypersimple Set. Journal of Symbolic Logic 38 (3):446 - 452.score: 198.0
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  29. Carl G. Jockusch Jr & Alexandra Shlapentokh (1995). Weak Presentations of Computable Fields. Journal of Symbolic Logic 60 (1):199 - 208.score: 198.0
    It is shown that for any computable field K and any r.e. degree a there is an r.e. set A of degree a and a field F ≅ K with underlying set A such that the field operations of F (including subtraction and division) are extendible to (total) recursive functions. Further, it is shown that if a and b are r.e. degrees with b ≤ a, there is a 1-1 recursive function $f: \mathbb{Q} \rightarrow \omega$ such that f(Q) ∈ a, (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  30. Tamara J. Hummel & Carl G. Jockusch Jr (2001). Ramsey's Theorem for Computably Enumerable Colorings. Journal of Symbolic Logic 66 (2):873-880.score: 198.0
    It is shown that for each computably enumerable set P of n-element subsets of ω there is an infinite Π 0 n set $A \subseteq \omega$ such that either all n-element subsets of A are in P or no n-element subsets of A are in P. An analogous result is obtained with the requirement that A be Π 0 n replaced by the requirement that the jump of A be computable from 0 (n) . These results are best possible in (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  31. Carl G. Jockusch Jr, Bart Kastermans, Steffen Lempp, Manuel Lerman & Reed Solomon (2009). Stability and Posets. Journal of Symbolic Logic 74 (2):693 - 711.score: 198.0
    Hirschfeldt and Shore have introduced a notion of stability for infinite posets. We define an arguably more natural notion called weak stability, and we study the existence of infinite computable or low chains or antichains, and of infinite $\Pi _1^0 $ chains and antichains, in infinite computable stable and weakly stable posets. For example, we extend a result of Hirschfeldt and Shore to show that every infinite computable weakly stable poset contains either an infinite low chain or an infinite computable (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  32. Carl G. Jockusch Jr & Tamara J. Lakins (2002). Generalized R-Cohesiveness and the Arithmetical Hierarchy: A Correction to "Generalized Cohesiveness". Journal of Symbolic Logic 67 (3):1078 - 1082.score: 198.0
    For $X \subseteq \omega$ , let $\lbrack X \rbrack^n$ denote the class of all n-element subsets of X. An infinite set $A \subseteq \omega$ is called n-r-cohesive if for each computable function $f: \lbrack \omega \rbrack^n \rightarrow \lbrace 0, 1 \rbrace$ there is a finite set F such that f is constant on $\lbrack A - F \rbrack^n$ . We show that for each n ≥ 2 there is no $\prod_n^0$ set $A \subseteq \omega$ which is n-r-cohesive. For n = (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  33. Carl G. Jockusch Jr, Joseph S. Ullian & Robert B. Barrett Jr (1972). Meeting of the Association for Symbolic Logic: St. Louis 1972. Journal of Symbolic Logic 37 (4):775-782.score: 198.0
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  34. Carl G. Jockusch Jr (1968). Uniformly Introreducible Sets. Journal of Symbolic Logic 33 (4):521-536.score: 198.0
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  35. Joan Feigenbaum, Haim Gaifman, Jean-Yves Girard, C. Ward Henson, Denis Hirschfeldt, Carl G. Jockusch Jr, Saul Kripke, Salma Kuhlmann, John C. Mitchell & Ernest Schimmerling (2001). 2001 Annual Meeting of the Association for Symbolic Logic. Bulletin of Symbolic Logic 7 (3).score: 198.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  36. Valentina S. Harizanov, Carl G. Jockusch Jr & Julia F. Knight (2009). Chains and Antichains in Partial Orderings. Archive for Mathematical Logic 48 (1):39-53.score: 198.0
    We study the complexity of infinite chains and antichains in computable partial orderings. We show that there is a computable partial ordering which has an infinite chain but none that is ${\Sigma _{1}^{1}}$ or ${\Pi _{1}^{1}}$ , and also obtain the analogous result for antichains. On the other hand, we show that every computable partial ordering which has an infinite chain must have an infinite chain that is the difference of two ${\Pi _{1}^{1}}$ sets. Our main result is that there (...)
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  37. Carl G. Jockusch Jr (1973). An Application of ∑04 Determinancy to the Degrees of Unsolvability. Journal of Symbolic Logic 38 (2):293 - 294.score: 198.0
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  38. Carl G. Jockusch Jr, Richard Laver, Donald Monk, Jan Mycielski & Jon Pearce (1984). Annual Meeting of the Association for Symbolic Logic: Denver, 1983. Journal of Symbolic Logic 49 (2):674 - 682.score: 198.0
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  39. Carl G. Jockusch Jr (1969). The Degrees of Hyperhyperimmune Sets. Journal of Symbolic Logic 34 (3):489-493.score: 198.0
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  40. Rod Downey & Carl G. Jockusch Jr (1999). Effective Presentability of Boolean Algebras of Cantor-Bendixson Rank. Journal of Symbolic Logic 64 (1):45-52.score: 198.0
    We show that there is a computable Boolean algebra B and a computably enumerable ideal I of B such that the quotient algebra B/I is of Cantor-Bendixson rank 1 and is not isomorphic to any computable Boolean algebra. This extends a result of L. Feiner and is deduced from Feiner's result even though Feiner's construction yields a Boolean algebra of infinite Cantor-Bendixson rank.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  41. Carl G. Jockusch Jr (1996). A Letter From. In Piergiorgio Odifreddi (ed.), Kreiseliana. About and Around Georg Kreisel. A K Peters.score: 198.0
    No categories
     
    My bibliography  
     
    Export citation  
  42. Carl G. Jockusch Jr (2005). Free Sets and Reverse Mathematics. In Stephen Simpson (ed.), Reverse Mathematics 2001. 104.score: 198.0
    No categories
     
    My bibliography  
     
    Export citation  
  43. Carl G. Jockusch Jr & Theodore A. Slaman (1993). On the Σ2-Theory of the Upper Semilattice of Turing Degrees. Journal of Symbolic Logic 58 (1):193 - 204.score: 198.0
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  44. R. Shore, T. Slaman & Carl G. Jockusch Jr (2001). REVIEWS-Defining the Turing Jump. Bulletin of Symbolic Logic 7 (1):73-74.score: 198.0
     
    My bibliography  
     
    Export citation  
1 — 50 / 323