Related papers: Hardy's paradox according to non-classical semanti…
Tarski gave a general semantics for deductive reasoning: a formula a may be deduced from a set A of formulas iff a holds in all models in which each of the elements of A holds. A more liberal semantics has been considered: a formula a may…
The idea of using unfolding as a way of computing a program semantics has been applied successfully to logic programs and has shown itself a powerful tool that provides concrete, implementable results, as its outcome is actually source…
We investigate Hardy spaces $H^1_L(X)$ corresponding to self-adjoint operators $L$. Our main aim is to obtain a description of $H^1_L(X)$ in terms of atomic decompositions similar to such characterisation of the classical Hardy spaces…
This paper studies the Hardy-type inequalities on the intervals (may be infinite) with two weights, either vanishing at two endpoints of the interval or having mean zero. For the first type of inequalities, in terms of new isoperimetric…
This paper introduces a notion of equivalence for higher-dimensional automata, called weak equivalence. Weak equivalence focuses mainly on a traditional trace language and a new homology language, which captures the overall independence…
We prove several Sobolev inequalities, which are then used to establish a fractional Hardy-Sobolev- Maz'ya inequality on the upper halfspace.
The "marginal" distributions for measurable coordinate and spin projection is introduced. Then, the analog of the Pauli equation for spin-1/2 particle is obtained for such probability distributions instead of the usual wave functions. That…
This work investigates the algorithmic complexity of non-classical logics, focusing on superintuitionistic and modal systems. It is shown that propositional logics are usually polynomial-time reducible to their fragments with at most two…
We give a semiclassical analysis of a nonlinear eigenvalue problem arising from the study of the failure of analytic hypoellipticity and obtain a general family of hypoelliptic, but not analytic hypoelliptic operators.
For a newcomer, paraconsistent logics can be difficult to grasp. Even experts in logic can find the concept of paraconsistency to be suspicious or misguided, if not actually wrong. The problem is that although they usually have much in…
Over the past few decades, non-monotonic reasoning has developed to be one of the most important topics in computational logic and artificial intelligence. Different ways to introduce non-monotonic aspects to classical logic have been…
Paradoxes are a very frequent phenomenon in processes of thought which strive towards the intelectual and cognitive shifts. They occur in all areas of human spiritual activites. What we are interested here in, are the paradoxes in physics.…
Choice constructs are an important part of the language of logic programming, yet the study of their semantics has been a challenging task. So far, only two-valued semantics have been studied, and the different proposals for such semantics…
In this paper, we consider the first order Hardy inequalities using simple equalities. This basic setting not only permits to derive quickly many well-known Hardy inequalities with optimal constants, but also supplies improved or new…
Starting with a functional difficulty appeared in the paper \cite{vz00} by V\'azquez and Zuazua, we obtain new insights into the Hardy Inequality and the evolution problem associated to it by means of a reformulation of the problem.…
We study certain double--series inequalities, which are motivated by weighted Hardy inequalities.
Hodge theorem and harmonic spinors are studied in a physics-oriented approach in the present paper. New mathematical results on the harmonic spinors are as follows. Harmonic spinors defined by partial differential operators could be of two…
Let $H$ be the Hardy operator and $I$ the identity operator acting on functions on the real half-line. We find optimal bounds for the operator $H - I$ in the setting of power weights and the cases of positive decreasing functions, positive…
We implemented a joint weak measurement of the trajectories of two photons in a photonic version of Hardy's experiment. The joint weak measurement has been performed via an entangled meter state in polarization degrees of freedom of the two…
The halting problem is considered to be an essential part of the theoretical background to computing. That halting is not in general computable has supposedly been proved in many text books and taught on many computer science courses, in…