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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1953-2014
0119532013

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Motivated by the unusual patterns and dyn amics of the Arab Spring, we construct a model explaining the vulnerability of the… (More)
  • table 1
  • figure 1
Is this relevant?
2011
2011
This article shows that there exist two particular linear orders such that firstorder logic with these two linear orders has the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2005
2005
Two studies looked at whether children used transitivity as a structural cue to telicity semantics. Telicity comprehension was… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Review
2003
Review
2003
The significance of ‘‘being similar’’ in the inference of species relationships is refuted once again (see also Hennig, 1966… (More)
Is this relevant?
2001
2001
This report is intended as a companion to another report, Asymmetry and Reverse Transfers in Metaphor, [Barnden et al., 2002]. In… (More)
Is this relevant?
2000
2000
We investigate the complexity of the xed-points of bounded formulas in the context of nite set theory; that is, in the context of… (More)
Is this relevant?
1999
1999
The ordered conjecture states that least fixed-point logic LFP is strictly more expressive than first-order logic FO on every… (More)
Is this relevant?
1998
1998
Building upon the known generalized-quantifier-based first-order characterization of LOGCFL, we lay the groundwork for a deeper… (More)
Is this relevant?
1986
1986
 
Is this relevant?
1954
1954
 
Is this relevant?