#### Filter Results:

#### Publication Year

1989

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Leszek Pacholski, Wieslaw Szwast, Lidia Tendera
- SIAM J. Comput.
- 2000

Let C 2 p denote the class of rst order sentences with two variables and with additional quantiiers \there exists exactly (at most, at least) i", for i p, and let C 2 be the union of C 2 p taken over all integers p. We prove that the satissability problem for C 2 1 sentences is NEXPTIME-complete. This strengthens the results by E. Grr adel, Ph. Kolaitis and… (More)

- Wieslaw Szwast, Lidia Tendera
- STACS
- 2013

We show that the satisfiability problem for the two-variable first-order logic, FO 2 , over transitive structures when only one relation is required to be transitive, is decidable. The result is optimal, as FO 2 over structures with two transitive relations, or with one transitive and one equivalence relation, are known to be undecidable, so in fact, our… (More)

- Wieslaw Szwast, Lidia Tendera
- Ann. Pure Appl. Logic
- 2004

The guarded fragment with transitive guards, [GF+TG], is an extension of the guarded fragment of ÿrst-order logic, GF, in which certain predicates are required to be transitive, transitive predicate letters appear only in guards of the quantiÿers and the equality symbol may appear everywhere. We prove that the decision problem for [GF+TG] is decidable.… (More)

- Leszek Pacholski, Wieslaw Szwast, Lidia Tendera
- LICS
- 1997

- Wieslaw Szwast, Lidia Tendera
- LICS
- 2001

- Leszek Pacholski, Wieslaw Szwast
- Inf. Comput.
- 1993

- Leszek Pacholski, Wieslaw Szwast
- FOCS
- 1989

- Leszek Pacholski, Wieslaw Szwast
- J. Symb. Log.
- 1991

- Wieslaw Szwast, Lidia Tendera
- LPAR
- 2005

- Leszek Pacholski, Wieslaw Szwast
- LICS
- 1991