2014Notre Dame Journal of Formal LogicOpen access

Forcing with Sequences of Models of Two Types

Itay Neeman

Open full text 42 citations

Abstract

We present an approach to forcing with finite sequences of models that uses models of two types. This approach builds on earlier work of Friedman and Mitchell on forcing to add clubs in cardinals larger than ℵ1, with finite conditions. We use the two-type approach to give a new proof of the consistency of the proper forcing axiom. The new proof uses a finite support forcing, as opposed to the countable support iteration in the standard proof. The distinction is important since a proof using finite supports is more amenable to generalizations to cardinals greater than ℵ1.

Open-access reader

About this research paper

What this paper is about

We present an approach to forcing with finite sequences of models that uses models of two types. This approach builds on earlier work of Friedman and Mitchell on forcing to add clubs in cardinals larger than ℵ1, with finite conditions. We use the two-type approach to give a new proof of the consistency of the proper forcing axiom. The new proof uses a finite support forcing, as opposed to the countable support iteration in the standard proof. The distinction is important since a proof using finite supports is more amenable to generalizations to cardinals greater than ℵ1.

Why it matters

OpenAlex reports 42 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

We present an approach to forcing with finite sequences of models that uses models of two types. This approach builds on earlier work of Friedman and Mitchell on forcing to add clubs in cardinals larger than ℵ1, with finite conditions. We use the two-type approach to give a new proof of the consistency of the proper forcing axiom. The new proof uses a finite support forcing, as opposed to the countable support iteration in the standard proof. The distinction is important since a proof using finite supports is more amenable to generalizations to cardinals greater than ℵ1.

Key concepts: Forcing (mathematics), Axiom, Mathematics, Countable set, Consistency (knowledge bases), Type (biology), Pure mathematics, Algebra over a field

Related papers

Back to paper searchBrowse research topicsOriginal source
Forcing with Sequences of Models of Two Types — Research Paper | ScholarLens