Erfan Khaniki

MaRDI QIDQ2074811zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Jump operators, interactive proofs and proof complexity generators	2026-06-23	Paper
From proof complexity to circuit complexity via interactive protocols	2026-01-14	Paper
TFNP intersections through the Lens of feasible disjunction	2025-11-04	Paper
The provably total functions of basic arithmetic and its extensions Archive for Mathematical Logic	2025-02-18	Paper
The Proof Analysis Problem (available as arXiv preprint)	2025-01-01	Paper
Nisan-Wigderson generators in proof complexity: new lower bounds	2024-07-05	Paper
NEW RELATIONS AND SEPARATIONS OF CONJECTURES ABOUT INCOMPLETENESS IN THE FINITE DOMAIN Journal of Symbolic Logic	2022-08-29	Paper
Not all Kripke models of \(\mathsf{HA}\) are locally \(\mathsf{PA}\) Advances in Mathematics	2022-02-11	Paper
Not all Kripke models of $\sf HA$ are locally $\sf PA$	2020-06-21	Paper
The provably total recursive functions and the MRDP theorem in Basic Arithmetic and its extensions	2020-03-03	Paper
Not all Kripke models of $\sf HA$ are locally $\sf PA$ (available as arXiv preprint)	2020-01-01	Paper
A counterexample to polynomially bounded realizability of basic arithmetic Notre Dame Journal of Formal Logic	2019-10-22	Paper
New relations and separations of conjectures about incompleteness in the finite domain (available as arXiv preprint)	2019-04-02	Paper

Research outcomes over time

This page was built for person: Erfan Khaniki