Related papers: A minimalist two-level foundation for constructive…
In this course, I talk about the source of mathematical constructivism and its role in the future development of theoretical physics. I describe what physical constructivism is and why it is necessary for the penetration of exact methods of…
We first recall some basic notions on minimalist grammars and on categorial grammars. Next we shortly introduce partially commutative linear logic, and our representation of minimalist grammars within this categorial system, the so-called…
Initial Semantics aims at interpreting the syntax associated to a signature as the initial object of some category of 'models', yielding induction and recursion principles for abstract syntax. Zsid\'o proves an initiality result for…
In this article we introduce a definition of topological minimal sets, which is a generalization of that of Mumford-Shah-minimal sets. We prove some general properties as well as two existence theorems for topological minimal sets. As an…
Axiomatic type theory is a dependent type theory without computation rules. The term equality judgements that usually characterise these rules are replaced by computation axioms, i.e., additional term judgements that are typed by identity…
This paper introduces a space of variable lotteries and proves a constructive version of the expected utility theorem. The word ``constructive'' is used here in two senses. First, as in constructive mathematics, the logic underlying proofs…
We present a unified theory for formal mathematical systems including recursive systems closely related to formal grammars, including the predicate calculus as well as a formal induction principle. We introduce recursive systems generating…
Varieties with log terminal and log canonical singularities are considered in the Minimal Model Program, see \cite{...} for introduction. In \cite{shokurov:hyp} it was conjectured that many of the interesting sets, associated with these…
Constructive type theory combines logic and programming in one language. This is useful both for reasoning about programs written in type theory, as well as for reasoning about other programming languages inside type theory. It is…
In this article we extend the theory of lax monoidal structures, also known as multitensors, and the monads on categories of enriched graphs that they give rise to. Our first principal result -- the lifting theorem for multitensors --…
We show that the class of Kalm\'ar elementary functions can be inductively generated from the addition, the integer remainder, and the base-two exponentiation, hence improving previous results by Marchenkov and Mazzanti. We also prove that…
Given an initial family of sets, we may take unions, intersections and complements of the sets contained in this family in order to form a new collection of sets; our construction process is done recursively until we obtain the last family.…
The degree of mixing is a fundamental property of a dynamical system. General multi-dimensional shifts cannot be systematically determined. This work introduces constructive and systematic methods for verifying the degree of mixing, from…
We give necessary and sufficient geometric conditions for a theory definable in an o-minimal structure to interpret a real closed field. The proof goes through an analysis of thorn-minimal types in super-rosy dependent theories of finite…
We formulate a definition of the existence property that works with "structural" set theories, in the mode of ETCS (the elementary theory of the category of sets). We show that a range of structural set theories, when formulated using…
We describe a type system for a platform called the General Intensional Programming System (GIPSY), designed to support intensional programming languages built upon intensional logic and their imperative counter-parts for the intensional…
At two examples dealt with in methodologically different ways it will be pointed out how the concept of an empirical theory (in the sense of the Structuralists) can be useful to specify contents relevant to maths didactics.
This paper presents a method for the optimization of multi-component structures comprised of two and three materials considering large motion sliding contact and separation along interfaces. The structural geometry is defined by an explicit…
We introduce two-sided type systems, which are sequent calculi for typing formulas. Two-sided type systems allow for hypothetical reasoning over the typing of compound program expressions, and the refutation of typing formulas. By…
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…