On uniform definability of types over finite sets for NIP formulas

IF 0.9 1区数学 Q1 LOGIC

Journal of Mathematical Logic Pub Date : 2019-04-23 DOI:10.1142/s021906132150015x

Shlomo Eshel, Itay Kaplan

引用次数: 6

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.

查看原文本刊更多论文

有限集上NIP公式类型的一致可定义性

结合机器学习理论的两个结果，证明了一个公式是NIP当且仅当它满足有限集上类型的一致可定义性(UDTFS)。这解决了拉斯科夫斯基的一个猜想。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Journal of Mathematical Logic MATHEMATICS-LOGIC

CiteScore

1.60

自引率

11.10%

发文量

审稿时长

>12 weeks

期刊介绍： The Journal of Mathematical Logic (JML) provides an important forum for the communication of original contributions in all areas of mathematical logic and its applications. It aims at publishing papers at the highest level of mathematical creativity and sophistication. JML intends to represent the most important and innovative developments in the subject.