Related papers: Bi-interpretation in weak set theories

Set theory is widely believed to provide a secure foundation for deductive mathematics, but current set theories do not quite do this. The mainstream essentially uses na\"\i ve set theory. After Russell's paradox showed this to be…

We investigate the lower bound of the consistency strength of $\mathsf{CZF}$ with Full Separation $\mathsf{Sep}$ and a Reinhardt set, a constructive analogue of Reinhardt cardinals. We show that $\mathsf{CZF+Sep}$ with a Reinhardt set…

A general study of non-abelian duality is presented. We first identify a possible obstruction to the conformal invariance of the dual theory for non-semisimple groups. We construct the exact non-abelian dual for any Wess-Zumino-Witten (WZW)…

In 1994 Jech gave a model theoretic proof of G\"odel's second incompleteness theorem for Zermelo-Fraenkel set theory in the following form: ZF does not prove that ZF has a model. Kotlarski showed that Jech's proof can be adapted to Peano…

In the paper we introduce a weak set theory $\mathsf{H}_{<\omega}$ . A formalization of arithmetic on finite von Neumann ordinals gives an embedding of arithmetical language into this theory. We show that $\mathsf{H}_{<\omega}$ proves a…

A result of Kaufmann shows that if $L_\alpha$ is countable, admissible and satisfies $\Pi_n\textsf{-Collection}$, then $\langle L_\alpha, \in \rangle$ has a proper $\Sigma_{n+1}$-elementary end extension. This paper investigates to what…

In this research note, we show the relationship between two non-admissible argumentation framework semantics: cogent and weakly admissible semantics. We prove that, while cogent extensions are weakly admissible, the converse is not true.

Let $(X, +)$ denote $(\mathbb{R}, +)$ or $(2^{\omega}, +_2)$. We prove that for any meagre set $F \subseteq X$ there exists a subgroup $G \le X$ without the Baire property, disjoint with some translation of F. We point out several…

Interpretability research takes counterfactual theories of causality for granted. Most causal methods rely on counterfactual interventions to inputs or the activations of particular model components, followed by observations of the change…

We show that there is a $\beta$-model of second-order arithmetic in which the choice scheme holds, but the dependent choice scheme fails for a $\Pi^1_2$-assertion, confirming a conjecture of Stephen Simpson. We obtain as a corollary that…

Let $\widetilde{\mathbb{Q}_p}$ be the field of $p$-adic numbers in the language of rings. In this paper we consider the theory of $\widetilde{\mathbb{Q}_p}$ expanded by two predicates interpreted by multiplicative subgroups…

We say that a function f defined on R or Qp has a well defined weak Mellin transform (or weak zeta integral) if there exists some function $M\_f(s)$ so that we have $Mell(\phi \star f,s) = Mell(\phi,s)M\_f(s)$ for all test functions $\phi$…

The main observation of this paper is that some sequential weak compactness arguments in Hilbert space theory can be replaced by Heine/Borel compactness arguments (for the strong topology). Even though the latter form of compactness fails…

We construct an ontological model for the theory known as bilocal classical theory doi.org/10.1103/PhysRevA.102.052216. To our knowledge, this is only the second time that an ontological model has been constructed for an entire theory,…

We prove various extensions of the Tennenbaum phenomenon to the case of computable quotient presentations of models of arithmetic and set theory. Specifically, no nonstandard model of arithmetic has a computable quotient presentation by a…

We show that there is a restriction, or modification of the finite-variable fragments of First Order Logic in which a weak form of Craig's Interpolation Theorem holds, but a strong form of this theorem does not hold. Translating these…

The rigid relation principle, introduced in this article, asserts that every set admits a rigid binary relation. This follows from the axiom of choice, because well-orders are rigid, but we prove that it is neither equivalent to the axiom…

Ensemble models are widely recognized in the ML community for their limited interpretability. For instance, while a single decision tree is considered interpretable, ensembles of trees (e.g., boosted trees) are often treated as black-boxes.…

We study the notion of non-trivial elementary embeddings $j : V \rightarrow V$ under the assumption that $V$ satisfies $ZFC$ without Power Set but with the Collection Scheme. We show that no such embedding can exist under the additional…

We show that the types of the witnesses in the Herbrand functional interpretation can be simplified, avoiding the use of "sets of functionals" in the interpretation of implication and universal quantification. This is done by presenting an…