Related papers: The Implicitly Constructible Universe
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…
Implicit Computational Complexity makes two aspects implicit, by manipulating programming languages rather than models of com-putation, and by internalizing the bounds rather than using external measure. We survey how automata theory…
Motivated by algorithmic information theory, the problem of program discovery can help find candidates of underlying generative mechanisms of natural and artificial phenomena. The uncomputability of such inverse problem, however,…
Recent work by Faizal et al. (2025) claims that G\"odelian undecidability of non-algorithmic truths in our universe imply the impossibility of a formal, algorithmic simulation of the universe. This paper clarifies the distinction between…
In this short paper, we conjecture a correspondence between the creation of the universe in entangled pairs and eternal black holes. We shall see that this correspondence will restore the matter-antimatter asymmetry at the beginning of the…
This article is a continuation of a paper of the first author \cite{F} about complex structures on real Banach spaces. We define a notion of even infinite dimensional real Banach space, and prove that there exist even spaces, including HI…
We study quadratic Lie algebras over a field K of null characteristic which admit, at the same time, a symplectic structure. We see that if K is algebraically closed every such Lie algebra may be constructed as the T*-extension of a…
Given a symplectic (respectively, orthogonal) parabolic vector bundle over a compact Riemann surface, we prove that its pullback and direct image through a map between compact Riemann surfaces inherit a natural symplectic (respectively,…
We show that globally and regularly hyperbolic future geodesically incomplete isotropic universes, except for the standard all-encompassing `big crunch', can accommodate singularities of only one kind, namely, those having a non-integrable…
Are all subcategories of locally finitely presentable categories that are closed under limits and $\lambda$-filtered colimits also locally presentable? For full subcategories the answer is affirmative. Makkai and Pitts proved that in the…
This article presents simple and easy proofs of the Implicit Function Theorem and the Inverse Function Theorem, in this order, both of them on a finite-dimensional Euclidean space, that employ only the Intermediate Value Theorem and the…
To understand changes in physical systems and facilitate decisions, explaining how model predictions are made is crucial. We use model-based interpretability, where models of physical systems are constructed by composing basic constructs…
In the present paper we obtain a new homological version of the implicit function theorem and some versions of the Darboux theorem. Such results are proved for continuous maps on topological manifolds. As a consequence, some versions of…
We present an obstruction theoretic inductive construction of intersection space pairs, which generalizes Banagl's construction of intersection spaces for arbitrary depth stratifications. We construct intersection space pairs for…
If our universe has appeared in a result of Big Bang or something like this, whether we have reasons to deny an existence of other universes appearing by the same or similar way? An objection that there is no anything like it, is doubtful,…
In recent work of Bringmann, Guerzhoy, and the first author, p-adic modular forms were constructed from mock modular forms. This paper proves explicit congruences for these p-adic modular forms.
We present the linear first-order intermediate language IL for verified compilers. IL is a functional language with calls to a nondeterministic environment. We give IL terms a second, imperative semantic interpretation and obtain a register…
We revisit the construction of stable envelopes in equivariant elliptic cohomology [arXiv:1604.00423] and give a direct inductive proof of their existence and uniqueness in a rather general situation. We also discuss the specialization of…
Let d \subset d' be finite-dimensional Lie algebras, H = U(d), H'=U(d') the corresponding universal enveloping algebras endowed with the cocommutative Hopf algebra structure. We show that if L is a primitive Lie pseudoalgebra over H then…
In Inverse subsumption for complete explanatory induction Yamamoto et al. investigate which inductive logic programming systems can learn a correct hypothesis $H$ by using the inverse subsumption instead of inverse entailment. We prove that…