#### Filter Results:

- Full text PDF available (4)

#### Publication Year

1988

2013

- This year (0)
- Last 5 years (1)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- M. H. Mourgues, Jean-Pierre Ressayre
- J. Symb. Log.
- 1993

- Jacques Duparc, Olivier Finkel, Jean-Pierre Ressayre
- Theor. Comput. Sci.
- 2001

(I) Wadge de ned a natural re nement of the Borel hierarchy, now called the Wadge hierarchy WH. The fundamental properties of WH follow from the results of Kuratowski, Martin, Wadge and Louveau. We give a transparent restatement and proof of Wadge’s main theorem. Our method is new for it yields a wide and unexpected extension: from Borel sets of reals to a… (More)

- Jean-Pierre Ressayre
- J. Symb. Log.
- 1988

- Sedki Boughattas, Jean-Pierre Ressayre
- ITA
- 2008

(1) Shepherdson proved that a discrete unitary commutative semi-ring A satisfies IE0 (induction scheme restricted to quantifier free formulas) iff A is integral part of a real closed field; and Berarducci asked about extensions of this criterion when exponentiation is added to the language of rings. Let T range over axiom systems for ordered fields with… (More)

- Jacques Duparc, Olivier Finkel, Jean-Pierre Ressayre
- Logic, Computation, Hierarchies
- 2013

We describe the Wadge hierarchy of the ω-languages recognized by deterministic Petri nets. This is an extension of the celebrated Wagner hierarchy which turned out to be the Wadge hierarchy of the ω-regular languages. Petri nets are more powerful devices than finite automata. They may be defined as partially blind multi-counter automata. We show that the… (More)

- Olivier Finkel, Jean-Pierre Ressayre
- J. Symb. Log.
- 1996

- Sedki Boughattas, Jean-Pierre Ressayre
- Ann. Pure Appl. Logic
- 2010

- Olivier Finkel, Jean-Pierre Ressayre, Pierre Simonnet
- ArXiv
- 2008

We consider the set Rω(Γ, D) of infinite real traces, over a dependence alphabet (Γ, D) with no isolated letter, equipped with the topology induced by the prefix metric. We then prove that all rational languages of infinite real traces are analytic sets. We reprove also that there exist some rational languages of infinite real traces which are analytic but… (More)

- Jean-Pierre Ressayre
- Theor. Comput. Sci.
- 2001

- Jean-Pierre Ressayre
- Annals of Mathematics and Artificial Intelligence
- 1996

This paper presents the contents of a talk given in December 1990, during the second “Journées sur les Arithmétiques Faibles” held at the LITP, Paris; the talk was repeated during the 1991 Ecole de Printemps of Méjannes le Clap. The paper proves a polynomial time computability result for a class of NP inter co-NP problems, for which only the obvious… (More)