Alexis Bès

25 papers B 1C 3Misc 1Journal 19Unranked 1
YearRankTypeTitle / Venue / Authors
2022 J jnl
Decidability of Definability Issues in the Theory of Real Addition.
Fundam. Informaticae
Alexis Bès, Christian Choffrut
2021 J jnl
Theories of real addition with and without a predicate for integers.
Log. Methods Comput. Sci.
Alexis Bès, Christian Choffrut
2020 C conf
$\langle \mathbb {R}, +, <, 1 \rangle $ Is Decidable in $\langle \mathbb {R}, +, < , \mathbb {Z}\rangle $.
LATA
Alexis Bès, Christian Choffrut
2020 J jnl
Theories of real addition with and without a predicate for integers.
CoRR
Alexis Bès, Christian Choffrut
2019 J jnl
Complexity and (Un)decidability of Fragments of 〈 ω ω λ ;× 〉.
Fundam. Informaticae
Alexis Bès, Christian Choffrut
2018 J jnl
Complexity and (un)decidability of fragments of 〈 ω
CoRR
Alexis Bès, Christian Choffrut
2018 J jnl
Decidability of the existential fragment of some infinitely generated trace monoids: an application to ordinals.
CoRR
Alexis Bès, Christian Choffrut
2013 J jnl
Expansions of MSO by cardinality relations.
Log. Methods Comput. Sci.
Alexis Bès
2012 J jnl
On countable chains having decidable monadic theory.
J. Symb. Log.
Alexis Bès, Alexander Rabinovich
2011 B conf
Algebraic Characterization of FO for Scattered Linear Orderings.
CSL
Alexis Bès, Olivier Carton
2011 J jnl
Decidable Expansions of Labelled Linear Orderings
Log. Methods Comput. Sci.
Alexis Bès, Alexander Rabinovich
2010 — conf
Decidable Expansions of Labelled Linear Orderings.
Fields of Logic and Computation
Alexis Bès, Alexander Rabinovich
2010 J jnl
Logic and Rational Languages of Words Indexed by Linear Orderings.
Theory Comput. Syst.
Nicolas Bedon, Alexis Bès, Olivier Carton, Chloe Rispal
2008 J jnl
An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet
CoRR
Alexis Bès
2008 J jnl
An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet.
Log. Methods Comput. Sci.
Alexis Bès
2008 Misc conf
Logic and Rational Languages of Words Indexed by Linear Orderings.
CSR
Nicolas Bedon, Alexis Bès, Olivier Carton, Chloe Rispal
2008 J jnl
Weakly maximal decidable structures.
RAIRO Theor. Informatics Appl.
Alexis Bès, Patrick Cégielski
2006 J jnl
A Kleene Theorem for Languages of Words Indexed by Linear Orderings.
Int. J. Found. Comput. Sci.
Alexis Bès, Olivier Carton
2005 C conf
A Kleene Theorem for Languages of Words Indexed by Linear Orderings.
Developments in Language Theory
Alexis Bès, Olivier Carton
2003 J jnl
On query optimization in a temporal SPC algebra.
Data Knowl. Eng.
Jef Wijsen, Alexis Bès
2001 C conf
Temporal Tableau Queries.
TIME
Jef Wijsen, Alexis Bès
2000 J jnl
An Extension of The Cobham-Semënov Theorem.
J. Symb. Log.
Alexis Bès
1998 J jnl
Undecidable Extensions of Skolem Arithmetic.
J. Symb. Log.
Alexis Bès, Denis Richard
1997 J jnl
On Pascal Triangles Modulo a Prime Power.
Ann. Pure Appl. Log.
Alexis Bès
1997 J jnl
Undecidable Extensions of Büchi Arithmetic and Cobham-Semënov Theorem.
J. Symb. Log.
Alexis Bès