Results for 'Cholak, P.'

(not author) ( search as author name )
998 found
Order:
  1.  17
    Automorphisms of the lattice of recursively enumerable sets.Peter Cholak - 1995 - Providence, RI: American Mathematical Society.
    Chapter 1: Introduction. S = <{We}c<w; C,U,n,0,w> is the substructure formed by restricting the lattice <^P(w); C , U, n,0,w> to the re subsets We of the ...
    Direct download  
     
    Export citation  
     
    Bookmark   12 citations  
  2. Bosch, R., see Bagaria, J. Cholak, P., see Ash, CJ.U. Engberg, G. Winskel, S. Ghilardi, G. Meloni, P. Matet, D. Skvortsov, S. van Bakel, L. Liquori, S. Ronchi Della Rocca & P. Urzyczyn - 1997 - Annals of Pure and Applied Logic 86:305.
     
    Export citation  
     
    Bookmark   1 citation  
  3.  63
    Uniform Almost Everywhere Domination.Peter Cholak, Noam Greenberg & Joseph S. Miller - 2006 - Journal of Symbolic Logic 71 (3):1057 - 1072.
    We explore the interaction between Lebesgue measure and dominating functions. We show, via both a priority construction and a forcing construction, that there is a function of incomplete degree that dominates almost all degrees. This answers a question of Dobrinen and Simpson, who showed that such functions are related to the proof-theoretic strength of the regularity of Lebesgue measure for Gδ sets. Our constructions essentially settle the reverse mathematical classification of this principle.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  4. On the strength of Ramsey's theorem for pairs.Peter A. Cholak, Carl G. Jockusch & Theodore A. Slaman - 2001 - Journal of Symbolic Logic 66 (1):1-55.
    We study the proof-theoretic strength and effective content of the infinite form of Ramsey's theorem for pairs. Let RT n k denote Ramsey's theorem for k-colorings of n-element sets, and let RT $^n_{ denote (∀ k)RT n k . Our main result on computability is: For any n ≥ 2 and any computable (recursive) k-coloring of the n-element sets of natural numbers, there is an infinite homogeneous set X with X'' ≤ T 0 (n) . Let IΣ n and BΣ (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   55 citations  
  5.  72
    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  
  6.  20
    Introduction to the Special Issue on Vaught's Conjecture.Peter Cholak - 2007 - Notre Dame Journal of Formal Logic 48 (1):1-2.
  7.  60
    Computably categorical structures and expansions by constants.Peter Cholak, Sergey Goncharov, Bakhadyr Khoussainov & Richard A. Shore - 1999 - Journal of Symbolic Logic 64 (1):13-37.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   18 citations  
  8.  35
    Reverse mathematics and the equivalence of definitions for well and better quasi-orders.Peter Cholak, Alberto Marcone & Reed Solomon - 2004 - Journal of Symbolic Logic 69 (3):683-712.
  9. Filosofskie problemy teorii ti︠a︡gotenii︠a︡ Ėĭnshteĭna.P. S. Dyshlevyĭ, Petrov, Aleskeĭ Zinovʹevich & [From Old Catalog] (eds.) - 1965
     
    Export citation  
     
    Bookmark  
  10.  65
    An almost deep degree.Peter Cholak, Marcia Groszek & Theodore Slaman - 2001 - Journal of Symbolic Logic 66 (2):881-901.
    We show there is a non-recursive r.e. set A such that if W is any low r.e. set, then the join W $\oplus$ A is also low. That is, A is "almost deep". This answers a question of Jockusch. The almost deep degrees form an definable ideal in the r.e. degrees (with jump.).
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  11.  55
    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  
  12.  16
    On Mathias generic sets.Peter A. Cholak, Damir D. Dzhafarov & Jeffry L. Hirst - 2012 - In S. Barry Cooper (ed.), How the World Computes. pp. 129--138.
  13.  12
    Corrigendum to: “On the strength of Ramsey's Theorem for pairs”.Peter Cholak, Jr} {Jockusch & Theodore A. Slaman - 2009 - Journal of Symbolic Logic 74 (4):1438-1439.
  14.  41
    On the Cantor-bendixon rank of recursively enumerable sets.Peter Cholak & Rod Downey - 1993 - Journal of Symbolic Logic 58 (2):629-640.
    The main result of this paper is to show that for every recursive ordinal α ≠ 0 and for every nonrecursive r.e. degree d there is a r.e. set of rank α and degree d.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  15.  48
    The translation theorem.Peter Cholak - 1994 - Archive for Mathematical Logic 33 (2):87-108.
    We state and prove the Translation Theorem. Then we apply the Translation Theorem to Soare's Extension Theorem, weakening slightly the hypothesis to yield a theorem we call the Modified Extension Theorem. We use this theorem to reprove several of the known results about orbits in the lattice of recursively enumerable sets. It is hoped that these proofs are easier to understand than the old proofs.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  16.  36
    Some orbits for E.Peter Cholak, Rod Downey & Eberhard Herrmann - 2001 - Annals of Pure and Applied Logic 107 (1-3):193-226.
    In this article we establish the existence of a number of new orbits in the automorphism group of the computably enumerable sets. The degree theoretical aspects of these orbits also are examined.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  17.  64
    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  
  18.  19
    Lattice nonembeddings and intervals of the recursively enumerable degrees.Peter Cholak & Rod Downey - 1993 - Annals of Pure and Applied Logic 61 (3):195-221.
    Let b and c be r.e. Turing degrees such that b>c. We show that there is an r.e. degree a such that b>a>c and all lattices containing a critical triple, including the lattice M5, cannot be embedded into the interval [c, a].
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  19.  39
    Boolean algebras and orbits of the lattice of R.e. Sets modulo the finite sets.Peter Cholak - 1990 - Journal of Symbolic Logic 55 (2):744-760.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark  
  20.  14
    On n -tardy sets.Peter A. Cholak, Peter M. Gerdes & Karen Lange - 2012 - Annals of Pure and Applied Logic 163 (9):1252-1270.
  21.  27
    Reverse mathematics and infinite traceable graphs.Peter Cholak, David Galvin & Reed Solomon - 2012 - Mathematical Logic Quarterly 58 (1-2):18-28.
    We analyze three applications of Ramsey’s Theorem for 4-tuples to infinite traceable graphs and finitely generated infinite lattices using the tools of reverse mathematics. The applications in graph theory are shown to be equivalent to Ramsey’s Theorem while the application in lattice theory is shown to be provable in the weaker system RCA0.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  22. A computably stable structure with no Scott family of finitary formulas.Peter Cholak, Richard A. Shore & Reed Solomon - 2006 - Archive for Mathematical Logic 45 (5):519-538.
  23.  68
    Iterated relative recursive enumerability.Peter A. Cholak & Peter G. Hinman - 1994 - Archive for Mathematical Logic 33 (5):321-346.
    A result of Soare and Stob asserts that for any non-recursive r.e. setC, there exists a r.e.[C] setA such thatA⊕C is not of r.e. degree. A setY is called [of]m-REA (m-REA[C] [degree] iff it is [Turing equivalent to] the result of applyingm-many iterated ‘hops’ to the empty set (toC), where a hop is any function of the formX→X ⊕W e X . The cited result is the special casem=0,n=1 of our Theorem. Form=0,1, and any (m+1)-REA setC, ifC is not ofm-REA (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  24.  22
    ${\Cal d}$-maximal sets.Peter A. Cholak, Peter Gerdes & Karen Lange - 2015 - Journal of Symbolic Logic 80 (4):1182-1210.
    Soare [20] proved that the maximal sets form an orbit in${\cal E}$. We consider here${\cal D}$-maximal sets, generalizations of maximal sets introduced by Herrmann and Kummer [12]. Some orbits of${\cal D}$-maximal sets are well understood, e.g., hemimaximal sets [8], but many are not. The goal of this paper is to define new invariants on computably enumerable sets and to use them to give a complete nontrivial classification of the${\cal D}$-maximal sets. Although these invariants help us to better understand the${\cal D}$-maximal (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  25.  46
    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  
  26.  55
    Maximal contiguous degrees.Peter Cholak, Rod Downey & Stephen Walk - 2002 - Journal of Symbolic Logic 67 (1):409-437.
    A computably enumerable (c.e.) degree is a maximal contiguous degree if it is contiguous and no c.e. degree strictly above it is contiguous. We show that there are infinitely many maximal contiguous degrees. Since the contiguous degrees are definable, the class of maximal contiguous degrees provides the first example of a definable infinite anti-chain in the c.e. degrees. In addition, we show that the class of maximal contiguous degrees forms an automorphism base for the c.e. degrees and therefore for the (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  27.  21
    -Maximal sets.Peter A. Cholak, Peter Gerdes & Karen Lange - 2015 - Journal of Symbolic Logic 80 (4):1182-1210.
    Soare [20] proved that the maximal sets form an orbit in${\cal E}$. We consider here${\cal D}$-maximal sets, generalizations of maximal sets introduced by Herrmann and Kummer [12]. Some orbits of${\cal D}$-maximal sets are well understood, e.g., hemimaximal sets [8], but many are not. The goal of this paper is to define new invariants on computably enumerable sets and to use them to give a complete nontrivial classification of the${\cal D}$-maximal sets. Although these invariants help us to better understand the${\cal D}$-maximal (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  28.  43
    The dense simple sets are orbit complete with respect to the simple sets.Peter Cholak - 1998 - Annals of Pure and Applied Logic 94 (1-3):37-44.
    We prove conjectures of Herrmann and Stob by showing that the dense simple sets are orbit complete w.r.t. the simple sets.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  29.  67
    Introduction to philosophy: classical and contemporary readings.Louis P. Pojman & James Fieser (eds.) - 2004 - New York: Oxford University Press.
    Now in a third edition, Introduction to Philosophy: Classical and Contemporary Readings is a highly acclaimed, topically organized collection that covers five major areas of philosophy--theory of knowledge, philosophy of religion, philosophy of mind, freedom and determinism, and moral philosophy. Editor Louis P. Pojman enhances the text's topical organization by arranging the selections into a pro/con format to help students better understand opposing arguments. He also includes accessible introductions to each chapter, subsection, and individual reading, a unique feature for an (...)
    Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  30.  61
    Skepticism.P. Klein - 2002 - In Paul K. Moser (ed.), The Oxford handbook of epistemology. New York: Oxford University Press.
    In ”Skepticism,” Peter Klein distinguishes between the “Academic Skeptic” who proposes that we cannot have knowledge of a certain set of propositions and the “Pyrrhonian Skeptic” who refrains from opining about whether we can have knowledge. Klein argues that Academic Skepticism is plausibly supported by a “Closure Principle‐style” argument based on the claim that if x entails y and S has justification for x, then S has justification for y. He turns to contextualism to see if it can contribute to (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   35 citations  
  31.  2
    Kontinualistika: (poznanie vseobshcheĭ svi︠a︡zi): monografi︠a︡.A. P. Svitin - 2004 - Krasnoi︠a︡rsk: BGU.
  32.  28
    Akademische Vorträge, von T. von Döllinger. Erster Band. Nordlingen. Beck, 1888. pp. iv. 427. Mk. 7.50.P. A. - 1889 - The Classical Review 3 (05):215-.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  33. World Medical Association, Medical ethics manual.P. Momoh - 1988 - In Ian E. Thompson, Kath M. Melia & Kenneth M. Boyd (eds.), Nursing ethics. New York: Churchill Livingstone Elsevier. pp. 13--6.
     
    Export citation  
     
    Bookmark   1 citation  
  34.  8
    Scepticism and Naturalism: Some Varieties.P. F. Strawson - 1985 - New York: Routledge.
    First published in 1987. Routledge is an imprint of Taylor & Francis, an informa company.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   118 citations  
  35.  98
    Scepticism and naturalism: some varieties.P. F. Strawson - 1985 - New York: Routledge.
    First published in 1987. Routledge is an imprint of Taylor & Francis, an informa company.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   86 citations  
  36.  11
    Review: Stephen G. Simpson, Subsystems of Second Order Arithmetic. [REVIEW]Peter Cholak - 1999 - Journal of Symbolic Logic 64 (3):1356-1357.
  37.  72
    Engineering, ethics, and the environment.P. Aarne Vesilind - 1998 - New York: Cambridge University Press. Edited by Alastair S. Gunn.
    Engineering is 'the people-serving profession'. The work of engineers involves interaction with clients, other engineers, and the public at large. More than any other profession, their work also directly involves and affects the environment. This book makes the case that engineers have special professional obligations to protect and enhance the environment, and the authors - one, an engineer and the other, a philosopher - seek to provide an ethical basis for these obligations. In exploring these ethical issues, the authors aim (...)
    Direct download  
     
    Export citation  
     
    Bookmark   13 citations  
  38. Finite Exchangeable Sequences.P. Diaconis & D. Freedman - 1980 - The Annals of Probability 8:745--64.
     
    Export citation  
     
    Bookmark   13 citations  
  39.  42
    Philosophy in Africa: trends and perspectives.P. O. Bodunrin (ed.) - 1985 - Ile-Ife, Nigeria: University of Ife Press.
  40. Gordon Baker's late interpretation of Wittgenstein.P. M. S. Hacker - 2007 - In Guy Kahane, Edward Kanterian & Oskari Kuusela (eds.), Wittgenstein and His Interpreters: Essays in Memory of Gordon Baker. Oxford: Wiley-Blackwell. pp. 88--122.
    Gordon Baker and I had been colleagues at St John’s for almost ten years when we resolved, in 1976, to undertake the task of writing a commentary on Wittgenstein’s Philosophical Investigations. We had been talking about Wittgenstein since 1969, and when we cooperated in writing a long critical notice on the Philosophical Grammar in 1975, we found that working together was mutually instructive, intellectually stimulating and great fun. We thought that we still had much to say about Wittgenstein’s philosophy, and (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  41. Personalization 2.0? – Testing the personalization hypothesis in citizens’, journalists’, and politicians’ campaign Twitter communication. [REVIEW]Lukas P. Otto, Isabella Glogger & Michaela Maier - 2019 - Communications 44 (4):359-381.
    This paper advances the research on personalization of political communication by investigating whether this process of focusing on politicians instead of political issues plays a role on Twitter. Results of a content analysis of 5,530 tweets posted in the run-up to the German federal election provide evidence that Twitter communication refers more often to politicians than to issues. However, tweets containing personal characteristics about political leaders play only a marginal role. When distinguishing among different groups of actors on Twitter (journalists, (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  42.  26
    Stephen G. Simpson. Subsystems of second order arithmetic. Perspectives in mathematical logic. Springer, Berlin, Heidelberg, New York, etc., 1999, xiv + 445 pp. [REVIEW]Peter Cholak - 1999 - Journal of Symbolic Logic 64 (3):1356-1357.
  43.  99
    Wittgenstein, meaning and mind.P. M. S. Hacker (ed.) - 1990 - Cambridge, Mass., USA: Blackwell.
    ... 243-) INTRODUCTION §§243- constitute the eighth 'chapter' of the book. Its point of departure is a natural query with respect to the conclusion of the ...
    Direct download  
     
    Export citation  
     
    Bookmark   60 citations  
  44. Popular Music and Art-interpretive Injustice.P. D. Magnus & Evan Malone - forthcoming - Inquiry: An Interdisciplinary Journal of Philosophy.
    It has been over two decades since Miranda Fricker labeled epistemic injustice, in which an agent is wronged in their capacity as a knower. The philosophical literature has proliferated with variants and related concepts. By considering cases in popular music, we argue that it is worth distinguishing a parallel phenomenon of art-interpretive injustice, in which an agent is wronged in their creative capacity as a possible artist. In section 1, we consider the prosecutorial use of rap lyrics in court as (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  45.  3
    Metaphysics.P. M. S. Hacker - 2017 - In Hans-Johann Glock & John Hyman (eds.), A Companion to Wittgenstein. Chichester, West Sussex, UK: Wiley-Blackwell. pp. 209–227.
    Throughout its long history metaphysics has been variously conceived. At its most sublime, it has been taken to be the study of the super‐sensible, in particular of the existence of a god, the nature of the soul, and the possibility of an afterlife. When the young Ludwig Wittgenstein entered the lists, it was entirely reasonable to conceive of metaphysics in this manner. Its subject matter was held to be the language‐independent and thought‐independent de re necessities of the world. The Tractatus (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  46.  25
    It is Not Too Late for Reconciliation Between Israel and Palestine, Even in the Darkest Hour.P. A. Komesaroff - 2024 - Journal of Bioethical Inquiry 21 (1):29-45.
    The conflict in Gaza and Israel that ignited on October 7, 2023 signals a catastrophic breakdown in the possibility of ethical dialogue in the region. The actions on both sides have revealed a dissolution of ethical restraints, with unimaginably cruel attacks on civilians, murder of children, destruction of health facilities, and denial of basic needs such as water, food, and shelter. There is a need both to understand the nature of the ethical singularity represented by this conflict and what, if (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  47.  94
    Notes on logic and set theory.P. T. Johnstone - 1987 - New York: Cambridge University Press.
    A succinct introduction to mathematical logic and set theory, which together form the foundations for the rigorous development of mathematics. Suitable for all introductory mathematics undergraduates, Notes on Logic and Set Theory covers the basic concepts of logic: first-order logic, consistency, and the completeness theorem, before introducing the reader to the fundamentals of axiomatic set theory. Successive chapters examine the recursive functions, the axiom of choice, ordinal and cardinal arithmetic, and the incompleteness theorems. Dr. Johnstone has included numerous exercises designed (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  48.  53
    Scepticism and Naturalism: Some Varieties.P. F. Strawson - 1985 - New York: Routledge.
    By the time of his death in 2006, Sir Peter Strawson was regarded as one of the world's most distinguished philosophers. Unavailable for many years,_ Scepticism and Naturalism_ is a profound reflection on two classic philosophical problems by a philosopher at the pinnacle of his career. Based on his acclaimed Woodbridge lectures delivered at Columbia University in 1983, Strawson begins with a discussion of scepticism, which he defines as questioning the adequacy of our grounds for holding various beliefs. He then (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   18 citations  
  49.  43
    BAB 1: RENCANA YANG SEMPURNA.Quan-Hoang Vuong & Sari N. P. W. P. - 2024 - The Kingfisher Story Collection (Indonesian Translation). Translated by Ni Putu Wulan Purnama Sari.
    Pekakak adalah salah satu tokoh yang memiliki pengetahuan mendalam dan perencanaan yang cermat. Saat fajar menyingsing, ia terlihat bertengger di atas pohon. Dengan kemampuan sempurna untuk mengontrol kecepatan penerbangan miliknya, seperti kapan harus memperlambat atau mempercepat, dia dapat dengan mudah menghitung cara optimal untuk menangkap ikan.
    Direct download  
     
    Export citation  
     
    Bookmark  
  50.  53
    What is the Matter with Matter? Barad, Butler, and Adorno.P. Højme - 2024 - Matter: Journal of New Materialist Research 9.
    This article aims to read feminist new materialisms (Barad), together with ‘postulated’ linguistic or cultural primacy of Queer Theory (Butler), to show how both are engaged in similar critical-ethical endeavours. The central argument is that the criticism of Barad and new materialisms misses Butler’s materialistic insights due to a narrow interpretation of Butler's alleged social-constructivist position. There is, therefore, a specific focus on where they both make similar ethical appeals. Moreover, the article relies on Adorno's negative dialectic to highlight an (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
1 — 50 / 998