Tomasz Rzepecki

dblp:177/7881 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
2since 2021 · last 2022
0000-0001-9786-1648ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 4 · 1 first-author · 2 since 2021
YearPublicationVenuePosition
2022 Generating ideals by additive subgroups of rings
Krzysztof Krupinski, Tomasz Rzepecki
Ann. Pure Appl. Log.2
2021 On the automorphism Group of the Universal homogeneous Meet-Tree
abstract
Abstract We show that the countable universal homogeneous meet-tree has a generic automorphism, but it does not have a generic pair of automorphisms.
Itay Kaplan, Tomasz Rzepecki, Daoud Siniora
J. Symb. Log.2
2018 Equivalence Relations Invariant under Group Actions
abstract
Abstract We extend some recent results about bounded invariant equivalence relations and invariant subgroups of definable groups: we show that type-definability and smoothness are equivalent conditions in a wider class of relations than heretofore considered, which includes all the cases for which the equivalence was proved before. As a by-product, we show some analogous results in purely topological context (without direct use of model theory).
Tomasz Rzepecki
J. Symb. Log.1
2016 Smoothness of Bounded Invariant Equivalence Relations
abstract
Abstract We generalise the main theorems from the paper “The Borel cardinality of Lascar strong types” by I. Kaplan, B. Miller and P. Simon to a wider class of bounded invariant equivalence relations. We apply them to describe relationships between fundamental properties of bounded invariant equivalence relations (such as smoothness or type-definability) which also requires finding a series of counterexamples. Finally, we apply the generalisation mentioned above to prove a conjecture from a paper by the first author and J. Gismatullin, showing that the key technical assumption of the main theorem (concerning connected components in definable group extensions) from that paper is not only sufficient but also necessary to obtain the conclusion.
Krzysztof Krupinski, Tomasz Rzepecki
J. Symb. Log.2