Related papers: Yablo's paradox and forcing
Indications of a possible composition-dependent fifth force, based on a reanalysis of the E\"{o}tv\"{o}s experiment, have not been supported by a number of modern experiments. Here, we argue that searching for a composition-dependent fifth…
Two types of approximation to the paradoxical Russell Set are presented, one approximating it from below, one from above. It is shown that any lower approximation gives rise to a better approximation containing it, and that any upper…
We establish a lower bound on the forcing numbers of domino tilings computable in polynomial time based on height functions. This lower bound is sharp for a 2n by 2n square as well as other cases.
We note how several central results in multiplicative number theory may be rephrased naturally in terms of multiplicative functions $f$ that pretend to be another multiplicative function $g$. We formalize a `distance' which gives a measure…
We introduce the forcing property "almost strong properness" which sits between properness and strong properness. As an application, we introduce a simple forcing with finite conditions to force $\rm MRP$.
We discuss two fourth-order Steklov problems and highlight a Babu\v{s}ka paradox appearing in their approximations on convex domains via sequences of convex polygons. To do so, we prove that the eigenvalues of one of the two problems depend…
We develop librationism, {\pounds}, and clarify some mathematical and philosophical matters which relate to the particular manner in which it deals with the paradoxes and to its usefulness as a foundation for mathematics and type free…
Logical systems with classical negation and means for sentential or propositional self-reference involve, in some way, paradoxical statements such as the liar. However, the paradox disappears if one replaces classical by an appropriate…
Since the seminal paper by Tversky and Kahneman, the conjunction fallacy has been the subject of multiple debates and become a fundamental challenge for cognitive theories in decision-making. In this article, we take a rather uncommon…
The occurrence of Simpson's paradox (SP) in $2\times 2$ contingency tables has been well studied. The present work comprehensively revisits this problem using a combination of philosophical reflections, causal considerations, and…
We revisit a subexponential bound for the $abc$ conjecture due to the first author, and we establish a variation of it using linear forms in logarithms. As an application, we prove an unconditional subexponential bound towards the $4$-terms…
We present a systematic study of the method of "norms on possibilities" of building forcing notions with keeping their properties under full control. This technique allows us to answer several open problems, but on our way to get the…
Learning physics is a context dependent process. I consider a broader interdisciplinary problem of where differences in understanding and reasoning arise. I suggest the long run effects a multiple choice based learning system as well as…
The fundamental proposal in this article is that logical formulas of the form (f <-> ~f) are not contradictions, and that formulas of the form (t <-> t) are not tautologies. Such formulas, wherever they appear in mathematics, are instead…
Possibility theory offers a framework where both Lehmann's "preferential inference" and the more productive (but less cautious) "rational closure inference" can be represented. However, there are situations where the second inference does…
This is an attempt to find a hidden virtue in Tolman's paradox by showing that it can give rise to quantum superposition. We consider tachyon exchange between two particles and show that it can generate superposition of eigenstates…
The inversion of nabla Laplace transform, corresponding to a causal sequence, is considered. Two classical methods, i.e., residual calculation method and partial fraction method are developed to perform the inverse nabla Laplace transform.…
Consider $(\kappa^{+++},\kappa^{++}) \twoheadrightarrow (\kappa^+,\kappa)$ where $\kappa$ is an uncountable regular cardinal. By a result of Shelah's we have $\operatorname{cof}(X \cap \kappa^{++}) = \kappa$ for almost all $X \subset…
The research process includes many decisions, e.g., how to entitle and where to publish the paper. In this paper, we introduce a general framework for investigating the effects of such decisions. The main difficulty in investigating the…
We present three syntactic forcing models for coherent logic. These are based on sites whose underlying category only depends on the signature of the coherent theory, and they do not presuppose that the logic has equality. As an application…