Related papers: Separating Subversion Forcing Axioms

This paper introduces an alternative approach to proving the existence of choice functions for specific families of sets within Zermelo-Fraenkel set theory (ZF) without assuming any form on the Axiom of Choice (AC). Traditional methods of…

A process algebra is proposed, whose semantics maps a term to a nondeterministic finite automaton (NFA, for short). We prove a representability theorem: for each NFA $N$, there exists a process algebraic term $p$ such that its semantics is…

We prove that it is consistent that every two disjoint boldface $\mathbf{\Sigma}^1_1$ subsets of $\omega_1^{\omega_1}$ can be separated by a boldface $\mathbf{\Delta}^1_1$ set. The forcing starts from $L$ and preserves CH and therefore also…

We show that the forcing axiom for countably compact, $\omega_2$-Knaster, well-met posets is inconsistent. This is supplemental to an inconsistency result of Shelah and sets a new limit to the generalization of Martin's Axiom to the stage…

In an earlier article [J. Schubert, On nonspecific evidence, Int. J. Intell. Syst. 8(6), 711-725 (1993)] we established within Dempster-Shafer theory a criterion function called the metaconflict function. With this criterion we can…

We extend the inflationary fixed-point logic, IFP, with a new kind of second-order quantifiers which have (poly-)logarithmic bounds. We prove that on ordered structures the new logic $\exists^{\log^{\omega}}\text{IFP}$ captures the limited…

This work provides calculus for the Fr\'echet and limiting subdifferential of the pointwise supremum given by an arbitrary family of lower semicontinuous functions. We start our study showing fuzzy results about the Fr\'echet…

These notes are extracted from the lectures on forcing axioms and applications held by professor Matteo Viale at the University of Turin in the academic year 2011-2012. Our purpose is to give a brief account on forcing axioms with a special…

A central theme in set theory is to find universes with extreme, well-understood behaviour. The case we are interested in is assuming GCH and has a strong forcing axiom of higher order than usual. Instead of "for every suitable forcing…

Henle, Mathias, and Woodin proved that, provided that $\omega\rightarrow(\omega)^{\omega}$ holds in a model $M$ of ZF, then forcing with $([\omega]^{\omega},\subseteq^*)$ over $M$ adds no new sets of ordinals, thus earning the name a…

We prove that two-way probabilistic and quantum finite automata (2PFA's and 2QFA's) can be considerably more concise than both their one-way versions (1PFA's and 1QFA's), and two-way nondeterministic finite automata (2NFA's). For this…

In a sigma-closed forcing extension, the bounded forcing axiom for Namba forcing fails. This answers a question of Justin Tatch Moore.

This article describes a Turing machine which can solve for $\beta^{'}$ which is RE-complete. RE-complete problems are proven to be undecidable by Turing's accepted proof on the Entscheidungsproblem. Thus, constructing a machine which…

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…

In the context of $\mathsf{ZF}+\mathsf{DC}$, we force $\mathsf{DC}_\kappa$ for relations on $\mathcal{P}(\kappa)$ for $\kappa{}<\aleph_\omega$ over the Chang model $\mathrm{L}(\mathrm{Ord}^\omega)$ making some assumptions on the thorn…

Generalizing the proof for Sacks forcing, we show that the $h$-perfect tree forcing notions introduced by Goldstern, Judah and Shelah preserve selective independent families even when iterated. As a result we obtain new proofs of the…

We find necessary and sufficient conditions on an (inverse) semigroup $X$ under which its semigroups of maximal linked systems $\lambda(X)$, filters $\phi(X)$, linked upfamilies $N_2(X)$, and upfamilies $\upsilon(X)$ are inverse.

This paper explores the consistency strength of The Proper Forcing Axiom ($\textsf{PFA}$) and the theory (T) which involves a variation of the Viale-Wei$\ss$ guessing hull principle. We show that (T) is consistent relative to a supercompact…

We define and study a class of subshifts of finite type (SFTs) defined by a family of allowed patterns of the same shape where, for any contents of the shape minus a corner, the number of ways to fill in the corner is the same. The main…

Let $\mathscr{M}$ be a finite von Neumann algebra with a faithful normal tracial state $\tau$ and $\mathfrak{A}$ be a finite subdiagonal subalgebra of $\mathscr{M}$ with respect to a $\tau$-preserving faithful normal conditional expectation…