Related papers: Naturality and Definability III
The literature on concurrency theory offers a wealth of examples of characteristic-formula constructions for various behavioural relations over finite labelled transition systems and Kripke structures that are defined in terms of fixed…
The concept of definability of quantum fields in a set-theoretical foundation is introduced. We propose an axiomatic set theory and then derive a nonlinear sigma model and the Schroedinger equation in a Lagrangian form; this follows…
We combine several folklore observations to provide a working framework for iterating constructions which contradict the axiom of choice. We use this to define a model in which any kind of structural failure must fail with a proper class of…
We introduce judgemental theories and their calculi as a general framework to present and study deductive systems. As an exemplification of their expressivity, we approach dependent type theory and natural deduction as special kinds of…
We investigate the isomorphism problem in the setting of definable sets (equivalent to sets with atoms): given two definable relational structures, are they related by a definable isomorphism? Under mild assumptions on the underlying…
A tentative proposal is demonstrated that there is a natural strategy to get rid of unphysical (UV) infinities in QFTs if one adopts the modern standard point of view that a fundamental theory that is complete and well-defined in all…
This paper is a technical continuation of ``Natural Axiom Schemata Extending ZFC. Truth in the Universe?'' In that paper we argue that $CIFS$ is a natural axiom schema for the universe of sets. In particular it is a natural closure…
This paper presents and extends our type theoretical framework for a compositional treatment of natural language semantics with some lexical features like coercions (e.g. of a town into a football club) and copredication (e.g. on a town as…
We specialise a recently introduced notion of generalised dinaturality for functors $T : (\mathcal{C}^\text{op})^p \times \mathcal{C}^q \to \mathcal{D}$ to the case where the domain (resp., codomain) is constant, obtaining notions of ends…
We obtain a complete characterization of \emph{topologically exact patterns} on \emph{triods}. Based on their \emph{rotation number} $\rho$, these \emph{exact patterns} are grouped into three classes: \emph{slow} ($\rho < \frac{1}{3}$),…
We use a generalization of a construction by Ziegler to show that for any field $F$ and any countable collection of countable subsets $A_i \subseteq F, i \in \calI \subset \Z_{>0}$ there exist infinitely many fields $K$ of arbitrary…
We propose a reinterpretation of the continuum grounded in the stratified structure of definability rather than classical cardinality. In this framework, a real number is not an abstract point on the number line, but an object expressible…
We prove coherence theorems for bicategories, pseudofunctors and pseudonatural transformations. These theorems boil down to proving the coherence of some free $(4,2)$-categories. In the case of bicategories and pseudofunctors, existing…
We provide a simple natural duality for the varieties generated by the negation- and implication- free reduct of a finite MV-chain. We study these varieties through the dual equivalence thus obtained. For example, we fully characterize…
Using a modification of the invariant Jensen forcing, we define a model of ZFC, in which, for a given $n\ge3$, there exists a lightface $\varPi^1_n$ set of reals, which is a ${\mathsf E}_0$ equivalence class, hence a countable set, and…
Formal explainability guarantees the rigor of computed explanations, and so it is paramount in domains where rigor is critical, including those deemed high-risk. Unfortunately, since its inception formal explainability has been hampered by…
In a Systems Engineering setting, various models are produced using a variety of methods and tools. Focusing on a type of models -- called descriptive models -- which we shall describe, we argue that, while the clarity and precision of…
We develop a technique for normalization for $\infty$-type theories. The normalization property helps us to prove a coherence theorem: the initial model of a given $\infty$-type theory is $0$-truncated. The coherence theorem justifies…
In this paper we prove that every definable set has a definable triangulation which is locally Lipschitz and weakly bi-Lipschitz on the natural simplicial stratification of the simplicial complex. We also distinguish a class T of regularity…
Constructor theory seeks to express all fundamental scientific theories in terms of a dichotomy between possible and impossible physical transformations - those that can be caused to happen and those that cannot. This is a departure from…