Skip to search formSkip to main contentSkip to account menu

BIT predicate

Known as: Ackermann coding 
In mathematics and computer science, the BIT predicate or Ackermann coding, sometimes written BIT(i, j), is a predicate which tests whether the jth… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Pedestrian accidents are a serious and growing problem in the cities of developing countries, especially in Dhaka, the capital of… 
2014
2014
0. Introduction. It is generally accepted that verb forms in Russian are inflected for features of the sentence in which they… 
2014
2014
Proponents of the predicate view of names explain the reference of an occurrence of a name N by invoking the property of bearing… 
2008
2008
  • Xiaoping Zhou
  • Information Processing Letters
  • 2008
  • Corpus ID: 22464824
2008
2008
Recently, a strong link has been discovered between supermodularity on lattices and tractability of optimization problems known… 
Highly Cited
2003
Highly Cited
2003
The significance of “being similar” in the inference of species relationships is refuted once again (see also Hennig, 1966… 
2002
2002
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Linguistics and Philosophy, 2002. 
2000
2000
We give a combinatorial method for proving elementary equivalence in first-order logic FO with counting modulo n quantifiers Dn… 
Highly Cited
1978
Highly Cited
1978
The semantics of the nondeterministic and noncontinuous constructs of the descriptive and applicative parts of the wide spectrum…