Related papers: Failure of Normalization in Impredicative Type The…
Propositional formulas that are equivalent in intuitionistic logic, or in its extension known as the logic of here-and-there, have the same stable models. We extend this theorem to propositional formulas with infinitely long conjunctions…
We give a definition of finitary type theories that subsumes many examples of dependent type theories, such as variants of Martin-L\"of type theory, simple type theories, first-order and higher-order logics, and homotopy type theory. We…
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…
There are two possible computational interpretations of second-order arithmetic: Girard's system F or Spector's bar recursion and its variants. While the logic is the same, the programs obtained from these two interpretations have a…
In this paper we scrutinize the so called Principle of Local Lorentz Invariance (\emph{PLLI}) that many authors claim to follow from the Equivalence Principle. Using rigourous mathematics we introduce in the General Theory of Relativity two…
The purpose of the present paper is to discuss the following conjecture of Fel'shtyn and Hill, which is a generalization of the classical Burnside theorem: Let G be a countable discrete group, f its automorphism, R(f) the number of…
We introduce a modification of standard Martin-Lof type theory in which we eliminate definitional equality and replace all computation rules by propositional equalities. We show that type checking for such a system can be done in quadratic…
Incomputability results in Formal Logic and the Theory of Computation (i.e., incompleteness and undecidability) have deep implications for the foundations of mathematics and computer science. Likewise, Social Choice Theory, a branch of…
A very simple example demonstrates that Fisher's application of the conditionality principle to regression ("fixed-$x$ regression"), endorsed by Sprott and many other followers, makes prediction impossible in the context of statistical…
We generalize the construction of Raynaud of smooth projective surfaces of general type in positive characteristic that violate the Kodaira vanishing theorem. This corrects an earlier paper of the same purpose. These examples are smooth…
Arrow's Impossibility Theorem is a seminal result of Social Choice Theory that demonstrates the impossibility of ranked-choice decision-making processes to jointly satisfy a number of intuitive and seemingly desirable constraints. The…
Several theorems about the equivalence of familiar theories of reverse mathematics with certain well-ordering principles have been proved by recursion-theoretic and combinatorial methods (Friedman, Marcone, Montalban et al.) and with…
In this paper the authors produce a projective indecomposable module for the Frobenius kernel of a simple algebraic group in characteristic $p$ that is not the restriction of an indecomposable tilting module. This yields a counterexample to…
We generalize a previous inequality related to a sharp version of the Littlewood conjecture on the minimal $L_1$-norm of $N$-term exponential sums $f$ on the unit circle. The new result concerns replacing the expression $\log(1+t|f|^2)$…
The usual homogeneous form of equality type in Martin-L\"of Type Theory contains identifications between elements of the same type. By contrast, the heterogeneous form of equality contains identifications between elements of possibly…
When it isn't possible to tell two distinct experimental procedures apart purely from their input/output statistics, then it seems a plausible hypothesis that the two procedures must be physically identical. We call such a hypothesis…
In this short note, we give a sketch of a new proof of the exponential contraction of the Feigenbaum renormalization operator in the hybrid class of the Feigenbaum fixed point. The proof uses the non existence of invariant line fields in…
For a local analytic diffeomorphism of the plane with an irrational elliptic fixed point at 0, we introduce the notion of ``geometric normalization'', which includes the classical formal normalizations as a special case: it is a formal…
In this paper we explore a family of type isomorphisms in System F whose validity corresponds, semantically, to some form of the Yoneda isomorphism from category theory. These isomorphisms hold under theories of equivalence stronger than…
This paper presents a type theory with a form of equality reflection: provable equalities can be used to coerce the type of a term. Coercions and other annotations, including implicit arguments, are dropped during reduction of terms. We…