Related papers: Open class determinacy is preserved by forcing

We develop a general framework for forcing with coherent adequate sets on $H(\lambda)$ as side conditions, where $\lambda \ge \omega_2$ is a cardinal of uncountable cofinality. We describe a class of forcing posets which we call coherent…

A well-ordering principle is a principle of the form: If $X$ is well-ordered then $F(X)$ is well-ordered, where $F$ is some natural operator transforming linear orders into linear orders. Many important subsystems of Second-order Arithmetic…

The Right to Free and Compulsory Education Act (2009) (RTE) of the Government of India prescribes student-teacher ratios for state-run schools. One method advocated by the Act to achieve its goals is the redeployment of teachers from…

We present a systematic study of the method of "norms on possibilities" of building forcing notions with keeping their properties under full control. This technique allows us to answer several open problems, but on our way to get the…

Any modality in homotopy type theory gives rise to an orthogonal factorization system of which the left class is stable under pullbacks. We show that there is a second orthogonal factorization system associated to any modality, of which the…

The paper deals with a class of cooperative functional differential equations (FDEs) with infinite delay, for which sufficient conditions for persistence and permanence are established. Here, the persistence refers to all solutions with…

It is shown that when in a higher order variational principle one fixes fields at the boundary leaving the field derivatives unconstrained, then the variational principle (in particular the solution space) is not invariant with respect to…

Human lives are increasingly being affected by the outcomes of automated decision-making systems and it is essential for the latter to be, not only accurate, but also fair. The literature of algorithmic fairness has grown considerably over…

Contemporary autoregressive transformers operate in open loop: each hidden state is computed in a single forward pass and never revised, causing errors to propagate uncorrected through the sequence. We identify this open-loop bottleneck as…

Constructor rewriting systems are said to be cons-free if, roughly, constructor terms in the right-hand sides of rules are subterms of constructor terms in the left-hand side; the computational intuition is that rules cannot build new data…

Canonical formulation of higher order theory of gravity can only be accomplished associating additional degrees of freedom, which are extrinsic curvature tensor. Consequently, to match Cauchy data with the boundary data, terms in addition…

For an arbitrary forcing class $\Gamma$, the $\Gamma$-fragment of Todorcevic's strong reflection principle SRP is isolated in such a way that (1) the forcing axiom for $\Gamma$ implies the $\Gamma$-fragment of SRP, (2) the stationary set…

Suppose a map $\phi$ on the set of positive definite matrices satisfies $\det(A+B)=\det(\phi(A)+\phi(B))$. Then we have $${\rm tr}(AB^{-1}) = {\rm tr}(\phi(A){\phi(B)}^{-1}).$$ Through this viewpoint, we show that $\phi$ is of the form…

Multi-class systems having possibly both finite and infinite classes are investigated under a natural partial exchangeability assumption. It is proved that the conditional law of such a system, given the vector of the empirical measures of…

Complex systems can be characterized by classes of equivalency of their elements defined according to system specific rules. We propose a generalized preferential attachment model to describe the class size distribution. The model…

We argue that the obstacles to having a first-order formalism for odd-derivative actions presented in a pedagogical note by Deser are based on examples which are not first-order forms of the original actions. The general derivation of an…

A class theorem is presented and proved: the complex Fourier transforms of a certain class of exponential functions have all their zeros on the real line. A class of basis functions is first considered, and the class is then extended via…

Looking at some monoids and (semi)rings (natural numbers, integers and p-adic integers), and more generally, residually finite algebras (in a strong sense), we prove the equivalence of two ways for a function on such an algebra to behave…

We use the technique of "classical realizability" to build new models of ZF + DC in which R is not well ordered. This gives new relative consistency results, probably not obtainable by forcing. This gives also a new method to get programs…

We describe a flexible construction that produces triples of finitely generated, residually finite groups $M\hookrightarrow P \hookrightarrow \Gamma$, where the maps induce isomorphisms of profinite completions…