Related papers: Montague's Paradox without Necessitation
We propose an integration of possibility theory into non-classical logics. We obtain many formal results that generalize the case where possibility and necessity functions are based on classical logic. We show how useful such an approach is…
There are many examples in the literature that suggest that indistinguishability is intransitive, despite the fact that the indistinguishability relation is typically taken to be an equivalence relation (and thus transitive). It is shown…
In Newcomb's paradox you choose to receive either the contents of a particular closed box, or the contents of both that closed box and another one. Before you choose though, an antagonist uses a prediction algorithm to deduce your choice,…
The paper contains a proof for the P != NP hypothesis with the help of the two "natural" postulates. The postulates restrict capacity of the Turing machines and state that each independent and necessary condition of the problem should be…
In this paper a conditional logic is defined and studied. This conditional logic, DmBL, is constructed as a deterministic counterpart to the Bayesian conditional. The logic is unrestricted, so that any logical operations are allowed. A…
The discrete non-commutative Darboux system of equations with self-consistent sources is constructed, utilizing both the vectorial fundamental (binary Darboux) transformation and the method of additional independent variables. Then the…
We show that if there exists a counter example for the rational case of the Franks-Misiurewicz conjecture, then it must exhibit unbounded deviations in the complementary direction of its rotation set.
The definition of probabilities in eternally inflating universes requires a measure to regulate the infinite spacetime volume, and much of the current literature uses a global time cutoff for this purpose. Such measures have been found to…
Conditional-independence-based discovery uses statistical tests to identify a graphical model that represents the independence structure of variables in a dataset. These tests, however, can be unreliable, and algorithms are sensitive to…
This paper is concerned with test of the conditional independence. We first establish an equivalence between the conditional independence and the mutual independence. Based on the equivalence, we propose an index to measure the conditional…
Formal reasoning with non-denoting terms, esp. non-referring descriptions such as "the King of France", is still an under-investigated area. The recent exception being a series of papers e.g. by Indrzejczak, Zawidzki and K\"rbis. The…
It is often argued that superluminal velocities and nontrivial spacetime topologies, allowed by the theory of relativity, may lead to causal paradoxes. By emphasizing that the notion of causality assumes the existence of a time arrow (TA)…
We present a resolution of the celebrated "Surprise Exam Paradox". We argue that if the surprise exam story is analyzed using the exact same meaning of the notion of "surprise" as is dictated by the story itself, then no paradox arises.
A Modified Associate Formalism is proposed for thermodynamic modelling of solution phases. The approach is free from the entropy paradox described by L\"{u}ck et al. (Z. Metallkd. 80 (1989) pp. 270--275). The model is considered in its…
Statistical classical mechanics and quantum mechanics are developed and well-known theories that represent a basis for modern physics. The two described theories are well known and have been well studied. As these theories contain numerous…
The emergence of intrinsic probability has long been one of the most important and puzzling problems in quantum mechanics, and the law most directly related to this problem is the Born rule. For a century, there have been many attempts to…
The FKG theorem says that the POSITIVE LATTICE CONDITION, an easily checkable hypothesis which holds for many natural families of events, implies POSITIVE ASSOCIATION, a very useful property. Thus there is a natural and useful theory of…
The use of meta-rules in logic, i.e., rules whose content includes other rules, has recently gained attention in the setting of non-monotonic reasoning: a first logical formalisation and efficient algorithms to compute the (meta)-extensions…
Problems involving rolling without slipping or no sideways skidding, to name a few, introduce velocity-dependent constraints that can be efficiently treated by the method of Lagrange multipliers in the Lagrangian formulation of the…
Epistemic modals have peculiar logical features that are challenging to account for in a broadly classical framework. For instance, while a sentence of the form $p\wedge\Diamond\neg p$ ('$p$, but it might be that not $p$') appears to be a…