An intuitionistic version of Zermelo's proof that every choice set can be well-ordered

E-ISSN： 1943-5886|66|3|1121-1126

ISSN： 0022-4812

Source： The Journal of Symbolic Logic, Vol.66, Iss.3, 2001-09, pp. : 1121-1126

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 axiom of choice for well-ordered families and for families of well-orderable sets

The Journal of Symbolic Logic, Vol. 60, Iss. 4, 1995-12 ,pp. : 1115-1117

Cambridge University Press

Access to resources Recommend Favorite

Infinite exponent partition relations and well-ordered choice1

The Journal of Symbolic Logic, Vol. 38, Iss. 2, 1973-06 ,pp. : 299-308

Cambridge University Press

Access to resources Recommend Favorite

Real functions on the family of all well-ordered subsets of a partially ordered set ¹

The Journal of Symbolic Logic, Vol. 48, Iss. 1, 1983-03 ,pp. : 91-96

Cambridge University Press

Access to resources Recommend Favorite

LIFTING PROOF THEORY TO THE COUNTABLE ORDINALS: ZERMELO-FRAENKEL SET THEORY

The Journal of Symbolic Logic, Vol. 79, Iss. 2, 2014-06 ,pp. : 325-354

Cambridge University Press

Access to resources Recommend Favorite

A proof of zermelo's theorem

The Journal of Symbolic Logic, Vol. 32, Iss. 3, 1967-10 ,pp. : 366-366

Cambridge University Press

Access to resources Recommend Favorite