Related papers: Forcing axioms for $\lambda$-complete $\mu^+$-C.C
Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction is well understood for Kripke semantics, non-normal modal logics…
This paper presents the main results in my Ph.D. thesis. In what follows several proofs of SCH are presented introducing a family of covering properties which implies both SCH and the failure of various forms of square. These covering…
The purpose of this article is to prove that the forcing axiom for completely proper forcings is inconsistent with the Continuum Hypothesis. This answers a longstanding problem of Shelah. The corresponding completely proper forcing which…
It is well known that pretameness implies the forcing theorem, and that pretameness is characterized by the preservation of the axioms of $\mathsf{ZF}^-$, that is $\mathsf{ZF}$ without the power set axiom, or equivalently, by the…
We find and prove a factorization formula for certain Macdonald Littlewood-Richardson coefficients $c_{\lambda\mu}^{\nu}(q,t)$. Namely, we consider the case that the Kostka number $K_{\mu, \nu -\lambda}$ is $1$. This settles a particular…
We prove a central limit theorem with aassumptions which are many weak than classical conditions
In this paper, we present a general realizability semantics for the simply typed $\lambda\mu$-calculus. Then, based on this semantics, we derive both weak and strong normalization results for two versions of the $\lambda\mu$-calculus…
To verify the universal validity of the "two-sided" monotonicity condition introduced in [8], we will apply it to include more classical examples. The present paper selects the $L^{p}$ convergence case for this purpose. Furthermore, Theorem…
For an ordinal $\lambda>0$, we use the Erd\H{o}s--Rado partition theorem to prove the failure of strong completeness of $\mathsf{GL}$ for modal languages of cardinality $(2^{|\lambda|+\aleph_0})^{+}$ with respect to models on ordinals…
We study various formulations of the completeness of first-order logic phrased in constructive type theory and mechanised in the Coq proof assistant. Specifically, we examine the completeness of variants of classical and intuitionistic…
We prove the consistency of: for suitable strongly inaccessible cardinal lambda the dominating number, i.e. the cofinality of lambda^lambda is strictly bigger than cov(meagre_lambda), i.e. the minimal number of nowhere dense subsets of…
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…
We prove the density of the sets of the form ${{\lambda}_1^m {\mu}_1^n {\xi}_1 +...+{\lambda}_k^m {\mu}_k^n {\xi}_k : m,n \in \mathbb N}$ modulo one, where $\lambda_i$ and $\mu_i$ are multiplicatively independent algebraic numbers…
The Lambek calculus can be considered as a version of non-commutative intuitionistic linear logic. One of the interesting features of the Lambek calculus is the so-called "Lambek's restriction," that is, the antecedent of any provable…
We give a sufficient condition under which every finite-satisfiable formula of a given PCTL fragment has a model with at most doubly exponential number of states (consequently, the finite satisfiability problem for the fragment is in…
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 introduce the antipodal pairs property for probability measures on finite Boolean algebras and prove that conditional versions imply strong forms of log-concavity. We give several applications of this fact, including improvements of some…
The algebraic lambda calculus and the linear algebraic lambda calculus are two extensions of the classical lambda calculus with linear combinations of terms. They arise independently in distinct contexts: the former is a fragment of the…
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…
Forcing axioms are generalizations of Baire category principles that allow one to intersect more dense open sets and to do so in a wider variety of circumstances. In this paper we introduce two new forcing axioms related to posets which…