Related papers: Biba's trick, with applications

We introduce a class of notions of forcing which we call $\Sigma$-Prikry, and show that many of the known Prikry-type notions of forcing that centers around singular cardinals of countable cofinality are $\Sigma$-Prikry. We show that given…

This paper's first aim is to prove a modernized Occam's razor beyond a reasonable doubt. To summarize the main argument in one sentence: If we consider all possible, intelligible, scientific models of ever-higher complexity, democratically,…

The aim of this paper is to establish some metrical coincidence and common fixed point theorems with an arbitrary relation under an implicit contractive condition which is general enough to cover a multitude of well known contraction…

We isolate a combinatorial property of capacities leading to a construction of proper forcings. Then we show that many classical capacities such as the Newtonian capacity satisfy the property.

I prove forcing preservation theorems for products of definable partial orders preserving the cofinality of the meager or null ideal. Rectangular Ramsey theorems for related ideals follow from the proofs.

Computational reflection allows us to turn verified decision procedures into efficient automated reasoning tools in proof assistants. The typical applications of such methodology include mathematical structures that have decidable theory…

A theorem of Functorial Affinization of Nash's manifold is proven here giving necessary and sufficient conditions to lift a holomorphic arc to the smooth locus of the Nash manifold. In addition a theorem about valuations is proven.

We study the locus of the liftings of a homogeneous ideal $H$ in a polynomial ring over any field. We prove that this locus can be endowed with a structure of scheme $\mathrm L_H$ by applying the constructive methods of Gr\"obner bases, for…

We introduce the notion of implicative algebra, a simple algebraic structure intended to factorize the model constructions underlying forcing and realizability (both in intuitionistic and classical logic). The salient feature of this…

In this paper we consider first-order logic theorem proving and model building via approximation and instantiation. Given a clause set we propose its approximation into a simplified clause set where satisfiability is decidable. The…

We study the proof theory and algorithms for orthologic, a logical system based on ortholattices, which have shown practical relevance in simplification and normalization of verification conditions. Ortholattices weaken Boolean algebras…

We prove the statement in the title, solving in this way a conjecture stated by Ginot for manifolds with corners. Along the way, we establish a derived Swiss-cheese additivity theorem and an alternative proof for the hyperdescent of…

In this paper we present the formal, computer-supported verification of a functional implementation of Buchberger's critical-pair/completion algorithm for computing Gr\"obner bases in reduction rings. We describe how the algorithm can be…

We show that it is possible to add $\kappa^+-$Cohen subsets to $\kappa$ with a Prikry forcing over $\kappa$. This answers a question from \cite{HayutBenhanouGitik}. A strengthening of non-Galvin property is introduced. It is shown to be…

Let $\kappa$ be an uncountable cardinal such that $2^{<\kappa} = \kappa$ or just ${\rm cf}(\kappa) > \omega$, $2^{2^{<\kappa}}= 2^\kappa$, and $([\kappa]^\kappa, \supseteq)$ collapses $2^\kappa$ to $\omega$. We show under these assumptions…

The purpose of this paper is to investigate forcing as a tool to construct universal models. In particular, we look at theories of initial segments of the universe and show that any model of a sufficiently rich fragment of those theories…

We investigate the cyclic proof theory of extensions of Peano Arithmetic by (finitely iterated) inductive definitions. Such theories are essential to proof theoretic analyses of certain `impredicative' theories; moreover, our cyclic systems…

We prove that for any integers $\alpha, \beta > 1$, the existential fragment of the first-order theory of the structure $\langle \mathbb{Z}; 0,1,<, +, \alpha^{\mathbb{N}}, \beta^{\mathbb{N}}\rangle$ is decidable (where $\alpha^{\mathbb{N}}$…

We consider several formalizations in the language of second-order arithmetic of "The formula $\phi$ is a theorem of $\omega$-logic", including some which have been studied in the literature and a new variant defined via a least fixed…

The proof of the relative consistency of the axiom of choice has been mechanized using Isabelle/ZF. The proof builds upon a previous mechanization of the reflection theorem. The heavy reliance on metatheory in the original proof makes the…