Related papers: Combinatorial realizability models of type theory
The technique of "classical realizability" is an extension of the method of "forcing"; it permits to extend the Curry-Howard correspondence between proofs and programs, to Zermelo-Fraenkel set theory and to build new models of ZF, called…
We develop a new framework for the study of complex continuous time dynamical systems based on viewing them as collections of interacting control modules. This framework is inspired by and builds upon the groupoid formalism of Golubitsky,…
Let ML(U^+) denote the fragment of modal logic extended with the universal modality in which the universal modality occurs only positively. We characterize the relative definability of ML(U^+) relative to finite transitive frames in the…
A typoid is a type equipped with an equivalence relation, such that the terms of equivalence between the terms of the type satisfy certain conditions, with respect to a given equivalence relation between them, that generalise the properties…
To ensure decidability and consistency of its type theory, a proof assistant should only accept terminating recursive functions and productive corecursive functions. Most proof assistants enforce this through syntactic conditions, which can…
ZF is a well investigated impredicative constructive version of Zermelo-Fraenkel set theory. Using set terms, we axiomatize IZF with Replacement, which we call \izfr, along with its intensional counterpart \iizfr. We define a typed lambda…
Let k be an algebraically closed field of characteristic 0, and let f be a morphism of smooth projective varieties from X to Y over the ring k((t)) of formal Laurent series. We prove that if a general geometric fiber of f is rationally…
In generic realizability for set theories, realizers treat unbounded quantifiers generically. To this form of realizability, we add another layer of extensionality by requiring that realizers ought to act extensionally on realizers, giving…
In this paper we examine four different models for the realization space of a polytope: the classical model, the Grassmannian model, the Gale transform model, and the slack variety. Respectively, they identify realizations of the polytopes…
Graph monoids arise naturally in the study of non-stable K-theory of graph C*-algebras and Leavitt path algebras. They play also an important role in the current approaches to the realization problem for von Neumann regular rings. In this…
The supercharacter theory of algebra groups gave us a representation theoretic realization of the Hopf algebra of symmetric functions in noncommuting variables. The underlying representation theoretic framework comes equipped with two…
We explore various combinatorial problems mostly borrowed from physics, that share the property of being continuously or discretely integrable, a feature that guarantees the existence of conservation laws that often make the problems…
These lecture notes are devoted to formal and phenomenological aspects of F-theory. We begin with a pedagogical introduction to the general concepts of F-theory, covering classic topics such as the connection to Type IIB orientifolds, the…
In these notes we explain how the CFT description of random matrix models can be used to perform actual calculations. Our basic example is the hermitian matrix model, reformulated as a conformal invariant theory of free fermions. We give an…
Following a project of developing conventions and notations for informal type theory carried out in the homotopy type theory book for a framework built out of an augmentation of constructive type theory with axioms governing…
We provide groupoid models for Toeplitz and Cuntz-Krieger algebras of topological higher-rank graphs. Extending the groupoid models used in the theory of graph algebras and topological dynamical systems to our setting, we prove results on…
The technique of construction on Manhattan lattice (ML) the fermionic action for Integrable models is presented. The Sign-Factor of 3D Ising model (SF of 3DIM) and Chalker-Coddington-s phenomenological model (CCM) for the edge excitations…
Intensional computation derives concrete outputs from abstract function definitions; extensional computation defines functions through explicit input-output pairs. In formal semantics: intensional computation interprets expressions as…
We use finite group topological lattice gauge theory, also known as the quantum double model, as a lens to explore a notion of topological order enriched by a non-invertible symmetry. For invertible symmetry enriched topological order,…
The harmonic Frenkel-Kontorova model is used to illustrate with an exactly solvable example a general technique of mapping a coherently strained epitaxial system with continuous atomic displacements onto a lattice gas model (LGM) with only…