English
Related papers

Related papers: A road to ultrafilter extensions

200 papers

We prove a result of cohomology and base change for families of coherent systems over a curve. We use that in order to prove the existence of (non-split, non-degenerate) universal families of extensions for families of coherent systems (in…

Algebraic Geometry · Mathematics 2012-12-04 Matteo Tommasini

In a regression setup with deterministic design, we study the pure aggregation problem and introduce a natural extension from the Gaussian distribution to distributions in the exponential family. While this extension bears strong…

Machine Learning · Statistics 2012-06-06 Philippe Rigollet

Canonical formulas are a powerful tool for studying intuitionistic and modal logics. Actually, they provide a uniform and semantic way to axiomatise all extensions of intuitionistic logic and all modal logics above K4. Although the method…

Logic · Mathematics 2016-06-23 Nick Bezhanishvili , Nick Galatos , Luca Spada

We continue Gitik, Kanovei and Koepke's work and study sets in generic extensions by the Magidor forcing and by the Prikry forcing with non-normal ultrafilters.

Logic · Mathematics 2021-09-22 Tom Benhamou , Moti Gitik

Mutually Unbiased Bases (MUBs) are closely connected with quantum physics, and the structure has a rich mathematical background. We provide equivalent criteria for extending a set of MUBs for $C^n$ by studying real points of a certain…

Discrete Mathematics · Computer Science 2025-07-04 Arindam Banerjee , Kanoy Kumar Das , Ajeet Kumar , Rakesh Kumar , Subhamoy Maitra

We establish the Lyndon interpolation property for basic lattice expansion logics (LE-logics) in arbitrary signatures using display calculi. Our approach is constructive, yielding interpolants algorithmically from derivations, and modular,…

Following a review of metric, ultrametric and generalized ultrametric, we review their application in data analysis. We show how they allow us to explore both geometry and topology of information, starting with measured data. Some themes…

Logic in Computer Science · Computer Science 2010-08-24 Fionn Murtagh

In this article, we obtain quasiconformal extensions of some classes of conformal maps defined either on the unit disc or on the exterior of it onto the extended complex plane. Some of these extensions have been obtained by constructing…

Complex Variables · Mathematics 2018-09-20 Bappaditya Bhowmik , Goutam Satpati

An approach to universal (meta-)logical reasoning in classical higher-order logic is employed to explore and study simplifications of Kurt G\"odel's modal ontological argument. Some argument premises are modified, others are dropped, modal…

Logic in Computer Science · Computer Science 2020-06-16 Christoph Benzmüller

In this work, we present a supersymmetric extension of the quantum spherical model, both in components and also in the superspace formalisms. We find the solution for short/long range interactions through the imaginary time formalism path…

Statistical Mechanics · Physics 2012-06-12 Pedro R. S. Gomes , P. F. Bienzobaz , M. Gomes

Taking symmetric extensions can be considered as a generalisation of forcing, which produces a richer multiverse of models with and without the axiom of choice. We can study the structure of this multiverse using modal logic. In particular,…

Logic · Mathematics 2026-05-08 Hope Duncan

A class of models is presented, in the form of continuation monads polymorphic for first-order individuals, that is sound and complete for minimal intuitionistic predicate logic. The proofs of soundness and completeness are constructive and…

Logic · Mathematics 2014-11-04 Danko Ilik

Propositional term modal logic is interpreted over Kripke structures with unboundedly many accessibility relations and hence the syntax admits variables indexing modalities and quantification over them. This logic is undecidable, and we…

Logic in Computer Science · Computer Science 2019-01-01 Anantha Padmanabha , R Ramanujam

There is an increasing need to integrate model-agnostic explanation techniques with concept-based approaches, as the former can explain models across different architectures while the latter makes explanations more faithful and…

Machine Learning · Computer Science 2026-02-27 Junhao Liu , Haonan Yu , Xin Zhang

This paper describes a universal model for paraphrasing that transforms according to defined criteria. We showed that by using different criteria we could construct different kinds of paraphrasing systems including one for answering…

Computation and Language · Computer Science 2007-05-23 Masaki Murata , Hitoshi Isahara

This article presents modal versions of resource-conscious logics. We concentrate on extensions of variants of Linear Logic with one minimal non-normal modality. In earlier work, where we investigated agency in multi-agent systems, we have…

Logic in Computer Science · Computer Science 2015-09-07 Daniele Porello , Nicolas Troquard

An important goal in studying the relations between unitary VOAs and conformal nets is to prove the equivalence of their ribbon categories. In this article, we prove this conjecture for many familiar examples. Our main idea is to construct…

Quantum Algebra · Mathematics 2021-04-06 Bin Gui

We define separating properties for normal ultrafilters. We prove that compactness and supercompactness are separable, yet compactness and measurability are not. We describe how to use separating properties in order to elicit distinct…

Logic · Mathematics 2012-12-10 Shimon Garti

Given a small category C, we show that there is a universal way of expanding C into a model category, essentially by formally adjoining homotopy colimits. The technique of localization becomes a method for imposing `relations' into these…

Algebraic Topology · Mathematics 2007-05-23 Daniel Dugger

A new syntactic characterization of problems complete via Turing reductions is presented. General canonical forms are developed in order to define such problems. One of these forms allows us to define complete problems on ordered…

Computational Complexity · Computer Science 2014-11-25 Vladimir Naidenko