Results for 'Leo Harrington'

(not author) ( search as author name )
1000+ found
Order:
  1.  30
    Some exact equiconsistency results in set theory.Leo Harrington & Saharon Shelah - 1985 - Notre Dame Journal of Formal Logic 26 (2):178-188.
  2. A mathematical incompleteness in Peano arithmetic.Jeff Paris & Leo Harrington - 1977 - In Jon Barwise & H. Jerome Keisler (eds.), Handbook of Mathematical Logic. North-Holland Pub. Co.. pp. 90--1133.
     
    Export citation  
     
    Bookmark   63 citations  
  3.  52
    Models without indiscernibles.Fred G. Abramson & Leo A. Harrington - 1978 - Journal of Symbolic Logic 43 (3):572-600.
    For T any completion of Peano Arithmetic and for n any positive integer, there is a model of T of size $\beth_n$ with no (n + 1)-length sequence of indiscernibles. Hence the Hanf number for omitting types over T, H(T), is at least $\beth_\omega$ . (Now, using an upper bound previously obtained by Julia Knight H (true arithmetic) is exactly $\beth_\omega$ ). If T ≠ true arithmetic, then $H(T) = \beth_{\omega1}$ . If $\delta \not\rightarrow (\rho)^{ , then any completion of (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  4.  48
    The d.r.e. degrees are not dense.S. Barry Cooper, Leo Harrington, Alistair H. Lachlan, Steffen Lempp & Robert I. Soare - 1991 - Annals of Pure and Applied Logic 55 (2):125-151.
    By constructing a maximal incomplete d.r.e. degree, the nondensity of the partial order of the d.r.e. degrees is established. An easy modification yields the nondensity of the n-r.e. degrees and of the ω-r.e. degrees.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   31 citations  
  5.  20
    Recursively presentable prime models.Leo Harrington - 1974 - Journal of Symbolic Logic 39 (2):305-309.
  6.  12
    ℵ0-Categorical, ℵ0-stable structures.Gregory Cherlin, Leo Harrington & Alistair H. Lachlan - 1985 - Annals of Pure and Applied Logic 28 (2):103-135.
  7. Definability, automorphisms, and dynamic properties of computably enumerable sets.Leo Harrington & Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (2):199-213.
    We announce and explain recent results on the computably enumerable (c.e.) sets, especially their definability properties (as sets in the spirit of Cantor), their automorphisms (in the spirit of Felix Klein's Erlanger Programm), their dynamic properties, expressed in terms of how quickly elements enter them relative to elements entering other sets, and the Martin Invariance Conjecture on their Turing degrees, i.e., their information content with respect to relative computability (Turing reducibility).
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  8.  23
    Codable sets and orbits of computably enumerable sets.Leo Harrington & Robert I. Soare - 1998 - Journal of Symbolic Logic 63 (1):1-28.
    A set X of nonnegative integers is computably enumerable (c.e.), also called recursively enumerable (r.e.), if there is a computable method to list its elements. Let ε denote the structure of the computably enumerable sets under inclusion, $\varepsilon = (\{W_e\}_{e\in \omega}, \subseteq)$ . We previously exhibited a first order ε-definable property Q(X) such that Q(X) guarantees that X is not Turing complete (i.e., does not code complete information about c.e. sets). Here we show first that Q(X) implies that X has (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  9.  32
    The d.r.e. degrees are not dense.S. Cooper, Leo Harrington, Alistair Lachlan, Steffen Lempp & Robert Soare - 1991 - Annals of Pure and Applied Logic 55 (2):125-151.
    By constructing a maximal incomplete d.r.e. degree, the nondensity of the partial order of the d.r.e. degrees is established. An easy modification yields the nondensity of the n-r.e. degrees and of the ω-r.e. degrees.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   24 citations  
  10.  51
    Definable properties of the computably enumerable sets.Leo Harrington & Robert I. Soare - 1998 - Annals of Pure and Applied Logic 94 (1-3):97-125.
    Post in 1944 began studying properties of a computably enumerable set A such as simple, h-simple, and hh-simple, with the intent of finding a property guaranteeing incompleteness of A . From the observations of Post and Myhill , attention focused by the 1950s on properties definable in the inclusion ordering of c.e. subsets of ω, namely E = . In the 1950s and 1960s Tennenbaum, Martin, Yates, Sacks, Lachlan, Shoenfield and others produced a number of elegant results relating ∄-definable properties (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  11.  10
    There is no fat orbit.Rod Downey & Leo Harrington - 1996 - Annals of Pure and Applied Logic 80 (3):277-289.
    We give a proof of a theorem of Harrington that there is no orbit of the lattice of recursively enumerable sets containing elements of each nonzero recursively enumerable degree. We also establish some degree theoretical extensions.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  12. On σ1 well-orderings of the universe.Leo Harrington & Thomas Jech - 1976 - Journal of Symbolic Logic 41 (1):167-170.
  13.  17
    Trivial pursuit: Remarks on the main gap.John T. Baldwin & Leo Harrington - 1987 - Annals of Pure and Applied Logic 34 (3):209-230.
  14.  14
    On characterizing Spector classes.Leo A. Harrington & Alexander S. Kechris - 1975 - Journal of Symbolic Logic 40 (1):19-24.
  15.  9
    On $Sigma_1$ Well-Orderings of the Universe.Leo Harrington & Thomas Jech - 1976 - Journal of Symbolic Logic 41 (1):167-170.
  16.  60
    Analytic determinacy and 0#. [REVIEW]Leo Harrington - 1978 - Journal of Symbolic Logic 43 (4):685 - 693.
  17.  18
    Meeting of the association for symbolic logic: Reno, 1976.Solomon Feferman, Jon Barwise & Leo Harrington - 1977 - Journal of Symbolic Logic 42 (1):156-160.
  18.  54
    On the definability of the double jump in the computably enumerable sets.Peter A. Cholak & Leo A. Harrington - 2002 - Journal of Mathematical Logic 2 (02):261-296.
    We show that the double jump is definable in the computably enumerable sets. Our main result is as follows: let [Formula: see text] is the Turing degree of a [Formula: see text] set J ≥T0″}. Let [Formula: see text] such that [Formula: see text] is upward closed in [Formula: see text]. Then there is an ℒ property [Formula: see text] such that [Formula: see text] if and only if there is an A where A ≡T F and [Formula: see text]. (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  19.  46
    Definable encodings in the computably enumerable sets.Peter A. Cholak & Leo A. Harrington - 2000 - Bulletin of Symbolic Logic 6 (2):185-196.
    The purpose of this communication is to announce some recent results on the computably enumerable sets. There are two disjoint sets of results; the first involves invariant classes and the second involves automorphisms of the computably enumerable sets. What these results have in common is that the guts of the proofs of these theorems uses a new form of definable coding for the computably enumerable sets.We will work in the structure of the computably enumerable sets. The language is just inclusion, (...)
    Direct download (11 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  20.  13
    Corrigendum to “The d.r.e. degrees are not dense” [Ann. Pure Appl. Logic 55 (1991) 125–151].S. Barry Cooper, Leo Harrington, Alistair H. Lachlan, Steffen Lempp & Robert I. Soare - 2017 - Annals of Pure and Applied Logic 168 (12):2164-2165.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  21.  42
    Isomorphisms of splits of computably enumerable sets.Peter A. Cholak & Leo A. Harrington - 2003 - Journal of Symbolic Logic 68 (3):1044-1064.
    We show that if A and $\widehat{A}$ are automorphic via Φ then the structures $S_{R}(A)$ and $S_{R}(\widehat{A})$ are $\Delta_{3}^{0}-isomorphic$ via an isomorphism Ψ induced by Φ. Then we use this result to classify completely the orbits of hhsimple sets.
    Direct download (10 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  22.  35
    Fundamentals of forking.Victor Harnik & Leo Harrington - 1984 - Annals of Pure and Applied Logic 26 (3):245-286.
  23.  17
    Models and Types of Peano's Arithmetic.Haim Gaifman, Julia F. Knight, Fred G. Abramson & Leo A. Harrington - 1983 - Journal of Symbolic Logic 48 (2):484-485.
    Direct download  
     
    Export citation  
     
    Bookmark   5 citations  
  24.  63
    The complexity of orbits of computably enumerable sets.Peter A. Cholak, Rodney Downey & Leo A. Harrington - 2008 - Bulletin of Symbolic Logic 14 (1):69 - 87.
    The goal of this paper is to announce there is a single orbit of the c.e. sets with inclusion, ε, such that the question of membership in this orbit is ${\Sigma _1^1 }$ -complete. This result and proof have a number of nice corollaries: the Scott rank of ε is $\omega _1^{{\rm{CK}}}$ + 1; not all orbits are elementarily definable; there is no arithmetic description of all orbits of ε; for all finite α ≥ 9, there is a properly $\Delta (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  25. University of Illinois at Chicago, Chicago, IL, June 1–4, 2003.Gregory Cherlin, Alan Dow, Yuri Gurevich, Leo Harrington, Ulrich Kohlenbach, Phokion Kolaitis, Leonid Levin, Michael Makkai, Ralph McKenzie & Don Pigozzi - 2004 - Bulletin of Symbolic Logic 10 (1).
     
    Export citation  
     
    Bookmark  
  26.  5
    Aristotle's Theology: A Commentary on Book Λ of the Metaphysics (review). [REVIEW]K. W. Harrington - 1974 - Journal of the History of Philosophy 12 (4):523-525.
    In lieu of an abstract, here is a brief excerpt of the content:BOOK REVIEWS 523 Aristotle's Theology: A Commentary on Book A of the Metaphysics. By Leo Elders. (Assen, The Netherlands: Royal VanGorcum Ltd., 1972) In 1961 Leo Elders published a book under the title Aristotle's Theory o] the One with the subtitle "A Commentary on Book X of the Metaphysics." Five years later he published Aristotle's Cosmology, subtitled "A Commentary on the De Caelo." Continuing his "commentary " approach to (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  27. Review: Leo Harrington, Recursively Presentable Prime Models; Terrence S. Millar, Foundations of Recursive Model Theory; Terrence S. Millar, A Complete, Decidable Theory with Two Decidable Models. [REVIEW]C. J. Ash - 1984 - Journal of Symbolic Logic 49 (2):671-672.
  28.  67
    Jack H. Silver. Counting the number of equivalence classes of Borel and coanalytic equivalence relations. Annals of mathematical logic, vol. 18 , pp. 1–28. - John P. Burgess. Equivalences generated by families of Borel sets. Proceedings of the American Mathematical Society. vol. 69 , pp. 323–326. - John P. Burgess. A reflection phenomenon in descriptive set theory. Fundamenta mathematicae. vol. 104 , pp. 127–139. - L. Harrington and R. Sami. Equivalence relations, projective and beyond. Logic Colloquium '78, Proceedings of the Colloquium held in Mons, August 1978, edited by Maurice Boffa, Dirk van Dalen, and Kenneth McAloon, Studies in logic and the foundations of mathematics, vol. 97, North-Holland Publishing Company, Amsterdam, New York, and Oxford, 1979, pp. 247–264. - Leo Harrington and Saharon Shelah. Counting equivalence classes for co-κ-Souslin equivalence relations. Logic Colloquium '80, Papers intended for the European summer meeting of the Association for Symbolic Logic, edit. [REVIEW]Alain Louveau - 1987 - Journal of Symbolic Logic 52 (3):869-870.
  29.  56
    Computability, enumerability, unsolvability, Directions in recursion theory, edited by S. B. Cooper, T. A. Slaman, and S. S. Wainer, London Mathematical Society lecture note series, no. 224, Cambridge University Press, Cambridge, New York, and Oakleigh, Victoria, 1996, vii + 347 pp. - Leo Harrington and Robert I. Soare, Dynamic properties of computably enumerable sets, Pp. 105–121. - Eberhard Herrmann, On the ∀∃-theory of the factor lattice by the major subset relation, Pp. 139–166. - Manuel Lerman, Embeddings into the recursively enumerable degrees, Pp. 185–204. - Xiaoding Yi, Extension of embeddings on the recursively enumerable degrees modulo the cappable degrees, Pp. 313–331. - André Nies, Relativization of structures arising from computability theory. Pp. 219–232. - Klaus Ambos-Spies, Resource-bounded genericity. Pp. 1–59. - Rod Downey, Carl G. Jockusch, and Michael Stob. Array nonrecursive degrees and genericity, Pp. 93–104. - Masahiro Kumabe, Degrees of generic sets, Pp. 167–183. [REVIEW]C. T. Chong - 1999 - Journal of Symbolic Logic 64 (3):1362-1365.
  30.  4
    Harrington Leo. Recursively presentable prime models.C. J. Ash - 1984 - Journal of Symbolic Logic 49 (2):671-672.
  31.  24
    Harrington’s conservation theorem redone.Fernando Ferreira & Gilda Ferreira - 2008 - Archive for Mathematical Logic 47 (2):91-100.
    Leo Harrington showed that the second-order theory of arithmetic WKL 0 is ${\Pi^1_1}$ -conservative over the theory RCA 0. Harrington’s proof is model-theoretic, making use of a forcing argument. A purely proof-theoretic proof, avoiding forcing, has been eluding the efforts of researchers. In this short paper, we present a proof of Harrington’s result using a cut-elimination argument.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  32.  44
    Handbook of mathematical logic, edited by Barwise Jon with the cooperation of Keisler H. J., Kunen K., Moschovakis Y. N., and Troelstra A. S., Studies in logic and the foundations of mathematics, vol. 90, North-Holland Publishing Company, Amsterdam, New York, and Oxford, 1978 , xi + 1165 pp.Smoryński C.. D.1. The incompleteness theorems. Pp. 821–865.Schwichtenberg Helmut. D.2. Proof theory: some applications of cut-elimination. Pp. 867–895.Statman Richard. D.3. Herbrand's theorem and Gentzen's notion of a direct proof. Pp. 897–912.Feferman Solomon. D.4. Theories of finite type related to mathematical practice. Pp. 913–971.Troelstra A. S.. D.5. Aspects of constructive mathematics. Pp. 973–1052.Fourman Michael P.. D.6. The logic of topoi. Pp. 1053–1090.Barendregt Henk P.. D.1. The type free lambda calculus. Pp. 1091–1132.Paris Jeff and Harrington Leo. D.8. A mathematical incompleteness in Peano arithmetic. Pp. 1133–1142. [REVIEW]W. A. Howard - 1984 - Journal of Symbolic Logic 49 (3):980-988.
  33.  20
    Maitra A. and Ryll-Nardzewski C.. On the existence of two analytic non-Borel sets which are not isomorphic. Bulletin de L'Académie Polonaise des Sciences, Série des sciences mathematiques, astronomiques et physiques, vol. 18 , pp. 177–178.Mauldin R. Daniel. On nonisomorphic analytic sets. Proceedings of the American Mathematical Society, vol. 58 , pp. 241–244.Hrbacek Karel. On the complexity of analytic sets. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 24 , pp. 419–425.Hrbacek Karel and Simpson Stephen G.. On Kleene degrees of analytic sets. The Kleene Symposium, Proceedings of the symposium held June 18–24, 1978 at Madison, Wisconsin, U.S.A., edited by Barwise Jon, Keisler H. Jerome, and Kunen Kenneth, Studies in logic and the foundations of mathematics, vol. 101, North-Holland Publishing Company, Amsterdam, New York, and Oxford, 1980, pp. 347–352.Harrington Leo. Analytic determinacy and 0#. [REVIEW]Jacques Stern - 1984 - Journal of Symbolic Logic 49 (2):665-668.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  34.  18
    Haim Gaifman. Models and types of Peano's arithmetic. Annals of mathematical logic, vol. 9, pp. 223–306. - Julia F. Knight. Omitting types in set theory and arithmetic. The journal of symbolic logic, vol. 41 , pp. 25–32. - Julia F. Knight. Hanf numbers for omitting types over particular theories. The journal of symbolic logic, vol. 41 , pp. 583–588. - Fred G. Abramson and Leo A. Harrington. Models without indiscernibles. The journal of symbolic logic, vol. 41 , vol. 43 , pp. 572–600. [REVIEW]J. P. Ressayre - 1983 - Journal of Symbolic Logic 48 (2):484-485.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  35.  23
    Soare Robert I.. Automorphisms of the lattice of recursively enumerable sets. Part I: maximal sets. Annals of mathematics, ser. 2 vol. 100 , pp. 80–120. - Lerman Manuel and Soare Robert I.. d-Simple sets, small sets, and degree classes. Pacific journal of mathematics, vol. 87 , pp. 135–155. - Cholak Peter. Automorphisms of the lattice of recursively enumerable sets. Memoirs of the American Mathematical Society, no. 541. American Mathematical Society, Providence1995, viii + 151 pp. - Harrington Leo and Soare Robert I.. The Δ30-automorphism method and noninvariant classes of degrees. Journal of the American Mathematical Society, vol. 9 , pp. 617–666. [REVIEW]Rod Downey - 1997 - Journal of Symbolic Logic 62 (3):1048-1055.
  36.  5
    The political writings of James Harrington: representative selections.James Harrington - 1980 - Westport, Conn.: Greenwood Press. Edited by Charles Blitzer.
    Excerpt from The Political Writings of James Harrington: Representative Selections Finally, I should like to express my deep gratitude to three scholars who have generously helped me in the preparation of this volume: Carl J. Friedrich, of Harvard University, under whose kind and expert guidance I first undertook the study of James Harrington's political thought; Cecil Driver, of Yale University, who tried (with scant success, I fear) to give my prose style something of the grace and elegance that (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  37.  3
    Towards a rhetoric of medical law.John Harrington - 2017 - New York, NY: Routledge.
    Rhetoric -- Paradox -- Space -- Time -- Utopia -- Progress -- Art -- Ethics.
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  38.  24
    An exposition of Shelah's "main gap": counting uncountable models of $\omega$-stable and superstable theories.L. Harrington & M. Makkai - 1985 - Notre Dame Journal of Formal Logic 26 (2):139-177.
  39. Eriugena and the Neoplatonic tradition.Michael Harrington - 2019 - In Adrian Guiu (ed.), A companion to John Scottus Eriugena. Boston: Brill.
    No categories
     
    Export citation  
     
    Bookmark  
  40.  3
    Hermeneutic dialogue and social science: a critique of Gadamer and Habermas.Austin Harrington - 2001 - New York: Routledge.
    By re-examining the writings of Gadamer and Habermas and their views of earlier interpretive theorists, this book offers a radical challenge to their idea of the 'dialogue' between researchers and their subjects.
    Direct download  
     
    Export citation  
     
    Bookmark  
  41.  3
    Time: a philosophical introduction.James Harrington - 2015 - New York: Bloomsbury Academic.
    Time: A Philosophical Introduction presents the philosophy of time as the central debate between being and the becoming.This core theme brings together the key topics, debates and thinkers, making ideas such as Zeno's paradoxes, the experience of change and temporal flow and the direction and shape of time and time travel, clear and understandable. Alongside a glossary and detailed timeline to further enhance study and understanding, each chapter features: • Extensive lists of further reading in both primary and secondary sources (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  42.  1
    The problem of human suffering looked at from the standpoint of a Christian.Vernon Charles Harrington - 1899 - [Burlington, Vt.,: The Lane press. Edited by Harrington & [From Old Catalog].
    Direct download  
     
    Export citation  
     
    Bookmark  
  43. Veŕité et méthode dans les "Pensées" de Pascal.Thomas More Harrington - 1972 - Paris,: J. Vrin.
     
    Export citation  
     
    Bookmark  
  44. The political philosophy of Hobbes, its basis and its genesis.Leo Strauss - 1952 - [Chicago]: University of Chicago Press.
    In this classic analysis, Leo Strauss pinpoints what is original and innovative in the political philosophy of Thomas Hobbes.
  45.  13
    51. Taking Sides: The Education of a Militant Mind.Michael Harrington - 2014 - In Bernard Williams (ed.), Essays and Reviews: 1959-2002. Princeton: Princeton University Press. pp. 252-256.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  46. Discursive Injustice and the Speech of Indigenous Communities.Leo Townsend - 2021 - In Preston Stovall, Leo Townsend & Hans Bernhard Schmid (eds.), The Social Institution of Discursive Norms. Routledge. pp. 248-263.
    Recent feminist philosophy of language has highlighted the ways that the speech of women can be unjustly impeded, because of the way their gender affects the uptake their speech receives. In this chapter, I explore how similar processes can undermine the speech of a different sort of speaker: Indigenous communities. This involves focusing on Indigeneity rather than gender as the salient social identity, and looking at the ways that group speech, rather than only individual speech, can be unjustly impeded. To (...)
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  47. The Philosophy of Fanaticism: Epistemic, Affective, and Political Dimensions.Leo Townsend, Ruth Rebecca Tietjen, Michael Staudigl & Hans Bernard Schmid (eds.) - 2022 - London: Routledge.
  48.  10
    Leo Strauss on political philosophy: responding to the challenge of positivism and historicism.Leo Strauss - 2018 - London: University of Chicago Press. Edited by Catherine H. Zuckert, Les Harris & Philip Bretton.
    Leo Strauss is known primarily for reviving classical political philosophy through careful analyses of works by ancient thinkers. As with his published writings, Strauss’s seminars devoted to specific philosophers were notoriously dense, accessible only to graduate students and scholars with a good command of the subject. In 1965, however, Strauss offered an introductory course on political philosophy at the University of Chicago. Using a conversational style, he sought to make political philosophy, as well as his own ideas and methods, understandable (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  49.  11
    Leo Strauss on Nietzsche's Thus spoke Zarathustra.Leo Strauss - 2017 - Chicago: University of Chicago Press. Edited by Richard L. Velkley.
    The Leo Strauss transcript project -- Editor's introduction: Strauss, Nietzsche, and the history of political philosophy -- Editorial headnote -- Introduction: Nietzsche's philosophy, existentialism, and the problem of our age -- Restoring nature as ethical principle: Zarathustra, prologue -- The creative self: Zarathustra, part 1, 1-8 -- The true individual as the highest goal: Zarathustra, part 1, 9-15 -- Postulated nature and final truth: Zarathustra, part 1, 16-22 -- Truth, interpretation, and intelligibility: Zarathustra, part 2, 1-12 -- Will to power (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  50.  5
    Book Review: Nuclear Realism: Global Political Thought during the Thermonuclear Revolution. [REVIEW]Anne I. Harrington - 2019 - Thesis Eleven 153 (1):145-149.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   9 citations  
1 — 50 / 1000