Related papers: Sketches and Classifying Logoi

We formulate a theory of shape valid for objects of arbitrary dimension whose contours are path connected. We apply this theory to the design and modeling of viable trajectories of complex dynamical systems. Infinite families of…

Network models with latent geometry have been used successfully in many applications in network science and other disciplines, yet it is usually impossible to tell if a given real network is geometric, meaning if it is a typical element in…

Topologies on algebraic and equational theories are used to define germ determined, near-point determined, and point determined rings of smooth functions, without requiring them to be finitely generated. It is proved, that any commutative…

A theory of sketches for arithmetic universes (AUs) is developed. A restricted notion of sketch, called here "context", is defined with the property that every non-strict model is uniquely isomorphic to a strict model. This allows us to…

We show that certain diagrams of $\infty$-logoses are reconstructed in homotopy type theory extended with some lex, accessible modalities, which enables us to use plain homotopy type theory to reason about not only a single $\infty$-logos…

Although contemporary model theory has been called "algebraic geometry minus fields", the formal methods of the two fields are radically different. This dissertation aims to shrink that gap by presenting a theory of logical schemes,…

For any fixed integer $R \geq 2$ we characterise the typical structure of undirected graphs with vertices $1, ..., n$ and maximum degree $R$, as $n$ tends to infinity. The information is used to prove that such graphs satisfy a labelled…

This is a draft of a book submitted for publication by the AMS. Its theme is the remarkable interplay, accelerating in the last few decades, between topology and the theory of orderable groups, with applications in both directions. It…

Verifying a conjecture of Gromov we establish a generalized Margulis Lemma for manifolds with lower Ricci curvature bound. Among the various applications are finiteness results for fundamental groups of compact $n$-manifolds with upper…

We give characterizations, for various fragments of geometric logic, of the class of theories classified by a locally connected (resp. connected and locally connected, atomic, compact, presheaf) topos, and exploit the existence of multiple…

We study the $2$-categories BIon, of (generalized) bounded ionads, and $\text{Acc}_\omega$, of accessible categories with directed colimits, as an abstract framework to approach formal model theory. We relate them to topoi and (lex)…

We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth $D(G)$ of a graph $G$ is equal to the minimum quantifier depth of a sentence defining $G$…

We establish a criterion for deciding whether a class of structures is the class of models of a geometric theory inside Grothendieck toposes; then we specialize this result to obtain a characterization of the infinitary first-order theories…

We construct the universal realized limit sketch associated to a given limit sketch. The construction uses factorization systems to organize the classical argument of [2], yielding a streamlined and conceptually unified formulation of the…

This contribution proposes a new approach towards developing a class of probabilistic methods for classifying attributed graphs. The key concept is random attributed graph, which is defined as an attributed graph whose nodes and edges are…

A labeled oriented graph (LOG) is an oriented graph with a labeling function from the edge set into the vertex set. The complexity of a LOG is the minimal cardinality of an initial set $S$ of vertices such that every vertex can be reached…

A geometric entropy is defined as the Riemannian volume of the parameter space of a statistical manifold associated with a given network. As such it can be a good candidate for measuring networks complexity. Here we investigate its ability…

We classify graphs and, more generally, finite relational structures that are identified by C2, that is, two-variable first-order logic with counting. Using this classification, we show that it can be decided in almost linear time whether a…

We propose a homology theory for locally compact spaces with ends in which the ends play a special role. The approach is motivated by results for graphs with ends, where it has been highly successful. But it was unclear how the original…

The primary goal of this paper is to present a unified way to transform the syntax of a logic system into certain initial algebraic structure so that it can be studied algebraically. The algebraic structures which one may choose for this…