Related papers: Generics for Mathias forcing over general Turing i…
This paper introduces the concept of a generic finite set, and points out that a consistent and significant interpretation of the grossone notation of Yarolslav D. Sergeyev is that of a generic natural number. This means that the grossone…
We carry out some of Galois's work in the setting of an arbitrary first-order theory T. We replace the ambient algebraically closed field by a large model M of T, replace fields by definably closed subsets of M, assume that T codes finite…
This paper deals with formulas of set theory which force the infinity. For such formulas, we provide a technique to infer satisfiability from a finite assignment.
We propose the representation principle to study physical systems with a given symmetry. In the context of symmetry enriched topological orders, we give the appropriate representation category, the category of SET orders, which include SPT…
A forcing extension may create new isomorphisms between two models of a first order theory. Certain model theoretic constraints on the theory and other constraints on the forcing can prevent this pathology. A countable first order theory is…
The ferromagnetic Ising model is a model of a magnetic material and a central topic in statistical physics. It also plays a starring role in the algorithmic study of approximate counting: approximating the partition function of the…
This paper gives an explicit formula for the multiplier ideals, and consequently for the log canonical thresholds, of any GL(V)xGL(W)-invariant ideal in the symmetric algebra S of the tensor product of V with the dual of W, where V and W…
We introduce more properties of forcing notions which imply that their lambda-support iterations are lambda-proper, where lambda is an inaccessible cardinal. This paper is a direct continuation of section A.2 of math.LO/0210205. As an…
We mechanize, in the proof assistant Isabelle, a proof of the axiom-scheme of Separation in generic extensions of models of set theory by using the fundamental theorems of forcing. We also formalize the satisfaction of the axioms of…
A set $G \subseteq \omega$ is $n$-generic for a positive integer $n$ if and only if every $\Sigma^0_n$ formula of $G$ is decided by a finite initial segment of $G$ in the sense of Cohen forcing. It is shown here that every $n$-generic set…
I prove several theorems concerning upward closure and amalgamation in the generic multiverse of a countable transitive model of set theory. Every such model $W$ has forcing extensions $W[c]$ and $W[d]$ by adding a Cohen real, which cannot…
Given an ideal $a \subseteq R$ in a (log) $Q$-Gorenstein $F$-finite ring of characteristic $p > 0$, we study and provide a new perspective on the test ideal $\tau(R, a^t)$ for a real number $t > 0$. Generalizing a number of known results…
The Steprans forcing notion arises as a quotient of Borel sets modulo the ideal of $\sigma$-continuity of a certain Borel not $\sigma$-continuous function. We give a characterization of this forcing in the language of trees and using this…
For which (first-order complete, usually countable) $T$ do there exist non-isomorphic models of $T$ which become isomorphic after forcing with a forcing notion $\mathbb{P}$? Necessarily, $\mathbb{P}$ is non-trivial; i.e.~it adds some new…
The modal logic of forcing arises when one considers a model of set theory in the context of all its forcing extensions, interpreting necessity as "in all forcing extensions" and possibility as "in some forcing extension". In this modal…
The Ising model on an infinite generic tree is defined as a thermodynamic limit of finite systems. A detailed description of the corresponding distribution of infinite spin configurations is given. As an application we study the…
We analyze the time evolution of a one-dimensional quantum system with an attractive delta function potential whose strength is subjected to a time periodic (zero mean) parametric variation. We show that for generic forcing which includes…
In this paper we continue the study of equivalence of generics filters started by Smythe in [Smy22]. We fully characterize those forcing posets for which the corresponding equivalence of generics is smooth using the purely topological…
We study notions of generic and coarse computability in the context of computable structure theory. Our notions are stratified by the $\Sigma_\beta$ hierarchy. We focus on linear orderings. We show that at the $\Sigma_1$ level all linear…
We consider the problem of deciding the satisfiability of quantifier-free formulas in the theory of finite sets with cardinality constraints. Sets are a common high-level data structure used in programming; thus, such a theory is useful for…