Related papers: The core model induction beyond $L(\mathbb{R})$: n…
In this paper, we show that the failure of the unique branch hypothesis (UBH) for tame trees (see \rdef{tame iteration tree}) implies that in some homogenous generic extension of $V$ there is a transitive model $M$ containing $Ord \cup…
We discuss a conjecture of Wilson that under the proper forcing axiom, $\Theta_0$ of the derived model at $\kappa$ is below $\kappa^+$. We prove the conjecture holds for the old derived model. Assuming mouse capturing in the new derived…
This paper makes significant progress towards resolving a conjecture relating strong forcing axioms like $PFA$ and the derived model at a limit of Woodin cardinals $\kappa$. In particular, using a concept called Covering Matrices, we show…
Assume ZF + AD + $V=L(\mathbb{R})$. We prove some "mouse set" theorems, for definability over $J_\alpha(\mathbb{R})$ where $[\alpha,\alpha]$ is a projective-like gap (of $L(\mathbb{R})$) and $\alpha$ is either a successor ordinal or has…
An automorphism $F$ of the polynomial ring in $n$ variables over a field of characteristic zero is said to be {\it co-tame} if the subgroup of the automorphism group of the polynomial ring generated by $F$ and affine automorphisms contains…
We introduce a quantum-like classical computational model, called affine computation, as a generalization of probabilistic computation. After giving the basics of affine computation, we define affine finite automata (AfA) and compare it…
In the previous work, we have given a novel, game-semantic model of computation in an intrinsic, non-inductive and non-axiomatic manner, which is similar to Turing machines but beyond computation on natural numbers, e.g., higher-order…
In this paper we consider a nondeterministic computation by deterministic multi-head 2-way automata having a read-only access to an auxiliary memory. The memory contains additional data (a guess) and computation is successful iff it is…
Let kappa be the least ordinal alpha such that L_{alpha}(R) is admissible. Let A be the set of reals x such that x is ordinal definable in L_{\alpha}(R), for some alpha<kappa. It is well known that (assuming determinacy) A is the largest…
Tennenbaum's theorem states that PA does not admit any nonstandard computable model. In 2022, Pakhomov proved that this theorem is fragile in regards to how PA is expressed, by constructing a theory that is definitionally equivalent to PA…
Foundations of the theory of vertex algebras are extended to the non-Archimedean setting.
We prove in this paper that there is a language $L_s$ accepted by some nondeterministic Turing machine that runs within time $O(n^k)$ for any positive integer $k\in\mathbb{N}_1$ but not by any ${\rm co}\mathcal{NP}$ machines. Then we…
Krueger showed that PFA implies that for all regular $\Theta \ge \aleph_2$, there are stationarily many $[H(\Theta)]^{\aleph_1}$ that are internally club but not internally approachable. From countably many Mahlo cardinals, we force a model…
Let $M$ be a fine structural mouse and let $F\in M$ be such that $M\models$``$F$ is a total extender'' and $(M||\mathrm{lh}(F),F)$ is a premouse. We show that it follows that $F\in\mathbb{E}^M$, where $\mathbb{E}^M$ is the extender sequence…
We prove the following facts about the language recognition power of quantum Turing machines (QTMs) in the unbounded error setting: QTMs are strictly more powerful than probabilistic Turing machines for any common space bound $ s $…
In finite-dimensional simple Lie algebras and affine Kac-Moody Lie algebras, Chevalley involutions are crucial ingredients of the modular theory. Towards establishing the modular theory for extended affine Lie algebras, we investigate the…
We propose to consider non confluence with respect to implicit complexity. We come back to some well known classes of first-order functional program, for which we have a characterization of their intentional properties, namely the class of…
We give an overview of the category of subgroups of the modular group, incorporating both the tame part, i.e. finite index subgroups, and the non-tame part, i.e. the rest. We also discuss arithmetic related questions which exist in both the…
In this paper we explore a connection between descriptive set theory and inner model theory. From descriptive set theory, we will take a countable, definable set of reals, A. We will then show that A is equal to the reals of M, where M is a…
We present a framework for model theoretic forcing in a non-first-order context, and present some applications of this framework to Banach space theory.