相关论文: The strength of replacement in weak arithmetic

Multicriteria decision analysis aims at supporting a person facing a decision problem involving conflicting criteria. We consider an additive utility model which provides robust conclusions based on preferences elicited from the decision…

In this short note, we introduce a generalization of the canonical base property, called transfer of internality on quotients. A structural study of groups definable in theories with this property yields as a consequence infinitely many new…

This paper is concerned with the lengths of constant length substitutions that generate topologically conjugate systems. We show that if the systems are infinite, then these lengths must be powers of the same integer. This result is a…

In eXplainable Artificial Intelligence (XAI), several counterfactual explainers have been proposed, each focusing on some desirable properties of counterfactual instances: minimality, actionability, stability, diversity, plausibility,…

We introduce a principle of local collection for compositional truth predicates and show that it is conservative over the classically compositional theory of truth in the arithmetical setting. This axiom states that upon restriction to…

The main aim of the article is to show, in the absence of the Axiom of Choice, relationships between the following, independent of $\mathbf{ZF}$, statements: "Every countable product of compact metrizable spaces is separable (respectively,…

A regularity lemma for polynomials provides a decomposition in terms of a bounded number of approximately independent polynomials. Such regularity lemmas play an important role in numerous results, yet suffer from the familiar shortcoming…

It is well known that the strong subadditivity theorem is hold for classical system, but it is very difficult to prove that it is hold for quantum system. The first proof of this theorem is due to Lieb by using the Lieb's theorem. Here we…

This is a brief review of the experimental and theoretical quantum computing. The hopes for eventually building a useful quantum computer rely entirely on the so-called "threshold theorem". In turn, this theorem is based on a number of…

We consider two axioms of second-order arithmetic. These axioms assert, in two different ways, that infinite but narrow binary trees always have infinite paths. We show that both axioms are strictly weaker than Weak K\"onig's Lemma, and…

We introduce a hierarchical classification of theories that describe systems with fundamentally limited information content. This property is introduced in an operational way and gives rise to the existence of mutually complementary…

We show that the principles of a ''complete physical theory'' and the conclusions of the standard quantum mechanics do not irreconcilably contradict each other as is commonly believed. In the algebraic approach, we formulate axioms that…

We consider the task of verifying the correctness of quantum computation for a restricted class of circuits which contain at most two basis changes. This contains circuits giving rise to the second level of the Fourier Hierarchy, the lowest…

This article offers a gentle introduction to the axiom of choice. We introduce the axiom, discuss some common objections to it, and present three kinds of reasons to accept it. Although the exposition is aimed at non-experts in set theory,…

We consider extensions of the notion of topological transitivity for a dynamical system $(X,f)$. In addition to chain transitivity, we define strong chain transitivity and vague transitivity. Associated with each there is a notion of…

A fertile area of recent research has demonstrated concrete polynomial time lower bounds for solving natural hard problems on restricted computational models. Among these problems are Satisfiability, Vertex Cover, Hamilton Path, Mod6-SAT,…

This tutorial deal with the Axiom of Choice and some of its applications to topics related to Computer Science. We will see that the Axiom of Choice is equivalent to some well-known proof principles like Zorn's Lemma or Tuckey's Maximality…

We consider the lattice of all the weak factorization systems on a given finite lattice. We prove that it is semidistributive, trim and congruence uniform. We deduce a graph theoretical approach to the problem of enumerating transfer…

Axiomatizing mathematical structures is a goal of Mathematical Logic. Axiomatizability of the theories of some structures have turned out to be quite difficult and challenging, and some remain open. However axiomatization of some…

In this conceptual paper, we discuss quantum formalisms which do not use the famous Axiom of Choice. We also consider the fundamental problem which addresses the (in)correctness of having the complex numbers as the base field for Hilbert…