Delineating classes of computational complexity via second order theories with weak set existence principles. I

Publisher： Cambridge University Press

E-ISSN： 1943-5886|60|1|103-121

ISSN： 0022-4812

Source： The Journal of Symbolic Logic, Vol.60, Iss.1, 1995-03, pp. : 103-121

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

The Computational Complexity of Weak Saddles

By Brandt Felix  

Theory of Computing Systems, Vol. 49, Iss. 1, 2011-07 ,pp. : 139-161

Springer Publishing Company

Access to resources Recommend Favorite

On the complexity of the theories of weak direct powers

By  

The Journal of Symbolic Logic, Vol. 41, Iss. 3, 1976-09 ,pp. : 561-573

Cambridge University Press

Access to resources Recommend Favorite

Second Order Nonlinear Evolution Inclusions I: Existence and Relaxation Results

By Papageorgiou Nikolaos   Yannakakis Nikolaos  

Acta Mathematica Sinica, Vol. 21, Iss. 5, 2005-10 ,pp. : 977-996

Springer Publishing Company

Access to resources Recommend Favorite

Term models for weak set theories with a universal set

By  

The Journal of Symbolic Logic, Vol. 52, Iss. 2, 1987-06 ,pp. : 374-387

Cambridge University Press

Access to resources Recommend Favorite

RELATIVE PREDICATIVITY AND DEPENDENT RECURSION IN SECOND-ORDER SET THEORY AND HIGHER-ORDER THEORIES

By  

The Journal of Symbolic Logic, Vol. 79, Iss. 3, 2014-08 ,pp. : 712-732

Cambridge University Press

Access to resources Recommend Favorite