Results for 'M. Lerman'

980 found
Order:
  1.  11
    R. PETER [1934] Uber den Zussammenhang der verschiedenen Begriffe der rekursiven Funktion, Math. Ann.Sc Kleene, El Post, M. Kline, M. Lerman, L. Lowenheim, D. Normann, P. Odifreddi, G. Peano, Cs Peirce & R. Penrose - 1999 - In Edward R. Griffor (ed.), Handbook of Computability Theory. Elsevier. pp. 34.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  2.  5
    [Omnibus Review].M. Lerman - 1985 - Journal of Symbolic Logic 50 (2):550-552.
  3.  18
    Upper bounds for the arithmetical degrees.M. Lerman - 1985 - Annals of Pure and Applied Logic 29 (3):225-254.
  4.  13
    The universal splitting property. II.M. Lerman & J. B. Remmel - 1984 - Journal of Symbolic Logic 49 (1):137-150.
  5.  44
    Recursively enumerable sets modulo iterated jumps and extensions of Arslanov's completeness criterion.C. G. Jockusch, M. Lerman, R. I. Soare & R. M. Solovay - 1989 - Journal of Symbolic Logic 54 (4):1288-1323.
  6.  17
    A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees.M. Lerman - 1998 - Annals of Pure and Applied Logic 94 (1-3):143-180.
    We define a class of finite partial lattices which admit a notion of rank compatible with embedding constructions, and present a necessary and sufficient condition for the embeddability of a finite ranked partial lattice into the computably enumerable degrees.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  7.  16
    A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees.M. Lerman - 2000 - Annals of Pure and Applied Logic 101 (2-3):275-297.
    We present a necessary and sufficient condition for the embeddability of a principally decomposable finite lattice into the computably enumerable degrees. This improves a previous result which required that, in addition, the lattice be ranked. The same condition is also necessary and sufficient for a finite lattice to be embeddable below every non-zero computably enumerable degree.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  8.  18
    Hyperhypersimple α-r.e. sets.C. T. Chong & M. Lerman - 1976 - Annals of Mathematical Logic 9 (1-2):1-48.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  9.  35
    Lattice embeddings into the recursively enumerable degrees.K. Ambos-Spies & M. Lerman - 1986 - Journal of Symbolic Logic 51 (2):257-272.
  10.  34
    Carl G. JockuschJr., and David B. Posner. Double jumps of minimal degrees. The journal of symbolic logic, vol. 43 no. 4 , pp. 715–724. - Carl G. JockuschJr., and David B. Posner. Automorphism bases for degrees of unsotvability. Israel journal of mathematics, vol. 40 , pp. 150–164. - Richard L. Epstein. Initial segments of degrees below 0′. Memoirs of the American Mathematical Society, no. 241. American Mathematical Society, Providence1981, vi + 102 pp. - Richard A. Shore. The theory of the degrees below 0′. The journal of the London Mathematical Society, ser. 2 vol. 24 , pp. 1–14.M. Lerman - 1985 - Journal of Symbolic Logic 50 (2):550-552.
  11.  28
    Lattice embeddings into the recursively enumerable degrees. II.K. Ambos-Spies & M. Lerman - 1989 - Journal of Symbolic Logic 54 (3):735-760.
  12. Griffor, ER, see Rathjen, M.L. Harrington, R. I. Soare, J. F. Knight & M. Lerman - 1998 - Annals of Pure and Applied Logic 94:297.
    No categories
     
    Export citation  
     
    Bookmark  
  13.  25
    Turing degrees and many-one degrees of maximal sets.Manuel Lerman - 1970 - Journal of Symbolic Logic 35 (1):29-40.
    Martin [4, Theorems 1 and 2] proved that a Turing degree a is the degree of a maximal set if, and only if, a′ = 0″. Lachlan has shown that maximal sets have minimal many-one degrees [2, §1] and that every nonrecursive r.e. Turing degree contains a minimal many-one degree [2, Theorem 4]. Our aim here is to show that any r.e. Turing degree a of a maximal set contains an infinite number of maximal sets whose many-one degrees are pairwise (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark  
  14.  68
    The Intellectual Powers: A Study of Human Nature, by P. M. S. Hacker. [REVIEW]Hemdat Lerman - 2015 - Mind 124 (496):1278-1285.
  15.  24
    C. Berline and G. Cherlin. QE rings in characteristic p. Logic year 1979–80, The University of Connecticut, USA, edited by M. Lerman, J. H. Schmerl, and R. I. Soare, Lecture notes in mathematics, vol. 859, Springer-Verlag, Berlin, Heidelberg, and New York, 1981, pp. 16–31. - C. Berline and G. Cherlin. QE nilrings of prime characteristic. Bulletin de la Société Mathématique de Belgique, ser. B vol. 33 , pp. 3–17. - Chantal Berline and Gregory Cherlin. QE rings in characteristic pn. The journal of symbolic logic, vol. 48 , pp. 140–162. - D. Saracino and C. Wood. QE commutative nilrings. The journal of symbolic logic, vol. 49 , pp. 644–651. [REVIEW]M. Boffa - 1985 - Journal of Symbolic Logic 50 (4):1080-1081.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  16.  8
    James H. Schmerl. Peano models with many generic classes. Pacific Journal of Mathematics, vol. 43 (1973), pp. 523–536. - James H. Schmerl. Correction to: “Peano models with many generic classes”. Pacific Journal of Mathematics, vol. 92 (1981), no. 1, pp. 195–198. - James H. Schmerl. Recursively saturated, rather classless models of Peano arithmetic. Logic Year 1979–80. Recursively saturated, rather classless models of Peano arithmetic. Logic Year 1979–80 (Proceedings, Seminars, and Conferences in Mathematical Logic, University of Connecticut, Storrs, Connecticut, 1979/80). edited by M. Lerman, J. H. Schmerl, and R. I. Soare, Lecture Notes in Mathematics, vol. 859. Springer, Berlin, pp. 268–282. - James H. Schmerl. Recursively saturatedmodels generated by indiscernibles. Notre Dane Journal of Formal Logic, vol. 26 (1985), no. 1, pp. 99–105. - James H. Schmerl. Large resplendent models generated by indiscernibles. The Journal of Symbolic Logic, vol. 54 (1989), no. 4, pp. 1382–1388. - Jam. [REVIEW]Roman Kossak - 2009 - Bulletin of Symbolic Logic 15 (2):222-227.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  17.  3
    James H. Schmerl. Peano models with many generic classes. Pacific Journal of Mathematics, vol. 43 (1973), pp. 523–536. - James H. Schmerl. Correction to: “Peano models with many generic classes”. Pacific Journal of Mathematics, vol. 92 (1981), no. 1, pp. 195–198. - James H. Schmerl. Recursively saturated, rather classless models of Peano arithmetic. Logic Year 1979–80. Recursively saturated, rather classless models of Peano arithmetic. Logic Year 1979–80 (Proceedings, Seminars, and Conferences in Mathematical Logic, University of Connecticut, Storrs, Connecticut, 1979/80). edited by M. Lerman, J. H. Schmerl, and R. I. Soare, Lecture Notes in Mathematics, vol. 859. Springer, Berlin, pp. 268–282. - James H. Schmerl. Recursively saturatedmodels generated by indiscernibles. Notre Dane Journal of Formal Logic, vol. 26 (1985), no. 1, pp. 99–105. - James H. Schmerl. Large resplendent models generated by indiscernibles. The Journal of Symbolic Logic, vol. 54 (1989), no. 4, pp. 1382–1388. - Jam. [REVIEW]Roman Kossak - 2009 - Bulletin of Symbolic Logic 15 (2):222-227.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  18.  57
    Review of Amy E. Lerman and Vesla M. Weaver, Arresting Citizenship: The Democratic Consequences of American Crime Control. [REVIEW]Steven Swartzer - 2016 - Ethics 126 (3):840-845.
  19. Attention, Salience, and the Phenomenology of Visual Experience.Hemdat Lerman - 2022 - In Sophie Archer (ed.), Salience: A Philosophical Inquiry. New York, NY: Routledge. pp. 24-49.
    Both introspection and empirical studies suggest that visual attention can affect the phenomenology of our visual experience. However, the exact character of such effects is far from clear. My aim in this chapter is to spell out the main difficulties involved in attempting to achieve a clearer view of these effects, and to make some suggestions as to how we can make progress with this issue while avoiding tempting mistakes. I do this by discussing the question of whether there is (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  20. Perception, Causation, and Objectivity.Johannes Roessler, Hemdat Lerman & Naomi Eilan (eds.) - 2011 - Oxford, GB: Oxford University Press.
    Perceptual experience, that paradigm of subjectivity, constitutes our most immediate and fundamental access to the objective world. At least, this would seem to be so if commonsense realism is correct — if perceptual experience is (in general) an immediate awareness of mind-independent objects, and a source of direct knowledge of what such objects are like. Commonsense realism raises many questions. First, can we be more precise about its commitments? Does it entail any particular conception of the nature of perceptual experience (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  21.  15
    Degrees of unsolvability: local and global theory.Manuel Lerman - 1983 - New York: Springer Verlag.
    I first seriously contemplated writing a book on degree theory in 1976 while I was visiting the University of Illinois at Chicago Circle. There was, at that time, some interest in ann-series book about degree theory, and through the encouragement of Bob Soare, I decided to make a proposal to write such a book. Degree theory had, at that time, matured to the point where the local structure results which had been the mainstay of the earlier papers in the area (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   26 citations  
  22.  13
    Homomorphisms and quotients of degree structures.Burkhard Englert, Manuel Lerman & Kevin Wald - 2003 - Annals of Pure and Applied Logic 123 (1-3):193-233.
    We investigate homomorphisms of degree structures with various relations, functions and constants. Our main emphasis is on pseudolattices, i.e., partially ordered sets with a join operation and relations simulating the meet operation. We show that there are no finite quotients of the pseudolattice of degrees or of the pseudolattice of degrees 0′, but that many finite distributive lattices are pseudolattice quotients of the pseudolattice of computably enumerable degrees.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  23.  17
    Separating principles below Ramsey's theorem for pairs.Manuel Lerman, Reed Solomon & Henry Towsner - 2013 - Journal of Mathematical Logic 13 (2):1350007.
    In recent years, there has been a substantial amount of work in reverse mathematics concerning natural mathematical principles that are provable from RT, Ramsey's Theorem for Pairs. These principles tend to fall outside of the "big five" systems of reverse mathematics and a complicated picture of subsystems below RT has emerged. In this paper, we answer two open questions concerning these subsystems, specifically that ADS is not equivalent to CAC and that EM is not equivalent to RT.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   15 citations  
  24. Non-conceptual Experiential Content and Reason-giving.Hemdat Lerman - 2010 - Philosophy and Phenomenological Research 81 (1):1-23.
    According to John McDowell and Bill Brewer, our experiences have the type of content which can be the content of judgements - content which is the result of the actualization of specific conceptual abilities. They defend this view by arguing that our experiences must have such content in order for us to be able to think about our environment. In this paper I show that they do not provide a conclusive argument for this view. Focusing on Brewer’s version of the (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  25.  9
    Degrees which do not bound minimal degrees.Manuel Lerman - 1986 - Annals of Pure and Applied Logic 30 (3):249-276.
  26.  17
    Reflexiones de matemática.Laura Pelegrín, Marcelo Lerman, Felipe Montero, Teo Iovine & Luciana Martínez - 2021 - Con-Textos Kantianos 14:7-34.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  27.  10
    Admissible ordinals and priority arguments.Manuel Lerman - 1973 - In A. R. D. Mathias & H. Rogers (eds.), Cambridge Summer School in Mathematical Logic. New York: Springer Verlag. pp. 311--344.
  28. Philosophical Foundations of Neuroscience.M. R. Bennett & P. M. S. Hacker - 2003 - Hoboken, New Jersey: Wiley-Blackwell. Edited by P. M. S. Hacker.
    Writing from a scientifically and philosophically informed perspective, the authors provide a critical overview of the conceptual difficulties encountered in many current neuroscientific and psychological theories.
    Direct download  
     
    Export citation  
     
    Bookmark   213 citations  
  29.  17
    Embedding finite lattices into the ideals of computably enumerable Turing degrees.William C. Calhoun & Manuel Lerman - 2001 - Journal of Symbolic Logic 66 (4):1791-1802.
    We show that the lattice L 20 is not embeddable into the lattice of ideals of computably enumerable Turing degrees (J). We define a structure called a pseudolattice that generalizes the notion of a lattice, and show that there is a Π 2 necessary and sufficient condition for embedding a finite pseudolattice into J.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark  
  30.  77
    Demonstrative Content and the Experience of Properties.Hemdat Lerman - 2012 - Dialectica 66 (4):489-515.
    John McDowell (in Mind and World) and Bill Brewer (in Perception and Reason) argue that the content of our perceptual experience is conceptual in the following sense. It is of the type of content that could be the content of a judgement – that is, a content which results from the actualization of two (or more) conceptual abilities. Specifically, they suggest that the conceptual abilities actualized in experience are demonstrative abilities, and thus the resulting content is of the type we (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  31.  12
    Ideals of Generalized Finite Sets in Lattices of α‐Recursively Enumerable Sets.Manuel Lerman - 1976 - Mathematical Logic Quarterly 22 (1):347-352.
  32.  26
    Ideals of Generalized Finite Sets in Lattices of α-Recursively Enumerable Sets.Manuel Lerman - 1976 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 22 (1):347-352.
  33.  19
    Types of simple α-recursively enumerable sets.Manuel Lerman - 1976 - Journal of Symbolic Logic 41 (2):419-426.
  34.  27
    Theories with recursive models.Manuel Lerman & James H. Schmerl - 1979 - Journal of Symbolic Logic 44 (1):59-76.
  35. Particular Thoughts & Singular Thought.M. G. F. Martin - 2002 - Royal Institute of Philosophy Supplement 51:173-214.
    A long-standing theme in discussion of perception and thought has been that our primary cognitive contact with individual objects and events in the world derives from our perceptual contact with them. When I look at a duck in front of me, I am not merely presented with the fact that there is at least one duck in the area, rather I seem to be presented withthisthing (as one might put it from my perspective) in front of me, which looks to (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   74 citations  
  36.  16
    Congruence relations, filters, ideals, and definability in lattices of α-recursively enumerable sets.Manuel Lerman - 1976 - Journal of Symbolic Logic 41 (2):405-418.
  37.  22
    Some nondistributive lattices as initial segments of the degrees of unsolvability.Manuel Lerman - 1969 - Journal of Symbolic Logic 34 (1):85-98.
  38.  18
    A framework for priority arguments.Manuel Lerman - 2010 - New York: Cambridge University Press.
    This book presents a unifying framework for using priority arguments to prove theorems in computability. Priority arguments provide the most powerful theorem-proving technique in the field, but most of the applications of this technique are ad hoc, masking the unifying principles used in the proofs. The proposed framework presented isolates many of these unifying combinatorial principles and uses them to give shorter and easier-to-follow proofs of computability-theoretic theorems. Standard theorems of priority levels 1, 2, and 3 are chosen to demonstrate (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  39.  14
    Computable choice functions for computable linear orderings.Manuel Lerman & Richard Watnick - 2003 - Mathematical Logic Quarterly 49 (5):485-510.
    A choice set for a computable linear ordering is a set which contains one element from each maximal block of the ordering. We obtain a partial characterization of the computable linear order-types for which each computable model has a computable choice set, and a full characterization in the relativized case; Every model of the linear order-type α of degree ≤ d has a choice set of degree ≤ d iff α can written as a finite sum of order-types, each of (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  40.  11
    In memoriam: Gerald E. Sacks, 1933–2019.Manuel Lerman & Theodore A. Slaman - 2022 - Bulletin of Symbolic Logic 28 (1):150-155.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  41.  41
    Least upper bounds for minimal pairs of α-R.E. α-degrees.Manuel Lerman - 1974 - Journal of Symbolic Logic 39 (1):49-56.
  42.  4
    Logic year 1979-80, the University of Connecticut, USA.Manuel Lerman, James Henry Schmerl & Robert Irving Soare (eds.) - 1981 - New York: Springer Verlag.
  43.  13
    Minimal Degrees and Recursively Inseparable Pairs of Recursively Enumerable Sets.Manuel Lerman - 1991 - Mathematical Logic Quarterly 37 (19‐22):331-342.
  44.  27
    Minimal Degrees and Recursively Inseparable Pairs of Recursively Enumerable Sets.Manuel Lerman - 1991 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 37 (19-22):331-342.
    Direct download  
     
    Export citation  
     
    Bookmark  
  45. Some theorems on r-maximal sets and major subsets of recursively enumerable sets.Manuel Lerman - 1971 - Journal of Symbolic Logic 36 (2):193-215.
  46.  13
    The Weimar Republic and the younger proletariat. An economic and social analysis.Katharine Anne Lerman - 1994 - History of European Ideas 18 (3):421-422.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  47.  2
    Kantian Antitheodicy: Philosophical and Literary Varieties.Sami Pihlström - 2016 - Cham: Imprint: Palgrave Macmillan. Edited by Sari Kivistö.
    This book defends antitheodicism, arguing that theodicies, seeking to excuse God for evil and suffering in the world, fail to ethically acknowledge the victims of suffering. The authors argue for this view using literary and philosophical resources, commencing with Immanuel Kant's 1791 "Theodicy Essay" and its reading of the Book of Job. Three important twentieth century antitheodicist positions are explored, including "Jewish" post-Holocaust ethical antitheodicism, Wittgensteinian antitheodicism exemplified by D.Z. Phillips and pragmatist antitheodicism defended by William James. The authors argue (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  48. On a Conjecture of Dobrinen and Simpson concerning Almost Everywhere Domination.Stephen Binns, Bjørn Kjos-Hanssen, Manuel Lerman & Reed Solomon - 2006 - Journal of Symbolic Logic 71 (1):119 - 136.
  49. Sketch for a Systematic Metaphysics.D. M. Armstrong - 2010 - Oxford, UK: Oxford University Press UK.
    In his last book, David Armstrong sets out his metaphysical system in a set of concise and lively chapters each dealing with one aspect of the world. He begins with the assumption that all that exists is the physical world of space-time. On this foundation he constructs a coherent metaphysical scheme that gives plausible answers to many of the great problems of metaphysics. He gives accounts of properties, relations, and particulars; laws of nature; modality; abstract objects such as numbers; and (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   48 citations  
  50.  54
    Non-physicalist Theories of Consciousness.Hedda Hassel Mørch - 2023 - Cambridge: Cambridge University Press.
    Is consciousness a purely physical phenomenon? Most contemporary philosophers and theorists hold that it is, and take this to be supported by modern science. But a significant minority endorse non-physicalist theories such as dualism, idealism and panpsychism, among other reasons because it may seem impossible to fully explain consciousness, or capture what it's like to be in conscious states (such as seeing red, or being in pain), in physical terms. This Element will introduce the main non-physicalist theories of consciousness and (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
1 — 50 / 980