English
Related papers

Related papers: Constructive Ackermann's interpretation

200 papers

We construct a countable simple theory which, in Keisler's order, is strictly above the random graph (but "barely so") and also in some sense orthogonal to the building blocks of the recently discovered infinite descending chain. As a…

Logic · Mathematics 2019-07-29 M. Malliaris , S. Shelah

Rathjen proved that Aczel's constructive set theory $\mathbf{CZF}$ extended with inaccessible sets of all transfinite orders can be interpreted in Martin-L\"{o}f type theory $\mathbf{MLTT}$ extended with Setzer's Mahlo universe and another…

Logic in Computer Science · Computer Science 2025-11-05 Yuta Takahashi

It was realized early on that topologies can model constructive systems, as the open sets form a Heyting algebra. After the development of forcing, in the form of Boolean-valued models, it became clear that, just as over ZF any…

Logic · Mathematics 2015-10-06 Robert Lubarsky

We investigate the structure of finite sets $A \subseteq \Z$ where $|A+A|$ is large. We present a combinatorial construction that serves as a counterexample to natural conjectures in the pursuit of an "anti-Freiman" theory in additive…

Classical Analysis and ODEs · Mathematics 2011-03-01 Allison Lewko , Mark Lewko

We propose a set theory strong enough to interpret powerful type theories underlying proof assistants such as LEGO and also possibly Coq, which at the same time enables program extraction from its constructive proofs. For this purpose, we…

Logic in Computer Science · Computer Science 2015-07-01 Wojciech Moczydlowski

The objects of study in this paper are Hopf algebras $H$ which are finitely generated algebras over an algebraically closed field and are extensions of a commutative Hopf algebra by a finite dimensional Hopf algebra. Basic structural and…

Quantum Algebra · Mathematics 2019-07-25 Kenneth Brown , Miguel Couto

We observe that the notion of two sets being equal up to finitely many elements is a homotopy equivalence relation in a model category, and suggest a homotopy-invariant variant of Generalised Continuum Hypothesis about which more can be…

Category Theory · Mathematics 2010-06-25 Misha Gavrilovich

Higher order set theory has been a topic of interest for some time, with recent efforts focused on the strength of second order set theories [KW16]. In this paper we strive to present one 'theory of collections' that allows for a formal…

Logic · Mathematics 2022-06-24 Alec Rhea

We expand the notion of characteristic formula to infinite finitely presentable subdirectly irreducible algebras. We prove that there is a continuum of varieties of Heyting algebras containing infinite finitely presentable subdirectly…

Logic in Computer Science · Computer Science 2012-08-14 Alex Citkin

We introduce a model-complete theory which completely axiomatizes the structure $Z_{\alpha}=(Z, +, 0, 1, f)$ where $f : x \to \lfloor{\alpha} x \rfloor $ is a unary function with $\alpha$ a fixed transcendental number. When $\alpha$ is…

Logic · Mathematics 2025-10-16 Mohsen Khani , Ali N. Valizadeh , Afshin Zarei

We study the approximately finite-dimensional (AF) $C^*$-algebras that appear as inductive limits of sequences of finite-dimensional $C^*$-algebras and left-invertible embeddings. We show that there is such a separable AF-algebra $\mathcal…

Operator Algebras · Mathematics 2021-08-25 Saeed Ghasemi , Wiesław Kubiś

In this paper, we investigate arithmetical completeness with respect to finite Kripke models of quantified modal logic. We adapt the finite-model embedding techniques of Artemov and Japaridze to two settings involving finite Kripke models.…

Logic · Mathematics 2026-04-29 Haruka Kogure , Taishi Kurahashi

This thesis concerns embeddings and self-embeddings of foundational structures in both set theory and category theory. The first part of the work on models of set theory consists in establishing a refined version of Friedman's theorem on…

Logic · Mathematics 2019-07-31 Paul K. Gorbow

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…

Logic · Mathematics 2024-01-30 David J. Fernández-Bretón

In this paper, we consider certain cardinals in ZF (set theory without AC, the Axiom of Choice). In ZFC (set theory with AC), given any cardinals C and D, either C <= D or D <= C. However, in ZF this is no longer so. For a given infinite…

Logic · Mathematics 2016-09-06 Lorenz Halbeisen , Saharon Shelah

This paper aims to build a new understanding of the nonstandard mathematical analysis. The main contribution of this paper is the construction of a new set of numbers, $\mathbb{R}^{\mathbb{Z}_< }$, which includes infinities and…

Logic · Mathematics 2020-09-25 Anggha Nugraha , Maarten McKubre-Jordens , Hannes Diener

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…

Logic · Mathematics 2024-12-02 Emanuele Frittaion , Takako Nemoto , Michael Rathjen

We consider a new kind of interpretation over relational structures: finite sets interpretations. Those interpretations are defined by weak monadic second-order (WMSO) formulas with free set variables. They transform a given structure into…

Logic in Computer Science · Computer Science 2017-01-11 Thomas Colcombet , Christof Löding

In this article we generalise the structure of Connes-Kreimer Hpof algebra consisting of Feynmam diagrams to the situations of abstract finite sets, matrices and star product of scalar field, where the construction for the case of finite…

Mathematical Physics · Physics 2023-09-06 Mai Zhou

In this paper, I argue, contrary to the prevailing opinion in the linguistics and philosophy literature, that a sortal approach to aspectual composition can indeed be explanatory. In support of this view, I develop a synthesis of competing…

cmp-lg · Computer Science 2008-02-03 Michael White