Related papers: Dathematics: A Meta-isomorphic Version of 'Standar…
We prove an analogue of Morley's categoricity theorem where cardinality is replaced by the recursion-theoretic notion of arithmetic degree. We say that a complete arithmetically definable theory $T$ is $D$-categorical if any two…
Sets with atoms serve as an alternative to ZFC foundations for mathematics, where some infinite, though highly symmetric sets, behave in a finitistic way. Therefore, one can try to carry over analysis of the classical algorithms from finite…
We show that if we enrich first order logic by allowing quantification over isomorphisms between definable ordered fields the resulting logic, L(Q_{Of}), is fully compact. In this logic, we can give standard compactness proofs of various…
Let $\phi$ be a normalized convex function defined on open unit disk $\mathbb{D}$. For a unified class of normalized analytic functions which satisfy the second order differential subordination $f'(z)+ \alpha z f''(z) \prec \phi(z)$ for all…
We present a system of axioms motivated by a topological intuition: The set of subsets of any set is a topology on that set. On the one hand, this system is a common weakening of Zermelo-Fraenkel set theory ZF, the positive set theory GPK…
New Foundations ($\mathrm{NF}$) is a set theory obtained from naive set theory by putting a stratification constraint on the comprehension schema; for example, it proves that there is a universal set $V$. $\mathrm{NFU}$ ($\mathrm{NF}$ with…
Although some work has been done on the metamathematics of Metamath, there has not been a clear definition of a model for a Metamath formal system. We define the collection of models of an arbitrary Metamath formal system, both for…
ZF is a well investigated impredicative constructive version of Zermelo-Fraenkel set theory. Using set terms, we axiomatize IZF with Replacement, which we call \izfr, along with its intensional counterpart \iizfr. We define a typed lambda…
Let $X$ be a smooth projective variety defined on a finite field $\mathbb{F}_q$. On $X$ there is a special morphism $Fr_X$, which raises coordinates to exponent $q$: $t\mapsto t^q$. The two main results in this paper are: Result 1: If…
It is well-known that a finite axiomatization of Zermelo-Fraenkel set theory (ZF) is not possible in the same first-order language. In this note we show that a finite axiomatization is possible if we extent the language of ZF with the new…
This is the second in a series of papers on the relation between algebraic set theory and predicative formal systems. In part I, we introduced the notion of a predicative category of small maps and obtained the result that such categories…
The reader surely knows what particles physics is about: finding building blocks of nature that appear elementary at a given time and study their interactions - so why in the world this essay? The problem is how to arrive at a fundamental…
The main goal of this note is to provide a First-Order Logic with Betweenness (FOLB) axiomatization of the main classes of graphs occurring in Metric Graph Theory, in analogy to Tarski's axiomatization of Euclidean geometry. We provide such…
We study models M of set theory that are "condensable", in the sense that there is an "ordinal" v of M such that the rank initial segment of M determined by v is both isomorphic to M, and also an elementary submodel of M for infinitary…
Axiomatizing mathematical structures and theories is an objective of Mathematical Logic. Some axiomatic systems are nowadays mere definitions, such as the axioms of Group Theory; but some systems are much deeper, such as the axioms of…
This paper is divided into two parts. The first is a review, through categorical lenses, of the classical theory of regular-singular differential systems over $C((x))$ and $\mathbb P^1_C\smallsetminus\{0,\infty\}$, where $C$ is…
In this paper, we present a proof of the consistency of the New Foundations set theory ($\mathit{NF}$). $\mathit{NF}$'s main idea is to permit very large sets (including the Universal Set) by restricting set formation to stratified…
In this paper a class of languages which are formal enough for mathematical reasoning is introduced. First-order formal languages containing natural numbers and numerals belong to that class. Its languages are called mathematically…
We prove a general decomposition theorem for the modal $\mu$-calculus $L_\mu$ in the spirit of Feferman and Vaught's theorem for disjoint unions. In particular, we show that if a structure (i.e., transition system) is composed of two…
This work uses mostly model-theoretic methods to establish new proof-theoretic theorems about several axiomatic theories of truth over KP (Kripke-Platek set theory) and stronger theories, especially ZF (Zermelo-Fraenkel set theory).