Related papers: The weakest nontrivial idempotent equations
An algebraizable singularity is a germ of a singular holomorphic foliation which can be defined in some appropriate local chart by a differential equation with algebraic coefficients. We show that there exists at least countably many…
Based on a weak convergence argument, we provide a necessary and sufficient condition that guarantees that a nonnegative local martingale is indeed a martingale. Typically, conditions of this sort are expressed in terms of integrability…
Systems of wave equations may fail to be globally well posed, even for small initial data. Attempts to classify systems into well and ill-posed categories work by identifying structural properties of the equations that can work as…
We establish an equivalence between two forms of the composition condition for the Abel differential equation with trigonometric coefficients.
A weak multiplier Hopf algebra is a pair (A,\Delta) of a non-degenerate idempotent algebra A and a coproduct $\Delta$ on A. The coproduct is a coassociative homomorphism from A to the multiplier algebra M(A\otimes A) with some natural extra…
We establish the existence of strong solutions to a class of nonlinear strongly coupled and uniform elliptic systems consisting of more than two equations. The existence of of nontrivial and non constant solutions (or pattern formations)…
We extend the definition of algebraic entropy to semi-discrete (difference-differential) equations. Calculating the entropy for a number of integrable and non integrable systems, we show that its vanishing is a characteristic feature of…
A deductive system is structurally complete if its admissible inference rules are derivable. For several important systems, like modal logic S5, failure of structural completeness is caused only by the underivability of passive rules, i.e.…
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…
We construct a recursive formula for a complete system of primitive orthogonal idempotents for any $R$-trivial monoid. This uses the newly proved equivalence between the notions of $R$-trivial monoid and weakly ordered monoid.
This paper presents an investigation on the structure of conditional events and on the probability measures which arise naturally in this context. In particular we introduce a construction which defines a (finite) {\em Boolean algebra of…
The resolvability of equations in integers containing truncated Newton's binomial, is determined by the divisibility of the binomial by the characteristic parameters of the equation, which most often is the binomial exponent. Two types of…
Measurement incompatibility is the most basic resource that distinguishes quantum from classical physics. Contextuality is the critical resource behind the power of some models of quantum computation and is also a necessary ingredient for…
The class of weak BCK-algebras is obtained by weakening one of standard BCK axioms. It is known that every weak BCK-algebra is completely determined by the structure of its initial segments. We review several natural classes of commutative…
Let J and J' be Jordan rings. We prove under some conditions that if J contains a nontrivial idempotent, then n-multiplicative maps and n-multiplicative derivations from J to J' are additive maps.
The underlying probabilistic theory for quantum mechanics is non-Kolmogorovian. The order in which physical observables will be important if they are incompatible (non-commuting). In particular, the notion of conditioning needs to be…
We introduce a weak division-like property for noncommutative rings: a nontrivial ring is fadelian if for all nonzero $a,x$ there exist $b,c$ such that $x=ab+ca$. We prove properties of fadelian rings, and construct examples of such rings…
A note on the property of weak contraction, which implies that all bounded solutions of a nonlinear system converge to a (possibly non-unique) equilibrium. We provide some simple results about interconnections of such systems, and a brief…
This paper presents a soundness and completeness proof for propositional intuitionistic calculus with respect to the semantics of computability logic. The latter interprets formulas as interactive computational problems, formalized as games…
We give a comprehensive analysis of interrelations between the basic concepts of the modern theory of symmetry (classical and non-classical) reductions of partial differential equations. Using the introduced definition of reduction of…