Showing cs.LOShow all
3 papers · 1 filter
cs.LO2026
Proof Complexity of Linear Logics
Amirhossein Akbar Tabatabai, Raheleh Jalali
Proving proof-size lower bounds for , the sequent calculus for classical propositional logic, remains one of the major open problems in proof complexity. We shed new l…
cs.LO2025
Universal Proof Theory: Semi-analytic Rules and Uniform Interpolation
Amirhossein Akbar Tabatabai, Raheleh Jalali
In \cite{Craig}, we introduced a syntactically defined and highly general class of calculi known as \emph{semi-analytic}. We then demonstrated that any sufficiently strong (modal)…
cs.LO2024
Universal Proof Theory: Semi-analytic Rules and Craig Interpolation
Amirhossein Akbar Tabatabai, Raheleh Jalali
We provide a general and syntactically-defined family of sequent calculi, called \emph{semi-analytic}, to formalize the informal notion of a "nice" sequent calculus. We show that a…