Descriptive complexity of finite structures: Saving the quantifier rank

E-ISSN： 1943-5886|70|2|419-450

ISSN： 0022-4812

Source： The Journal of Symbolic Logic, Vol.70, Iss.2, 2005-06, pp. : 419-450

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Finite Variable Logics in Descriptive Complexity Theory

Bulletin of Symbolic Logic, Vol. 4, Iss. 4, 1998-12 ,pp. : 345-398

Cambridge University Press

Access to resources Recommend Favorite

On the Complexity of the Classification Problem for Torsion-Free Abelian Groups of Finite Rank

Bulletin of Symbolic Logic, Vol. 7, Iss. 3, 2001-10 ,pp. : 329-344

Cambridge University Press

Access to resources Recommend Favorite

On the quantifier complexity of ∆_n+1 (T)– induction

By Cordón-Franco A. Fernández-Margarit A. Lara-Martín F.F.

Archive for Mathematical Logic, Vol. 43, Iss. 3, 2004-04 ,pp. : 371-398

Springer Publishing Company

Access to resources Recommend Favorite

Incompleteness of a formal system for infinitary finite-quantifier formulas

The Journal of Symbolic Logic, Vol. 36, Iss. 3, 1971-09 ,pp. : 445-455

Cambridge University Press

Access to resources Recommend Favorite

Fields of finite Morley rank

The Journal of Symbolic Logic, Vol. 66, Iss. 2, 2001-06 ,pp. : 703-706

Cambridge University Press

Access to resources Recommend Favorite