Upper bounds for metapredicative Mahlo in explicit mathematics and admissible set theory

E-ISSN： 1943-5886|66|2|935-958

ISSN： 0022-4812

Source： The Journal of Symbolic Logic, Vol.66, Iss.2, 2001-06, pp. : 935-958

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

Wellordering proofs for metapredicative Mahlo

The Journal of Symbolic Logic, Vol. 67, Iss. 1, 2002-03 ,pp. : 260-278

Cambridge University Press

Access to resources Recommend Favorite

On power set in explicit mathematics

The Journal of Symbolic Logic, Vol. 61, Iss. 2, 1996-06 ,pp. : 468-489

Cambridge University Press

Access to resources Recommend Favorite

EXPLICIT MATHEMATICS AND OPERATIONAL SET THEORY: SOME ONTOLOGICAL COMPARISONS

Bulletin of Symbolic Logic, Vol. 20, Iss. 3, 2014-10 ,pp. : 275-292

Cambridge University Press

Access to resources Recommend Favorite

Upper bounds on locally countable admissible initial segments of a Turing degree hierarchy1

The Journal of Symbolic Logic, Vol. 46, Iss. 4, 1981-12 ,pp. : 753-760

Cambridge University Press

Access to resources Recommend Favorite

The next admissible set ¹

The Journal of Symbolic Logic, Vol. 36, Iss. 1, 1971-03 ,pp. : 108-120

Cambridge University Press

Access to resources Recommend Favorite