I am mainly interested in Set theory. Currently I am working on extensions of divisibility to the Stone-Čech compactification and connections to nonstandard arithmetic.

For Novi Sad Conference in Set Theory and General Topology series see www.dmi.uns.ac.rs/settop.

MSc thesis: "Ultrafiltri i ultraproizvodi" (in serbian) dvi.

PhD thesis: "Games on Boolean algebras" pdf.

Research papers:

Divisibility in the Stone-Čech compactification:

1.    Divisibility in the Stone-Čech compactification, Rep. Math. Logic 50 (2015), 53-66.

2.    Divisibility orders in the βN, Publ. Inst. Math. (Beograd) (N.S.) 107 (121) (2020), 37-44.

3.    ἶ-divisibility of ultrafilters, to appear in Ann. Pure Appl. Logic 172 (2021), No.1.

4.    Divisibility in βN and *N, Rep. Math. Logic 54 (2019), 65-82.

5.    More about divisibility in βN, MLQ Math. Log. Q. 67 (2021), No.1, 77-87.
6.    Congruence of ultrafilters, J. Symbolic Logic 86 (2021), No.2, 746-761.
7.    Multiplicative finite embeddability vs divisibility of ultrafilters, Arch. Math. Logic 61 (2022), 535-553.
8.    ἶ -divisibility of ultrafilters II: The big picture, to appear in Rep. Math. Logic. 60 (2025).
9.    A survey on divisibility of ultrafilters, in: Selected Topics in Combinatorial Analysis Part II (editor: Boriša Kuzeljević), Zbornik radova 22 (30), Mathematical institute of the Serbian Academy of Sciences and Arts, 2025, 491-509.
10. Divisibility classes of ultrafilters and their patterns, submitted, arxiv.org/abs/2412.19753.
11. (with L. Luperi Baglini, M. Mamino, R. Mennuni, M. Ragosta) Extending orders to types, submitted, arxiv.org/abs/2509.09623.

Games on Boolean algebras:

  1. (with M. Kurilić) A game on Boolean algebras describing the collapse of continuum, Ann. Pure Appl. Logic 160 (2009), No.1, 117-126.
  2. (with M. Kurilić) Power-collapsing games, J. Symbolic Logic 73 (2008), No.4, 1433-1457. 
  3. (with M. Kurilić) Four games on Boolean algebras, Filomat 30 (2016), No.13, 3389-3395.

Other:

  1. (with B. Nikolić) Measures of string similarities based on the Hamming distance, Publ. Inst. Math. (Beograd) (N.S.) 116 (130) (2024), 1–21.
  2. Partition properties on countable bipartite graphs, Miskolc Math. Notes 17 (2016), No.2, 1061-1066.
  3. Random bipartite graphs, Novi Sad Journal of Mathematics 44, (2014), No.2, 69-75.
  4. Inseparable sequences and forcing, Novi Sad Journal of Mathematics 43, (2013), No.2, 185-189.
  5. Higher order fixed points of normal functions and an application to ultrapowers of ordinals, Novi Sad Journal of Mathematics 38, (2008), No.1, 177-181.
  6. Ultraproducts of trees, partly published in Extended abstracts of 4th Panhellenic Logic Symposium, Thessaloniki 2003.