Related papers: The diagonal lemma as the formalized Grelling para…

The concept of informal mathematical proof considered in intuitionism is apparently vulnerable to a version of the liar paradox. However, a careful reevaluation of this concept reveals a subtle error whose correction blocks the…

That there exist two losing games that can be combined, either by random mixture or by nonrandom alternation, to form a winning game is known as Parrondo's paradox. We establish a strong law of large numbers and a central limit theorem for…

Analogical reasoning is at the core of human cognition, serving as an important foundation for a variety of intellectual activities. While prior work has shown that LLMs can represent task patterns and surface-level concepts, it remains…

We present a new proof of the classical divergence theorem in bounded domains. Our proof is based on a nonlocal analog of the divergence theorem and a rescaling argument. Main ingredients in the proof are nonlocal versions of the divergence…

In traditional justification logic, evidence terms have the syntactic form of polynomials, but they are not equipped with the corresponding algebraic structure. We present a novel semantic approach to justification logic that models…

Astrophysical paradoxes are the paradoxes of physics. The main motivation of a formulated paradox is clearly recognized in the scientific environment because the phenomenon of a paradox itself has become interesting. There is an explanation…

Automated theorem proving in first-order logic is an active research area which is successfully supported by machine learning. While there have been various proposals for encoding logical formulas into numerical vectors -- from simple…

This expository essay discusses a finite dimensional approach to dilation theory. How much of dilation theory can be worked out within the realm of linear algebra? It turns out that some interesting and simple results can be obtained. These…

In human consciousness perceptions are distinct or atomistic events despite being perceived by an apparently undivided inner observer. This paper applies both classical (Boolean) and quantum logic to analysis of the Liar paradox which is…

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…

We introduce a logic for reasoning about evidence, that essentially views evidence as a function from prior beliefs (before making an observation) to posterior beliefs (after making the observation). We provide a sound and complete…

The purpose of this letter is to show, on the one hand, how the so-called train paradox could be resolved directly without appealing to non-linear Lorentz transformations. The resolution is established in the most general case of…

Recent advancements in Large Language Models (LLMs) have demonstrated remarkable capabilities in various domains. However, effective decision-making relies heavily on strong reasoning abilities. Reasoning is the foundation for…

We will investigate proof-theoretic and linguistic aspects of first-order linear logic. We will show that adding partial order constraints in such a way that each sequent defines a unique linear order on the antecedent formulas of a sequent…

When teaching an elementary logic course to students who have a general scientific background but have never been exposed to logic, we have to face the problem that the notions of deduction rule and of derivation are completely new to them,…

Farkas' Lemma is a foundational result in linear programming, with implications in duality, optimality conditions, and stochastic and bilevel programming. Its generalizations are known as theorems of the alternative. There exist theorems of…

A proof is one of the most important concepts of mathematics. However, there is a striking difference between how a proof is defined in theory and how it is used in practice. This puts the unique status of mathematics as exact science into…

Since the seminal work of J. A. Robinson on resolution, many lifting lemmas for simplifying proofs of completeness of resolution have been proposed in the literature. In the logic programming framework, they may also help to detect some…

Logical bilateralism challenges traditional concepts of logic by treating assertion and denial as independent yet opposed acts. While initially devised to justify classical logic, its constructive variants show that both acts admit…

Many problems can be specified by patterns of propositional formulae depending on a parameter, e.g. the specification of a circuit usually depends on the number of bits of its input. We define a logic whose formulae, called "iterated…