Recursion in a quantifier vs. elementary induction1

Publisher： Cambridge University Press

E-ISSN： 1943-5886|44|2|235-259

ISSN： 0022-4812

Source： The Journal of Symbolic Logic, Vol.44, Iss.2, 1979-06, pp. : 235-259

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

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

On n-quantifier induction

By  

The Journal of Symbolic Logic, Vol. 37, Iss. 3, 1972-09 ,pp. : 466-482

Cambridge University Press

Access to resources Recommend Favorite

The diversity of quantifier prefixes 1

By  

The Journal of Symbolic Logic, Vol. 38, Iss. 1, 1973-03 ,pp. : 79-85

Cambridge University Press

Access to resources Recommend Favorite

The measure quantifier1

By  

The Journal of Symbolic Logic, Vol. 44, Iss. 1, 1979-03 ,pp. : 103-108

Cambridge University Press

Access to resources Recommend Favorite

On recursion theory in IΣ 1

By  

The Journal of Symbolic Logic, Vol. 54, Iss. 2, 1989-06 ,pp. : 576-589

Cambridge University Press

Access to resources Recommend Favorite