Results for 'Peter Cholak'

(not author) ( search as author name )
979 found
Order:
  1.  57
    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  
  2. 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   54 citations  
  3.  16
    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  
  4.  58
    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  
  5.  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  
  6.  33
    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.
  7.  17
    Introduction to the Special Issue on Vaught's Conjecture.Peter Cholak - 2007 - Notre Dame Journal of Formal Logic 48 (1):1-2.
  8.  57
    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  
  9.  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  
  10.  35
    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  
  11.  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  
  12.  35
    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  
  13.  44
    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  
  14.  18
    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  
  15. 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.
  16.  63
    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  
  17.  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.
  18.  38
    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  
  19.  15
    ${\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  
  20.  10
    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.
  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.  45
    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  
  23.  17
    -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  
  24.  11
    On n -tardy sets.Peter A. Cholak, Peter M. Gerdes & Karen Lange - 2012 - Annals of Pure and Applied Logic 163 (9):1252-1270.
  25.  22
    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  
  26.  37
    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  
  27.  8
    Review: Stephen G. Simpson, Subsystems of Second Order Arithmetic. [REVIEW]Peter Cholak - 1999 - Journal of Symbolic Logic 64 (3):1356-1357.
  28.  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.
  29.  15
    Participants and titles of lectures.Klaus Ambos-Spies, Marat Arslanov, Douglas Cenzer, Peter Cholak, Chi Tat Chong, Decheng Ding, Rod Downey, Peter A. Fejer, Sergei S. Goncharov & Edward R. Griffor - 1998 - Annals of Pure and Applied Logic 94 (1):3-6.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  30.  21
    The Notre Dame Lectures, edited by Peter Cholak, Lecture Notes in Logic, vol. 18. Association for Symbolic Logic, A K Peters, Ltd., Wellesley, Massachusetts, 2005, vii + 185 pp. [REVIEW]Roman Kossak - 2006 - Bulletin of Symbolic Logic 12 (4):605-607.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  31.  94
    S. S. Goncharov. Autostability and computable families of constructivizations. Algebra and Logic, vol. 14 , no. 6, pp. 392–409. - S. S. Goncharov. The quantity of nonautoequivalent constructivizations. Algebra and Logic, vol. 16 , no. 3, pp. 169–185. - S. S. Goncharov and V. D. Dzgoev. Autostability of models. Algebra and Logic, vol. 19 , no. 1, pp. 28–37. - J. B. Remmel. Recursively categorical linear orderings. Proceedings of the American Mathematical Society, vol. 83 , no. 2, pp. 387–391. - Terrence Millar. Recursive categoricity and persistence. The Journal of Symbolic Logic, vol. 51 , no. 2, pp. 430–434. - Peter Cholak, Segey Goncharov, Bakhadyr Khoussainov and Richard A. Shore. Computably categorical structures and expansions by constants. The Journal of Symbolic Logic, vol. 64 , no. 1, pp. 13–137. - Peter Cholak, Richard A. Shore and Reed Solomon. A computably stable structure with no Scott family of finitary formulas. Archive for Mathematical Logic, vol. 45 , no. 5, pp. 519–538. [REVIEW]Daniel Turetsky - 2012 - Bulletin of Symbolic Logic 18 (1):131-134.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  32.  4
    S. S. Goncharov. Autostability and computable families of constructivizations. Algebra and Logic, vol. 14 (1975), no. 6, pp. 392–409. - S. S. Goncharov. The quantity of nonautoequivalent constructivizations. Algebra and Logic, vol. 16 (1977), no. 3, pp. 169–185. - S. S. Goncharov and V. D. Dzgoev. Autostability of models. Algebra and Logic, vol. 19 (1980), no. 1, pp. 28–37. - J. B. Remmel. Recursively categorical linear orderings. Proceedings of the American Mathematical Society, vol. 83 (1981), no. 2, pp. 387–391. - Terrence Millar. Recursive categoricity and persistence. The Journal of Symbolic Logic, vol. 51 (1986), no. 2, pp. 430–434. - Peter Cholak, Segey Goncharov, Bakhadyr Khoussainov and Richard A. Shore. Computably categorical structures and expansions by constants. The Journal of Symbolic Logic, vol. 64 (1999), no. 1, pp. 13–137. - Peter Cholak, Richard A. Shore and Reed Solomon. A computably stable structure with no Scott family of finitary formulas. Archive for Mathematical. [REVIEW]Daniel Turetsky - 2012 - Bulletin of Symbolic Logic 18 (1):131-134.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  33.  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.
  34. Famine, affluence, and morality.Peter Singer - 1972 - Philosophy and Public Affairs 1 (3):229-243.
    As I write this, in November 1971, people are dying in East Bengal from lack of food, shelter, and medical caxc. The suffering and death that are occurring there now axe not inevitable, 1101; unavoidable in any fatalistic sense of the term. Constant poverty, a cyclone, and a civil war have turned at least nine million people into destitute refugees; nevertheless, it is not beyond Lhe capacity of the richer nations to give enough assistance to reduce any further suffering to (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1073 citations  
  35. Basic questions.Peter Carruthers - 2018 - Mind and Language 33 (2):130-147.
    This paper argues that a set of questioning attitudes are among the foundations of human and animal minds. While both verbal questioning and states of curiosity are generally explained in terms of metacognitive desires for knowledge or true belief, I argue that each is better explained by a prelinguistic sui generis type of mental attitude of questioning. I review a range of considerations in support of such a proposal and improve on previous characterizations of the nature of these attitudes. I (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   35 citations  
  36.  46
    Animal liberation: the definitive classic of the animal movement.Peter Singer - 2009 - New York: Ecco Book/Harper Perennial.
    Since its original publication in 1975, this groundbreaking work has awakened millions of people to the existence of "speciesism"—our systematic disregard of nonhuman animals—inspiring a worldwide movement to transform our attitudes to animals and eliminate the cruelty we inflict on them. In Animal Liberation, author Peter Singer exposes the chilling realities of today’s "factory farms" and product-testing procedures—destroying the spurious justifications behind them, and offering alternatives to what has become a profound environmental and social as well as moral issue. (...)
    Direct download  
     
    Export citation  
     
    Bookmark   67 citations  
  37. Questions, topics and restricted closure.Peter Hawke - 2016 - Philosophical Studies 173 (10):2759-2784.
    Single-premise epistemic closure is the principle that: if one is in an evidential position to know that P where P entails Q, then one is in an evidential position to know that Q. In this paper, I defend the viability of opposition to closure. A key task for such an opponent is to precisely formulate a restricted closure principle that remains true to the motivations for abandoning unrestricted closure but does not endorse particularly egregious instances of closure violation. I focus (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   21 citations  
  38.  16
    Permitting, forcing, and copying of a given recursive relation.C. J. Ash, P. Cholak & J. F. Knight - 1997 - Annals of Pure and Applied Logic 86 (3):219-236.
  39. Imagining as a Guide to Possibility.Peter Kung - 2010 - Philosophy and Phenomenological Research 81 (3):620-663.
    I lay out the framework for my theory of sensory imagination in “Imagining as a guide to possibility.” Sensory imagining involves mental imagery , and crucially, in describing the content of imagining, I distinguish between qualitative content and assigned content. Qualitative content derives from the mental image itself; for visual imaginings, it is what is “pictured.” For example, visually imagine the Philadelphia Eagles defeating the Pittsburgh Steelers to win their first Super Bowl. You picture the greenness of the field and (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   106 citations  
  40.  24
    The Grounds of Political Legitimacy.Fabienne Peter - 2023 - Oxford, GB: Oxford University Press.
    Political decisions have the potential to greatly impact our lives. Think of decisions in relation to abortion or climate change, for example. This makes political legitimacy an important normative concern. But what makes political decisions legitimate? Are they legitimate in virtue of having support from the citizens? Democratic conceptions of political legitimacy answer in the affirmative. Such conceptions righly highlight that legitimate political decision-making must be sensitive to disagreements among the citizens. But what if democratic decisions fail to track what (...)
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  41.  58
    Searching for True Dogmatism.Peter J. Markie - 2013 - In Chris Tucker (ed.), Seemings and Justification: New Essays on Dogmatism and Phenomenal Conservatism. New York: Oxford University Press USA. pp. 248.
  42. When does communication succeed? The case of general terms.Peter Pagin - 2020 - In Teresa Marques & Åsa Wikforss (eds.), Shifting Concepts: The Philosophy and Psychology of Conceptual Variability. Oxford: Oxford University Press.
  43. Useful false beliefs.Peter D. Klein - 2008 - In Quentin Smith (ed.), Epistemology: new essays. New York : Oxford University Press,: Oxford University Press. pp. 25--63.
  44. The mystery of direct perceptual justification.Peter Markie - 2005 - Philosophical Studies 126 (3):347-373.
    In at least some cases of justified perceptual belief, our perceptual experience itself, as opposed to beliefs about it, evidences and thereby justifies our belief. While the phenomenon is common, it is also mysterious. There are good reasons to think that perceptions cannot justify beliefs directly, and there is a significant challenge in explaining how they do. After explaining just how direct perceptual justification is mysterious, I considerMichael Huemers (Skepticism and the Veil of Perception, 2001) and Bill Brewers (Perception and (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   74 citations  
  45. Epistemic Normativity and Social Norms.Peter J. Graham - 2015 - In David K. Henderson & John Greco (eds.), Epistemic Evaluation: Purposeful Epistemology. Oxford: Oxford University Press UK. pp. 247-273.
  46.  37
    The political philosophy of the British idealists: selected studies.Peter P. Nicholson - 1990 - New York: Cambridge University Press.
    This book offers a reassessment of the political philosophy of the British Idealists, a group of once influential and now neglected nineteenth-century Hegelian philosophers, whose work has been much misunderstood. Peter Nicholson focuses on F. H. Bradley's idea of morality and moral philosophy; T. H. Green's theory of the Common Good, of the social nature of rights, of freedom, and of state interference; and Bernard Bosanquet's notorious theory of the General Will. By examining the arguments offered by the Idealists (...)
  47.  6
    Happiness, hope, and despair: rethinking the role of education.Peter Roberts - 2016 - New York: Peter Lang.
    In the Western world it is usually taken as given that we all want happiness, and our educational arrangements tacitly acknowledge this. Happiness, Hope, and Despair argues, however, that education has an important role to play in deepening our understanding of suffering and despair as well as happiness and joy. Education can be uncomfortable, unpredictable, and unsettling; it can lead to greater uncertainty and unhappiness. Drawing on the work of Søren Kierkegaard, Miguel de Unamuno, Fyodor Dostoevsky, Simone Weil, Paulo Freire, (...)
    Direct download  
     
    Export citation  
     
    Bookmark   8 citations  
  48.  10
    Schelling's late philosophy in confrontation with Hegel.Peter Dews - 2023 - New York, NY: Oxford University Press.
    This book presents and evaluates the late philosophy (Spätphilosophie) of F. W. J. Schelling (1775-1854) across a wide range of issues, ranging from relation between pure thinking and being, to the philosophy of mythology and religion, to the philosophy of history, to questions concerning the philosophy of nature and freedom. Simultaneously, it discusses Hegel's treatment of similar issues, and systematically compares the two thinkers. This is the first time, in an English-language publication, that these two major German Idealists have been (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  49. Theories of Aboutness.Peter Hawke - 2018 - Australasian Journal of Philosophy 96 (4):697-723.
    Our topic is the theory of topics. My goal is to clarify and evaluate three competing traditions: what I call the way-based approach, the atom-based approach, and the subject-predicate approach. I develop criteria for adequacy using robust linguistic intuitions that feature prominently in the literature. Then I evaluate the extent to which various existing theories satisfy these constraints. I conclude that recent theories due to Parry, Perry, Lewis, and Yablo do not meet the constraints in total. I then introduce the (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   42 citations  
  50. The Innate Mind: Structure and Contents.Peter Carruthers, Stephen Laurence & Stephen P. Stich (eds.) - 2005 - New York, US: Oxford University Press USA.
    This is the first volume of a projected three-volume set on the subject of innateness. The extent to which the mind is innate is one of the central questions in the human sciences, with important implications for many surrounding debates. By bringing together the top nativist scholars in philosophy, psychology, and allied disciplines these volumes provide a comprehensive assessment of nativist thought and a definitive reference point for future nativist inquiry. The Innate Mind: Structure and Content, concerns the fundamental architecture (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   22 citations  
1 — 50 / 979