Related papers: Countable imaginary simple unidimensional theories
Supersymmetric states in M-theory are mapped after compactification to perturbatively non-supersymmetric states in type IIA string theory, with the supersymmetric parts being encoded in the non-perturbative section of the string theory. An…
We prove a computable version of the Hall Harem Theorem where the matching realizes a unary function with controlled sizes of cycles. We apply it to non-amenable computable coarse spaces. As a result, we obtain a computable version of the…
We classify the simple infinite dimensional integrable modules with finite dimensional weight spaces over the quantized enveloping algebra of an untwisted affine algebra. We prove that these are either highest (lowest) weight integrable…
The reduced C*-algebra of a countable linear group G is shown to be simple if and only if G has no nontrivial normal amenable subgroups. Moreover, these conditions are shown to be equivalent to the uniqueness of tracial state on the…
We develop a structure theory of connected solvable spherical subgroups in semisimple algebraic groups. Based on this theory, we obtain an explicit classification of all such subgroups up to conjugation.
A few steps are made towards representation theory of embeddability among uncountable graphs. A monotone class of graphs is defined by forbidding countable subgraphs, related to the graph's end-structure. Using a combinatorial theorem of…
We develop algebraic models of simple type theories, laying out a framework that extends universal algebra to incorporate both algebraic sorting and variable binding. Examples of simple type theories include the unityped and simply-typed…
We prove that in an arbitrary o-minimal structure, every interpretable group is definably isomorphic to a definable one. We also prove that every definable group lives in a cartesian product of one-dimensional definable group-intervals (or…
We present and study new definitions of universal and programmable universal unary functions and consider a new simplicity criterion: almost decidability of the halting set. A set of positive integers S is almost decidable if there exists a…
Finite semisimple group algebras for which all the minimal ideals are easily computable dimension (ECD) are characterized and some lower bounds for the minimum Hamming distance of group codes in these algebras are offered. Examples…
We prove that several results in different areas of number theory such as the divergent series, summation of arithmetic functions, uniform distribution modulo one and summation over prime numbers which are currently considered to be…
We give a simplified proof of elimination of imaginaries (in the geometric sorts) in ACVF, based on ideas of Hrushovski. This proof manages to avoid many of the technical issues which arose in the original proof by Haskell, Hrushovski, and…
Simple argument in favour of unitarity, to all orders, of space-like noncommutative theory is given.
This paper introduces a new simplified version of the countable branching recurrence of Computability Logic, proves its equivalence to the old one, and shows that the basic logic induced by it is a proper superset of the basic logic induced…
Recent work on the use of dimensional reduction for the regularisation of non--supersymmetric theories is reviewed. It is then shown that there exists a class of theories for which a universal form of the soft supersymmetry breaking terms…
We derive the N=1 supersymmetric extension for a class of weakly nonlocal four dimensional gravitational theories.The construction is explicitly done in the superspace and the tree-level perturbative unitarity is explicitly proved both in…
A general simplicity problem in category theory is proposed. A particular example, the simplest choice of generators of an algebra is specified and illustrated by an example.
We develop some basic results about full amalgamation classes with intrinsic trascendentals. These classes have generics whose models may have finite subsets whose intrinsic closure is not contained in its algebraic closure. We will show…
We use Shelah's theory of possible cofinalities in order to solve a problem about ultrafilters. THEOREM. Suppose that $ \lambda $ is a singular cardinal, $ \lambda ' < \lambda $, and the ultrafilter $D$ is $ \kappa $-decomposable for all…
We classify integrable bounded simple weight modules over classical Lie superalgebras at infinity. We also study the categories of such modules, and we prove that for most of the classical Lie superalgebras at infinity the respective…