In the mathematical discipline of set theory, forcing is a technique for proving consistency and independence results. Intuitively, forcing can be thought of as a technique to expand the set theoretical universe to a larger universe by introducing a new "generic" object . Forcing was first used by Paul Cohen in 1963, to prove the independence of the axiom of choice and the continuum hypothesis from Zermelo–Fraenkel set theory. It has been considerably reworked and simplified in the following years, and has since served as a powerful technique, both in set theory and in areas of mathematical logic such as recursion theory. Descriptive set theory uses the notions of forcing from both recursion theory and set theory. Forcing has also been used in model theory, but it is common in model theory to define genericity directly without mention of forcing. Forcing is usually used to construct an expanded universe that satisfies some desired property. For example, the expanded universe might contain many new real numbers (at least of them), identified with subsets of the set of natural numbers, that were not there in the old universe, and thereby violate the continuum hypothesis. In order to intuitively justify such an expansion, it is best to think of the "old universe" as a model of the set theory, which is itself a set in the "real universe" . By the Löwenheim–Skolem theorem, can be chosen to be a "bare bones" model that is externally countable, which guarantees that there will be many subsets (in ) of that are not in . Specifically, there is an ordinal that "plays the role of the cardinal " in , but is actually countable in . Working in , it should be easy to find one distinct subset of per each element of . (For simplicity, this family of subsets can be characterized with a single subset .) However, in some sense, it may be desirable to "construct the expanded model within ". This would help ensure that "resembles" in certain aspects, such as being the same as (more generally, that cardinal collapse does not occur), and allow fine control over the properties of .

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Related publications (12)

Low-Rank Subspaces for Unsupervised Entity Linking

Robert West, Akhil Arora, Alberto Garcia Duran

Entity linking is an important problem with many applications. Most previous solutions were designed for settings where annotated training data is available, which is, however, not the case in numerous domains. We propose a light-weight and scalable entity ...
ASSOC COMPUTATIONAL LINGUISTICS-ACL2021

A data-driven method for reconstructing and modelling social interactions in moving animal groups

Francesco Mondada, Frank Bonnet, Vaios Papaspyros

Group-living organisms that collectively migrate range from cells and bacteria to human crowds, and include swarms of insects, schools of fish, and flocks of birds or ungulates. Unveiling the behavioural and cognitive mechanisms by which these groups coord ...
2020

The PCL Theorem: Transactions cannot be Parallel, Consistent, and Live

Rachid Guerraoui, Victor Bushkov, Panagiota Fatourou

We establish a theorem called the PCL theorem, which states that it is impossible to design a transactional memory algorithm that ensures (1) parallelism, i.e., transactions do not need to synchronize unless they access the same application objects, (2) ve ...
ASSOC COMPUTING MACHINERY2019
Show more

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.