English
Related papers

Related papers: On Finite Bases for Weak Semantics: Failures versu…

200 papers

This survey reviews some of the most recent achievements in the saga of the axiomatisation of parallel composition, along with some classic results. We focus on the recursion, relabelling and restriction free fragment of CCS and we discuss…

Logic in Computer Science · Computer Science 2021-05-04 Luca Aceto , Elli Anastasiadi , Valentina Castiglioni , Anna Ingolfsdottir , Bas Luttik

Based on the concept of unbounded absolutely weakly convergence, we give new characterizations of L-weakly compact sets. As applications, we find some properties of order weakly compact operators. Also, a new characterizations of order…

Functional Analysis · Mathematics 2020-05-05 Hassan Khabaoui , Jawad H'michane , Kamal El Fahri

A weakly complete finitary axiomatization for EQPL (exogenous quantum propositional logic) is presented. The proof is carried out using a non trivial extension of the Fagin-Halpern-Megiddo technique together with three Henkin style…

Logic · Mathematics 2016-01-14 P. Mateus , A. Sernadas

In this paper we introduce a novel family of semantics called weakly complete semantics. Differently from Dung's complete semantics, weakly complete semantics employs a mechanism called undecidedness blocking by which the label undecided of…

Logic in Computer Science · Computer Science 2021-03-22 Pierpaolo Dondio , Luca Longo

We develop a spanning set for weak modules of C_2 co-finite vertex operator algebras. This spanning set has finiteness properties that we use to show weak modules are C_n co-finite and A_n(M) is finite dimensional.

Quantum Algebra · Mathematics 2007-05-23 Geoffrey Buhl

The influence of errors on the convergence of infinite products of weak quasi-contraction mappings in $b$-metric spaces is explored. An example demonstrating the necessity of convergence of the sequence of computational errors to zero is…

Functional Analysis · Mathematics 2020-02-06 Anuradha Gupta , Manu Rohilla

We study the computational complexity of a robust version of the problem of testing two univariate C-finite functions for eventual inequality at large times. Specifically, working in the bit-model of real computation, we consider the…

Computational Complexity · Computer Science 2023-07-04 Eike Neumann

In this paper we prove existence and multiplicity results of unbounded critical points for a general class of weakly lower semicontinuous functionals. We will apply a suitable nonsmooth critical point theory.

Analysis of PDEs · Mathematics 2016-09-07 Benedetta Pellacci , Marco Squassina

We extend the definition of weak symmetric continuity to be applicable for functions defined on any nonempty subset of $\R$. Then we investigate basic properties of weakly symmetrically continuous functions and compare them with those of…

Classical Analysis and ODEs · Mathematics 2014-05-29 Prapanpong Pongsriiam , Teraporn Thongsiri

We define a notion of a weak canonical base for a partial type. This notion is weaker than the usual canonical base for an amalgamation base. We prove that certain family of partial types have a weak canonical base. This family clearly…

Logic · Mathematics 2013-11-14 Ziv Shami

Over any partially ordered abelian group whose positive cone is closed in an appropriate sense and has finitely many faces, modules that satisfy a weak finiteness condition admit finite primary decompositions. This conclusion rests on the…

Commutative Algebra · Mathematics 2020-08-12 Ezra Miller

A $\Sigma^*$-algebra is a concrete $C^*$-algebra that is sequentially closed in the weak operator topology. We study an appropriate class of $C^*$-modules over $\Sigma^*$-algebras analogous to the class of $W^*$-modules (selfdual…

Operator Algebras · Mathematics 2016-09-13 Clifford A. Bearden

We revisit completion modulo equational theories for left-linear term rewrite systems where unification modulo the theory is avoided and the normal rewrite relation can be used in order to decide validity questions. To that end, we give a…

Logic in Computer Science · Computer Science 2025-04-30 Johannes Niederhauser , Nao Hirokawa , Aart Middeldorp

It is proved that every normalized weakly null \sq\ has a sub\sq\ which is convexly unconditional. Further, an Hierarchy of summability methods is introduced and with this we give a complete classification of the complexity of weakly null…

Functional Analysis · Mathematics 2016-09-06 Spiros A. Argyros , S. Merkourakis , A. Tsarpalias

Weak supersolutions to the porous medium equation are defined by means of smooth test functions under an integral sign. We show that nonnegative weak supersolutions become lower semicontinuous after redefinition on a set of measure zero.…

Analysis of PDEs · Mathematics 2013-12-11 Benny Avelin , Teemu Lukkari

In this note we give a precise statement and a detailed proof for reconstruction problem of weak bialgebra maps. As an application we characterize indecomposability of weak algebras in categorical setting.

Rings and Algebras · Mathematics 2020-03-02 Michihisa Wakui

To verify theoretical results it is sometimes important to use a numerical example where the solution has a particular regularity. The paper describes one approach to construct such examples. It is based on the regularity theory for…

Numerical Analysis · Mathematics 2025-03-10 Thomas Apel , Katharina Lorenz , Serge Nicaise

The problem of sequential probability forecasting is considered in the most general setting: a model set C is given, and it is required to predict as well as possible if any of the measures (environments) in C is chosen to generate the…

Machine Learning · Computer Science 2019-10-25 Daniil Ryabko

In this paper, we establish the well-posedness of Cauchy problems for weak solutions to second-order degenerate parabolic equations with a non-smooth, time-dependent degenerate elliptic part that includes both bounded and unbounded…

Analysis of PDEs · Mathematics 2025-12-04 Khalid Baadi

By [R. Bautista, P. Gabriel, A.V Roiter., L. Salmeron, Representation-finite algebras and multiplicative basis. Invent. Math. 81 (1985) 217-285.], a finite-dimensional algebra having finitely many isoclasses of indecomposable…

Representation Theory · Mathematics 2007-11-17 Andrej V. Roiter , Vladimir V. Sergeichuk