Skip to search formSkip to main contentSkip to account menu

Cylindric numbering

In computability theory a cylindric numbering is a special kind of numbering first introduced by Yuri L. Ershov in 1973. If a numberings is reducible… 
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
We present a real-world robotic agent that is capable of transferring grasping strategies across objects that share similar parts… 
2012
2012
The letter considers dynamics of helical vortices and helical-vortex rings either solving directly the equations of motions of a… 
2010
2010
In stack and queue layouts the vertices of a graph are linearly ordered from left to right, where each edge corresponds to an… 
Highly Cited
2007
Highly Cited
2007
  • R. Hirsch
  • Journal of Symbolic Logic
  • 2007
  • Corpus ID: 6885681
Abstract We show, for any ordinal γ ≥ 3, that the class ℜaCAγ is pseudo-elementary and has a recursively enumerable elementary… 
2006
2006
Universal algebra [5, 9, 4] is the theory of equalities t = u. It is a simple framework within which we can study mathematical… 
2004
2004
  • H. Hamperl
  • Archiv für Gynäkologie
  • 2004
  • Corpus ID: 22289348
ZusammenfassungEs besteht kein beweisender Anhaltspunkt dafür, daß die kongenitale Pseudoerosion (Fischel) in die Pseudoerosion… 
Highly Cited
1997
Highly Cited
1997
A boolean algebra is shown to be completely representable if and only if it is atomic, whereas it is shown that neither the class… 
Highly Cited
1995
Highly Cited
1995
For an arbitrary similarity type of Boolean Algebras with Operators we define a class ofSahlqvist identities. Sahlqvist… 
Highly Cited
1993
Highly Cited
1993
In this note we remark upon some relationships between the ideas of an approximation space and rough sets due to Pawlak ([9] and… 
Highly Cited
1984
Highly Cited
1984