Related papers: Remarks on Fixed Point Assertions in Digital Topol…

This paper is divided to two parts. In the first part, we provide elementary proofs for some important results in multi-objective optimization. The given proofs are so simple and short in compared to the existing ones. Also, a Pareto…

Existing performance measures rank delineation algorithms inconsistently, which makes it difficult to decide which one is best in any given situation. We show that these inconsistencies stem from design flaws that make the metrics…

Data are essential for the experiments of relevant scientific publication recommendation methods but it is difficult to build ground truth data. A naturally promising solution is using publications that are referenced by researchers to…

In this paper, we point out that the definition of weak tracial approximation can be improved and strengthened. An example of weak tracial approximation is also provided.

We show that some mathematical results and their negations are both deducible. The derived contradictions indicate the inconsistency of current mathematics. This paper is an updated version of arXiv:math/0606635v3 with additional results…

Model checking of strategic ability under imperfect information is known to be hard. The complexity results range from NP-completeness to undecidability, depending on the precise setup of the problem. No less importantly, fixpoint…

In this paper we make some observations concerning m-metric spaces and point out some discrepancies in the proofs found in the literature. To remedy this, we propose a new topological construction and prove that it is in fact a…

Following F. William Lawvere, we show that many self-referential paradoxes, incompleteness theorems and fixed point theorems fall out of the same simple scheme. We demonstrate these similarities by showing how this simple scheme encompasses…

A number of exciting advances have been made in automated fact-checking thanks to increasingly larger datasets and more powerful systems, leading to improvements in the complexity of claims which can be accurately fact-checked. However,…

We present an improved incremental selection algorithm of the selection algorithm presented in [1] and prove all the selected conjectures.

A few final comments on arXiv:1210.7548 are given to confute incorrect arguments claimed there.

Automated fact checking systems have been proposed that quickly provide veracity prediction at scale to mitigate the negative influence of fake news on people and on public opinion. However, most studies focus on veracity classifiers of…

It has been argued that reduction procedures are closely connected to the question about identity of proofs and that accepting certain reductions would lead to a trivialization of identity of proofs in the sense that every derivation of the…

Most work on scholarly document processing assumes that the information processed is trustworthy and factually correct. However, this is not always the case. There are two core challenges, which should be addressed: 1) ensuring that…

Conditions for the detectability of topology variations in dynamical networks are developed in a recent article in the IEEE Transactions on Control of Network Systems [1]. Here, an example is presented which illustrates an error in the…

This thesis is concerned with investigations into the "complexity of term rewriting systems". Moreover the majority of the presented work deals with the "automation" of such a complexity analysis. The aim of this introduction is to present…

We consider a generalization of an important class of high-dimensional inference problems, namely spiked symmetric matrix models, often used as probabilistic models for principal component analysis. Such paradigmatic models have recently…

We close a gap appearing at the same time in the author's thesis "Iterated rings of bounded elements and generalizations of Schm\"udgen's theorem" [1] and in the author's article "Iterated rings of bounded elements and generalizations of…

Problems in two axiomatizations of Ja\'skowski's discussive (or discursive) logic D2 are considered. A recent axiomatization of D2 and completeness proof relative to D2's intended semantics seems to be mistaken because some formulas valid…

First, a misconception about the spectrum of a confined particle is evidentiated. Then, the results are shown to be incorrect by means of a counter-example, an explicit preparation for the probe is given that yields an arbitrary…