6 citations · 16 across the 12 of their papers we have counts for
6 papers · 1 filter
Feasibility of Primality in Bounded Arithmetic
Raheleh Jalali, Ondřej Ježil
We prove the correctness of the AKS algorithm \cite{AKS} within the bounded arithmetic theory or, equivalently, the first-order consequences of the theory exp…
Universal Proof Theory, TACL 2022 Lecture Notes
Rosalie Iemhoff, Raheleh Jalali
These lecture notes survey the emerging area of Universal Proof Theory, which investigates general questions about the existence, equivalence, and characterization of good proof sy…
Universal Proof Theory: Feasible Admissibility in Intuitionistic Modal Logics
Amirhossein Akbar Tabatabai, Raheleh Jalali
In this paper, we introduce a general family of sequent-style calculi over the modal language and its fragments to capture the essence of all constructively acceptable systems. Cal…
Uniform Lyndon Interpolation for Basic Non-normal Modal and Conditional Logics
Amirhossein Akbar Tabatabai, Rosalie Iemhoff, Raheleh Jalali
In this paper, a proof-theoretic method to prove uniform Lyndon interpolation for non-normal modal and conditional logics is introduced and applied to show that the logics $\mathsf…
Uniform Lyndon interpolation for intuitionistic monotone modal logic
Amirhossein Akbar Tabatabai, Rosalie Iemhoff, Raheleh Jalali
In this paper we show that the intuitionistic monotone modal logic has the uniform Lyndon interpolation property (ULIP). The logic is a non-normal modal…
Proof Complexity of Substructural Logics
Raheleh Jalali
In this paper, we investigate the proof complexity of a wide range of substructural systems. For any proof system at least as strong as Full Lambek calculus, $\mathbf{…