Results for 'Scodel Harvey'

962 found
Order:
  1. An Interview with Professor Hans Jonas.Harvey Scodel - 2003 - Social Research: An International Quarterly 70 (2):339-368.
     
    Export citation  
     
    Bookmark   3 citations  
  2. Whither relevant arithmetic?Harvey Friedman & Robert K. Meyer - 1992 - Journal of Symbolic Logic 57 (3):824-831.
    Based on the relevant logic R, the system R# was proposed as a relevant Peano arithmetic. R# has many nice properties: the most conspicuous theorems of classical Peano arithmetic PA are readily provable therein; it is readily and effectively shown to be nontrivial; it incorporates both intuitionist and classical proof methods. But it is shown here that R# is properly weaker than PA, in the sense that there is a strictly positive theorem QRF of PA which is unprovable in R#. (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   20 citations  
  3.  94
    A borel reducibility theory for classes of countable structures.Harvey Friedman & Lee Stanley - 1989 - Journal of Symbolic Logic 54 (3):894-914.
    We introduce a reducibility preordering between classes of countable structures, each class containing only structures of a given similarity type (which is allowed to vary from class to class). Though we sometimes work in a slightly larger context, we are principally concerned with the case where each class is an invariant Borel class (i.e. the class of all models, with underlying set $= \omega$, of an $L_{\omega_1\omega}$ sentence; from this point of view, the reducibility can be thought of as a (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   52 citations  
  4.  51
    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   20 citations  
  5.  36
    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.
  6. New borel independence results.Harvey Friedman - manuscript
    S. Adams, W. Ambrose, A. Andretta, H. Becker, R. Camerlo, C. Champetier, J.P.R. Christensen, D.E. Cohen, A. Connes. C. Dellacherie, R. Dougherty, R.H. Farrell, F. Feldman, A. Furman, D. Gaboriau, S. Gao, V. Ya. Golodets, P. Hahn, P. de la Harpe, G. Hjorth, S. Jackson, S. Kahane, A.S. Kechris, A. Louveau,, R. Lyons, P.-A. Meyer, C.C. Moore, M.G. Nadkarni, C. Nebbia, A.L.T. Patterson, U. Krengel, A.J. Kuntz, J.-P. Serre, S.D. Sinel'shchikov, T. Slaman, Solecki, R. Spatzier, J. Steel, D. Sullivan, S. (...)
     
    Export citation  
     
    Bookmark  
  7. What are these three aspects?Harvey M. Friedman - unknown
    Provide a formal system that is a conservative extension of PA for Π02 sentences, and even a conservative extension of HA, that supports the worry free smooth development of constructive analysis in the style of Errett Bishop.
     
    Export citation  
     
    Bookmark  
  8.  34
    Borel sets and hyperdegrees.Harvey M. Friedman - 1973 - Journal of Symbolic Logic 38 (3):405-409.
  9. The consistency of classical set theory relative to a set theory with intuitionistic logic.Harvey Friedman - 1973 - Journal of Symbolic Logic 38 (2):315-319.
  10.  46
    Judgments of weight as affected by adaptation range, adaptation duration, magnitude of unlabeled anchor, and judgmental language.O. J. Harvey & Donald T. Campbell - 1963 - Journal of Experimental Psychology 65 (1):12.
  11. 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).
     
    Export citation  
     
    Bookmark   5 citations  
  12. 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.
     
    Export citation  
     
    Bookmark   2 citations  
  13.  28
    Using a Student Authentication and Authorship Checking System as a Catalyst for Developing an Academic Integrity Culture: a Bulgarian Case Study.Roumiana Peytcheva-Forsyth, Harvey Mellar & Lyubka Aleksieva - 2019 - Journal of Academic Ethics 17 (3):245-269.
    This paper presents a case study carried out at Sofia University in Bulgaria, describing the relationship between two developments, firstly an expanding involvement with online learning and e-assessment, and secondly the development of institutional approaches to academic integrity. The two developments interact, the widening use of e-learning and e-assessment raising new issues for academic integrity, and the technology providing new tools to support academic integrity, with the involvement in technological developments acting as a catalyst for changes in approaches to academic (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  14.  47
    The equivalence of the disjunction and existence properties for modal arithmetic.Harvey Friedman & Michael Sheard - 1989 - Journal of Symbolic Logic 54 (4):1456-1459.
    In a modal system of arithmetic, a theory S has the modal disjunction property if whenever $S \vdash \square\varphi \vee \square\psi$ , either $S \vdash \square\varphi$ or $S \vdash \square\psi. S$ has the modal numerical existence property if whenever $S \vdash \exists x\square\varphi(x)$ , there is some natural number n such that $S \vdash \square\varphi(\mathbf{n})$ . Under certain broadly applicable assumptions, these two properties are equivalent.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  15.  58
    Mimesis and catharsis reëxamined.Harvey D. Goldstein - 1966 - Journal of Aesthetics and Art Criticism 24 (4):567-577.
  16.  49
    Match-Fixing: Working Towards an Ethical Framework.Andy Harvey - 2015 - Journal of the Philosophy of Sport 42 (3):393-407.
    How does match-fixing, or other unfair manipulation of matches, that involves under-performance by players, or refereeing and umpiring that prevents fair competition, be thought of in ethical terms? In this article, I outline the different forms that match-fixing can take and seek to comprehend these disparate scenarios within Kantian, Hegelian and contractualist ethical frameworks. I tentatively suggest that, by developing an ethical opposition to match-fixing in sport, we can give much greater substance to popular phrases such as ‘respect for the (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  17.  7
    Where in the text?Mary Harvey Doyno - 2017 - Common Knowledge 23 (1):59-66.
    As part of a series of case studies titled “In the Humanities Classroom,” this essay asks how one can teach college students with little or no exposure to close reading, critical analysis, or the premodern world to read a text written c. 202 CE. An instructor at Sacramento State University in California describes her experience introducing students enrolled in a humanities survey course to The Passion of SS. Perpetua and Felicitas—a text that combines the prison diaries of two North African (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  18.  8
    Nietzsche's Philosophy of the Eternal Recurrence of the Same.J. Harvey Lomax (ed.) - 1997 - University of California Press.
    This long overdue English translation of Karl Löwith's magisterial study is a major event in Nietzsche scholarship in the Anglo-American intellectual world. Its initial publication was extraordinary in itself—a dissident interpretation, written by a Jew, appearing in National Socialist Germany in 1935. Since then, Löwith's book has continued to gain recognition as one of the key texts in the German Nietzsche reception, as well as a remarkable effort to reclaim the philosopher's work from political misappropriation. For Löwith, the centerpiece of (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  19.  26
    Nietzsche & the Eternal Recurrence.J. Harvey Lomax - 2000 - Philosophy Now 29:20-22.
    Direct download  
     
    Export citation  
     
    Bookmark  
  20. Arms and the State.Walter Millis, Harvey C. Mansfield & Harry Stein - 1961 - Science and Society 25 (3):278-280.
     
    Export citation  
     
    Bookmark  
  21. Unprovable theorems in discrete mathematics.Harvey Friedman - manuscript
    An unprovable theorem is a mathematical result that can-not be proved using the com-monly accepted axioms for mathematics (Zermelo-Frankel plus the axiom of choice), but can be proved by using the higher infinities known as large cardinals. Large car-dinal axioms have been the main proposal for new axioms originating with Gödel.
     
    Export citation  
     
    Bookmark  
  22. The inevitability of logical strength: Strict reverse mathematics.Harvey Friedman - manuscript
    An extreme kind of logic skeptic claims that "the present formal systems used for the foundations of mathematics are artificially strong, thereby causing unnecessary headaches such as the Gödel incompleteness phenomena". The skeptic continues by claiming that "logician's systems always contain overly general assertions, and/or assertions about overly general notions, that are not used in any significant way in normal mathematics. For example, induction for all statements, or even all statements of certain restricted forms, is far too general - mathematicians (...)
     
    Export citation  
     
    Bookmark  
  23. Axiomatization of set theory by extensionality, separation, and reducibility.Harvey Friedman - manuscript
    We discuss several axiomatizations of set theory in first order predicate calculus with epsilon and a constant symbol W, starting with the simple system K(W) which has a strong equivalence with ZF without Foundation. The other systems correspond to various extensions of ZF by certain large cardinal hypotheses. These axiomatizations are unusually simple and uncluttered, and are highly suggestive of underlying philosophical principles that generate higher set theory.
     
    Export citation  
     
    Bookmark  
  24.  96
    Agency and community: A critical realist paradigm.David L. Harvey - 2002 - Journal for the Theory of Social Behaviour 32 (2):163–194.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  25. Does normal mathematics need new axioms?Harvey Friedman - manuscript
    We present a range of mathematical theorems whose proofs require unexpectedly strong logical methods, which in some cases go well beyond the usual axioms for mathematics.
     
    Export citation  
     
    Bookmark  
  26. (1 other version)P01 INCOMPLETENESS: Finite graph theory.Harvey Friedman - manuscript
    For digraphs G, we write V(G) for the set of all vertices of G, and E(G) for the set of all edges of G. A digraph on a set E is a digraph G where V(G) = E.
     
    Export citation  
     
    Bookmark  
  27.  14
    (1 other version)Bar Induction and $Pi^1_1-CA^1$.Harvey Friedman - 1969 - Journal of Symbolic Logic 34 (3):353-362.
  28. P 1 INCOMPLETENESS: finite set equations.Harvey M. Friedman - unknown
    We say that R is strictly dominating if and only if for all x,yŒ[1,n], if R(x,y) then max(x) 3k ¥ [1,n], there exists A Õ [1,n] such that R = A. Furthermore, A Õ [1,n] is unique.
     
    Export citation  
     
    Bookmark  
  29. Boolean relation theory and the incompleteness phenomena.Harvey Friedman - manuscript
    ENTIRE BOOK, SINGLE FILE. BOOLEAN RELATION THEORY AND THE INCOMPLETENESS PHENOMENA. 10/30/07 version. Same as 10/01/07 version with Preface added. 568 pages without Appendix B. See above for Appendix B by Francoise Point.
     
    Export citation  
     
    Bookmark  
  30. Long finite sequences.Harvey Friedman - manuscript
    Let k be a positive integer. There is a longest finite sequence x1,...,xn in k letters in which no consecutive block xi,...,x2i is a subsequence of any other consecutive block xj,...,x2j. Let n(k) be this longest length. We prove that n(1) = 3, n(2) = 11, and n(3) is incomprehensibly large. We give a lower bound for n(3) in terms of the familiar Ackerman hierarchy. We also give asymptotic upper and lower bounds for n(k). We view n(3) as a particularly (...)
     
    Export citation  
     
    Bookmark  
  31. Some decision problems of enormous complexity.Harvey Friedman - manuscript
    We present some new decision and comparison problems of unusually high computational complexity. Most of the problems are strictly combinatorial in nature; others involve basic logical notions. Their complexities range from iterated exponential time completeness to (0 time completeness to ((((,0) time completeness to ((((,,0) time completeness. These three ordinals are well known ordinals from proof theory, and their associated com- plexity classes represent new levels of computational complexity for natural decision problems. Proofs will appear in an extended version of (...)
     
    Export citation  
     
    Bookmark  
  32. 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
     
    Export citation  
     
    Bookmark  
  33.  43
    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  
  34. Phenomena.Harvey M. Friedman - unknown
    We have been particularly interested in the demonstrable unremovability of machinery, which is a theme that can be pursued systematically starting at the most elementary level - the use of binary notation to represent integers; the use of rational numbers to solve linear equations; the use of real and complex numbers to solve polynomial equations; and the use of transcendental functions to solve differential equations.
     
    Export citation  
     
    Bookmark  
  35.  34
    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  
  36.  11
    Statistical and Thermal Physics: With Computer Applications.Harvey Gould & Jan Tobochnik - 2010 - Princeton University Press.
    This textbook carefully develops the main ideas and techniques of statistical and thermal physics and is intended for upper-level undergraduate courses. The authors each have more than thirty years' experience in teaching, curriculum development, and research in statistical and computational physics. Statistical and Thermal Physics begins with a qualitative discussion of the relation between the macroscopic and microscopic worlds and incorporates computer simulations throughout the book to provide concrete examples of important conceptual ideas. Unlike many contemporary texts on thermal physics, (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  37.  37
    Different Loci of Semantic Interference in Picture Naming vs. Word-Picture Matching Tasks.Denise Y. Harvey & Tatiana T. Schnur - 2016 - Frontiers in Psychology 7.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  38. The Upper Shift Kernel Theorems.Harvey M. Friedman - unknown
    We now fix A ⊆ Q. We study a fundamental class of digraphs associated with A, which we call the A-digraphs. An A,kdigraph is a digraph (Ak,E), where E is an order invariant subset of A2k in the following sense. For all x,y ∈ A2k, if x,y have the same order type then x ∈ E ↔ y ∈ E.
    No categories
     
    Export citation  
     
    Bookmark  
  39. From social theory to sociology of knowledge and back: Karl Mannheim and the sociology of intellectual knowledge production.Harvey Goldman - 1994 - Sociological Theory 12 (3):266-278.
    This paper proposes a reconsideration of Karl Mannheim and his work from the viewpoint of the needs of sociological theory. It points out certain affinities between Mannheim and some contemporary theorists, such as Gramsci and Foucault, and then reflects on certain problems in Mannheim's work, particularly the response to "relativism" and the hope of creating new "syntheses" through the sociology of knowledge. Finally, it proposes ways to draw on the sociology of intellectuals, inspired by Mannheim, in order to advance the (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  40. .A. Harvey - unknown
    No categories
     
    Export citation  
     
    Bookmark   1 citation  
  41.  41
    Large sets in intuitionistic set theory.Harvey Friedman & Andrej Ščedrov - 1984 - Annals of Pure and Applied Logic 27 (1):1-24.
    We consider properties of sets in an intuitionistic setting corresponding to large cardinals in classical set theory. Adding such ‘large set axioms’ to intuitionistic ZF set theory does not violate well-know metamathematical properties of intuitionistic systems. Moreover, we consider statements in constructive analysis equivalent to the consistency of such ‘large set axioms’.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  42.  14
    Campbell Crockett 1918 - 1985.Thomas A. Long & Harvey Mullane - 1985 - Proceedings and Addresses of the American Philosophical Association 59 (2):284 - 285.
    Direct download  
     
    Export citation  
     
    Bookmark  
  43. Vigre Lectures.Harvey M. Friedman - unknown
    In mathematics, we back up our discoveries with rigorous deductive proofs. Mathematicians develop a keen instinctive sense of what makes a proof rigorous. In logic, we strive for a *theory* of rigorous proofs.
     
    Export citation  
     
    Bookmark  
  44.  6
    Jacob Rogozinski, The Logic of Hatred: From Witch Hunts to the Terror.Robert Harvey - forthcoming - Theory, Culture and Society.
    With gripping archival detail, The Logic of Hatred scrutinizes the witch hunts and the Great Terror during the French Revolution to elaborate a theory and critique of what Jacob Rogozinski names the persecution apparatus. When this process is set into motion, sovereign power excludes and persecutes minoritized groups of humans deemed unworthy of inclusion, ultimately annihilating them. The author’s purpose is to break the seemingly inexorable cycle.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  45. Philosophy 532 Philosophical Problems in Logic Lecture 1 9/25/02.Harvey M. Friedman - unknown
    This is widely accepted, inside and outside philosophy, but one can spend an entire career clarifying, justifying, and amplifying on this statement. Certainly a graduate student career.
    No categories
     
    Export citation  
     
    Bookmark  
  46. Strict reverse mathematics draft.Harvey M. Friedman - unknown
    NOTE: This is an expanded version of my lecture at the special session on reverse mathematics, delivered at the Special Session on Reverse Mathematics held at the Atlanta AMS meeting, on January 6, 2005.
     
    Export citation  
     
    Bookmark  
  47. Strict reverse mathematics.Harvey M. Friedman - unknown
    An extreme kind of logic skeptic claims that "the present formal systems used for the foundations of mathematics are artificially strong, thereby causing unnecessary headaches such as the Gödel incompleteness phenomena". The skeptic continues by claiming that "logician's systems always contain overly general assertions, and/or assertions about overly general notions, that are not used in any significant way in normal mathematics. For example, induction for all statements, or even all statements of certain restricted forms, is far too general - mathematicians (...)
     
    Export citation  
     
    Bookmark  
  48. Phenomenological Teleology and Human Interactivity.R. Gahrn-Andersen & M. I. Harvey - 2016 - Constructivist Foundations 11 (2):224-226.
    Open peer commentary on the article “Lived Experience and Cognitive Science Reappraising Enactivism’s Jonasian Turn” by Mario Villalobos & Dave Ward. Upshot: We argue that Villalobos and Ward’s criticism misses two crucial aspects of Varelian enactivism. These are, first, that enactivism attempts to offer a rigorous scientific justification for its teleological claims, and second, that enactivism in fact pays too little attention to the nature of human phenomenology and intentionality, rather than anthropomorphically over-valuing it.
     
    Export citation  
     
    Bookmark  
  49. Issues in the Foundations of Mathematics.Harvey M. Friedman - unknown
    C. To what extent, and in what sense, is the natural hierarchy of logical strengths rep resented by familiar systems ranging from exponential function arithmetic to ZF + j:V Æ V robust?
     
    Export citation  
     
    Bookmark  
  50. What is o-minimality?Harvey M. Friedman - 2008 - Annals of Pure and Applied Logic 156 (1):59-67.
    We characterize the o-minimal expansions of the ring of real numbers, in mathematically transparent terms. This should help bridge the gap between investigators in o-minimality and mathematicians unfamiliar with model theory, who are concerned with such notions as non oscillatory behavior, tame topology, and analyzable functions. We adapt the characterization to the case of o-minimal expansions of an arbitrary ordered ring.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
1 — 50 / 962