Related papers: Hardy's paradox according to non-classical semanti…
The quantum smoothing theory [Tsang, Phys. Rev. Lett. 102, 250403 (2009); Phys. Rev. A, in press (e-print arXiv:0906.4133)] is extended to account for discrete jumps in the classical random process to be estimated, discrete variables in the…
The idea of writing a table of probabilistic data for a quantum or classical system, and of decomposing this table in a compact way, leads to a shortcut for Hardy's formalism, and gives new perspectives on foundational issues.
We introduce a novel logical notion--partial entailment--to propositional logic. In contrast with classical entailment, that a formula P partially entails another formula Q with respect to a background formula set \Gamma intuitively means…
In this study we critically examine some important papers on weak measurement and weak values. We find some insufficiency and mistakes in these papers, and we demonstrate that the real parts of weak values provide the back-action to the…
We prove that a pointwise fractional Hardy inequality implies a fractional Hardy inequality, defined via a Gagliardo-type seminorm. The proof consists of two main parts. The first one is to characterize the pointwise fractional Hardy…
We study Hardy type inequalities involving mixed cylindrical and spherical weights, for functions supported in cones. These inequalities are related to some singular or degenerate differential operators.
A refinement of the Hardy inequality has been presented by use of superquadratic function.
We define partial differential (PD in the following), i.e., field theoretic analogues of Hamiltonian systems on abstract symplectic manifolds and study their main properties, namely, PD Hamilton equations, PD Noether theorem, PD Poisson…
Classes of linguistic paradoxes and linguistic tautologies are introduced with examples and explanations. They are part of the author's work on the Paradoxist Philosophy based on mathematical logic. The general cases exposed below are…
Various semantics for studying the square of opposition and the hexagon of opposition have been proposed recently. We interpret sentences by imprecise (set-valued) probability assessments on a finite sequence of conditional events. We…
Modal logic is a paradigm for several useful and applicable formal systems in computer science. It generally retains the low complexity of classical propositional logic, but notable exceptions exist in the domains of description, temporal,…
Partial words are sequences over a finite alphabet that may contain wildcard symbols, called holes, which match or are compatible with all letters; partial words without holes are said to be full words (or simply words). Given an infinite…
In this paper, we find complex symmetric composition operators on the classical Hardy space whose symbols are linear-fractional but not automorphic. In doing so, we answer a recent question of Noor, and partially answer the original problem…
Several arguments have been proposed some years ago, attempting to prove the impossibility of defining Lorentz-invariant elements of reality. Here I revisit that question, and bring a number of additional considerations to it. I will first…
We establish fractional Hardy inequality on bounded domains in $\mathbb{R}^{d}$ with inverse of distance function from smooth boundary of codimension $k$, where $k=2, \dots,d$, as weight function. The case $sp=k$ is the critical case, where…
We obtain, for the first time, a modular many-valued semantics for combined logics, which is built directly from many-valued semantics for the logics being combined, by means of suitable universal operations over partial non-deterministic…
In the paper, the EPR paradox is explored by the approach of quantum supervaluationism that leads to a "gappy" semantics with the propositions giving rise to truth-value gaps. Within this approach, the statement, which asserts that in the…
Logical nonlocality is completely characterized by Hardy's "paradox" in (2,2,l) and (2,k,2) scenarios. We consider a variety of consequences and applications of this fact. (i) Polynomial algorithms may be given for deciding logical…
In traditional semantics for classical logic and its extensions, such as modal logic, propositions are interpreted as subsets of a set, as in discrete duality, or as clopen sets of a Stone space, as in topological duality. A point in such a…
We extend Hardy's inequality from sequences of non-negative numbers to sequences of positive semi-definite operators if the parameter p satisfies 1<p<=2, and to operators under a trace for arbitrary p>1. Applications to trace functions are…