Related papers: A General Counterexample to Any Decision Theory an…
Argumentation has proved a useful tool in defining formal semantics for assumption-based reasoning by viewing a proof as a process in which proponents and opponents attack each others arguments by undercuts (attack to an argument's premise)…
Nonmonotonic reasoning is a pattern of reasoning that allows an agent to make and retract (tentative) conclusions from inconclusive evidence. This paper gives a possible-worlds interpretation of the nonmonotonic reasoning problem based on…
Transparency is an essential requirement of machine learning based decision making systems that are deployed in real world. Often, transparency of a given system is achieved by providing explanations of the behavior and predictions of the…
The transitivity of preferences is one of the basic assumptions used in the theory of games and decisions. It is often equated with rationality of choice and is considered useful in building rankings. Intransitive preferences are considered…
General program equivalence is undecidable. However, if we abstract away the semantics of statements, then this problem becomes not just decidable, but practically feasible. For instance, a program of the form "if $b$ then $e$ else $f$"…
We present a propositional logic %which can be used to reason about the uncertainty of events, where the uncertainty is modeled by a set of probability measures assigning an interval of probability to each event. We give a sound and…
In this article, we survey some controversial problems concerning the idea of erasing Which Way information proposed in recent years. A statistical examination of these proposals suggests that whenever the Bayesian rule is taken into…
The best developed formulation of closed system quantum theory that handles multiple-time statements, is the consistent (or decoherent) histories approach. The most important weaknesses of the approach is that it gives rise to many…
Recent work by Faizal et al. (2025) claims that G\"odelian undecidability of non-algorithmic truths in our universe imply the impossibility of a formal, algorithmic simulation of the universe. This paper clarifies the distinction between…
In this work, we show that very natural, apparently simple problems in quantum measurement theory can be undecidable even if their classical analogues are decidable. Undecidability hence appears as a genuine quantum property here. Formally,…
We obtain sufficient conditions ensuring the topological equivalence of two perturbed difference linear systems whose linear part has a property of generalized exponential dichotomy. When the exponential dichotomy is verified, we obtain a…
In the paper "Quantum theory cannot consistently describe the use of itself" by D. Frauchiger and R. Renner an atempt is made at proving a "no-go theorem" that states that either quantum theory cannot be universally applied, even to…
Two types of explanations have been receiving increased attention in the literature when analyzing the decisions made by classifiers. The first type explains why a decision was made and is known as a sufficient reason for the decision, also…
An ultimate universal theory -- a complete theory that accounts, via few and simple first principles, for all the phenomena already observed and that will ever be observed -- has been, and still is, the aspiration of most physicists and…
This is a philosophical paper. It claims that there is a gap to be filled in the relationship between complexity theory (CT) and quantum theory (QT). This gap concerns two very distinct understandings of time. The paper provides the ground…
We show that strict deterministic propositional dynamic logic with intersection is highly undecidable, solving a problem in the Stanford Encyclopedia of Philosophy. In fact we show something quite a bit stronger. We introduce the…
Contrastive explanations clarify why an event occurred in contrast to another. They are more inherently intuitive to humans to both produce and comprehend. We propose a methodology to produce contrastive explanations for classification…
The model of asynchronous programming arises in many contexts, from low-level systems software to high-level web programming. We take a language-theoretic perspective and show general decidability and undecidability results for asynchronous…
We study the following problem: Determine which almost structurally complete quasivarieties are structurally complete. We propose a general solution to this problem and then a solution in the semisimple case. As a consequence, we obtain a…
We show that for many classes of symmetric two-player games, the simple decision rule "imitate-the-best" can hardly be beaten by any other decision rule. We provide necessary and sufficient conditions for imitation to be unbeatable and show…