English
Related papers

Related papers: A road to ultrafilter extensions

200 papers

In this paper we investigate the fragment of intuitionistic logic which only uses conjunction (meet) and implication, using finite duality for distributive lattices and universal models. We give a description of the finitely generated…

Logic · Mathematics 2015-05-15 Nick Bezhanishvili , Dion Coumans , Samuel J. van Gool , Dick de Jongh

The ability to interpret machine learning models has become increasingly important now that machine learning is used to inform consequential decisions. We propose an approach called model extraction for interpreting complex, blackbox…

Machine Learning · Computer Science 2018-03-14 Osbert Bastani , Carolyn Kim , Hamsa Bastani

In this article we undertake a study of extension complexity from the perspective of formal languages. We define a natural way to associate a family of polytopes with binary languages. This allows us to define the notion of extension…

Computational Complexity · Computer Science 2019-08-29 Hans Raj Tiwary

With the increasing impact of algorithmic decision-making on human lives, the interpretability of models has become a critical issue in machine learning. Counterfactual explanation is an important method in the field of interpretable…

Machine Learning · Computer Science 2024-07-17 Ao Xu , Tieru Wu

In the affine fragment of continuous logic, type spaces are compact convex sets. I study some model theoretic properties of extreme types. It is proved that every complete theory $T$ has an extremal model, i.e. a model which realizes only…

Logic · Mathematics 2024-01-17 Seyed-Mohammad Bagheri

A necessary and sufficient condition is provided for the solvability of a binomial congruence with a composite modulus, circumventing its prime factorization. This is a generalization of Euler's Criterion through that of Euler's Theorem,…

Number Theory · Mathematics 2015-07-02 József Vass

Tunnel Geometry and Proliferation Logic were developed as independent attempts to describe structure without assuming an underlying continuum of points. Although their languages differ, both frameworks encode the same underlying idea: that…

Category Theory · Mathematics 2026-01-06 Dmytro Sukhov

This paper gives a uniform-theoretic refinement of classical homotopy theory. Both cubical sets (with connections) and uniform spaces admit classes of weak equivalences, special cases of classical weak equivalences, appropriate for the…

Algebraic Topology · Mathematics 2021-09-20 Sanjeevi Krishnan , Crichton Ogle

We give a characterizations of Ramsey ultrafilters on $\mathscr P(\omega)$ in terms of functions $f:\omega^n\to\omega$ and their ultrafilter extensions. To do this, we prove that for any partition $\mathcal P$ of $[\omega]^n$ there is a…

Logic · Mathematics 2022-03-25 N. L. Polyakov

Submodular extensions of an energy function can be used to efficiently compute approximate marginals via variational inference. The accuracy of the marginals depends crucially on the quality of the submodular extension. To identify the best…

Machine Learning · Computer Science 2018-01-22 Pankaj Pansari , Chris Russell , M. Pawan Kumar

Let k be a commutative ring with unit. We endow the categories of filtered complexes and of bicomplexes of k-modules, with cofibrantly generated model structures, where the class of weak equivalences is given by those morphisms inducing a…

Algebraic Topology · Mathematics 2020-12-09 Joana Cirici , Daniela Egas Santander , Muriel Livernet , Sarah Whitehouse

In the literature, two powerful temporal logic formalisms have been proposed for expressing information flow security requirements, that in general, go beyond regular properties. One is classic, based on the knowledge modalities of…

Logic in Computer Science · Computer Science 2014-09-10 Laura Bozzelli , Bastien Maubert , Sophie Pinchinat

This paper introduces a reformulation of the classical convergence theorem for spectral sequences of filtered complexes which provides an algorithm to effectively compute the induced filtration on the total (co)homology, as soon as the…

K-Theory and Homology · Mathematics 2009-04-30 Mohamed Barakat

Predictive models are being increasingly used to support consequential decision making at the individual level in contexts such as pretrial bail and loan approval. As a result, there is increasing social and legal pressure to provide…

Machine Learning · Computer Science 2020-03-02 Amir-Hossein Karimi , Gilles Barthe , Borja Balle , Isabel Valera

For any ordinal \Lambda, we can define a polymodal logic GLP(\Lambda), with a modality [\xi] for each \xi<\Lambda. These represent provability predicates of increasing strength. Although GLP(\Lambda) has no Kripke models, Ignatiev showed…

Logic · Mathematics 2012-04-24 David Fernández-Duque , Joost J. Joosten

The aim of this paper is to give mathematical account of an argument of David Lewis in Parts of Classes in defense of universalism in mereology. Specifically we study how to extend models of Core Mereology (following Achille Varzi's…

Logic · Mathematics 2024-10-04 Imanol Mozo Carollo

Let ML(U^+) denote the fragment of modal logic extended with the universal modality in which the universal modality occurs only positively. We characterize the relative definability of ML(U^+) relative to finite transitive frames in the…

Logic · Mathematics 2018-02-23 Katsuhiko Sano , Jonni Virtema

We present a new method, the Subdivision Construction, for proving the finite model property (the fmp) for broad classes of modal logics and modal rule systems. The construction builds on the framework of stable canonical rules, and…

Logic · Mathematics 2026-05-13 Tenyo Takahashi

Treatises about General Topology that emphasize the notion of uniformity and uniform space find, of course, no difficulty in defining the notion of a complete uniform space and in constructing the completion of a metric space, via its…

General Topology · Mathematics 2013-10-22 Eliahu Levy

We give a type system in which the universe of types is closed by reflection into it of the logical relation defined externally by induction on the structure of types. This contribution is placed in the context of the search for a natural,…

Logic in Computer Science · Computer Science 2015-02-23 Andrew Polonsky