Showing cs.LOShow all
3 papers · 1 filter
cs.LO2026
Limits of Uniform Certification in the Standard Turing Model -- Semantic Invariants and Admissible Methods
Fabio F. G. Buono
This work introduces a general obstructional framework, the "Double Bind," exposing intrinsic structural limitations of formal verification across computational complexity, mathema…
cs.LO2026
Syntactic Separation Implies Computational Indistinguishability: An Abstract Obstruction Theorem
Fabio F. G. Buono
We prove that syntactic separation implies computational indistinguishability. A local syntactic system R acts on terms within radius r0 without consulting any model; when two Skol…
cs.LO2026
Syntactic Systems Cannot See Semantic Invariants
Fabio F. G. Buono
We start from a small open question, where Hetzl and Vierling asked whether two theories of induction, open induction and clause set cycles, are incomparable. They proved one direc…