Related papers: Relative Categoricity and Abstraction Principles
Across machine learning (ML) sub-disciplines researchers make mathematical assumptions to facilitate proof-writing. While such assumptions are necessary for providing mathematical guarantees for how algorithms behave, they also necessarily…
We provided in \cite{BaldwinBrincusI} extensions of first order logic by modified inferential definitions of the classical $\omega$-rule in $1$ or $2$ sorts. These logics are categorical in the inferential sense. Arithmetic has a unique…
This work proposes a view of probability as a relative measure rather than an absolute one. To demonstrate this concept, we focus on finite outcome spaces and develop three fundamental axioms that establish requirements for relative…
In 1931, G\"odel presented in K\"onigsberg his famous Incompleteness Theorem, stating that some true mathematical statements are unprovable. Yet, this result gives us no idea about those independent (that is, true and unprovable)…
Let K be an Abstract Elementary Class. Under the asusmptions that K has a nicely behaved forking-like notion, regular types and existence of some prime models we establish a decomposition theorem for such classes. The decomposition implies…
This expository paper advocates an approach to physics in which ``typicality" is identified with a suitable form of algorithmic randomness. To this end various theorems from mathematics and physics are reviewed. Their original versions…
Approximation Fixpoint Theory (AFT) is an algebraic framework designed to study the semantics of non-monotonic logics. Despite its success, AFT is not readily applicable to higher-order definitions. To solve such an issue, we devise a…
Measurability with respect to ideals is tightly connected with absoluteness principles for certain forcing notions. We study a uniformization principle that postulates the existence of a uniformizing function on a large set, relative to a…
Suppose L is a relational language and P in L is a unary predicate. If M is an L-structure then P(M) is the L-structure formed as the substructure of M with domain {a: M models P(a)}. Now suppose T is a complete first order theory in L with…
This article was motivated by the discovery of a potential new foundation for mainstream mathematics. The goals are to clarify the relationships between primitives, foundations, and deductive practice; to understand how to determine what…
In this paper we generalize and put in a new light part of ``Fouier analysis on Number fields and Hecke's zeta function''[14] by Tate. We express the relative Euler characteristic using purely adelic language. By using certain natural…
In science, the most widespread statistical quantities are perhaps $p$-values. A typical advice is to reject the null hypothesis $H_0$ if the corresponding p-value is sufficiently small (usually smaller than 0.05). Many criticisms regarding…
To study operator algebras with symmetries in a wide sense we introduce a notion of {\em relative convolution operators} induced by a Lie algebra. Relative convolutions recover many important classes of operators, which have been already…
We set an upper bound on the gravitational cutoff in theories with exact quantum numbers of large N periodicity, such as Z_N discrete symmetries. The bound stems from black hole physics. It is similar to the bound appearing in theories with…
Abstract convexity generalises classical convexity by considering the suprema of functions taken from an arbitrarily defined set of functions. These are called the abstract linear (abstract affine) functions. The purpose of this paper is to…
We revisit, in an elementary way, the classical statement of various ``Main Conjectures'' for $p$-class groups $\mathcal{H}_K$ and $p$-ramified torsion groups $\mathcal{T}_K$ of abelian fields $K$, in the non semi-simple case $p \mid [K :…
We introduce a new version of arithmetic in all finite types which extends the usual versions with primitive notions of extensionality and extensional equality. This new hybrid version allows us to formulate a strong form of extensionality,…
We prove that any tame abstract elementary class categorical in a suitable cardinal has an eventually global good frame: a forking-like notion defined on all types of single elements. This gives the first known general construction of a…
The present paper gives a statistical adventure towards exploring the average case complexity behavior of computer algorithms. Rather than following the traditional count based analytical (pen and paper) approach, we instead talk in terms…
Heuristic Rating Estimation (HRE) is a newly proposed method supporting decisions analysis based on the use of pairwise comparisons. It allows that the ranking values of some alternatives (herein referred to as concepts) are initially…