The formal verification of the ctm approach to forcing

Annals of Pure and Applied Logic 175 (5):103413 (2024)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,642

External links

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

Through your library

Similar books and articles

A bialgebraic approach to automata and formal language theory.James Worthington - 2012 - Annals of Pure and Applied Logic 163 (7):745-762.
Forcing by non-scattered sets.Miloš S. Kurilić & Stevo Todorčević - 2012 - Annals of Pure and Applied Logic 163 (9):1299-1308.
Preservation theorems for Namba forcing.Osvaldo Guzmán, Michael Hrušák & Jindřich Zapletal - 2021 - Annals of Pure and Applied Logic 172 (2):102869.
Forcing axioms and the uniformization-property.Stefan Hoffelner - 2024 - Annals of Pure and Applied Logic 175 (10):103466.
Topological forcing semantics with settling.Robert S. Lubarsky - 2012 - Annals of Pure and Applied Logic 163 (7):820-830.
Laver forcing and converging sequences.Alan Dow - 2024 - Annals of Pure and Applied Logic 175 (1):103247.
Definable MAD families and forcing axioms.Vera Fischer, David Schrittesser & Thilo Weinert - 2021 - Annals of Pure and Applied Logic 172 (5):102909.
More on ideals with simple forcing notions.M. Gitik & S. Shelah - 1993 - Annals of Pure and Applied Logic 59 (3):219-238.
Forcing with copies of the Rado and Henson graphs.Osvaldo Guzmán & Stevo Todorcevic - 2023 - Annals of Pure and Applied Logic 174 (8):103286.

Analytics

Added to PP
2024-02-01

Downloads
11 (#351,772)

6 months
11 (#1,140,922)

Historical graph of downloads
How can I increase my downloads?