Related papers: Nominal C-Unification
Formalizing syntactic proofs of properties of logics, programming languages, security protocols, and other formal systems is a significant challenge, in large part because of the obligation to handle name-binding correctly. We present an…
(1) There is a finitely presented group with a word problem which is a uniformly effectively inseparable equivalence relation. (2) There is a finitely generated group of computable permutations with a word problem which is a universal…
We prove that the $L_1$-norms associated with a positive element $a$ of a unital C*-algebra are equivalent to the norm of C*-algebra if and only if $a$ is invertible.
We give a definition of partition C*-algebras: To any partition of a finite set, we assign algebraic relations for a matrix of generators of a universal C*-algebra. We then prove how certain relations may be deduced from others and we…
It is generally well agreed that developing a unifying theory is one of the most important issues in Data Mining research. In the last two decades, a great deal of work has been devoted to the algorithmic aspects of the Frequent Itemset…
Nominal abstract syntax and higher-order abstract syntax provide a means for describing binding structure which is higher-level than traditional techniques. These approaches have spawned two different communities which have developed along…
Clones of functions play a foundational role in both universal algebra and theoretical computer science. In this work, we introduce clone merge monoids (cm-monoids), a unifying one-sorted algebraic framework that integrates abstract clones,…
We consider inductive systems of C*-algebras with completely positive contractive connecting maps. We define a condition, called C*-encoding, which is sufficient for the limit of the system to be completely order isomorphic to a C*-algebra…
We present a unified theory for formal mathematical systems including recursive systems closely related to formal grammars, including the predicate calculus as well as a formal induction principle. We introduce recursive systems generating…
We study the elementary C*-algebra whose elements are the sum of a diagonal plus a compact operator. We describe the structure of the unitary group, the sets of ideals, automorhisms and projections.
We provide an algebraic setting for cumulants and factorial moments through the classical umbral calculus. Main tools are the compositional inverse of the unity umbra, connected with the logarithmic power series, and a new umbra here…
We give a quick survey of the various fixed point theorems in computability theory, partial combinatory algebra, and the theory of numberings, as well as generalizations based on those. We also point out several open problems connected to…
In the current paper, we generalize the "compact operator" part of the Voiculescu's non-commutative Weyl-von Neumann theorem on approximate equivalence of unital $*$-homomorphisms of an commutative C$^*$ algebra $\mathcal{A}$ into a…
We obtain partial affirmative answers to the question whether isomorphism of the unitary groups of two C*-algebras, either as topological groups or as discrete groups, implies isomorphism of the C*-algebras as real C*-algebras.
We prove a "quantified" version of the Weyl-von Neumann theorem, more precisely, we estimate the ranks of approximants to compact operators appearing in the Voiculescu's theorem applied to commutative algebras. This allows considerable…
Exactly solving first-order constraints (i.e., first-order formulas over a certain predefined structure) can be a very hard, or even undecidable problem. In continuous structures like the real numbers it is promising to compute approximate…
Universal continuous calculi are defined and it is shown that for every finite tuple of pairwise commuting Hermitian elements of a Su*-algebra (an ordered *-algebra that is symmetric, i.e. "strictly" positive elements are invertible, and…
We present formalized proofs verifying that the first-order unification algorithm defined over lists of satisfiable constraints generates a most general unifier (MGU), which also happens to be idempotent. All of our proofs have been…
The concept of quantization consists in replacing commutative quantities by noncommutative ones. In mathematical language an algebra of continuous functions on a locally compact topological space is replaced with a noncommutative…
In this note one tries to venture into a study of some notions, in the context of a (unital) normed algebra, in particular the algebra of operators on a Hilbert space. Namely, one considers ``moving norms'', i.e.\ norming an element minus a…