Related papers: Tarski's least fixed point theorem: A predicative …
We prove a fixed point theorem for the action of certain local monodromy groups on \'etale covers and use it to deduce lower bounds in essential dimension. In particular, we give more geometric proofs of many (but not all) of the results of…
In this paper, we demonstrate that Li's fixed point theorems are indeed equivalent with the primitive Caristi's fixed point theorem, Jachymski's fixed point theorems, Feng and Liu's fixed point theorems, Khamsi's fixed point theorems and…
To be usable in practice, interactive theorem provers need to provide convenient and efficient means of writing expressions, definitions, and proofs. This involves inferring information that is often left implicit in an ordinary…
We characterize the number of points for which there exist non-empty Terracini sets of points in $\mathbb{P}^n$. Then we study minimally Terracini finite sets of points in $\mathbb{P}^n$ and we obtain a complete description in the case of…
Propositional type theory, first studied by Henkin, is the restriction of simple type theory to a single base type that is interpreted as the set of the two truth values. We show that two constants (falsity and implication) suffice for…
In this paper we develop a new theory for the existence, localization and multiplicity of positive solutions for a class of non-variational,quasilinear, elliptic systems. In order to do this, we provide a fairly general abstract framework…
The depth-bounded fragment of the pi-calculus is an expressive class of systems enjoying decidability of some important verification problems. Unfortunately membership of the fragment is undecidable. We propose a novel type system,…
We give a definition of finitary type theories that subsumes many examples of dependent type theories, such as variants of Martin-L\"of type theory, simple type theories, first-order and higher-order logics, and homotopy type theory. We…
We illustrate the use of intersection types as a semantic tool for showing properties of the lattice of lambda theories. Relying on the notion of easy intersection type theory we successfully build a filter model in which the interpretation…
This paper develops a general method of inference for fixed effects models which is (i) automatic, (ii) computationally inexpensive, (iii) tuning parameter-free, and (iv) highly model agnostic. Specifically, we show how to combine a…
In this paper, we show that Severi varieties parameterizing irreducible reduced planar curves of a given degree and geometric genus are either empty or irreducible in any characteristic. Following Severi's original idea, this gives a new…
In some theory development tasks, a problem is satisfactorily solved once it is shown that a theorem (conjecture) is derivable from the background theory (premises). Depending on one's motivations, the details of the derivation of the…
The moduli space of Gieseker vector bundles is a compactification of moduli of vector bundles on a nodal curve. This moduli space has only normal crossing singularity and it provides a flat degeneration. We prove a Torelli type theorem for…
This paper deals with the Peskine version of Zariski Main Theorem published in 1965 and discusses some applications. It is written in the style of Bishop's constructive mathematics. Being constructive, each proof in this paper can be…
Simple type theory is suited as framework for combining classical and non-classical logics. This claim is based on the observation that various prominent logics, including (quantified) multimodal logics and intuitionistic logics, can be…
The constructive approach to mathematics has the advantage that witnesses can be extracted from statements of existence and theorems can be unwound to give algorithms. Even better, constructive theorems can be interpreted in any topos,…
In this paper, we propose an abstract definition of dependent type theories as essentially algebraic theories. One of the main advantages of this definition is its composability: simple theories can be combined into more complex ones, and…
This is the fourth in a series of papers extending Martin-L\"of's meaning explanation of dependent type theory to higher-dimensional types. In this installment, we show how to define cubical type systems supporting a general schema of…
Propositional inquisitive logic is the limit of its $n$-bounded approximations. In the predicate setting, however, this does not hold anymore, as discovered by Ciardelli and Grilletti, who also found complete axiomatizations of $n$-bounded…
Kotlarski's theorem (see H. Kotlarski. Bounded Induction and Satisfaction Classes. Mathematical Logic Quarterly, vol. 32, 31-34, 1986, P. 531--544.) formalized in $WKL_0$.