Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

5 relations
Computability theoryCylindrificationGödel numberingNumbering (computability theory)

Broader (1)

Theory of computation

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
Learning a dictionary of prototypical grasp-predicting parts from grasping experience
We present a real-world robotic agent that is capable of transferring grasping strategies across objects that share similar parts… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table I
Is this relevant?
2012
2012
Dynamics of helical vortices and helical-vortex rings
The letter considers dynamics of helical vortices and helical-vortex rings either solving directly the equations of motions of a… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Relation algebra reducts of cylindric algebras and complete representations
There is a version of this in JSL but that version contains an error and is followed by an erratum. The erratum is encorporated… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2006
2006
Nominal Algebra
Universal algebra [5, 9, 4] is the theory of equalities t = u. It is a simple framework within which we can study mathematical… Expand
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Complete Representations in Algebraic Logic
A boolean algebra is shown to be completely representable if and only if it is atomic, whereas it is shown that neither the class… Expand
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Sahlqvist's theorem for boolean algebras with operators with an application to cylindric algebras
For an arbitrary similarity type of Boolean Algebras with Operators we define a class ofSahlqvist identities. Sahlqvist… Expand
  • figure 2
  • figure 4
Is this relevant?
Highly Cited
1993
Highly Cited
1993
On connections between information systems, rough sets and algebraic logic
In this note we remark upon some relationships between the ideas of an approximation space and rough sets due to Pawlak ([9] and… Expand
Is this relevant?
Highly Cited
1991
Highly Cited
1991
The semantic foundations of concurrent constraint programming
Concurrent constraint programming [Sar89 ,SR90] is a simple and powerful model of concurrent computation based on the notions of… Expand
Is this relevant?
1990
1990
Introductory course on relation algebras, finite-dimensional cylindric algebras, and their interc
These are notes for a short course on relation algebras, nite-dimensional cylindric algebras, and their interconnections… Expand
Is this relevant?
Highly Cited
1984
Highly Cited
1984
The Relational Model of Data and Cylindric Algebras
Abstract It is shown how the theory of cylindric algebras (a notion introduced by Tarski and others as a tool in the… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE