Related papers: Saccharinity with ccc
We analyse the SU(2)_k WZNW models beyond the integrable representations and in particular the case of SU(2)_0. We find that these are good examples of logarithmic conformal field theories as indecomposable representations are naturally…
In this paper we consider the problem of building rich categories of setoids, in standard intensional Martin-L\"of type theory (MLTT), and in particular how to handle the problem of equality on objects in this context. Any…
The forcing method is a powerful tool to prove the consistency of set-theoretic assertions relative to the consistency of the axioms of set theory. Laver's theorem and Bukovsk\'y's theorem assert that set-generic extensions of a given…
It was established by Jensen in 1970 that there is a generic extension $L[a]$ of the constructible universe $L$ by a real $a\not\in L$ such that $a$ is $\varDelta^1_3$ in $L[a]$. Jensen's forcing construction has found a number of…
We use the theory of $\textbf{U}_q$-tilting modules to construct cellular bases for centralizer algebras. Our methods are quite general and work for any quantum group $\textbf{U}_q$ attached to a Cartan matrix and include the non-semisimple…
We provide a concrete realization of the cluster algebras associated with Q-systems as amalgamations of cluster structures on double Bruhat cells in simple algebraic groups. For nonsimply-laced groups, this provides a cluster-algebraic…
We provide a simple and general construction of infinite families of consistent, modular-covariant pairs of characters satisfying the basic requirements to describe two-character RCFT. These correspond to solutions of generic second-order…
Faber, Muller and Smith used complete sums of conic modules to construct non-commutative crepant resolutions (NCCR) of simplicial toric algebras. We link these conic modules to the Bondal-Thomsen collection of line bundles on smooth toric…
This is an expository paper about several sophisticated forcing techniques closely related to standard finite support iterations of ccc partial orders. We focus on the four topics of ultrapowers of forcing notions, iterations along…
In this paper, we introduce two focussed sequent calculi, LKp(T) and LK+(T), that are based on Miller-Liang's LKF system for polarised classical logic. The novelty is that those sequent calculi integrate the possibility to call a decision…
We show that many countable support iterations of proper forcings preserve Souslin trees. We establish sufficient conditions in terms of games and we draw connections to other preservation properties. We present a proof of preservation…
For $f,g\in\omega^\omega$ let $c^\forall_{f,g}$ be the minimal number of uniform $g$-splitting trees needed to cover the uniform $f$-splitting tree, i.e., for every branch $\nu$ of the $f$-tree, one of the $g$-trees contains $\nu$. Let…
In the first part of this paper, we consider several natural axioms in urelement set theory, including the Collection Principle, the Reflection Principle, the Dependent Choice scheme and its generalizations, as well as other axioms…
In this article we adapt the existing account of class-forcing over a ZFC model to a model $(M,\mathcal{C})$ of Morse-Kelley class theory. We give a rigorous definition of class-forcing in such a model and show that the Definability Lemma…
It is believed arXiv:0808.2762, arXiv:math/9904055 that, among the coefficients entering Kontsevich's formality quasi-isomorphism arXiv:q-alg/9709040, there are irrational (possibly even transcendental) numbers. In this paper, we prove that…
In this paper, we establish an analogue of Craig Interpolation Property for a many-sorted variant of first-order hybrid logic. We develop a forcing technique that dynamically adds new constants to the underlying signature in a way that…
We prove that if $F$ is a non-zero (possibly non-cuspidal) vector-valued Siegel modular form of any degree, then it has infinitely many non-zero Fourier coefficients which are indexed by half-integral matrices having odd, square-free (and…
We introduce a generalization of stationary set reflection which we call "filter reflection", and show it is compatible with the axiom of constructibility as well as with strong forcing axioms. We prove the independence of filter reflection…
Let mu be singular of uncountable cofinality. If mu>2^{cf(mu)}, we prove that in P=([mu]^mu,supseteq) as a forcing notion we have a natural complete embedding of Levy(aleph_0, mu^+) (so P collapses mu^+ to aleph_0) and even Levy(aleph_0,…
We deal with relatives of GCH which are provable. In particular we deal with rank version of the revised GCH. Our motivation was to find such results when only weak versions of the axiom of choice are assumed but some of the results gives…