跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.10711 · v1

Applicative theories can count

首次提交 2026-11-07 21:05
版本更新 2026-11-07 21:05
雷达观测 2026-11-10 11:14
arXiv ↗PDF ↗

摘要

Applicative theories offer a proof-theoretic framework for studying complexity. In this paper, we introduce a family of applicative theories to characterize classes ranging from constant-depth circuits to polynomial space. Our approach relies on a simple axiom scheme, the small variations of which allows to capture various forms of counting and alternation. This leads to highly uniform results. When applied on notation, the scheme captures bit counting, yielding a characterization of the functions computable by constant-depth, polynomial-size threshold circuits (FTC0\textbf{FTC}^0); when applied lexicographically, it allows for the counting of accepting computations, yielding a characterization of the functions in the counting hierarchy (FCH\textbf{FCH}). Increasing the logical complexity of the induction formulas allowed in the scheme, we obtain characterizations of the functions computable by bounded Boolean circuits of logarithmic-depth and polynomial-size (FNC1\textbf{FNC}^1) and of the functions computable in polynomial space (FPSPACE\textbf{FPSPACE}). The latter characterization solves an open problem in the field. Finally, we investigate separation results. While it is unknown whether FNC1\textbf{FNC}^1 and FCH\textbf{FCH} are different, there is an oracle relative to which (relativized) FNC1\textbf{FNC}^1 is strictly contained in (relativized) FCH\textbf{FCH}. We use this fact to separate the theories characterizing them, by exploring their ability to represent higher-order functionals.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-07 21:05 · 最新观测版本

Applicative theories can count

Applicative theories offer a proof-theoretic framework for studying complexity. In this paper, we introduce a family of applicative theories to characterize classes ranging from constant-depth circuits to polynomial space. Our approach relies on a simple axiom scheme, the small variations of which allows to capture various forms of counting and alternation. This leads to highly uniform results. When applied on notation, the scheme captures bit counting, yielding a characterization of the functions computable by constant-depth, polynomial-size threshold circuits (FTC0\textbf{FTC}^0); when applied lexicographically, it allows for the counting of accepting computations, yielding a characterization of the functions in the counting hierarchy (FCH\textbf{FCH}). Increasing the logical complexity of the induction formulas allowed in the scheme, we obtain characterizations of the functions computable by bounded Boolean circuits of logarithmic-depth and polynomial-size (FNC1\textbf{FNC}^1) and of the functions computable in polynomial space (FPSPACE\textbf{FPSPACE}). The latter characterization solves an open problem in the field. Finally, we investigate separation results. While it is unknown whether FNC1\textbf{FNC}^1 and FCH\textbf{FCH} are different, there is an oracle relative to which (relativized) FNC1\textbf{FNC}^1 is strictly contained in (relativized) FCH\textbf{FCH}. We use this fact to separate the theories characterizing them, by exploring their ability to represent higher-order functionals.

查看此版本解读 →查看此版本原文 ↗