Syntactic separation of Skolem functions in local systems implies computational indistinguishability with Omega(n) or Omega(2^n) derivation lower bounds, presented as an abstract obstruction governing Natural Proofs, Type Omitting Theorem, and AC^0 barriers.
Clause set cycles and induction.Logical Methods in Computer Science, 16(4):11, 2020
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Syntactic Separation Implies Computational Indistinguishability: An Abstract Obstruction Theorem
Syntactic separation of Skolem functions in local systems implies computational indistinguishability with Omega(n) or Omega(2^n) derivation lower bounds, presented as an abstract obstruction governing Natural Proofs, Type Omitting Theorem, and AC^0 barriers.