Non-Elementary Complexities for Branching VASS, MELL, and Extensions

被引：0

作者：

Lazic, Ranko ^{[1
]}

Schmitz, Sylvain ^{[2
,3
,4
]}

机构：

[1] Univ Warwick, Dept Comp Sci, Coventry, W Midlands, England

[2] ENS Cachan, LSV, Gif Sur Yvette, France

[3] CNRS, Paris, France

[4] INRIA, Rocquencourt, France

来源：

PROCEEDINGS OF THE JOINT MEETING OF THE TWENTY-THIRD EACSL ANNUAL CONFERENCE ON COMPUTER SCIENCE LOGIC (CSL) AND THE TWENTY-NINTH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS) | 2014年

关键词：

Fast-growing complexity; linear logic; substructural logic; vector addition systems; FINITE-MODEL PROPERTY; LINEAR LOGIC; FRAGMENTS;

D O I：

10.1145/2603088.2603129

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We study the complexity of reachability problems on branching extensions of vector addition systems, which allows us to derive new non-elementary complexity bounds for fragments and variants of propositional linear logic. We show that provability in the multiplicative exponential fragment is TOWER-hard already in the affine case-and hence non-elementary. We match this lower bound for the full propositional affine linear logic, proving its TOWER-completeness. We also show that provability in propositional contractive linear logic is ACKERMANN-complete.

引用

页数：10

共 50 条

[31] Non-elementary lower bound for Propositional Duration Calculus
Department of Computer Science, Tel Aviv University, Tel Aviv 69978, Israel
Inf. Process. Lett., 1 (7-11):
[32] Non-elementary exegesis of Twardowski's theory of presentation
Vasyukov, VL
LVOV-WARSAW SCHOOL AND CONTEMPORARY PHILOSOPHY, 1998, 273 : 153 - 167
[33] Non-elementary speedups between different versions of tableaux
Baaz, M
Fermuller, CG
THEOREM PROVING WITH ANALYTIC TABLEAUX AND RELATED METHODS, 1995, 918 : 217 - 230
[34] ERGODIC GEOMETRY FOR NON-ELEMENTARY RANK ONE MANIFOLDS
Link, Gabriele
Picaud, Jean-Claude
DISCRETE AND CONTINUOUS DYNAMICAL SYSTEMS, 2016, 36 (11) : 6257 - 6284
[35] FILTER CONVERGENCE IN NON-STANDARD ANALYSIS OF NON-ELEMENTARY FUNCTIONS
DOPP, K
ZEITSCHRIFT FUR MATHEMATISCHE LOGIK UND GRUNDLAGEN DER MATHEMATIK, 1984, 30 (04): : 353 - 384
[36] Non-elementary speed-ups in default reasoning
Egly, U
Tompits, H
QUALITATIVE AND QUANTITATIVE PRACTICAL REASONING, 1997, 1244 : 237 - 251
[37] A NON-ELEMENTARY PROOF BY DIFFERENTIAL EQUATION FOR THE CENTRAL LIMIT THEOREM
Korkmaz, Adil
Onemli, Muharrem Burak
PAKISTAN JOURNAL OF STATISTICS, 2013, 29 (03): : 307 - 313
[38] USING ELEMENTARY OF NON-ELEMENTARY MODELS IN CONTINGENCY TABLE ANALYSIS - APPLICATION TO MEDICAL PROBLEMS
ENKE, H
BIOMETRICAL JOURNAL, 1987, 29 (01) : 11 - 19
[39] New characterizations of exponential, elementary, and non-elementary time-bounded Turing machines
Ibarra, Oscar H.
McQuillan, Ian
INFORMATION AND COMPUTATION, 2023, 292
[40] C*-SIMPLICITY FOR GROUPS WITH NON-ELEMENTARY CONVERGENCE GROUP ACTIONS
Matsuda, Yoshifumi
Oguni, Shin-ichi
Yamagata, Saeko
HOUSTON JOURNAL OF MATHEMATICS, 2013, 39 (04): : 1291 - 1299

← 1 2 3 4 5 →