Related papers: Inner Models from Extended Logics: Part 2
We show that many large cardinal notions up to measurability can be characterized through the existence of certain filters for small models of set theory. This correspondence will allow us to obtain a canonical way in which to assign ideals…
We study compactness and L\"owenheim-Skolem properties of fragments of the class-sized logic $\mathcal{L}_{\infty \infty}$ and of class-sized versions of second-order and sort logics. In these fragments, certain combinations of infinitary…
Gauge symmetries play a fundamental role in Physics, as they provide a mathematical justification for the fundamental forces. Usually, one starts from a non-interactive theory which governs `matter', and features a global symmetry. One then…
We characterize several large cardinal notions by model-theoretic properties of extensions of first-order logic. We show that $\Pi_n$-strong cardinals, and, as a corollary, ``Ord is Woodin" and weak Vop\v{e}nka's Principle, are…
We consider the identifiability theory of probabilistic models and establish sufficient conditions under which the representations learned by a very broad family of conditional energy-based models are unique in function space, up to a…
In recent years, machine learning and AI have been introduced in many industrial fields. In fields such as finance, medicine, and autonomous driving, where the inference results of a model may have serious consequences, high…
Assume the existence of sufficent large cardinals. Let $M_{\mathrm{sw}n}$ be the minimal iterable proper class $L[E]$ model satisfying "there are $\delta_0<\kappa_0<\ldots<\delta_{n-1}<\kappa_{n-1}$ such that the $\delta_i$ are Woodin…
This paper continues the author's previous study \cite{Kura20}, showing that several weak principles inspired by non-normal modal logic suffice to derive various refined forms of the second incompleteness theorem. Among the main results of…
We analyze the notion of guessing model, a way to assign combinatorial properties to arbitrary regular cardinals. Guessing models can be used, in combination with inaccessibility, to characterize various large cardinals axioms, ranging from…
In this paper, we introduce a foundation for computable model theory of rational Pavelka logic (an extension of {\L}ukasiewicz logic) and continuous logic, and prove effective versions of some theorems in model theory. We show how to reduce…
We investigate mca-programs, that is, logic programs with clauses built of monotone cardinality atoms of the form kX, where k is a non-negative integer and X is a finite set of propositional atoms. We develop a theory of mca-programs. We…
Explainable Artificial Intelligence (XAI) emerged to reveal the internal mechanism of machine learning models and how the features affect the prediction outcome. Collinearity is one of the big issues that XAI methods face when identifying…
We mainly investigate model of set theory with restricted choice, e.g., ZF + DC + "the family of countable subsets of lambda is well ordered for every lambda" (really local version for a given lambda). In this frame much of pcf theory can…
We introduce a version of logic for metric structures suitable for applications to C*-algebras and tracial von Neumann algebras. We also prove a purely model-theoretic result to the effect that the theory of a separable metric structure is…
A main drawback of eXplainable Artificial Intelligence (XAI) approaches is the feature independence assumption, hindering the study of potential variable dependencies. This leads to approximating black box behaviors by analyzing the effects…
C. I. Lewis invented modern modal logic as a theory of "strict implication". Over the classical propositional calculus one can as well work with the unary box connective. Intuitionistically, however, the strict implication has greater…
This is the second paper in a series on intrinsic Donaldson-Thomas theory, a framework for studying the enumerative geometry of general algebraic stacks. In this paper, we present the construction of Donaldson-Thomas invariants for general…
Modal dependence logic was introduced recently by V\"a\"an\"anen. It enhances the basic modal language by an operator =(). For propositional variables p_1,...,p_n, =(p_1,...,p_(n-1);p_n) intuitively states that the value of p_n is…
We introduce Contrastive Activation Addition (CAA), an innovative method for steering language models by modifying their activations during forward passes. CAA computes "steering vectors" by averaging the difference in residual stream…
This is an introductory paper to a series of results linking generic absoluteness results for second and third order number theory to the model theoretic notion of model companionship. Specifically we develop here a general framework…