论文信息 - Double-exponential inseparability of Robinson subsystem Q+ - 字舞流文

Double-exponential inseparability of Robinson subsystem Q+

Lavinia Egidi | Giovanni Faglia

[1] Derek C. Oppen,et al. A 2^2^2^pn Upper Bound on the Complexity of Presburger Arithmetic , 1978, J. Comput. Syst. Sci..

[2] C. Ward Henson,et al. A Uniform Method for Proving Lower Bounds on the Computational Complexity of Logical Theories , 1990, Ann. Pure Appl. Log..

[3] José L. Balcázar,et al. Structural Complexity II , 2012, EATCS.

[4] Jeanne Ferrante,et al. A Decision Procedure for the First Order Theory of Real Addition with Order , 1975, SIAM J. Comput..

[5] Giovanni Faglia,et al. Double Exponential Inseparability Of Robinson Subsystem Q+ From The Unsatisfiable Sentences In The Language Of Addition , 1993, Kurt Gödel Colloquium.

[6] Leonard Berman,et al. The Complexity of Logical Theories , 1980, Theor. Comput. Sci..