Results for 'Harvey M. Weinstein'

1000+ found
Order:
  1.  11
    Asylum Evaluations—The Physician's Dilemma.Harvey M. Weinstein & Eric Stover - 2002 - Cambridge Quarterly of Healthcare Ethics 11 (3):303-304.
    In the following paper, Annemiek Richters of the University of Leiden in the Netherlands addresses the dilemmas faced by health professionals who are asked to evaluate and provide supporting documentation for those refugees who seek political asylum in the countries of Europe. It is in the politically charged arena of asylum applications, government regulations, and public policy where bioethics, human rights, and health converge. Despite the 1951 Convention on Refugees, a treaty signed by nations around the world to safeguard the (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  2.  13
    Learning and Extinction Based Upon Frustration, Food Reward, and Exploratory Tendency.Harvey M. Adelman & Jack L. Maatsch - 1956 - Journal of Experimental Psychology 52 (5):311.
  3.  24
    Countable Algebra and Set Existence Axioms.Harvey M. Friedman - 1983 - Annals of Pure and Applied Logic 25 (2):141.
  4.  35
    Linear Correlates in the Speech Signal: The Orderly Output Constraint.Harvey M. Sussman, David Fruchter, Jon Hilbert & Joseph Sirosh - 1998 - Behavioral and Brain Sciences 21 (2):241-259.
    Neuroethological investigations of mammalian and avian auditory systems have documented species-specific specializations for processing complex acoustic signals that could, if viewed in abstract terms, have an intriguing and striking relevance for human speech sound categorization and representation. Each species forms biologically relevant categories based on combinatorial analysis of information-bearing parameters within the complex input signal. This target article uses known neural models from the mustached bat and barn owl to develop, by analogy, a conceptualization of human processing of consonant plus (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  5. Does Mathematics Need New Axioms.Solomon Feferman, Harvey M. Friedman, Penelope Maddy & John R. Steel - 1999 - Bulletin of Symbolic Logic 6 (4):401-446.
    Part of the ambiguity lies in the various points of view from which this question might be considered. The crudest di erence lies between the point of view of the working mathematician and that of the logician concerned with the foundations of mathematics. Now some of my fellow mathematical logicians might protest this distinction, since they consider themselves to be just more of those \working mathematicians". Certainly, modern logic has established itself as a very respectable branch of mathematics, and there (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   61 citations  
  6.  28
    Weak Comparability of Well Orderings and Reverse Mathematics.Harvey M. Friedman & Jeffry L. Hirst - 1990 - Annals of Pure and Applied Logic 47 (1):11-29.
    Two countable well orderings are weakly comparable if there is an order preserving injection of one into the other. We say the well orderings are strongly comparable if the injection is an isomorphism between one ordering and an initial segment of the other. In [5], Friedman announced that the statement “any two countable well orderings are strongly comparable” is equivalent to ATR 0 . Simpson provides a detailed proof of this result in Chapter 5 of [13]. More recently, Friedman has (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   17 citations  
  7.  7
    Neural Coding of Relational Invariance in Speech: Human Language Analogs to the Barn Owl.Harvey M. Sussman - 1989 - Psychological Review 96 (4):631-642.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  8. Similar Subclasses.Harvey M. Friedman - unknown
    Reflection, in the sense of [Fr03a] and [Fr03b], is based on the idea that a category of classes has a subclass that is “similar” to the category. Here we present axiomatizations based on the idea that a category of classes that does not form a class has extensionally different subclasses that are “similar”. We present two such similarity principles, which are shown to interpret and be interpretable in certain set theories with large cardinal axioms.
    Translate
     
     
    Export citation  
     
    Bookmark   2 citations  
  9. Introduction.Harvey M. Friedman - unknown
    The use of x[y,z,w] rather than the more usual y Πx has many advantages for this work. One of them is that we have found a convenient way to eliminate any need for axiom schemes. All axioms considered are single sentences with clear meaning. (In one case only, the axiom is a conjunction of a manageable finite number of sentences).
    Translate
     
     
    Export citation  
     
    Bookmark   3 citations  
  10. Adjacent Ramsey Theory.Harvey M. Friedman - unknown
    Let k ≥ 2 and f:Nk Æ [1,k] and n ≥ 1 be such that there is no x1 < ... < xk+1 £ n such that f(x1,...,xk) = f(x1,...,xk+1). Then we want to find g:Nk+1 Æ [1,3] such that there is no x1 < ... < xk+2 £ n such that g(x1,...,xk+1) = g(x2,...,xk+2). This reducees adjacent Ramsey in k dimensions with k colors to adjacent Ramsey in k+1 dimensions with 3 colors.
    No categories
    Translate
     
     
    Export citation  
     
    Bookmark   2 citations  
  11. A Complete Theory of Everything: Satisfiability in the Universal Domain.Harvey M. Friedman - unknown
    Here we take the view that LPC(=) is applicable to structures whose domain is too large to be a set. This is not just a matter of class theory versus set theory, although it can be interpreted as such, and this interpretation is discussed briefly at the end.
    Translate
     
     
    Export citation  
     
    Bookmark   2 citations  
  12. Foundations of Mathematics: Past, Present, and Future.Harvey M. Friedman - unknown
    It turns out, time and time again, in order to make serious progress in f.o.m., we need to take actual reasoning and actual development into account at precisely the proper level. If we take these into account too much, then we are faced with information that is just too difficult to create an exact science around - at least at a given state of development of f.o.m. And if we take these into account too little, our findings will not have (...)
    No categories
    Translate
     
     
    Export citation  
     
    Bookmark   1 citation  
  13.  9
    Set Existence Property for Intuitionistic Theories with Dependent Choice.Harvey M. Friedman & Andrej Ščedrov - 1983 - Annals of Pure and Applied Logic 25 (2):129-140.
  14. Transfer Principles in Set Theory.Harvey M. Friedman - unknown
    1. Transfer principles from N to On. A. Mahlo cardinals. B. Weakly compact cardinals. C. Ineffable cardinals. D. Ramsey cardinals. E. Ineffably Ramsey cardinals. F. Subtle cardinals. G. From N to (...))
    Translate
     
     
    Export citation  
     
    Bookmark   1 citation  
  15.  16
    Subtle Cardinals and Linear Orderings.Harvey M. Friedman - 2000 - Annals of Pure and Applied Logic 107 (1-3):1-34.
    The subtle, almost ineffable, and ineffable cardinals were introduced in an unpublished 1971 manuscript of R. Jensen and K. Kunen. The concepts were extended to that of k-subtle, k-almost ineffable, and k-ineffable cardinals in 1975 by J. Baumgartner. In this paper we give a self contained treatment of the basic facts about this level of the large cardinal hierarchy, which were established by J. Baumgartner. In particular, we give a proof that the k-subtle, k-almost ineffable, and k-ineffable cardinals define three (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  16. Boolean Relation Theory.Harvey M. Friedman - unknown
    BRT is always based on a choice of BRT setting. A BRT setting is a pair (V,K), where V is an interesting family of multivariate functions. K is an interesting family of sets. In this talk, we will only consider V,K, where V is an interesting family of multivariate functions from N into N. K is an interesting family of subsets of N.
    No categories
    Translate
     
     
    Export citation  
     
    Bookmark   1 citation  
  17.  17
    Addendum to “Countable Algebra and Set Existence Axioms”.Harvey M. Friedman, Stephen G. Simpson & Rick L. Smith - 1984 - Annals of Pure and Applied Logic 28 (3):319-320.
  18.  21
    Proofless Text.Harvey M. Friedman - unknown
    i. Proofless text is based on a variant of ZFC with free logic. Here variables always denote, but not all terms denote. If a term denotes, then all subterms must denote. The sets are all in the usual extensional cumulative hierarchy of sets. There are no urelements.
    Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark   1 citation  
  19.  18
    Interactivity and Enaction in Human Cognition.M. I. Harvey, R. Gahrn-Andersen & S. V. Steffensen - 2016 - Constructivist Foundations 11 (2):234-245.
    Context: Distributed language and interactivity are central members of a set of concepts that are rapidly developing into rigorous, exciting additions to 4E cognitive science. Because they share certain assumptions and methodological commitments with enactivism, the two have sometimes been confused; additionally, while enactivism is a well-developed paradigm, interactivity has relied more on methodological development and on a set of focal examples. Problem: The goal of this article is to clarify the core conceptual commitments of both interactivity-based and enactive approaches (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  20.  29
    The Schools and the Cloister. The Life and Writings of Alexander Nequam 1157–1217 : R.W. Hunt, Ed. And Rev. Margaret Gibson , Xiii + 165pp., N.P. [REVIEW]M. M. Harvey - 1986 - History of European Ideas 7 (3):320-321.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  21.  11
    Reverse Mathematics and Homeomorphic Embeddings.Harvey M. Friedman & Jeffry L. Hirst - 1991 - Annals of Pure and Applied Logic 54 (3):229-253.
    Extrapolating from the work of Mahlo , one can prove that given any pair of countable closed totally bounded subsets of complete separable metric spaces, one subset can be homeomorphically embedded in the other. This sort of topological comparability is reminiscent of the statements concerning comparability of well orderings which Friedman has shown to be equivalent to ATR0 over the weak base system RCA0. The main result of this paper states that topological comparability is also equivalent to ATR0. In Section (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  22.  25
    Stimulus Correlates of Visual Pattern Recognition: A Probability Approach.Paul M. Fitts, Meyer Weinstein, Maurice Rappaport, Nancy Anderson & J. Alfred Leonard - 1956 - Journal of Experimental Psychology 51 (1):1.
  23.  10
    Intuitionistically Provable Recursive Well-Orderings.Harvey M. Friedman & Andre Scedrov - 1986 - Annals of Pure and Applied Logic 30 (2):165-171.
    We consider intuitionistic number theory with recursive infinitary rules . Any primitive recursive binary relation for which transfinite induction schema is provable is in fact well founded. Its ordinal is less than ε 0 if the transfinite induction schema is intuitionistically provable in elementary number theory. These results are provable intuitionistically. In fact, it suffices to consider transfinite induction with respect to one particular number-theoretic property.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  24.  14
    Human Speech: A Tinkerer's Delight.Harvey M. Sussman, David Fruchter, Jon Hilbert & Joseph Sirosh - 1998 - Behavioral and Brain Sciences 21 (2):287-295.
    The most frequent criticism of the target article is the lack of clear separability of human speech data relative to neuroethological data. A rationalization for this difference was sought in the tinkered nature of such new adaptations as human speech. Basic theoretical premises were defended, and new data were presented to support a claim that speakers maintain a low-noise relationship between F2 transition onset and offset frequencies for stops in pre-vocalic positions through articulatory choices. It remains a viable and testable (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  25.  7
    Let's Get Down to the “Wetware” and Look at Evolutionarily Motivated Mechanisms.Harvey M. Sussman - 1994 - Behavioral and Brain Sciences 17 (1):182-183.
  26.  17
    Harvey M. Friedman. Determinateness in the Low Projective Hierarchy. Fundamenta Mathematicae, Vol. 72 No. 1 , Pp. 79–95. [REVIEW]Jens Erik Fenstad - 1974 - Journal of Symbolic Logic 39 (3):599.
  27.  22
    Extinction of Instrumental Behavior as a Function of Frustration at Various Distances From the Goal.Harvey M. Adelman & Gerald Rosenbaum - 1954 - Journal of Experimental Psychology 47 (6):429.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  28.  9
    Mediating Verbal Responses and Stimulus Similarity as Factors in Conceptual Naming by School Age Children.Harvey M. Lacey - 1961 - Journal of Experimental Psychology 62 (2):113.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  29.  2
    Sidewinder: Creative Missile Development at China Lake. Ron Westrum.Harvey M. Sapolsky - 2001 - Isis 92 (1):222-223.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  30.  2
    Science Policy in American State Government.Harvey M. Sapolsky - 1971 - Minerva 9 (3):322-348.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  31.  5
    Harvey M. Bricker;, Victoria R. Bricker. Astronomy in the Maya Codices. Xxviii + 907 Pp., Illus., Index. Philadelphia: American Philosophical Society, 2011. $75. [REVIEW]Gerardo Aldana - 2014 - Isis 105 (1):193-195.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  32. More on Child-Resistant Packages.Harvey M. Arbit - 1983 - IRB: Ethics & Human Research 5 (5):10.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  33.  5
    Elicitation Theory: I. An Analysis of Two Typical Learning Situations.M. Ray Denny & Harvey M. Adelman - 1955 - Psychological Review 62 (4):290-296.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  34.  12
    Harvey M. Friedman, Stephen G. Simpson, and Rick L. Smith. Countable Algebra and Set Existence Axioms. Annals of Pure and Applied Logic, Vol. 25 , Pp. 141–181. - Harvey M. Friedman, Stephen G. Simpson, and Rick L. Smith. Addendum to “Countable Algebra and Set Existence Axioms.” Annals of Pure and Applied Logic, Vol. 28 , Pp. 319–320. [REVIEW]Peter G. Clote - 1987 - Journal of Symbolic Logic 52 (1):276-278.
  35. Review: Harvey M. Friedman, Stephen G. Simpson, Rick L. Smith, Countable Algebra and Set Existence Axioms; Harvey M. Friedman, Stephen G. Simpson, Rick L. Smith, Addendum to "Countable Algebra and Set Existence Axioms.". [REVIEW]Peter G. Clote - 1987 - Journal of Symbolic Logic 52 (1):276-278.
  36.  5
    Star Gods of the Maya: Astronomy in Art, Folklore, and Calendars. Susan Milbrath.Harvey M. Bricker - 2001 - Isis 92 (1):150-151.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  37. Agenda.Harvey M. Friedman - unknown
    In the Foundational Life, philosophy is commonly used as a method for choosing and analyzing fundamental concepts, and mathematics is commonly used for rigorous development. The mathematics informs the philosophy and the philosophy informs the mathematics.
    Translate
     
     
    Export citation  
     
    Bookmark  
  38. Applications of Large Cardinals to Graph Theory.Harvey M. Friedman - unknown
    Since then we have been engaged in the development of such results of greater relevance to mathematical practice. In January, 1997 we presented some new results of this kind involving what we call “jump free” classes of finite functions. This Jump Free Theorem is treated in section 2.
    Translate
     
     
    Export citation  
     
    Bookmark  
  39.  19
    Borel Sets and Hyperdegrees.Harvey M. Friedman - 1973 - Journal of Symbolic Logic 38 (3):405-409.
  40. Concept Calculus: Much Better Than.Harvey M. Friedman - unknown
    This is the initial publication on Concept Calculus, which establishes mutual interpretability between formal systems based on informal commonsense concepts and formal systems for mathematics through abstract set theory. Here we work with axioms for "better than" and "much better than", and the Zermelo and Zermelo Frankel axioms for set theory.
    Translate
     
     
    Export citation  
     
    Bookmark  
  41. Concrete Incompleteness From Efa Through Large Cardinals.Harvey M. Friedman - unknown
    Normal mathematical culture is overwhelmingly concerned with finite structures, finitely generated structures, discrete structures (countably infinite), continuous and piecewise continuous functions between complete separable metric spaces, with lesser consideration of pointwise limits of sequences of such functions, and Borel measurable functions between complete separable metric spaces.
    Translate
     
     
    Export citation  
     
    Bookmark  
  42. Clay Millenium Problem: P = Np.Harvey M. Friedman - unknown
    The equation P = NP concerns algorithms for deciding membership in sets. The consensus is that P ≠ NP, although some prominent experts guess otherwise.
    Translate
     
     
    Export citation  
     
    Bookmark  
  43. Decision Procedures for Verification.Harvey M. Friedman - unknown
    We focus on two formal methods contexts which generate investigations into decision problems for finite strings.
    No categories
    Translate
     
     
    Export citation  
     
    Bookmark  
  44. Decision Problems in Strings and Formal Methods.Harvey M. Friedman - unknown
    We focus on two formal methods contexts which generate investigations into decision problems for finite strings.
    No categories
    Translate
     
     
    Export citation  
     
    Bookmark  
  45. Decision Problems in Euclidean Geometry.Harvey M. Friedman - unknown
    We show the algorithmic unsolvability of a number of decision procedures in ordinary two dimensional Euclidean geometry, involving lines and integer points. We also consider formulations involving integral domains of characteristic 0, and ordered rings. The main tool is the solution to Hilbert's Tenth Problem. The limited number of facts used from recursion theory are isolated at the beginning.
    Translate
     
     
    Export citation  
     
    Bookmark  
  46. Equational Representations.Harvey M. Friedman - unknown
    We begin by presenting the language L(N,℘N,℘℘N). This is the standard language for presenting third order sentences, using its intended interpretation.
    Translate
     
     
    Export citation  
     
    Bookmark  
  47. [email protected]Harvey M. Friedman - unknown
    It has been accepted since the early part of the Century that there is no problem formalizing mathematics in standard formal systems of axiomatic set theory. Most people feel that they know as much as they ever want to know about how one can reduce natural numbers, integers, rationals, reals, and complex numbers to sets, and prove all of their basic properties. Furthermore, that this can continue through more and more complicated material, and that there is never a real problem.
    Translate
     
     
    Export citation  
     
    Bookmark  
  48. Foundational Adventures for the Future.Harvey M. Friedman - unknown
    • Wright Brothers made a two mile flight • Wright Brothers made a 42 mile flight • Want to ship goods • Want to move lots of passengers • Want reliability and safety • Want low cost • ... Modern aviation • Each major advance spawns reasonable demands for more and more • Excruciating difficulties overcome • Armies of people over decades or more • Same story for any practically any epoch breaking advance in anything..
    No categories
    Translate
     
     
    Export citation  
     
    Bookmark  
  49. Finite Phase Transitions.Harvey M. Friedman - unknown
    This topic has been discussed earlier on the FOM email list in various guises. The common theme is: big numbers and long sequences associated with mathematical objects. See..
    Translate
     
     
    Export citation  
     
    Bookmark  
  50. From Russell's Paradox To.Harvey M. Friedman - unknown
    Russell’s way out of his paradox via the impredicative theory of types has roughly the same logical power as Zermelo set theory - which supplanted it as a far more flexible and workable axiomatic foundation for mathematics. We discuss some new formalisms that are conceptually close to Russell, yet simpler, and have the same logical power as higher set theory - as represented by the far more powerful Zermelo-Frankel set theory and beyond. END.
     
    Export citation  
     
    Bookmark  
1 — 50 / 1000