Related papers: Admissibly Represented Spaces and Qcb-Spaces
We show pro-definability of spaces of definable types in various classical complete first order theories, including complete o-minimal theories, Presburger arithmetic, $p$-adically closed fields, real closed and algebraically closed valued…
Computable reducibility is a well-established notion that allows to compare the complexity of various equivalence relations over the natural numbers. We generalize computable reducibility by introducing degree spectra of reducibility and…
Using the previously developed concepts of semantic spacetime, I explore the interpretation of knowledge representations, and their structure, as a semantic system, within the framework of promise theory. By assigning interpretations to…
Representation theory is shown to be incomplete in terms of enumerating all integrable limits of quantum systems. As a consequence, one can find exactly solvable Hamiltonians which have apparently strongly broken symmetry. The number of…
Some results in C_k-theory are obtained with the use of bornologies. We investigate under which conditions the space of the continuous real functions with the compact-open topology is a productively countably tight space, which yields some…
We characterize three interrelated concepts in epistemic game theory: permissibility, proper rationalizability, and iterated admissibility. We define the lexicographic epistemic model for a game with incomplete information. Based on it, we…
We compute rationally the topological (complex) K-theory of the classifying space BG of a discrete group provided that G has a cocompact G-CW-model for its classifying space for proper G-actions. For instance word-hyperbolic groups and…
We prove two representability theorems, up to homotopy, for presheaves taking values in a closed symmetric combinatorial model category \cat V. The first theorem resembles the Freyd representability theorem, the second theorem is closer to…
Given two C*-algebras A and B, abstract A-B bimodules that can be isometrically represented as operator bimodules are characterised in terms of their norm. Various properties of such bimodules are given. Their theory is very similar to…
Classification is an important goal in many branches of mathematics. The idea is to describe the members of some class of mathematical objects, up to isomorphism or other important equivalence in terms of relatively simple invariants. Where…
Symmetries of trigonometric integrable two dimensional statistical face models are considered. The corresponding symmetry operators on the Hilbert space of states of the quantum version of these models define a weak *-Hopf algebra…
Quantum effects play an important role in quantum measurement theory. The set of all quantum effects can be organized into an algebraical structure called effect algebra. In this paper, we study various topologies on the Hilbert space…
Computability theory is a discipline in the intersection of computer science and mathematical logic where the fundamental question is: given two mathematical objects X and Y, does X compute Y in principle? In case X and Y are real numbers,…
Pre-trained large foundation models play a central role in the recent surge of artificial intelligence, resulting in fine-tuned models with remarkable abilities when measured on benchmark datasets, standard exams, and applications. Due to…
A compact set has computable type if any homeomorphic copy of the set which is semicomputable is actually computable. Miller proved that finite-dimensional spheres have computable type, Iljazovi\'c and other authors established the property…
In a recent paper, a realizability technique has been used to give a semantics of a quantum lambda calculus. Such a technique gives rise to an infinite number of valid typing rules, without giving preference to any subset of those. In this…
An affine model of computation is defined as a subset of iterated immediate-snapshot runs, capturing a wide variety of shared-memory systems, such as wait-freedom, t-resilience, k-concurrency, and fair shared-memory adversaries. The…
A large literature specifies conditions under which the information complexity for a sequence of numerical problems defined for dimensions $1, 2, \ldots$ grows at a moderate rate, i.e., the sequence of problems is tractable. Here, we focus…
Embedding spaces contain interpretable dimensions indicating gender, formality in style, or even object properties. This has been observed multiple times. Such interpretable dimensions are becoming valuable tools in different areas of…
We give an algorithm for computing the irreducible admissible representations of a real reductive group with regular integral infinitesimal character. This algorithm has been implemented on a computer, as part of the Atlas of Lie Groups and…