About: Leo Harrington     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : umbel-rc:Scientist, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon
http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FLeo_Harrington&invfp=IFP_OFF&sas=SAME_AS_OFF&graph=http%3A%2F%2Fdbpedia.org&graph=http%3A%2F%2Fdbpedia.org

Leo Anthony Harrington (born May 17, 1946) is a professor of mathematics at the University of California, Berkeley who works in recursion theory, model theory, and set theory.Having retired from being a Mathematician, Professor Leo Harrington is now a Philosopher. His notable results include proving the Paris–Harrington theorem along with Jeff Paris,showing that if the axiom of determinacy holds for all analytic sets then x# exists for all reals x,and proving with Saharon Shelah that the first-order theory of the partially ordered set of recursively enumerable Turing degrees is undecidable.

AttributesValues
rdf:type
rdfs:label
  • ليو هارينجتون (ar)
  • Leo Harrington (de)
  • Leo Harrington (fr)
  • Leo Harrington (en)
  • Leo Harrington (pt)
  • Харрингтон, Лео (ru)
rdfs:comment
  • ليو هارينجتون (بالإنجليزية: Leo Harrington)‏ هو رياضياتي وفيلسوف أمريكي، ولد في 17 مايو 1946. (ar)
  • Leo Anthony Harrington (born May 17, 1946) is a professor of mathematics at the University of California, Berkeley who works in recursion theory, model theory, and set theory.Having retired from being a Mathematician, Professor Leo Harrington is now a Philosopher. His notable results include proving the Paris–Harrington theorem along with Jeff Paris,showing that if the axiom of determinacy holds for all analytic sets then x# exists for all reals x,and proving with Saharon Shelah that the first-order theory of the partially ordered set of recursively enumerable Turing degrees is undecidable. (en)
  • Leo Anthony Harrington, né le 17 mai 1946, est un professeur de mathématiques américain qui travaille à l'université de Californie à Berkeley, et dont les travaux portent sur la théorie de la calculabilité, la théorie des modèles et la théorie des ensembles. Harrington et Jeff Paris ont notamment prouvé le (en). (fr)
  • Лео Энтони Харрингтон (англ. Leo Anthony Harrington; род. 17 мая 1946 США) — американский математик, профессор Калифорнийского университета в Беркли, специалист по теориям вычислимости, моделей и множеств. * В 1977 году совместно с Джеффом Парисом опубликовал доказательство теоремы Париса–Харрингтона. * Харрингтон доказал, что аксиома точна для всех , то есть существует для каждого числа. * Харрингтон и Сахарон Шелах показали, что теория упорядочения рекурсивно перечисляемых . (ru)
  • Leo Anthony Harrington (* 17. Mai 1946) ist ein US-amerikanischer Mathematiker, der sich mit mathematischer Logik und Mengenlehre beschäftigt. Harrington promovierte 1973 am Massachusetts Institute of Technology bei Gerald E. Sacks (Contributions to Recursion Theory on Higher Types). Er ist Professor an der University of California, Berkeley. Harrington bewies 1977 mit Jeff Paris die Unentscheidbarkeit eines Satzes innerhalb der Peano-Arithmetik. 1995 war er Gödel-Lecturer (Gödel, Heidegger, and Direct Perception (or, Why I am a Recursion Theorist)). Zu seinen Doktoranden zählt Ehud Hrushovski. (de)
  • Leo Anthony Harrington (17 de maio de 1946) é um matemático estadunidense. Harrington obteve um doutorado em 1973 no Instituto de Tecnologia de Massachusetts, orientado por Gerald Sacks, com a tese Contributions to Recursion Theory on Higher Types. É professor da Universidade da Califórnia em Berkeley. Harrington provou em 1977 com Jeff Paris a indeterminação de um teorema pertencente à aritmética de Peano. Em 1995 foi Gödel Lecturer (Gödel, Heidegger, and Direct Perception (or, Why I am a Recursion Theorist)). Dentre seus doutorandos consta Ehud Hrushovski. (pt)
foaf:name
  • Leo A. Harrington (en)
name
  • Leo A. Harrington (en)
foaf:depiction
  • http://commons.wikimedia.org/wiki/Special:FilePath/Leo_Harrington.jpg
birth date
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 59 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software