Related papers: Strict refinement property of connected loop-free …
This thesis introduces the "method of structural refinement", which serves as a means of transforming the relational semantics of a modal and/or constructive logic into an 'economical' proof system by connecting two proof-theoretic…
Let $G$ be the fundamental group of a graph of finitely generated virtually free groups with virtually cyclic edge groups. We shaw that $G$ is cohomologically good if $G$ is residually finite. If $G$ is LERF, we prove that G splits…
We prove a result of equivalence invariance of formal category theory for statements that can be expressed within an equipment. To do this, we exploit Henry and Bardomiano Mart\'inez's link between Makkai's FOLDS (first order logic with…
In this paper, we generalise the construction of the functorial pullback of refined unramified cohomology between smooth schemes, by following the ideas of Fulton's intersection theory and Rost's cycle modules. We also define standard…
If R is a commutative ring, we prove that every finitely generated module has a pure-composition series with indecomposable factors and any two such series are isomorphic if and only if R is a Bezout ring and a CF-ring.
We study a class of quasimorphisms of the free group that can be expressed as infinite sums of Brooks quasimorphisms with some nice properties. We then review Heuer's framework of decompositions developed in arXiv:1710.03193, and put these…
This paper develops a systematic framework for integrating local categories that model logical connectives using higher category theory. By extending these local categories into a unified two-category enriched with natural isomorphisms, the…
Given a nonzero integer $d$, we know by Hermite's Theorem that there exist only finitely many cubic number fields of discriminant $d$. However, it can happen that two non-isomorphic cubic fields have the same discriminant. It is thus…
Let C be an integral fusion category. We study some graphs, called the prime graph and the common divisor graph, related to the Frobenius-Perron dimensions of simple objects in the category C, that extend the corresponding graphs associated…
It has become obvious in the recent development that the structural Ramsey property is a categorical property: it depends not only on the choice of objects, but also on the choice of morphisms involved. In this paper we explicitely put the…
Definite descriptions are first-order expressions that denote unique objects. In this paper, we propose a second-order counterpart, designed to refer to unique relations between objects. We investigate this notion within the framework of…
Relational program verification is a variant of program verification where one can reason about two programs and as a special case about two executions of a single program on different inputs. Relational program verification can be used for…
Category theory provides a means through which many far-ranging fields of mathematics can be related by their similar structure. In a paper by Robinson [2], this interconnectivity afforded by categorical perspectives allowed for the…
We obtain a criterion for the automorphism group of an affine toric variety to be connected in combinatorial terms and in terms of the divisor class group of the variety. The component group of the automorphism group of a non-degenerate…
We use a $K$-theory recipe of Thomason to obtain classifications of triangulated subcategories via refining some standard thick subcategory theorems. We apply this recipe to the full subcategories of finite objects in the derived categories…
Any refinement system (= functor) has a fully faithful representation in the refinement system of presheaves, by interpreting types as relative slice categories, and refinement types as presheaves over those categories. Motivated by an…
The paper contains a very simple proof of the classical Hasumi's theorem that each usco mapping defined on an extremally disconnected space has a continuous selection. The paper also contains a very simple proof of a recent result about…
Linearizability is a commonly accepted consistency condition for concurrent objects. Filipovi\'{c} et al. show that linearizability is equivalent to observational refinement. However, linearizability does not permit concurrent objects to…
By Lindstr\"{o}m's theorems, the expressive power of first order logic (and similarly continuous logic) is not strengthened without losing some interesting property. Weakening it, is however less harmless and has been payed attention by…
Let F = F_p for any fixed prime p >= 2. An affine-invariant property is a property of functions on F^n that is closed under taking affine transformations of the domain. We prove that all affine-invariant property having local…