Skip to search formSkip to main contentSkip to account menu

Recursively inseparable sets

Known as: Effectively inseparable, Effectively separable sets, Effectively separable set 
In computability theory, recursively inseparable sets are pairs of sets of natural numbers that cannot be "separated" with a recursive set (Monk 1976… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
espanol«Y la una no se mueve sin la otra» es un texto de 1979 de Luce Irigaray, esa feminista francesa de la diferencia que… 
2015
2015
La relacion entre el arte y el conocimiento no solo es estrecha, directa e inseparable; ademas ancla sus raices en el propio… 
2010
2010
We show the non-arithmeticity of 1st order theories of lattices of Σn sentences modulo provable equivalence in a formal theory… 
2009
2009
In her response to Professor Golden's Principles of Patent Remedies, Professor Landers identifies three threads that underlie the… 
2008
2008
S OF PAPERS 899 Indecomposability is a weakening of the concept of measurability; indeed, inaccessible cardinals carrying… 
1990
1990
espanolSe presenta la experiencia durante un ario de visita domiciliaria del recien nacido, dentro de un Area Basica de Salud en… 
1984
1984
Presentation de trois problemes de decision naturels: un pour les problemes de correspondance et de grammaires CF lineaires, un…