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)

Semantic Scholar uses AI to extract papers important to this topic.

2014

2014

- Dmitry Dagaev, Natalia Lamberova, Anton Sobolev
- 2014

Motivated by the unusual patterns and dyn amics of the Arab Spring, we construct a model explaining the vulnerability of theâ€¦Â (More)

Is this relevant?

2011

2011

- Nicole Schweikardt, Thomas Schwentick
- Logical Methods in Computer Science
- 2011

This article shows that there exist two particular linear orders such that firstorder logic with these two linear orders has theâ€¦Â (More)

Is this relevant?

2005

2005

- Laura J. Wagner
- 2005

Two studies looked at whether children used transitivity as a structural cue to telicity semantics. Telicity comprehension wasâ€¦Â (More)

Is this relevant?

Review

2003

Review

2003

- Arnold G. Kluge
- 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

- Albert Atserias
- CSL
- 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

- Albert Atserias, Phokion G. Kolaitis
- LICS
- 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

1954