Related papers: A version of the Jensen-Johnsbr{\aa}ten coding at …

We present a proof of Jensen's Coding Theorem (assumong -0#) which quotes the covering lemma, but otherwise makes no appeal to fine structure theory. The key idea is to use a modified definition of the coding at limit cardinals, using…

In this paper we produce a real r such that 0<r<0# in L-degree, yet R is NOT generic over L (for a forcing amenable to L). This answers a question of Beller-Jensen-Welch.

This paper is concerned with extensions of geometric stability theory to some nonelementary classes. We prove the following theorem: Theorem: Let C be a large homogeneous model of a stable diagram D. Let p, q in S_D(A), where p is…

A $3$-uniform loose cycle, denoted by $C_t$, is a $3$-graph on $t$ vertices whose vertices can be arranged cyclically so that each hyperedge consists of three consecutive vertices, and any two consecutive hyperedges share exactly one…

Let A be a subset of $\F_p^n$, the $n$-dimensional linear space over the prime field $\F_p$ of size at least $\de N$ $(N=p^n)$, and let $S_v=P^{-1}(v)$ be the level set of a homogeneous polynomial map $P:\F_p^n\to\F_p^R$ of degree $d$, and…

The paper is the second of our series of notes aimed to bring back in circulation some bright ideas of early modern set theory, mainly due to Harrington and Sami, which have never been adequately presented in set theoretic publications. We…

This is the third in a sequence of three papers in which we prove the following generalization of Thomassen's 5-choosability theorem: Let $G$ be a finite graph embedded on a surface of genus $g$. Then $G$ can be $L$-colored, where $L$ is a…

We develop the theory of layered posets, and use the notion of layering to prove a new iteration theorem (Theorem 6): if $\kappa$ is weakly compact then any universal Kunen iteration of $\kappa$-cc posets (each possibly of size $\kappa$) is…

Let $P(n)$ be the number of polyominoes of $n$ cells and $\lambda$ be Klarner's constant, that is, $\lambda=\lim_{n\to\infty} \sqrt[n]{P(n)}$. We show that there exist some positive numbers $A,T$, so that for every $n$ \[ P(n) \ge…

We prove a strengthening of Chang's lemma for subsets of $\mathbb F_p^n$. The classical conclusion that the large spectrum is contained in a subspace of dimension at most $2\varepsilon^{-2}\log(1/\alpha)$ is refined to show that every…

We consist of first presenting Zeckendorf Theorem with these two versions Fibonacci and Luca. In this document we obtain results on the generalized of the Zeckendorf theorem for Fibonacci numbers (multibonacci). Such results find…

We introduce a category whose objects are stationary set preserving complete boolean algebras and whose arrows are complete homomorphisms with a stationary set preserving quotient. We show that the cut of this category at a rank initial…

The Standard Model of particle physics can be deduced from a small number of axioms within Connes' noncommutative geometry (NCG). Boyle and Farnsworth [New J. Phys. 16 (2014) 123027] proposed to interpret Connes' approach as an algebra…

We present a simplification of Jensen's proof of his Coding Theorem (even in the case where 0# exists). The proof avoids Jensen's split into cases according to whether or not 0# exists. In addition, the paper contains self-contained proofs…

Let $A$ be an infinite set. Let $\Omega(A)$ be the algebra over $A$ where every constant is a fundamental constant and every finitary function is a fundamental operation. We shall give a method of representing any algebra $\mathcal{L}$ in…

Shoenfield's completeness theorem (1959) states that every true first order arithmetical sentence has a recursive $\omega$-proof encodable by using recursive applications of the $\omega$-rule. For a suitable encoding of Gentzen style…

We force the existence of a chain of length $\omega_3$ in $[\omega_1]^{\omega_1}$ increasing modulo finite. The construction involves symmetric systems of models of two types as side conditions, introduced by the second author. This…

We use a way to extend partial combinatory algebras (pcas) by forcing them to represent certain functions. In the case of Scott's Graph model, equality is computable relative to the complement function. However, the converse is not true.…

There have been many generalizations of Shoenfield's Theorem on the absoluteness of $\Sigma^1_2$ sentences between uncountable transitive models of $\mathrm{ZFC}$. One of the strongest versions currently known deals with $\Sigma^2_1$…

We consider a natural generalization of the Nagell-Ljunggren equation to the case where the qth power of an integer y, for q >= 2, has a base-b representation that consists of a length-l block of digits repeated n times, where n >= 2.…