English
Related papers

Related papers: A mixed logic with binary operators

200 papers

We obtain exhaustive results and treat in a unified way the question of boundedness, compactness, and weak compactness of composition operators from the Bloch space into any space from a large family of conformally invariant spaces that…

Functional Analysis · Mathematics 2016-11-07 Manuel D. Contreras , Santiago Diaz-Madrigal , Dragan Vukotic

In this paper, we study weak bialgebras and weak Hopf algebras. These algebras form a class wider than bialgebras respectively Hopf algebras. The main results of this paper are Kaplansky's constructions type which lead to weak bialgebras or…

Rings and Algebras · Mathematics 2010-01-14 Zoheir Chebel , Abdenacer Makhlouf

We prove a boundedness criterion for a class of dyadic multilinear forms acting on two-dimensional functions. Their structure is more general than the one of classical multilinear Calder\'{o}n-Zygmund operators as several functions can now…

Classical Analysis and ODEs · Mathematics 2014-11-10 Vjekoslav Kovač , Christoph Thiele

The weak operator topology closed operator algebra on $L^2(R)$ generated by the one-parameter semigroups for translation, dilation and multiplication by $exp(i\lambda x), \lambda \geq 0$, is shown to be a reflexive operator algebra, in the…

Operator Algebras · Mathematics 2015-03-06 Eleftherios Kastis , Stephen Power

In the setting of modern mathematical logic and model theory, classification theory has been one of the landmark achievements of the field. Likewise, the classification of UHF-algebras and AF-algebras were substantial contributions to the…

Operator Algebras · Mathematics 2019-07-15 Patrick Fraser

We study losses for binary classification and class probability estimation and extend the understanding of them from margin losses to general composite losses which are the composition of a proper loss with a link function. We characterise…

Machine Learning · Statistics 2009-12-18 Mark D. Reid , Robert C. Williamson

Class imbalance poses a significant challenge to supervised classification, particularly in critical domains like medical diagnostics and anomaly detection where minority class instances are rare. While numerous studies have explored…

Machine Learning · Computer Science 2025-09-10 Ali Nawaz , Amir Ahmad , Shehroz S. Khan

We present a propositional logic with fundamental probabilistic semantics, in which each formula is given a real measure in the interval $[0,1]$ that represents its degree of truth. This semantics replaces the binarity of classical logic,…

Logic in Computer Science · Computer Science 2025-05-22 Francisco Aragão

We study bilinear embedding models for the task of multi-relational link prediction and knowledge graph completion. Bilinear models belong to the most basic models for this task, they are comparably efficient to train and use, and they can…

Machine Learning · Computer Science 2017-09-15 Yanjie Wang , Rainer Gemulla , Hui Li

Multi-adjoint logic programming is a general framework with interesting features, which involves other positive logic programming frameworks such as monotonic and residuated logic programming, generalized annotated logic programs, fuzzy…

Logic in Computer Science · Computer Science 2024-09-25 M. Eugenia Cornejo , David Lobo , Jesús Medina

Let $V$ be a vertex operator algebra and $A^{\infty}(V)$ and $A^{N}(V)$ for $N\in \mathbb{N}$ the associative algebras introduced by the author in [H5]. For a lower-bounded generalized $V$-module $W$, we give $W$ a structure of graded…

Quantum Algebra · Mathematics 2022-11-09 Yi-Zhi Huang

The paper is concerned with compact bilinear operators on asymmetric normed spaces. The study of multilinear operators on asymmetric normed spaces was initiated by Latreche and Dahia, Colloq. Math. (2020). We go further in this direction…

Functional Analysis · Mathematics 2021-11-09 S. Cobzaş

This article fits in the area of research that investigates the application of topological duality methods to problems that appear in theoretical computer science. One of the eventual goals of this approach is to derive results in…

Logic in Computer Science · Computer Science 2022-01-05 Mehdi Zaïdi

Using the tensor category theory developed by Lepowsky, Zhang and the second author, we construct a braided tensor category structure with a twist on a semisimple category of modules for an affine Lie algebra at an admissible level. We…

Quantum Algebra · Mathematics 2018-08-29 Thomas Creutzig , Yi-Zhi Huang , Jinwei Yang

We introduce the class of unbounded $M$-weakly operators and the class of unbounded $L$-weakly compact operators. We investigate some properties for these new classification of operators and we study relation between them and $M$-weakly…

Functional Analysis · Mathematics 2021-09-16 Zahra Niktab , Kazem Haghnejad Azar , Razi Alavizadeh , Saba Sadeghi Gavgani

In the present paper, a class of new simple modules over the $N=1$ Ramond algebra are constructed, which are induced from simple modules over some finite dimensional solvable Lie superalgebras. These new modules are simple restricted…

Quantum Algebra · Mathematics 2023-02-08 Haibo Chen

The study of finite automata and regular languages is a privileged meeting point of algebra and logic. Since the work of Buchi, regular languages have been classified according to their descriptive complexity, i.e. the type of logical…

Logic in Computer Science · Computer Science 2017-01-11 Pascal Tesson , Denis Therien

The paper presents a detailed description of duality for braided algebras, coalgebras, bialgebras, Hopf algebras and their modules and comodules in the infinite setting. Assuming that the dual objects exist, it is shown how a given braiding…

Quantum Algebra · Mathematics 2020-08-25 Elmar Wagner

The purpose of this dissertation is to set up a theory of generalized operads and multicategories, and to use it as a language in which to propose a definition of weak n-category. Included is a full explanation of why the proposed…

Category Theory · Mathematics 2007-05-23 Tom Leinster

We argue that operads provide a general framework for dealing with polynomials and combinatory completeness of combinatory algebras, including the classical $\mathbf{SK}$-algebras, linear $\mathbf{BCI}$-algebras, planar…

Logic in Computer Science · Computer Science 2023-06-22 Masahito Hasegawa