default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexis Bès
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j15]Alexis Bès, Christian Choffrut:
Decidability of Definability Issues in the Theory of Real Addition. Fundam. Informaticae 188(1): 15-39 (2022)- 2021
- [j14]Alexis Bès, Christian Choffrut:
Theories of real addition with and without a predicate for integers. Log. Methods Comput. Sci. 17(2) (2021) - 2019
- [j13]Alexis Bès, Christian Choffrut:
Complexity and (Un)decidability of Fragments of 〈 ω ω λ ;× 〉. Fundam. Informaticae 164(1): 1-15 (2019) - 2013
- [j12]Alexis Bès:
Expansions of MSO by cardinality relations. Log. Methods Comput. Sci. 9(4) (2013) - 2012
- [j11]Alexis Bès, Alexander Rabinovich
:
On countable chains having decidable monadic theory. J. Symb. Log. 77(2): 593-608 (2012) - 2011
- [j10]Alexis Bès, Alexander Rabinovich:
Decidable Expansions of Labelled Linear Orderings. Log. Methods Comput. Sci. 7(2) (2011) - 2010
- [j9]Nicolas Bedon, Alexis Bès, Olivier Carton, Chloe Rispal:
Logic and Rational Languages of Words Indexed by Linear Orderings. Theory Comput. Syst. 46(4): 737-760 (2010) - 2008
- [j8]Alexis Bès, Patrick Cégielski:
Weakly maximal decidable structures. RAIRO Theor. Informatics Appl. 42(1): 137-145 (2008) - [j7]Alexis Bès:
An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet. Log. Methods Comput. Sci. 4(1) (2008) - 2006
- [j6]Alexis Bès, Olivier Carton:
A Kleene Theorem for Languages of Words Indexed by Linear Orderings. Int. J. Found. Comput. Sci. 17(3): 519-542 (2006) - 2003
- [j5]Jef Wijsen, Alexis Bès:
On query optimization in a temporal SPC algebra. Data Knowl. Eng. 44(2): 165-192 (2003) - 2000
- [j4]Alexis Bès:
An Extension of The Cobham-Semënov Theorem. J. Symb. Log. 65(1): 201-211 (2000) - 1998
- [j3]Alexis Bès, Denis Richard:
Undecidable Extensions of Skolem Arithmetic. J. Symb. Log. 63(2): 379-401 (1998) - 1997
- [j2]Alexis Bès:
On Pascal Triangles Modulo a Prime Power. Ann. Pure Appl. Log. 89(1): 17-35 (1997) - [j1]Alexis Bès:
Undecidable Extensions of Büchi Arithmetic and Cobham-Semënov Theorem. J. Symb. Log. 62(4): 1280-1296 (1997)
Conference and Workshop Papers
- 2020
- [c6]Alexis Bès, Christian Choffrut:
$\langle \mathbb {R}, +, <, 1 \rangle $ Is Decidable in $\langle \mathbb {R}, +, < , \mathbb {Z}\rangle $. LATA 2020: 128-140 - 2011
- [c5]Alexis Bès, Olivier Carton:
Algebraic Characterization of FO for Scattered Linear Orderings. CSL 2011: 67-81 - 2010
- [c4]Alexis Bès, Alexander Rabinovich:
Decidable Expansions of Labelled Linear Orderings. Fields of Logic and Computation 2010: 95-107 - 2008
- [c3]Nicolas Bedon, Alexis Bès, Olivier Carton, Chloe Rispal:
Logic and Rational Languages of Words Indexed by Linear Orderings. CSR 2008: 76-85 - 2005
- [c2]Alexis Bès, Olivier Carton:
A Kleene Theorem for Languages of Words Indexed by Linear Orderings. Developments in Language Theory 2005: 158-167 - 2001
- [c1]Jef Wijsen, Alexis Bès:
Temporal Tableau Queries. TIME 2001: 136-143
Informal and Other Publications
- 2020
- [i4]Alexis Bès, Christian Choffrut:
Theories of real addition with and without a predicate for integers. CoRR abs/2002.04282 (2020) - 2018
- [i3]Alexis Bès, Christian Choffrut:
Complexity and (un)decidability of fragments of 〈 ωωλ; × 〉. CoRR abs/1803.01418 (2018) - [i2]Alexis Bès, Christian Choffrut:
Decidability of the existential fragment of some infinitely generated trace monoids: an application to ordinals. CoRR abs/1805.03028 (2018) - 2008
- [i1]Alexis Bès:
An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet. CoRR abs/0801.2498 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
