Related papers: Low Sets and Closure Properties of Counting Functi…
Kanerva (2014) suggested that it would be possible to construct a complete Lisp out of a vector-symbolic architecture. We present the general form of a vector-symbolic representation of the five Lisp elementary functions, lambda…
We show that restricting the elimination principle of the natural numbers type in Martin-L\"of Type Theory (MLTT) to a universe of types not containing $\Pi$-types ensures that all definable functions are primitive recursive. This extends…
Let G denote a connected, quasi-split reductive group over a field F that is complete with respect to a discrete valuation and that has a perfect residue field. Under mild hypotheses, we produce a subset of the Lie algebra g(F) that picks…
The downward and upward closures of a regular language $L$ are obtained by collecting all the subwords and superwords of its elements, respectively. The downward and upward interiors of $L$ are obtained dually by collecting words having all…
We present a model-theoretic property of finite structures, that can be seen to be a finitary analogue of the well-studied downward L\"owenheim-Skolem property from classical model theory. We call this property as the…
Closed classes of three-valued logic generated by symmetric funtions that equal $1$ in almost all tuples from $\{1,2\}^n$ and equal $0$ on the rest tuples are considered. Criteria for bases existence for these classes is obtained.
We introduce XCOMPS in this work, a multilingual conceptual minimal pair dataset covering 17 languages. Using this dataset, we evaluate LLMs' multilingual conceptual understanding through metalinguistic prompting, direct probability…
We introduce an operator on classes of regular languages, the star-free closure. Our motivation is to generalize standard results of automata theory within a unified framework. Given an arbitrary input class $C$, the star-free closure…
We demonstrate that any $\Pi_\alpha$ sentence of the infinitary logic $L_{\omega_1 \omega}$ extending the theory of linear orderings has a model with a $\Pi_{\alpha+4}$ Scott sentence and hence of Scott rank at most $\alpha+3$. In other…
Many natural combinatorial problems can be expressed as constraint satisfaction problems. This class of problems is known to be NP-complete in general, but certain restrictions on the form of the constraints can ensure tractability. The…
Humans understand new combinations of words encountered if they are combinations of words recognized from different contexts, an ability called Compositional Generalization. The COGS benchmark (Kim and Linzen, 2020) arXiv:2010.05465 reports…
We study the complexity classes P and NP through a semigroup fP ("polynomial-time functions"), consisting of all polynomially balanced polynomial-time computable partial functions. Then P is not equal to NP iff fP is a non-regular…
Instruction-tuned large language models produce helpful, structured responses, but how robust is this helpfulness under trivial constraints? We show that simple lexical constraints (banning a single punctuation character or common word)…
We compare the complexity of the search and decision problems for the complexity class S2P. While Cai (2007) showed that the decision problem is contained in ZPP^NP, we show that the search problem is equivalent to TFNP^NP, the class of…
Pomsets constitute one of the most basic models of concurrency. A pomset is a generalisation of a word over an alphabet in that letters may be partially ordered. A term $t$ using the bi-Kleene operations $0,1, +, \cdot\, ,^*, \parallel,…
We characterize the (sequentially) weak and strong closure of planar diffeomorphisms in the Sobolev topology and we show that they always coincide. We also provide some sufficient condition for a planar map to be approximable by…
We prove two new results about the randomized query complexity of composed functions. First, we show that the randomized composition conjecture is false: there are families of partial Boolean functions $f$ and $g$ such that $R(f\circ g)\ll…
We give a complete characterization of connected Lie groups with the Approximation Property for groups (AP). To this end, we introduce a strengthening of property (T), that we call property (T*), which is a natural obstruction to the AP. In…
Probabilistic programming languages (PPLs) allow users to encode arbitrary inference problems, and PPL implementations provide general-purpose automatic inference for these problems. However, constructing inference implementations that are…
We use a version of Haboush's theorem over complete local Noetherian rings to prove faithfulness of the lifting for semisimple cosemisimple Hopf algebras and separable (braided, symmetric) fusion categories from characteristic $p$ to…