In mathematics, a unary operation is an operation with only one operand, i.e. a single input. An example is the function f : A → A, where A is a set… (More)

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

Highly Cited

2014

Highly Cited

2014

- Greg Durrett, Dan Klein
- TACL
- 2014

We present a joint model of three core tasks in the entity analysis stack: coreference resolution (within-document clustering… (More)

Is this relevant?

2012

2012

- Alan J. Cain, Nikola Ruskuc, Richard M. Thomas
- IJAC
- 2012

Automatic presentations, also called FA-presentations, were introduced to extend finite model theory to infinite structures… (More)

Is this relevant?

2005

2005

- Péter P. Pálfy
- 2005

The unary algebraic functions of an algebra already determine the congruences. Therefore , investigations of algebras with some… (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- Kousha Etessami, Moshe Y. Vardi, Thomas Wilke
- LICS
- 1997

We investigate the power of first-order logic with only two variables over ω-words and finite words, a logic denoted by FO. We… (More)

Is this relevant?

1997

1997

- Jouko A. Väänänen
- Journal of Logic, Language and Information
- 1997

In this paper (except in Section 5) all quantifiers are assumed to be so called simple unary quantifiers, and all models are… (More)

Is this relevant?

1996

1996

- Adam J. Grove, Joseph Y. Halpern, Daphne Koller
- J. Symb. Log.
- 1996

Motivated by problems that arise in computing degrees of belief, we consider the problem of computing asymptotic conditional… (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

The theory of rough sets is an extension of set theory with two additional unary set-theoretic operators deened based on a binary… (More)

Is this relevant?

Highly Cited

1989

Highly Cited

1989

- Czesław Byliński
- 1989

Let A be a set. A unary operation on A is a function from A into A. A binary operation on A is a function from [:A, A :] into A… (More)

Is this relevant?

Highly Cited

1986

Highly Cited

1986

- Marek Chrobak
- Theor. Comput. Sci.
- 1986

We prove that O(e " t'/gT-~g~") states are sufficient to simulate an n-state lnfa recognizing a unary language by a ldfa. The… (More)

Is this relevant?

Highly Cited

1972

Highly Cited

1972

- Kit Fine
- Notre Dame Journal of Formal Logic
- 1972

Ordinary modal logic deals with the notion of a proposition being true in at least one possible world. This makes it natural to… (More)

Is this relevant?