Search results for 'M. Timur Friedman' (try it on Scholar)

166 found
Sort by:
  1. H. Friedman (1995). Sheard, M., See Friedman, H. Annals of Pure and Applied Logic 71:307.score: 1460.0
     
    My bibliography  
     
    Export citation  
  2. Harvey Friedman, A Complete Theory of Everything: Satisfiability in the Universal Domain Harvey M. Friedman October 10, 1999 Friedman@Math.Ohio-State.Edu Www.Math.Ohio-State.Edu/~Friedman/. [REVIEW]score: 1260.0
    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.
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  3. Harvey Friedman, A Complete Theory of Everything: Satisfiability in the Universal Domain Harvey M. Friedman October 10, 1999 Friedman@Math.Ohio-State.Edu. [REVIEW]score: 1260.0
    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.
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  4. Edwina L. Rissland, David B. Skalak & M. Timur Friedman (1996). BankXX: Supporting Legal Arguments Through Heuristic Retrieval. [REVIEW] Artificial Intelligence and Law 4 (1):1-71.score: 870.0
    The BankXX system models the process of perusing and gathering information for argument as a heuristic best-first search for relevant cases, theories, and other domain-specific information. As BankXX searches its heterogeneous and highly interconnected network of domain knowledge, information is incrementally analyzed and amalgamated into a dozen desirable ingredients for argument (called argument pieces), such as citations to cases, applications of legal theories, and references to prototypical factual scenarios. At the conclusion of the search, BankXX outputs the set of argument (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  5. Edwina L. Rissland, David B. Skalak & M. Timur Friedman (1997). Evaluating a Legal Argument Program: The BankXX Experiments. [REVIEW] Artificial Intelligence and Law 5 (1-2):1-74.score: 870.0
    In this article we evaluate the BankXX program from several perspectives. BankXX is a case-based legal argument program that retrieves cases and other legal knowledge pertinent to a legal argument through a combination of heuristic search and knowledge-based indexing. The program is described in detail in a companion article in Artificial Intelligence and Law 4: 1--71, 1996. Three perspectives are used to evaluate BankXX:(1) classical information retrieval measures of precision and recall applied against a hand-coded baseline; (2) knowledge-representation and case-based (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  6. Harvey M. Friedman, Friedman@Math.Ohio-State.Edu.score: 540.0
    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.
    No categories
    Translate to English
    | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  7. Hannah Friedman (2011). Mining (A.M.) Hirt Imperial Mines and Quarries in the Roman World. Organizational Aspects 27 BC – AD 235. Pp. Xiv + 551, Maps. Oxford: Oxford University Press, 2010. Cased £80. ISBN: 978-0-19-957287-8. [REVIEW] The Classical Review 61 (02):612-613.score: 360.0
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  8. Harvey Friedman, 4:00 P.M., F Sep 20.score: 360.0
    There are many familiar theorems whose proofs use methods which are in some appropriate sense substantially more "abstract" than its statement. Some particularly well known examples come from the use of complex variables in number theory. Sometimes such abstraction can be removed - for example by the "elementary proof of the prime number theorem" - and sometimes no appropriate removal is known. The interest in removing abstraction typically varies, with no agreed upon criteria for appropriateness. E.g., the removal might sacrifice (...)
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  9. S. D. Friedman, W. G. Handley, S. S. Wainer, A. Joyal, I. Moerdijk, L. Newelski, F. van Engelen & J. van Oosten (1994). Downey, R., Gasarch, W. And Moses, M., The Structure. Annals of Pure and Applied Logic 70:287.score: 360.0
     
    My bibliography  
     
    Export citation  
  10. Sy D. Friedman (1992). Martin Donald A.. The Largest Countable This, That, and the Other. Cabal Seminar 79–81, Proceedings, Caltech-UCLA Logic Seminar 1979–81, Edited by Kechris AS, Martin DA, and Moschovakis YN, Lecture Notes in Mathematics, Vol. 1019, Springer-Verlag, Berlin, Heidelberg, New York, and Tokyo, 1983, Pp. 97–106. Kechris Alexander S., Martin Donald A., and Solovay Robert M.. Introduction to Q-Theory. Cabal Seminar 79–81, Proceedings, Caltech-UCLA Logic Seminar 1979–81, Edited by Kechris AS, Martin DA, and ... [REVIEW] Journal of Symbolic Logic 57 (1):262-264.score: 360.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  11. Sy D. Friedman (1992). Review: Donald A. Martin, A. S. Kechris, D. A. Martin, Y. N. Moschovakis, The Largest Countable This, That, and the Other; Alexander S. Kechris, Donald A. Martin, Robert M. Solovay, Introduction to $Q$-Theory; Steve Jackson, A. S. Kechris, D. A. Martin, J. R. Steel, AD and the Projective Ordinals. [REVIEW] Journal of Symbolic Logic 57 (1):262-264.score: 360.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  12. Harvey M. Friedman, Foundations of Mathematics: Past, Present, and Future.score: 300.0
    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 to English
    | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  13. Harvey Friedman, Ramsey Theory and Enormous Lower Bounds.score: 300.0
    by Harvey M. Friedman Department of Mathematics Ohio State University friedman@math.ohio-state.edu www.math.ohio-state.edu/~friedman/ April 5, 1997..
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  14. J. Earman & M. Friedman (1973). The Meaning and Status of Newton's Law of Inertia and the Nature of Gravitational Forces. Philosophy of Science 40 (3):329-359.score: 240.0
    A four dimensional approach to Newtonian physics is used to distinguish between a number of different structures for Newtonian space-time and a number of different formulations of Newtonian gravitational theory. This in turn makes possible an in-depth study of the meaning and status of Newton's Law of Inertia and a detailed comparison of the Newtonian and Einsteinian versions of the Law of Inertia and the Newtonian and Einsteinian treatments of gravitational forces. Various claims about the status of Newton's Law of (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  15. Lawrence M. Friedman (1994). Is There a Modern Legal Culture? Ratio Juris 7 (2):117-131.score: 240.0
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  16. Solomon Feferman, Harvey M. Friedman, Penelope Maddy & John R. Steel (2000). Does Mathematics Need New Axioms? Bulletin of Symbolic Logic 6 (4):401-446.score: 240.0
    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)  
     
    My bibliography  
     
    Export citation  
  17. Harvey M. Friedman, Agenda.score: 240.0
    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 to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  18. M. Friedman (1998). On the Sociology of Scientific Knowledge and its Philosophical Agenda. Studies in History and Philosophy of Science Part A 29 (2):239-271.score: 240.0
  19. Harvey M. Friedman, Strict Reverse Mathematics.score: 240.0
    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 (...)
    Translate to English
    | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  20. M. Friedman (2003). Transcendental Philosophy and Mathematical Physics. Studies in History and Philosophy of Science Part A 34 (1):29-43.score: 240.0
    This paper explores the relationship between Kant's views on the metaphysical foundations of Newtonian mathematical physics and his more general transcendental philosophy articulated in the Critique of Pure Reason. I argue that the relationship between the two positions is very close indeed and, in particular, that taking this relationship seriously can shed new light on the structure of the transcendental deduction of the categories as expounded in the second edition of the Critique.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  21. Harvey M. Friedman, Vigre Lectures.score: 240.0
    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.
    No categories
    Translate to English
    | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  22. Harvey M. Friedman, Concrete Incompleteness From Efa Through Large Cardinals.score: 240.0
    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 to English
    | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  23. Harvey M. Friedman, Shocking(?) Unprovability.score: 240.0
    Mathematical Logic had a glorious period in the 1930s, which was briefly rekindled in the 1960s. Any Shock Value, such as it is, has surrounded unprovability from ZFC.
    No categories
    Translate to English
    | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  24. Harvey M. Friedman, Concept Calculus: Much Better Than.score: 240.0
    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.
    No categories
    Translate to English
    | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  25. Harvey M. Friedman, Concrete Mathematical Incompleteness.score: 240.0
    there are mathematical statements that cannot be proved or refuted using the usual axioms and rules of inference of mathematics.
    Translate to English
    | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  26. Harvey M. Friedman, From Russell's Paradox To.score: 240.0
    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.
    Translate to English
    | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  27. Harvey M. Friedman, A Complete Theory of Everything: Satisfiability in the Universal Domain.score: 240.0
    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.
    No categories
    Translate to English
    | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  28. Sandra Lee Bartky, Marilyn Friedman, William Harper, Alison M. Jaggar, Richard H. Miller, Abigail L. Rosenthal, Naomi Scheman, Nancy Tuana, Steven Yates, Christina Sommers, Philip E. Devine, Harry Deutsch, Michael Kelly & Charles L. Reid (1992). Letters to the Editor. Proceedings and Addresses of the American Philosophical Association 65 (7):55 - 90.score: 240.0
  29. Harvey M. Friedman, P 1 INCOMPLETENESS: Finite Set Equations.score: 240.0
    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.
    No categories
    Translate to English
    | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  30. M. Friedman (2009). The Heart of Justice: Care Ethics and Political Theory. Philosophical Review 118 (2):256-258.score: 240.0
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  31. Corrinne Bedecarre, Marilyn Friedman, Lisa M. Heldke, Robert C. Koons, Daniel Bonevac, Carol A. Mickett, Richard J. McGowan, Lynn Hankinson Nelson, Steven Yates & Leonard D. Katz (1993). Letters to the Editor. Proceedings and Addresses of the American Philosophical Association 67 (1):23 - 36.score: 240.0
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  32. Harvey M. Friedman, Foundational Adventures for the Future.score: 240.0
    • 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 to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  33. Harvey M. Friedman, Unprovable Theorems.score: 240.0
    I don’t remember if I got as high as 2-390, but I distinctly remember taking my first logic course - as a Freshman - with Hartley Rogers, in Fall 1964 - here in 2-190. Or was it in 2-290?
    No categories
    Translate to English
    | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  34. Harvey M. Friedman, Boolean Relation Theory.score: 240.0
    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 to English
    | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  35. Harvey M. Friedman, Philosophy 536 Philosophy of Mathematics Lecture 1 9/25/02.score: 240.0
    This distinction between logic and mathematics is subject to various criticisms and can be given various defenses. Nevertheless, the division seems natural enough and is commonly adopted in presentations of the standard foundations for mathematics.
    Translate to English
    | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  36. Harvey M. Friedman, Decision Problems in Strings and Formal Methods.score: 240.0
    We focus on two formal methods contexts which generate investigations into decision problems for finite strings.
    No categories
    Translate to English
    | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  37. Lawrence M. Friedman (1988). On The Interpretation Of Laws. Ratio Juris 1 (3):252-262.score: 240.0
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  38. Harvey M. Friedman, The Interpretation of Set Theory in Mathematical Predication Theory.score: 240.0
    This paper was referred to in the Introduction in our paper [Fr97a], “The Axiomatization of Set Theory by Separation, Reducibility, and Comprehension.” In [Fr97a], all systems considered used the axiom of Extensionality. This is appropriate in a set theoretic context.
    Translate to English
    | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  39. Harvey M. Friedman, Table of Contents.score: 240.0
    In fact, Godel gave an important model of pure predication, where he showed that restricted comprehension without parameters is valid, but where restricted comprehension with parameters is not (although this invalidity was not established until Cohen). This is the model based on ordinal definability in set theory.
    No categories
    Translate to English
    | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  40. Kenneth S. Friedman, Donald Gotterbarn, M. Glouberman, Bryan G. Norton, David S. Schwarz & Walter P. Van Stigt (1979). Book Reviews. [REVIEW] Philosophia 9 (1):805-813.score: 240.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  41. Harvey M. Friedman (2001). Subtle Cardinals and Linear Orderings. Annals of Pure and Applied Logic 107 (1-3):1-34.score: 240.0
    No categories
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  42. Harvey M. Friedman, Strict Reverse Mathematics Draft.score: 240.0
    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.
    Translate to English
    | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  43. Robert M. Friedman (1975). Merleau-Ponty's Theory of Subjectivity. Philosophy Today 19 (3):228-242.score: 240.0
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  44. Harvey M. Friedman, Remarks On GÖDel Phenomena and the Field of Reals.score: 240.0
    A lot of the well known impact of the Gödel phenomena is in the form of painful messages telling us that certain major mathematical programs cannot be completed as intended. This aspect of Gödel – the delivery of bad news –is not welcomed, and defensive measures are now in place.
    No categories
    Translate to English
    | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  45. Richard M. Dubiel, Lawrence Souder, Lee Anne Peck, James M. Haney, Muriel R. Friedman & Ian Marquand (2004). Book Reviews. [REVIEW] Journal of Mass Media Ethics 19 (3 & 4):307 – 320.score: 240.0
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  46. Harvey M. Friedman, Applications of Large Cardinals to Graph Theory.score: 240.0
    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 to English
    | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  47. Harvey M. Friedman, Adjacent Ramsey Theory.score: 240.0
    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 to English
    | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  48. Harvey M. Friedman, Decision Procedures for Verification.score: 240.0
    We focus on two formal methods contexts which generate investigations into decision problems for finite strings.
    No categories
    Translate to English
    | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  49. Harvey M. Friedman, Decision Problems in Euclidean Geometry.score: 240.0
    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.
    No categories
    Translate to English
    | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  50. Harvey M. Friedman, Finite Phase Transitions.score: 240.0
    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..
    No categories
    Translate to English
    | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
1 — 50 / 166