3 papers
cs.CC2024
From Proof Complexity to Circuit Complexity via Interactive Protocols
Noel Arteche, Erfan Khaniki, Ján Pich +1
Folklore in complexity theory suspects that circuit lower bounds against or , currently out of reach, are a necessary step towards p…
math.LO2020
Not all Kripke models of are locally
Erfan Khaniki
Let be an arbitrary Kripke model of Heyting Arithmetic, . For every node in , we can view the classical structure of , as a mo…
math.LO2019
New relations and separations of conjectures about incompleteness in the finite domain
Erfan Khaniki
Our main results are in the following three sections: 1. We prove new relations between proof complexity conjectures that are discussed in \cite{pu18}. 2. We investigate the existe…