Related papers: On Finite Bases for Weak Semantics: Failures versu…
We develop a complexity theory for approximate real computations. We first produce a theory for exact computations but with condition numbers. The input size depends on a condition number, which is not assumed known by the machine. The…
This work provides some general theorems about unconditional and conditional weak convergence of empirical processes in the case of Poisson sampling designs. The theorems presented in this work are stronger than previously published…
This paper presents a study of the finite axiomatizability of transitive logics of finite depth and finite weak width. We prove the finite axiomatizability of each transitive logic of finite depth and of weak width $1$ that is characterized…
In logic programming, negation can be interpreted in various ways. Probably best known is the concept of "negation as failure", where "$\mathit{not}\, p$" is true if we have no evidence for $p$. On the other hand, strong negation requires…
We prove two completeness results, one for the extension of dependence logic by a monotone generalized quantifier Q with weak interpretation, weak in the meaning that the interpretation of Q varies with the structures. The second result…
Weakly dicomplemented lattices are bounded lattices equipped with two unary operations to encode a negation on {\it concepts}. They have been introduced to capture the equational theory of concept algebras \cite{Wi00}. They generalize…
In this article, we prove an existence theorem regarding the weak solutions to the hyperbolic-type partial dynamic equation \begin{equation*}\begin{array}{l} z^{\Gamma\Delta}(x,y)=f(x, y, z(x, y)), z(x, 0)=0, \ \ \ z(0, y)=0 \end{array}, \…
Reversible systems feature both forward computations and backward computations, where the latter undo the effects of the former in a causally consistent manner. The compositionality properties and equational characterizations of strong and…
We introduce a new propositional logic, called very weak subintuitionistic logic $\mathbf{VF}$, by adapting the relational semantics of Fitting, Marek, and Truszczy\'nski for the pure logic of necessitation $\mathbf{N}$ to the propositional…
Looking at bivariate copulas from the perspective of conditional distributions and considering weak convergence of almost all conditional distributions yields the notion of weak conditional convergence. At first glance, this notion of…
Finite Unified Theories (FUTs) are N=1 supersymmetric Grand Unified Theories (GUTs) which can be made finite to all-loop orders, leading to a drastic reduction in the number of free parameters. By confronting the predictions of SU(5) FUTs…
This paper deals with formulas of set theory which force the infinity. For such formulas, we provide a technique to infer satisfiability from a finite assignment.
We consider the lattice of all the weak factorization systems on a given finite lattice. We prove that it is semidistributive, trim and congruence uniform. We deduce a graph theoretical approach to the problem of enumerating transfer…
We develop a notion of predicate transformer and, in particular, the weakest precondition, appropriate for quantum computation. We show that there is a Stone-type duality between the usual state-transformer semantics and the weakest…
This note describes Fatou's lemma and Lebesgue's dominated convergence theorem for a sequence of measures converging weakly to a finite measure and for a sequence of functions whose negative parts are uniformly integrable with respect to…
This paper studies the completeness of conjunctive queries over a partially complete database and the approximation of incomplete queries. Given a query and a set of completeness rules (a special kind of tuple generating dependencies) that…
This paper is devoted to give a complete unified study of several weak forms of $\ddb-$Lemma on compact complex manifolds.
In this note we propose a definition of weak solution for an abstract Cauchy problem in a Hilbert space, and we discuss existence and uniqueness results.
The paper presents geometric models for the set WO of weak orders on a finite set. In particulary, WO is modeled as a set of vertices of a cubical subdivision of a permutahedron. This approach is an alternative to the usual representation…
We have recently defined a weak Markovian bisimulation equivalence in an integrated-time setting, which reduces sequences of exponentially timed internal actions to individual exponentially timed internal actions having the same average…