• Facets (new session)
• Description
• Metadata
• Settings
  • Rule: ActivityStreamsMapasEquivalentb3sb3sifpdbprdf-labelfacetshttp://dbpedia.org/resource/inference/rules/dbpedia#http://dbpedia.org/resource/inference/rules/opencyc#http://dbpedia.org/resource/inference/rules/umbel#http://dbpedia.org/resource/inference/rules/yago#http://dbpedia.org/schema/property_rules#http://www.ontologyportal.org/inference/rules/SUMO#http://www.ontologyportal.org/inference/rules/WordNet#http://www.w3.org/2002/07/owl#ldpoplwebskos-transurn:det:rdf:labelvirtrdf-labelvirtrdf-urlNone
    
  • Inverse Functional Properties: Disabled (fastest) Apply to subjects only Apply to objects only Apply to both subjects and objects
  • "Same As": Disabled (fastest) Apply to subjects only Apply to objects only Apply to both subjects and objects (recommended) Apply to subjects, objects and predicates (not recommended on big datasets) Apply to predicates only (special use cases only)

About: Albert Muchnik     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:Whole100003553, within Data Space : dbpedia.org associated with source document(s)

Type: Thingpersonyago:WikicatLivingPeopleyago:WikicatMathematicalLogiciansyago:WikicatMoscowStatePedagogicalUniversityAlumniyago:WikicatRussianMathematiciansyago:Alumnus109786338yago:CausalAgent100007347yago:Expert109617867yago:Intellectual109621545yago:LivingThing100004258yago:Logician110269785yago:Mathematician110301261yago:Object100002684yago:Organism100004475yago:Person100007846yago:PhysicalEntity100001930yago:YagoLegalActoryago:YagoLegalActorGeoyago:Scholar110557854yago:Scientist110560637yago:Whole100003553 New Facet based on Instances of this Class

Albert Abramovich Muchnik (2 January 1934 – 14 February 2019) is a Russian mathematician who worked in the field of foundations and mathematical logic. He received his Ph.D. from Moscow State Pedagogical Institute in 1959 under the advisorship of Pyotr Novikov. Muchnik's most significant contribution was on the subject of relative computability. He and Richard Friedberg independently introduced the priority method which gave an affirmative answer to Post's problem regarding the existence of recursively enumerable Turing degrees between 0 and 0' . This result, now known as the Friedberg–Muchnik theorem, opened study of the Turing degrees of the recursively enumerable sets which turned out to possess a very complicated and non-trivial structure.