中文
相关论文

相关论文: What internal set theory knows about standard sets

200 篇论文

Multi-class systems having possibly both finite and infinite classes are investigated under a natural partial exchangeability assumption. It is proved that the conditional law of such a system, given the vector of the empirical measures of…

概率论 · 数学 2009-02-04 Carl Graham

We define the continuous modeling property for first-order structures and show that a first-order structure has the continuous modelling property if and only if its age has the embedding Ramsey property. We use generalized indiscernible…

逻辑 · 数学 2024-05-31 Adrián Portillo Fernández

Current techniques for generating a knowledge space, such as QUERY, guarantees that the resulting structure is closed under union, but not that it satisfies wellgradedness, which is one of the defining conditions for a learning space. We…

组合数学 · 数学 2009-08-28 David Eppstein , Jean-Claude Falmagne , Hasan Uzun

This paper addresses the current lack of a unified formal framework in machine learning theory, as well as the absence of robust theoretical foundations for interpretability and ethical safety assurance. We first construct a formal…

计算机科学中的逻辑 · 计算机科学 2025-11-11 Jianfeng Xu

We study classes of modules closed under direct sums, $\mathcal{M}$-submodules and $\mathcal{M}$-epimorphic images where $\mathcal{M}$ is either the class of embeddings, $RD$-embeddings or pure embeddings. We show that the…

环与代数 · 数学 2024-08-19 Marcos Mazari-Armida , Jiri Rosicky

LF is a dependent type theory in which many other formal systems can be conveniently embedded. However, correct use of LF relies on nontrivial metatheoretic developments such as proofs of correctness of decision procedures for LF's…

计算机科学中的逻辑 · 计算机科学 2010-05-04 Christian Urban , James Cheney , Stefan Berghofer

We give an almost entirely model-theoretic account of both Ramsey classes of finite structures and of generalized indiscernibles as studied in special cases in (for example) [7], [9]. We understand "theories of indiscernibles" to be special…

逻辑 · 数学 2012-10-30 Cameron Donnay Hill

Many versions of the Stokes theorem are known. More advanced of them require complicated mathematical machinery to be formulated which discourages the users. Our theorem is sufficiently simple to suit the handbooks and yet it is pretty…

经典分析与常微分方程 · 数学 2011-11-08 Lech Pasicki

Motivated by ideas from the model theory of metric structures, we introduce a metric set theory, $\mathsf{MSE}$, which takes bounded quantification as primitive and consists of a natural metric extensionality axiom (the distance between two…

逻辑 · 数学 2023-02-07 James Hanson

A generalized set theory (GST) is like a standard set theory but also can have non-set structured objects that can contain other structured objects including sets. This paper presents Isabelle/HOL support for GSTs, which are treated as type…

计算机科学中的逻辑 · 计算机科学 2022-07-26 Ciarán Dunne , J. B. Wells

Generalization is at the core of machine learning models. However, the definition of generalization is not entirely clear. We employ set theory to introduce the concepts of algorithms, hypotheses, and dataset generalization. We analyze the…

机器学习 · 计算机科学 2023-11-14 Shiqi Liu

Let $\mathcal M=(M,<,...)$ be a linearly ordered first-order structure and $T$ its complete theory. We investigate conditions for $T$ that could guarantee that $\mathcal M$ is not much more complex than some colored orders (linear orders…

逻辑 · 数学 2021-05-27 Predrag Tanović , Slavko Moconja , Dejan Ilić

By Tzouvaras, a set is nontypical in the Russell sense, if it belongs to a countable ordinal definable set. The class HNT of all hereditarily nontypical sets satisfies all axioms of ZF and the double inclusion HOD$\subseteq$HNT$\subseteq$V…

逻辑 · 数学 2021-11-16 Vladimir Kanovei , Vassily Lyubetsky

A point set $M$ in Euclidean plane is called an integral point set in semi-general position if all the distances between the elements of $M$ are integers, and $M$ does not contain collinear triples. We improve the lower bound for diameter…

组合数学 · 数学 2025-12-16 N. N. Avdeev , E. A. Lushina

We show that the class of representable substitution algebras is characterized by a set of universal first order sentences. In addition, it is shown that a necessary and sufficient condition for a substitution algebra to be representable is…

逻辑 · 数学 2015-03-05 Norman Feldman

We give a full solution to the question of existence of indiscernibles in dependent theories by proving the following theorem: for every $\theta$ there is a dependent theory $T$ of size $\theta$ such that for all $\kappa$ and $\delta$,…

逻辑 · 数学 2013-08-29 Itay Kaplan , Saharon Shelah

A set $M\subset\mathbb{R}$ is microscopic if for each $\varepsilon>0$ there is a sequence of intervals $(J_n)_{n\in\omega}$ covering $M$ and such that $|J_n|\leq \varepsilon^{n+1}$ for each $n\in\omega$. We show that there is a microscopic…

逻辑 · 数学 2017-09-26 Adam Kwela

We introduce a new class of "random" subsets of natural numbers, WM sets. This class contains normal sets (sets whose characteristic function is a normal binary sequence). We establish necessary and sufficient conditions for solvability of…

组合数学 · 数学 2009-11-10 Alexander Fish

The parameters of a machine learning model are typically learned by minimizing a loss function on a set of training data. However, this can come with the risk of overtraining; in order for the model to generalize well, it is of great…

机器学习 · 统计学 2024-05-13 Neil Dey , Jonathan P. Williams

Choices in the semantics and the signature of a theory are integral in determining how the theory is used and how challenging it is to reason over it. Our interest in this paper lies in the SMT theory of sequences. Various versions of it…

计算机科学中的逻辑 · 计算机科学 2024-11-05 Hichem Rami Ait El Hara , François Bobot , Guillaume Bury