Related papers: Equivalents of the finitary non-deterministic indu…
We study a new proof principle in the context of constructive Zermelo-Fraenkel set theory based on what we will call "non-deterministic inductive definitions". We give applications to formal topology as well as a predicative justification…
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…
The main goal of this paper is to formulate a constructive analogue of Ackermann's observation about finite set theory and arithmetic. We will see that Heyting arithmetic is bi-interpretable with $\mathsf{CZF^{fin}}$, the finitary version…
We present a bounded modified realisability and a bounded functional interpretation of intuitionistic nonstandard arithmetic with nonstandard principles. The functional interpretation is the intuitionistic counterpart of Ferreira and…
We study cofinal systems of finite subsets of $\omega_1$. We show that while such systems can be NIP, they cannot be defined in an NIP structure. We deduce a positive answer to a question of Chernikov and Simon from 2013: in an NIP theory,…
We observe that the nonstandard finite cardinality of a definable set in a strongly minimal pseudofinite structure D is a polynomial over the integers in the nonstandard finite cardinality of D. We conclude that D is unimodular, hence also…
In constructive mathematics, several nonequivalent notions of finiteness exist. In this paper, we continue the study of Noetherian sets in the dependently typed setting of the Agda programming language. We want to say that a set is…
Definable topological groups whose topologies are affine have definable $\mathcal C^r$ structures in d-minimal expansions of ordered fields, where $r$ is a positive integer. We prove this fact using a new notion called partition degree of a…
In this short note, we classify linear categorified open topological field theories in dimension two by pivotal Grothendieck-Verdier categories, a type of monoidal category equipped with a weak, not necessarily rigid duality. In combination…
This paper provides a canonical construction of a Noetherian least fixed point topology. While such least fixed point are not Noetherian in general, we prove that under a mild assumption, one can use a topological minimal bad sequence…
The assertion that every definable set has a definable element is equivalent over ZF to the principle $V=\text{HOD}$, and indeed, we prove, so is the assertion merely that every $\Pi_2$-definable set has an ordinal-definable element.…
The notion of a non-deterministic logical matrix (where connectives are interpreted as multi-functions) extends the traditional semantics for propositional logics based on logical matrices (where connectives are interpreted as functions).…
CZF is a system of set theory which, over classical logic, is equivalent to ZF, while over intuitionistic logic, it has a well-known constructive type-theoretic interpretation. This article introduces a simpler, intuitive family of…
We introduce the concept of topological finite-determinacy for germs of analytic functions within a fixed ideal $I$, which provides a notion of topological finite-determinacy of functions with non-isolated singularities. We prove the…
We report on a recent conjecture by Gisin on a restriction of physical processes in sets of finite information numbers (FIN) and further analyze the entropic constraint associated with the proposed algorithm. In the course, we provide a…
We establish a precise relation between M, a subsystem of the formal axiomatic system of intuitionistic analysis FIM of S. C. Kleene, and elementary analysis EL of A. S. Troelstra, two weak formal systems of two-sorted intuitionistic…
In this study, we explore the partial identification of nonseparable models with continuous endogenous and binary instrumental variables. We show that the structural function is partially identified when it is monotone or concave in the…
Initial semantics aims to model inductive structures and their properties, and to provide them with recursion principles respecting these properties. An ubiquitous example is the fold operator for lists. We are concerned with initial…
We give extensional and intensional characterizations of functional programs with nondeterminism: as structure preserving functions between biorders, and as nondeterministic sequential algorithms on ordered concrete data structures which…
In two papers we noted that in common practice many algebraic constructions are defined only `up to isomorphism' rather than explicitly. We mentioned some questions raised by this fact, and we gave some partial answers. The present paper…