Closes the missing direction of an open question on incomparability of two induction theories via a short syntactic argument and extracts the Syntactic Invariance Principle.
Razborov and Steven Rudich
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.LO 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
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.
citing papers explorer
-
Syntactic Systems Cannot See Semantic Invariants
Closes the missing direction of an open question on incomparability of two induction theories via a short syntactic argument and extracts the Syntactic Invariance Principle.
-
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.