New relations and separations of conjectures about incompleteness in the finite domain. arXiv e-prints E Khaniki arXiv preprint arXiv:1904.01362, 1-25, 2019 | 8 | 2019 |

New relations and separations of conjectures about incompleteness in the finite domain E Khaniki The Journal of Symbolic Logic 87 (3), 912-937, 2022 | 7 | 2022 |

On proof complexity of resolution over polynomial calculus E Khaniki ACM Transactions on Computational Logic (TOCL) 23 (3), 1-24, 2022 | 4 | 2022 |

Nisan-Wigderson generators in proof complexity: new lower bounds E Khaniki 37th Computational Complexity Conference (CCC 2022), 2022 | 3 | 2022 |

TFNP intersections through the lens of feasible disjunction P Hubáček, E Khaniki, N Thapen 15th Innovations in Theoretical Computer Science Conference (ITCS 2024), 2024 | 1 | 2024 |

The provably total recursive functions and the MRDP theorem in Basic Arithmetic and its extensions M Ardeshir, E Khaniki, M Shahriari arXiv preprint arXiv:2003.01603, 2020 | 1 | 2020 |

A Counterexample to Polynomially Bounded Realizability of Basic Arithmetic M Ardeshir, E Khaniki, M Shahriari Notre Dame Journal of Formal Logic 60 (3), 481-489, 2019 | 1 | 2019 |

(Im)possibilty results in Proof Complexity and Arithmetic E Khaniki Univerzita Karlova, Matematicko-fyzikální fakulta, 2023 | | 2023 |

Not all Kripke models of HA are locally PA E Khaniki Advances in Mathematics 397, 108126, 2022 | | 2022 |