On uniform definability of types over finite sets for NIP formulas-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

On uniform definability of types over finite sets for NIP formulas

Published:2020-12-29 Issue:03 Volume:21 Page:
ISSN:0219-0613
Container-title:Journal of Mathematical Logic
language:en
Short-container-title:J. Math. Log.

Author:

Eshel Shlomo¹,Kaplan Itay¹

Affiliation:

1. Einstein Institute of Mathematics, Hebrew University of Jerusalem, 91904, Jerusalem, Israel

Abstract

Combining two results from machine learning theory we prove that a formula is NIP if and only if it satisfies uniform definability of types over finite sets (UDTFS). This settles a conjecture of Laskowski.

Funder

the Israel Science Foundation

Publisher

World Scientific Pub Co Pte Ltd

Subject

Logic

Link

https://www.worldscientific.com/doi/pdf/10.1142/S021906132150015X

Reference12 articles.

1. Externally definable sets and dependent pairs II

2. On uniform definability of types over finite sets

3. Vol. 65 of Proceedings of Machine Learning Research;Hu L.,2017

4. Compression Schemes, Stable Definable Families, and o-Minimal Structures

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Model theory and agnostic online learning via excellent sets;Transactions of the American Mathematical Society;2024-09-03

2. ON LARGE EXTERNALLY DEFINABLE SETS IN NIP;Journal of the Institute of Mathematics of Jussieu;2023-12-04

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP