Related papers: Bi-interpretation in weak set theories

Assumption-based Argumentation (ABA) is a well-known structured argumentation formalism, whereby arguments and attacks between them are drawn from rules, defeasible assumptions and their contraries. A common restriction imposed on ABA…

Axiomatic set theory is almost universally accepted as the basic theory which provides the foundations of mathematics, and in which the whole of present day mathematics can be developed. As such, it is the most natural framework for…

In the context of continuous first-order logic, special attention is often given to theories that are somehow continuous in an 'essential' way. A common feature of such theories is that they do not interpret any infinite discrete…

Choice and independence of premise principles play an important role in characterizing Kreisel's modified realizability and G\"odel's Dialectica interpretation. In this paper we show that a great many intuitionistic set theories are closed…

The different interpretations of quantum mechanics yield the same experimental results, which may give the impression that the question of what interpretation is the true one, is a philosophical question, not a scientific one. But in this…

In the context of $\mathsf{ZF}$, we analyze a version of Hindman's finite unions theorem on infinite sets, which normally requires the Axiom of Choice to be proved. We establish the implication relations between this statement and various…

Let $\mathsf{M}$ be the set theory obtained from $\mathsf{ZF}$ by removing the collection scheme, restricting separation to $\Delta_0$-formulae and adding an axiom asserting that every set is contained in a transitive set. Let…

This paper argues that interpretability research in Artificial Intelligence (AI) is fundamentally ill-posed as existing definitions of interpretability fail to describe how interpretability can be formally tested or designed for. We posit…

In the first part of this paper, we consider several natural axioms in urelement set theory, including the Collection Principle, the Reflection Principle, the Dependent Choice scheme and its generalizations, as well as other axioms…

Coalition Logic studies what coalitions can enforce. Recent work treats inability as simple non-ability: $\neg\Eff{C}\varphi$. This conflates two distinct configurations -- a coalition unable to force $\varphi$ may still force…

The arguments of Cohen [Phys. Rev. A {\bf 60}, 80 (1999)] against the `ignorance interpretation' of mixed states are questioned. The physical arguments are shown to be inconsistent and the supporting example illustrates the opposite of the…

An elementary rheory of concatenation is introduced and used to establish mutual interpretability of Robinson arithmetic, Minimal Predicative Set Theory, the quantifier-free part of Kirby's finitary set theory, and Adjunctive Set Theory,…

We answer a question of Darji and Keleti by proving in $ZFC$ that there exists a compact nullset $C_0\subset\RR$ such that for every perfect set $P\subset\RR$ there exists $x\in\RR$ such that $(C_0+x)\cap P$ is uncountable. Using this $C_0$…

We show how to express intuitionistic Zermelo set theory in deduction modulo (i.e. by replacing its axioms by rewrite rules) in such a way that the corresponding notion of proof enjoys the normalization property. To do so, we first rephrase…

Frege's theorem says that second-order Peano arithmetic is interpretable in Hume's Principle and full impredicative comprehension. Hume's Principle is one example of an abstraction principle, while another paradigmatic example is Basic Law…

The SL(2,Z) duality transformations of type IIB supergravity are shown to be anomalous in generic F-theory backgrounds due to the anomalous transformation of the phase of the chiral fermion determinant. The anomaly is partially cancelled…

The ability of neural networks to represent more features than neurons makes interpreting them challenging. This phenomenon, known as superposition, has spurred efforts to find architectures that are more interpretable than standard…

The standard notion of the non-Abelian duality in string theory is generalized to the class of $\si$-models admitting `non-commutative conserved charges'. Such $\si$-models can be associated with every Lie bialgebra $(\cg ,\cgt)$ and they…

A matching from a finite subset $A\subset\mathbb{Z}^n$ to another subset $B\subset\mathbb{Z}^n$ is a bijection $f : A \rightarrow B$ with the property that $a+f(a)$ never lies in $A$. A matching is called acyclic if it is uniquely…

A theory of recursive definitions has been mechanized in Isabelle's Zermelo-Fraenkel (ZF) set theory. The objective is to support the formalization of particular recursive definitions for use in verification, semantics proofs and other…