相关论文: Information completeness in Nelson algebras of rou…

We examine rigidity phenomena for representations of amenable operator algebras which have an ideal of compact operators. We establish that a generalized version of Kadison's conjecture on completely bounded homomorphisms holds for the…

We say a completely positive contractive map between two C*-algebras has order zero, if it sends orthogonal elements to orthogonal elements. We prove a structure theorem for such maps. As a consequence, order zero maps are in one-to-one…

Given an Archimedean vector lattice $E$, we present one elementary property of $E$ which is equivalent to the entire traditional list of axioms which makes $E$ a $\Phi$-algebra. We call a vector lattice with this property ``square closed".…

This paper establishes a theoretical framework connecting neural network learning with abstract algebraic structures. We first present a minimal counterexample demonstrating that standard neural networks completely fail on compositional…

Proof-theoretic methods are developed for subsystems of Johansson's logic obtained by extending the positive fragment of intuitionistic logic with weak negations. These methods are exploited to establish properties of the logical systems.…

By operations on models we show how to relate completeness with respect to permissive-nominal models to completeness with respect to nominal models with finite support. Models with finite support are a special case of permissive-nominal…

We say that a Lie algebra $\gfr$ is quasi-state rigid if every Ad-invariant continuous Lie quasi-state on it is the directional derivative of a homogeneous quasimorphism. Extending work of Entov and Polterovich, we show that every reductive…

We prove strong completeness of a range of substructural logics with respect to a natural poset-based relational semantics using a coalgebraic version of completeness-via-canonicity. By formalizing the problem in the language of coalgebraic…

Neural networks excel at pattern recognition but struggle with reliable logical reasoning, often violating basic logical principles during inference. We address this limitation by developing a categorical framework that systematically…

A fundamental result from Boolean modal logic states that a first-order definable class of Kripke frames defines a logic that is validated by all of its canonical frames. We generalise this to the level of non-distributive logics that have…

BS4 is a natural Belnapian conservative extension of Lewis modal system S4 via strong negation. In [24] it was proved that the translation TB that naturally generalises the Godel-Tarski translation T embeds faithfully Nelsons logic N4 into…

In this Part I, we shall prove the consistency of arithmetic without complete induction from a point of view of strong negation, using its embedding to the tableau system $\bf SN$ of constructive arithmetic with strong negation without…

Working in the context of symmetric spectra, we describe and study a homotopy completion tower for algebras and left modules over operads in the category of modules over a commutative ring spectrum (e.g., structured ring spectra). We prove…

Some of the consequences that follow from the C_2 condition of Zhu are analysed. In particular it is shown that every conformal field theory satisfying the C_2 condition has only finitely many n-point functions, and this result is used to…

An important, if relatively less well known aspect of the singularity theorems in Lorentzian Geometry is to understand how their conclusions fare upon weakening or suppression of one or more of their hypotheses. Then, theorems with modified…

We study algorithmic randomness notions via effective versions of almost-everywhere theorems from analysis and ergodic theory. The effectivization is in terms of objects described by a computably enumerable set, such as lower semicomputable…

$W$-algebras are certain algebraic structures associated to a finite dimensional Lie algebra $\mathfrak g$ and a nilpotent element $f$ via Hamiltonian reduction. In this note we give a review of a recent approach to the study of (classical…

Non-classical negations may fail to be contradictory-forming operators in more than one way, and they often fail also to respect fundamental meta-logical properties such as the replacement property. Such drawbacks are witnessed by intricate…

Five-valued Nelson algebras are those satisfying the condition: $((x\to z)\to y)\to(((y \to x)\to y)\to y)=1$. We give alternative equations defining these algebras, and determine the structure and number of elements of the free five-valued…

It is well-known that intuitionistic logics can be formalized by means of Brouwerian semilattices, i.e. relatively pseudocomplemented semilattices. Then the logical connective implication is considered to be the relative pseudocomplement…