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.
Natural Proofs , volume =
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative 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.
Presents analogous arguments supporting the Cobham-Edmonds thesis that feasible computation explicates to P.
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.
-
Feasibilism, Explication, and the Cobham-Edmonds Thesis
Presents analogous arguments supporting the Cobham-Edmonds thesis that feasible computation explicates to P.