| Publication | Date of Publication | Type |
|---|
Decidability of Definability Issues in the Theory of Real Addition
Fundamenta Informaticae | 2023-03-09 | Paper |
scientific article; zbMATH DE number 7379289 (Why is no real title available?)
| 2021-08-05 | Paper |
Decidability of definability issues in the theory of real addition
| 2021-02-11 | Paper |
\(\langle\mathbb{R},+,<,1\rangle\) is decidable in \(\langle \mathbb{R},+,<,\mathbb{Z}\rangle\)
| 2020-07-27 | Paper |
Theories of real addition with and without a predicate for integers
| 2020-02-11 | Paper |
Complexity and (un)decidability of fragments of \(\langle \omega^{\omega^{\lambda}};\times\rangle\)
Fundamenta Informaticae | 2019-06-14 | Paper |
Decidability of the existential fragment of some infinitely generated trace monoids: an application to ordinals
| 2018-05-08 | Paper |
Expansions of MSO by cardinality relations
Logical Methods in Computer Science | 2014-01-08 | Paper |
Algebraic characterization of FO for scattered linear orderings
| 2012-09-18 | Paper |
On countable chains having decidable monadic theory
The Journal of Symbolic Logic | 2012-06-19 | Paper |
Decidable expansions of labelled linear orderings
Logical Methods in Computer Science | 2011-05-26 | Paper |
Decidable expansions of labelled linear orderings
Lecture Notes in Computer Science | 2010-09-03 | Paper |
Logic and rational languages of words indexed by linear orderings
Theory of Computing Systems | 2010-08-13 | Paper |
Nonmaximal decidable structures
Journal of Mathematical Sciences (New York) | 2010-01-15 | Paper |
An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet
Logical Methods in Computer Science | 2008-08-07 | Paper |
Weakly maximal decidable structures
RAIRO - Theoretical Informatics and Applications | 2008-07-21 | Paper |
Logic and Rational Languages of Words Indexed by Linear Orderings
Computer Science – Theory and Applications | 2008-06-05 | Paper |
A KLEENE THEOREM FOR LANGUAGES OF WORDS INDEXED BY LINEAR ORDERINGS
International Journal of Foundations of Computer Science | 2006-08-14 | Paper |
Developments in Language Theory
Lecture Notes in Computer Science | 2006-06-23 | Paper |
scientific article; zbMATH DE number 1827828 (Why is no real title available?)
| 2003-07-14 | Paper |
Decidability and definability results related to the elementary theory of ordinal multiplication
Fundamenta Mathematicae | 2002-02-21 | Paper |
An extension of the Cobham-Semënov Theorem
Journal of Symbolic Logic | 2001-03-19 | Paper |
scientific article; zbMATH DE number 1192199 (Why is no real title available?)
| 1999-02-04 | Paper |
Undecidable extensions of Skolem arithmetic
Journal of Symbolic Logic | 1998-10-07 | Paper |
Undecidable extensions of Büchi arithmetic and Cobham-Semënov Theorem
Journal of Symbolic Logic | 1998-09-21 | Paper |
On Pascal triangles modulo a prime power
Annals of Pure and Applied Logic | 1998-06-22 | Paper |
scientific article; zbMATH DE number 952488 (Why is no real title available?)
| 1997-02-24 | Paper |
