VLDB 2026 Research / reviewers in the wild / expert
Pablo Cubides Kovacsics
dblp:161/4413
· DBLP profile ↗
7ranked-venue papers
5as first author
1since 2021 · last 2023
0000-0002-9689-2132ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 7 · 5 first-author · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Topological fields with a generic derivation
Pablo Cubides Kovacsics, Françoise Point |
Ann. Pure Appl. Log. | 1 |
| 2019 | Strong density of Definable Types and closed Ordered differential FieldsabstractAbstract The following strong form of density of definable types is introduced for theoriesTadmitting a fibered dimension functiond: given a modelMofTand a definable setX⊆Mn, there is a definable typepinX, definable over a code forXand of the samed-dimension asX. Both o-minimal theories and the theory of closed ordered differential fields (CODF) are shown to have this property. As an application, we derive a new proof of elimination of imaginaries for CODF. Quentin Brouette, Pablo Cubides Kovacsics, Françoise Point |
J. Symb. Log. | 2 |
| 2017 | Clustered cell decomposition in P-minimal structures
Saskia Chambille, Pablo Cubides Kovacsics, Eva Leenknegt |
Ann. Pure Appl. Log. | 2 |
| 2017 | Topological cell Decomposition and Dimension Theory in P-Minimal FieldsabstractAbstract This paper addresses some questions about dimension theory for P-minimal structures. We show that, for any definable set A, the dimension of $\bar A\backslash A$ is strictly smaller than the dimension of A itself, and that A has a decomposition into definable, pure-dimensional components. This is then used to show that the intersection of finitely many definable dense subsets of A is still dense in A. As an application, we obtain that any definable function $f:D \subseteq {K^m} \to {K^n}$ is continuous on a dense, relatively open subset of its domain D, thereby answering a question that was originally posed by Haskell and Macpherson. In order to obtain these results, we show that P-minimal structures admit a type of cell decomposition, using a topological notion of cells inspired by real algebraic geometry. Pablo Cubides Kovacsics, Luck Darnière, Eva Leenknegt |
J. Symb. Log. | 1 |
| 2017 | A P-Minimal Structure without Definable Skolem FunctionsabstractAbstract We show there are intermediate P-minimal structures between the semialgebraic and subanalytic languages which do not have definable Skolem functions. As a consequence, by a result of Mourgues, this shows there are P-minimal structures which do not admit classical cell decomposition. Pablo Cubides Kovacsics, Kien Huu Nguyen |
J. Symb. Log. | 1 |
| 2016 | Integration and cell Decomposition in P-Minimal StructuresabstractAbstract We show that the class of ${\cal L}$ -constructible functions is closed under integration for any P-minimal expansion of a p-adic field $\left( {K,{\cal L}} \right)$ . This generalizes results previously known for semi-algebraic and subanalytic structures. As part of the proof, we obtain a weak version of cell decomposition and function preparation for P-minimal structures, a result which is independent of the existence of Skolem functions. A direct corollary is that Denef’s results on the rationality of Poincaré series hold in any P-minimal expansion of a p-adic field $\left( {K,{\cal L}} \right)$ . Pablo Cubides Kovacsics, Eva Leenknegt |
J. Symb. Log. | 1 |
| 2015 | Locally Constant Functions in C-Minimal StructuresabstractAbstract Let M be a C-minimal structure and T its canonical tree (which corresponds in an ultrametric space to the set of closed balls with radius different than ∞ ordered by inclusion). We present a description of definable locally constant functions f : M → T in C-minimal structures having a canonical tree with infinitely many branches at each node and densely ordered branches. This provides both a description of definable subsets of T in one variable and analogues of known results in algebraically closed valued fields. Pablo Cubides Kovacsics |
J. Symb. Log. | 1 |