On the expressiveness of the choice quantifier

Annals of Pure and Applied Logic (forthcoming)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,774

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Quantifier elimination in discriminator varieties.Francoise Point - 1986 - Annals of Pure and Applied Logic 32:83-101.
Quantifier elimination on some pseudo-algebraically closed valued fields.Jizhan Hong - 2023 - Annals of Pure and Applied Logic 174 (1):103170.
On the expressiveness of choice quantification.Bas Luttik - 2003 - Annals of Pure and Applied Logic 121 (1):39-87.
Choice and well-ordering.Peter Freyd - 1987 - Annals of Pure and Applied Logic 35 (C):149-166.
A nonconservativity result on global choice.Matt Kaufmann & Saharon Shelah - 1984 - Annals of Pure and Applied Logic 27 (3):209-214.
Sheaf models for choice sequences.Gerrit Van Der Hoeven & Ieke Moerdijk - 1984 - Annals of Pure and Applied Logic 27 (1):63-107.

Analytics

Added to PP
2013-12-30

Downloads
14 (#1,283,936)

6 months
14 (#206,617)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

The mathematics of metamathematics.Helena Rasiowa - 1963 - Warszawa,: Państwowe Wydawn. Naukowe. Edited by Roman Sikorski.
Admissible Sets and Structures.Jon Barwise - 1978 - Studia Logica 37 (3):297-299.
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
The Mathematics of Metamathematics.Donald Monk - 1963 - Journal of Symbolic Logic 32 (2):274-275.

Add more references