English
Related papers

Related papers: Preserving Dependent Choice

200 papers

In this note, we give an alternate proof of the multinomial theorem using a probabilistic approach. Although the multinomial theorem is basically a combinatorial result, our proof may be simpler for a student familiar with only basic…

General Mathematics · Mathematics 2019-07-25 K. K. Kataria

We contribute to the knowledge of the quantifier completions and their applications by using the language of doctrines. This algebraic presentation allows us to properly analyse the behaviour of the existential and universal quantifiers. We…

Category Theory · Mathematics 2021-02-03 Davide Trotta , Matteo Spadetto

Various semantics for studying the square of opposition and the hexagon of opposition have been proposed recently. We interpret sentences by imprecise (set-valued) probability assessments on a finite sequence of conditional events. We…

Probability · Mathematics 2017-10-13 Niki Pfeifer , Giuseppe Sanfilippo

Admissible rules are shown to be conservatively preserved by the meet-combination of a wide class of logics. A basis is obtained for the resulting logic from bases given for the component logics. Structural completeness and decidability of…

Logic · Mathematics 2016-12-19 Joao Rasga , Cristina Sernadas , Amilcar Sernadas

We give an elementary proof of a monotone selection principle which allows to pass from increasing nets to increasing sequences in the Hermitian part of a $\sigma$-finite von Neumann algebra. This is to be seen as a ``monotone version'' of…

Functional Analysis · Mathematics 2007-05-23 Marco Thill

A homological selection theorem for C-spaces, as well as, a finite-dimensional homological selection theorem is established. We apply the finite-dimensional homological selection theorem to obtain fixed-point theorems for usco homologically…

General Topology · Mathematics 2017-02-14 Vesko Valov

We study a conservative extension of classical propositional logic distinguishing between four modes of statement: a proposition may be affirmed or denied, and it may be strong or classical. Proofs of strong propositions must be…

Logic in Computer Science · Computer Science 2021-04-19 Pablo Barenbaum , Teodoro Freund

This paper studies trace-based equivalences for systems combining nondeterministic and probabilistic choices. We show how trace semantics for such processes can be recovered by instantiating a coalgebraic construction known as the…

Logic in Computer Science · Computer Science 2023-06-22 Filippo Bonchi , Ana Sokolova , Valeria Vignudelli

We study here preference revision, considering both the monotonic case where the original preferences are preserved and the nonmonotonic case where the new preferences may override the original ones. We use a relational framework in which…

Databases · Computer Science 2007-05-23 Jan Chomicki , Joyce Song

In the framework of explicit substitutions there is two termination properties: preservation of strong normalization (PSN), and strong normalization (SN). Since there are not easily proved, only one of them is usually established (and…

Logic in Computer Science · Computer Science 2009-10-08 Emmanuel Polonowski

Bishop's constructive mathematics school rejects the Law of Excluded Middle, but instead vastly makes use of weaker versions of the Choice. In this paper we pioneer an example, which shows that this road is not consistent, as our example…

Logic · Mathematics 2025-01-22 Babak Jabbar Nezhad

The paper proposes and motivates a conjecture on the invariance of cohomological support loci under derived equivalence. It contains a proof in the case of surfaces, and explains further developments and consequences.

Algebraic Geometry · Mathematics 2012-03-22 Mihnea Popa

We obtain sufficient conditions ensuring the topological equivalence of two perturbed difference linear systems whose linear part has a property of generalized exponential dichotomy. When the exponential dichotomy is verified, we obtain a…

Classical Analysis and ODEs · Mathematics 2015-08-31 Alvaro Castañeda , Gonzalo Robledo

We study the existence of stable matchings when agents have choice correspondences instead of preference relations. We extend the framework of \cite{chambers2017choice} by weakening the path independence assumption. For many-to-many…

Theoretical Economics · Economics 2026-05-20 Varun Bansal , Mihir Bhattacharya , Ojasvi Khare

We prove several extensions of the Erdos-Fuchs theorem.

Number Theory · Mathematics 2016-08-31 Li-Xia Dai , Hao Pan

First, we systemize ealier results the uniform persistence for discrete model $A_{n+1}=A_nF(A_{n-m})$ of population growth, where $F:(0,\infty)\to(0,\infty)$ is continuous and strictly decreasing. Second, we investigation the effect of…

General Mathematics · Mathematics 2012-06-11 Dang Vu Giang

In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constructions of objects with such properties are often very difficult, or…

Computational Complexity · Computer Science 2007-05-23 Luca Trevisan

We present an elementary combinatorial proof of the celebrated Friendship theorem. The proof involves looking at independent sets and constructing a bound on their size which forces a contradiction.

Combinatorics · Mathematics 2024-02-13 Vineeth Chintala

We prove the invariance of plurigenera under smooth projective deformations in full generality. The proof is done by several estimates of singular hermitian metrics in terms of $L^{2}$-extension theorem of holomorphic sections.

Algebraic Geometry · Mathematics 2007-05-23 Hajime Tsuji

The persistence theory has been employed by several authors in order to study persistence properties of dynamical systems generated by ordinary differential equations or maps across diverse disciplines. In this note, the author discusses a…

Dynamical Systems · Mathematics 2025-09-09 N. Pant