Alternatives to the Halpern-Läuchli theorem

Annals of Pure and Applied Logic 174 (9):103313 (2023)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2023.103313

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,369

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Forcing and the halpern–läuchli theorem.Natasha Dobrinen & Daniel Hathaway - 2020 - Journal of Symbolic Logic 85 (1):87-102.
The halpern–läuchli theorem at a measurable cardinal.Natasha Dobrinen & Dan Hathaway - 2017 - Journal of Symbolic Logic 82 (4):1560-1575.
A tail Cone version of the halpern–läuchli theorem at a large cardinal.Jing Zhang - 2019 - Journal of Symbolic Logic 84 (2):473-496.
Review: J. D. Halpern, H. Lauchli, A Partition Theorem; J. D. Halpern, A. Levy, The Boolean Prime Ideal Theorem Does Not Imply the Axiom of Choice. [REVIEW]David Pincus - 1974 - Journal of Symbolic Logic 39 (1):181-182.
Halpern J. D. and Läuchli H.. A partition theorem. Transactions of the American Mathematical Society, vol. 124 , pp. 360–367.Halpern J. D. and Lévy A.. The Boolean prime ideal theorem does not imply the axiom of choice. Axiomatic set theory, Proceedings of symposia in pure mathematics, vol. 13 part 1, American Mathematical Society, Providence, Rhode Island, 1971, pp. 83–134. [REVIEW]David Pincus - 1974 - Journal of Symbolic Logic 39 (1):181-182.
A collection of topological Ramsey spaces of trees and their application to profinite graph theory.Yuan Yuan Zheng - 2018 - Archive for Mathematical Logic 57 (7-8):939-952.
Arrow's Theorem with a fixed feasible alternative.John A. Weymark, Aanund Hylland & Allan F. Gibbard - unknown
A Partition Theorem.J. D. Halpern - 1974 - Journal of Symbolic Logic 39 (1):181-182.
Borel partitions of infinite subtrees of a perfect tree.A. Louveau, S. Shelah & B. Veličković - 1993 - Annals of Pure and Applied Logic 63 (3):271-281.
Linear Läuchli semantics.R. F. Blute & P. J. Scott - 1996 - Annals of Pure and Applied Logic 77 (2):101-142.
Borel partitions of infinite subtrees of a perfect tree.A. Louveau, S. Shelah & B. Velikovi - 1993 - Annals of Pure and Applied Logic 63 (3):271-281.
A simplified proof of an impossibility theorem.Alfred F. Mackay - 1973 - Philosophy of Science 40 (2):175-177.
The Independence of the Axiom of Choice from the Boolean Prime Ideal Theorem.J. D. Halpern - 1967 - Journal of Symbolic Logic 32 (2):273-274.
Some intuitions behind realizability semantics for constructive logic: Tableaux and Läuchli countermodels.James Lipton & Michael J. O'Donnell - 1996 - Annals of Pure and Applied Logic 81 (1-3):187-239.
Algorithmic uses of the Feferman–Vaught Theorem.J. A. Makowsky - 2004 - Annals of Pure and Applied Logic 126 (1-3):159-213.

Analytics

Added to PP
2023-07-23

Downloads
8 (#1,324,279)

6 months
4 (#798,692)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Set Theory.Thomas Jech - 1999 - Studia Logica 63 (2):300-300.

Add more references