Related papers: Typability and Type Inference in Atomic Polymorphi…
Fixing some computably enumerable theory $T$, the Friedman-Goldfarb-Harrington (FGH) theorem says that over elementary arithmetic, each $\Sigma_1$ formula is equivalent to some formula of the form $\Box_T \varphi$ provided that $T$ is…
A common approach to improve software quality is to use programming guidelines to avoid common kinds of errors. In this paper, we consider the problem of enforcing guidelines for Featherweight Java (FJ). We formalize guidelines as sets of…
Path polymorphism is the ability to define functions that can operate uniformly over arbitrary recursively specified data structures. Its essence is captured by patterns of the form $x\,y$ which decompose a compound data structure into its…
This paper investigates the decidability of opacity in timed automata (TA), a property that has been proven to be undecidable in general. First, we address a theoretical gap in recent work by J. An et al. (FM 2024) by providing necessary…
The problem of attempting to learn the mapping between data and labels is the crux of any machine learning task. It is, therefore, of interest to the machine learning community on practical as well as theoretical counts to consider the…
In this work, we show that very natural, apparently simple problems in quantum measurement theory can be undecidable even if their classical analogues are decidable. Undecidability hence appears as a genuine quantum property here. Formally,…
For each nonnegative integer $g$, we classify the ramification types and monodromy groups of indecomposable coverings of complex curves $f: X\to Y$ where $X$ has genus $g$, under the hypothesis that $n:=\deg(f)$ is sufficiently large and…
Variational Principle (VP) forms diffeomorphisms with prescribed Jacobian determinant (JD) and curl. Examples demonstrate that, (i) JD alone can not uniquely determine a diffeomorphism without curl; and (ii) the solutions by VP seem to…
We introduce an intersection type system for the lambda-mu calculus that is invariant under subject reduction and expansion. The system is obtained by describing Streicher and Reus's denotational model of continuations in the category of…
Postulating an impredicative universe in dependent type theory allows System F style encodings of finitary inductive types, but these fail to satisfy the relevant {\eta}-equalities and consequently do not admit dependent eliminators. To…
The \emph{Orbit Problem} consists of determining, given a linear transformation $A$ on $\mathbb{Q}^d$, together with vectors $x$ and $y$, whether the orbit of $x$ under repeated applications of $A$ can ever reach $y$. This problem was…
Session types statically prescribe bidirectional communication protocols for message-passing processes and are in a Curry-Howard correspondence with linear logic propositions. However, simple session types cannot specify properties beyond…
The relation between thermodynamic phase transitions in classical systems and topology changes in their configuration space is discussed for a one-dimensional, analytically tractable solid-on-solid model. The topology of a certain family of…
The "Tate forms" for elliptically fibered Calabi-Yau manifolds are reconsidered in order to determine their general validity. We point out that there were some implicit assumptions made in the original derivation of these "Tate forms" from…
In this paper, we investigate structural properties of finite groups that are detected by certain group invariants arising from Dijkgraaf--Witten theory, a topological quantum field theory, in one space and one time dimension. In this…
Let F = F_p for any fixed prime p >= 2. An affine-invariant property is a property of functions on F^n that is closed under taking affine transformations of the domain. We prove that all affine-invariant property having local…
We seek to create tools for a model-theoretic analysis of types in algebraically closed valued fields (ACVF). We give evidence to show that a notion of 'domination by stable part' plays a key role. In Part A, we develop a general theory of…
Although topological band theory has been used to discover and classify a wide array of novel topological phases in insulating and semi-metal systems, it is not well-suited to identifying topological phenomena in metallic or gapless…
This work deals with the definability problem by quantifier-free first-order formulas over a finite algebraic structure. We show the problem to be coNP-complete and present two decision algorithms based on a semantical characterization of…
Region-based type systems are a powerful tool for various kinds of program analysis. We introduce a new inference algorithm for region types based on an abstract notion of environment transformation. It analyzes the code of a method only…