Related papers: Non-elementary proper forcing notions

In this article we present a technique for selecting models of set theory that are complete in a model-theoretic sense. Specifically, we will apply Robinson infinite forcing to the collections of models of ZFC obtained by Cohen forcing.…

We give a self-contained introduction to accessible categories and how they shed light on both model- and set-theoretic questions. We survey for example recent developments on the study of presentability ranks, a notion of cardinality…

There is a growing concern that the recent progress made in AI, especially regarding the predictive competence of deep learning models, will be undermined by a failure to properly explain their operation and outputs. In response to this…

The analysis of theory-confirmation generally takes the deductive form: show that a theory in conjunction with physical data and auxiliary hypotheses yield a prediction about phenomena; verify the prediction; provide a quantitative measure…

Recently the second author introduced combinatorial principles that characterize supercompactness for inaccessible cardinals but can also hold true for small cardinals. We prove that the proper forcing axiom PFA implies these principles…

We prove that if Q is a nw-nep forcing then it cannot add a dominating real. We also prove that Amoeba forcing cannot be P(X)/I if I is an aleph_1-complete ideal.

We construct a left semi-model category of "marked strict $\infty$-categories" for which the fibrant objects are those whose marked arrows satisfy natural closure properties and are weakly invertible. The canonical model structure on strict…

This expository paper, aimed at the reader without much background in set theory or logic, gives an overview of Cohen's proof (via forcing) of the independence of the continuum hypothesis. It emphasizes the broad outlines and the intuitive…

We define a family of intuitionistic non-normal modal logics; they can bee seen as intuitionistic counterparts of classical ones. We first consider monomodal logics, which contain only one between Necessity and Possibility. We then consider…

Counterfactual frameworks have grown popular in machine learning for both explaining algorithmic decisions but also defining individual notions of fairness, more intuitive than typical group fairness conditions. However, state-of-the-art…

We develop the basic fine structure theory of the minimal model of the Largest Suslin Axiom. In particular, we prove that that the minimal model of the Largest Suslin Axiom satisfies the Mouse Set Conjecture, and that the Proper Forcing…

In many settings it is important for one to be able to understand why a model made a particular prediction. In NLP this often entails extracting snippets of an input text `responsible for' corresponding model output; when such a snippet…

Nominal terms extend first-order terms with binding. They lack some properties of first- and higher-order terms: Terms must be reasoned about in a context of 'freshness assumptions'; it is not always possible to 'choose a fresh variable…

We introduce the idea of a coherent adequate set of models, which can be used as side conditions in forcing. As an application we define a forcing poset which adds a square sequence on $\omega_2$ using finite conditions.

We introduce the logic FOCN(P) which extends first-order logic by counting and by numerical predicates from a set P, and which can be viewed as a natural generalisation of various counting logics that have been studied in the literature. We…

With recent advances in natural language processing, rationalization becomes an essential self-explaining diagram to disentangle the black box by selecting a subset of input texts to account for the major variation in prediction. Yet,…

It was realized early on that topologies can model constructive systems, as the open sets form a Heyting algebra. After the development of forcing, in the form of Boolean-valued models, it became clear that, just as over ZF any…

The assumption that an AEC is tame is a powerful assumption permitting development of stability theory for AECs with the amalgamation property. Lately several upward categoricity theorems were discovered where tameness replaces strong…

Theorems crucial in elementary real function theory have proofs in which compactness arguments are used. Despite the introduction in relatively recent literature of each new highly elegant compactness argument, or of an equivalent, this…

The P versus NP problem is addressed in a context of provability and limitations on the possibility of finding sound axioms for formal theories. It is shown that if the term "constructible theory" is defined in a way which satisfies certain…