Mathias like criterion for the extender based Prikry forcing

Annals of Pure and Applied Logic 172 (9):102994 (2021)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2021.102994

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,532

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

Supercompact extender based Prikry forcing.Carmi Merimovich - 2011 - Archive for Mathematical Logic 50 (5-6):591-602.
The short extenders gap two forcing is of Prikry type.Carmi Merimovich - 2009 - Archive for Mathematical Logic 48 (8):737-747.
The short extenders gap three forcing using a morass.Carmi Merimovich - 2011 - Archive for Mathematical Logic 50 (1-2):115-135.
Mathias–Prikry and Laver–Prikry type forcing.Michael Hrušák & Hiroaki Minami - 2014 - Annals of Pure and Applied Logic 165 (3):880-894.
Prikry forcing and tree Prikry forcing of various filters.Tom Benhamou - 2019 - Archive for Mathematical Logic 58 (7-8):787-817.
Sigma-Prikry forcing II: Iteration Scheme.Alejandro Poveda, Assaf Rinot & Dima Sinapova - 2022 - Journal of Mathematical Logic 22 (3):2150019.
A Characterization of Generalized Příkrý Sequences.Gunter Fuchs - 2005 - Archive for Mathematical Logic 44 (8):935-971.
Combinatorics and forcing with distributive ideals.Pierre Matet - 1997 - Annals of Pure and Applied Logic 86 (2):137-201.
The subcompleteness of diagonal Prikry forcing.Kaethe Minden - 2020 - Archive for Mathematical Logic 59 (1-2):81-102.
Extender-based forcings with overlapping extenders and negations of the Shelah Weak Hypothesis.Moti Gitik - 2020 - Journal of Mathematical Logic 20 (3):2050013.
Mathias–Prikry and Laver type forcing; summable ideals, coideals, and +-selective filters.David Chodounský, Osvaldo Guzmán González & Michael Hrušák - 2016 - Archive for Mathematical Logic 55 (3-4):493-504.
Supercompact extender based Magidor–Radin forcing.Carmi Merimovich - 2017 - Annals of Pure and Applied Logic 168 (8):1571-1587.
A variant of Mathias forcing that preserves \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathsf{ACA}_0}$$\end{document}. [REVIEW]François G. Dorais - 2012 - Archive for Mathematical Logic 51 (7-8):751-780.
Canonical seeds and Prikry trees.Joel David Hamkins - 1997 - Journal of Symbolic Logic 62 (2):373-396.
Generalized Prikry forcing and iteration of generic ultrapowers.Hiroshi Sakai - 2005 - Mathematical Logic Quarterly 51 (5):507-523.

Analytics

Added to PP
2021-05-19

Downloads
9 (#1,246,025)

6 months
1 (#1,470,413)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

A Mathias criterion for the Magidor iteration of Prikry forcings.Omer Ben-Neria - 2023 - Archive for Mathematical Logic 63 (1):119-134.
On Cohen and Prikry Forcing Notions.Tom Benhamou & Moti Gitik - forthcoming - Journal of Symbolic Logic:1-47.

Add more citations

References found in this work

Supercompact extender based Magidor–Radin forcing.Carmi Merimovich - 2017 - Annals of Pure and Applied Logic 168 (8):1571-1587.

Add more references