Related papers: NF is Consistent
We show that subsets of interacting oscillators may synchronize in different ways within a single network. This diversity of synchronization patterns is promoted by increasing the heterogeneous distribution of coupling weights and/or…
Typed feature structures are used extensively for the specification of linguistic information in many formalisms. The subsumption relation orders TFSs by their information content. We prove that subsumption of acyclic TFSs is well-founded,…
The homology groups of many natural sequences of groups $\{G_n\}_{n=1}^{\infty}$ (e.g. general linear groups, mapping class groups, etc.) stabilize as $n \rightarrow \infty$. Indeed, there is a well-known machine for proving such results…
We give some explicit calculations for stable distributions and convergence to them, mainly based on less explicit results in Feller (1971). The main purpose is to provide ourselves with easy reference to explicit formulas and examples.…
The main purpose of this paper is to find the fixed point in such cases where existing literature remain silent. In this paper we introduce partial completeness, a new type of contraction and many other definitions. Using this approach the…
In the paper we introduce a weak set theory $\mathsf{H}_{<\omega}$ . A formalization of arithmetic on finite von Neumann ordinals gives an embedding of arithmetical language into this theory. We show that $\mathsf{H}_{<\omega}$ proves a…
Justification theory is a general framework for the definition of semantics of rule-based languages that has a high explanatory potential. Nested justification systems, first introduced by Denecker et al. (2015), allow for the composition…
Local consistency arises in diverse areas, including Bayesian statistics, relational databases, and quantum foundations, and so does the notion of functional dependence. We adopt a general approach to study logical inference in a setting…
The problem of representing nodes in a signed network as low-dimensional vectors, known as signed network embedding (SNE), has garnered considerable attention in recent years. While several SNE methods based on graph convolutional networks…
Given a Dedekind incomplete ordered field, a pair of convergent nets of gaps which are respectively increasing or decreasing to the same point is used to obtain a further equivalent criterion for Dedekind completeness of ordered fields:…
As Graph Neural Networks (GNNs) are increasingly being employed in critical real-world applications, several methods have been proposed in recent literature to explain the predictions of these models. However, there has been little to no…
The process of pattern formation for a multi-species model anchored on a time varying network is studied. A non homogeneous perturbation superposed to an homogeneous stable fixed point can amplify, as follows a novel mechanism of…
We observe that most known results of the form "v is not a finite-type invariant" follow from two basic theorems. Among those invariants which are not of finite type, we discuss examples which are "ft-independent" and examples which are…
We give a self-contained treatment of the theory of persistence modules indexed over the real line. We give new proofs of the standard results. Persistence diagrams are constructed using measure theory. Linear algebra lemmas are simplified…
We develop an axiomatic set theory -- the Theory of Hyperfinite Sets THS, which is based on the idea of existence of proper subclasses of big finite sets. We demonstrate how theorems of classical continuous mathematics can be transfered to…
A thorough investigation of the foundations of paraconsistent logics. Relations between logical principles are formally studied, a novel notion of consistency is introduced, the logics of formal inconsistency, and the subclasses of…
The generating series of descendent invariants of stable pairs on 3-folds is conjectured to be rational and to satisfy a $q\leftrightarrow q^{-1}$ symmetry. We prove this conjecture for Fano 3-folds. We utilize the same path of stability…
We prove that for every simple theory $T$ (or even simple thick compact abstract theory) there is a (unique) compact abstract theory $T^\fP$ whose saturated models are the lovely pairs of $T$. Independence-theoretic results that were proved…
Connections between structural graph theory and finite model theory recently gained a lot of attention. In this setting, many interesting questions remain on the properties of dependent (NIP) hereditary classes of graphs, in particular…
We provide a framework for studying the interplay between concordance and positive mutation and identify some of the basic structures relating the two. The fundamental result in understanding knot concordance is the structure theorem proved…