相关论文: Reasonably complete forcing notions
We study the strength of well-founded ultrafilters on ordinals above choiceless large cardinals and their associated Prikry forcings. Gabriel Goldberg showed that all but boundedly many regular cardinals above a rank Berkeley cardinal carry…
We show, assuming the consistency of one measurable cardinal, that it is consistent for there to be exactly kappa+ many normal measures on the least measurable cardinal kappa. This answers a question of Stewart Baldwin. The methods…
In this paper we provide an identity between determinant and generalized matrix function. Also, a criterion of positive semi-definite matrices affirming the permanent dominant conjecture is given. As a consequence, infinitely many infinite…
We extend and improve the result of Makkai and Par\'e that the powerful image of any accessible functor F is accessible, assuming there exists a sufficiently large strongly compact cardinal. We reduce the required large cardinal assumption…
Justin Moore's weak club-guessing principle $\mho$ admits various possible generalizations to the second uncountable cardinal. One of them was shown to hold in ZFC by Shelah. A stronger one was shown to follow from several consequences of…
We study the question, what computational power is sufficient to perform constructions using either Laver or Hechler forcing. As a result, we obtain a separation between three relativised non-lowness classes that are the…
We prove various iteration theorems for forcing classes related to subproper and subcomplete forcing, introduced by Jensen. In the first part, we use revised countable support iterations, and show that 1) the class of subproper,…
While modal extensions of decidable fragments of first-order logic are usually undecidable, their monodic counterparts, in which formulas in the scope of modal operators have at most one free variable, are typically decidable. This only…
In this paper we introduce a tree-like forcing notion extending some properties of the random forcing in the context of the generalised Cantor space and study its associated ideal of null sets and notion of measurability. This issue was…
A set $A$ of integers is called total if there is an algorithm which, given an enumeration of $A$, enumerates the complement of $A$, and called cototal if there is an algorithm which, given an enumeration of the complement of $A$,…
We adapt (over $\mathbb{F}_2$) the general notions of multiplicative function, Dirichlet convolution and Inverse. We get some interesting results, namely necessary conditions for an odd binary polynomial to be perfect. Note that we are…
We prove that consistently there is a singular cardinal $\kappa$ of uncountable cofinality such that $2^\kappa$ is weakly inaccessible, and every regular cardinal strictly between $\kappa$ and $2^\kappa$ is the character of some uniform…
The lambda-PRK-calculus is a typed lambda-calculus that exploits the duality between the notions of proof and refutation to provide a computational interpretation for classical propositional logic. In this work, we extend lambda-PRK to…
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…
We prove some consistency results about b(lambda) and d(lambda), which are natural generalisations of the cardinal invariants of the continuum b and d. We also define invariants b_cl(lambda) and d_cl(lambda), and prove that almost always…
We show that it is equiconsistent with $\mathsf{ZF}$ that Fodor's lemma fails everywhere, and furthermore that the club filter on every regular cardinal is not even $\sigma$-complete. Moreover, these failures can be controlled in a very…
We prove the universality of the regular realizability problems for several classes of filters. The filters are encodings of finite relations on the set of non-negative integers in the format proposed by P. Wolf and H. Fernau. The…
We study principles of the form: if a name $\sigma$ is forced to have a certain property $\varphi$, then there is a ground model filter $g$ such that $\sigma^g$ satisfies $\varphi$. We prove a general correspondence connecting these name…
In this paper, we define a new realizability semantics for the simply typed lambda-mu-calculus. We show that if a term is typable, then it inhabits the interpretation of its type. We also prove a completeness result of our realizability…
Machine learning researchers and practitioners steadily enlarge the multitude of successful learning models. They achieve this through in-depth theoretical analyses and experiential heuristics. However, there is no known general-purpose…