English
Related papers

Related papers: Some Brouwerian Counterexamples Regarding Nominal …

200 papers

In order to build the collection of Cauchy reals as a set in constructive set theory, the only Power Set-like principle needed is Exponentiation. In contrast, the proof that the Dedekind reals form a set has seemed to require more than…

Logic · Mathematics 2015-10-05 Robert Lubarsky , Michael Rathjen

It is known that, in finite dimensions, the support function of a compact convex set with non empty interior is differentiable excepting the origin if and only if the set is strictly convex. In this paper we realize a thorough study of the…

Functional Analysis · Mathematics 2013-01-07 C. Zalinescu

In this short note we give and discuss a general multilinear expression of the structure function of an arbitrary semicoherent system in terms of its minimal path and cut sets. We also examine the link between the number of minimal path and…

Applications · Statistics 2016-06-22 Jean-Luc Marichal

This paper deals with existence of a nontrivial positive solution to systems of equations involving nontrivial nonhomogeneous terms and critical or subcritical nonlinearities. Via a minimization argument we prove existence of a positive…

Analysis of PDEs · Mathematics 2020-03-09 Mousomi Bhakta , Souptik Chakraborty , Patrizia Pucci

We define and characterise small support for complexes over non-Noetherian rings and in this context prove a vanishing theorem for modules. Our definition of support makes sense for any rigidly compactly generated tensor triangulated…

Commutative Algebra · Mathematics 2017-10-30 William T. Sanders

In the setting of constructive pointfree topology, we introduce a notion of continuous operation between pointfree topologies and the corresponding principle of pointfree continuity. An operation between points of pointfree topologies is…

Logic in Computer Science · Computer Science 2023-06-22 Tatsuji Kawai , Giovanni Sambin

We say a subset $C$ of an abelian group $G$ \textit{arises as a minimal additive complement} if there is some other subset $W$ of $G$ such that $C+W=\{c+w:c\in C,\ w\in W\}=G$ and such that there is no proper subset $C'\supset C$ such that…

Combinatorics · Mathematics 2020-10-26 Fan Zhou

We address a recent proposal concerning 'surplus structure' due to Nguyen et al. ['Why Surplus Structure is Not Superfluous.' Br. J. Phi. Sci. Forthcoming.] We argue that the sense of 'surplus structure' captured by their formal criterion…

History and Philosophy of Physics · Physics 2020-03-18 Clara Bradley , James Owen Weatherall

We consider the question of the existence of variables with few occurrences in boolean conjunctive normal forms (clause-sets). Let mvd(F) for a clause-set F denote the minimal variable-degree, the minimum of the number of occurrences of…

Discrete Mathematics · Computer Science 2014-06-24 Oliver Kullmann , Xishun Zhao

We show that an analogue of the Hilbert's Thirteenth Problem fails in the real subanalytic setting.Namely we prove that, for any integer $n$, the o-minimal structure generated by restricted analytic functions in $n$ variables is strictly…

Logic · Mathematics 2013-03-20 Serge Randriambololona

Let $(R,\m)$ be a Noetherian local ring and $M$ a finitely generated $R$-module with $\dim M=d.$ Let $i\geq 0$ be an integer. Following M. Brodmann and R. Y. Sharp \cite{BS1}, the $i$-th pseudo support of $M$ is the set of all prime ideals…

Commutative Algebra · Mathematics 2010-03-23 Nguyen Tu Cuong , Le Thanh Nhan , Nguyen Thi Kieu Nga

Modern data systems increasingly operate under conditions of persistent legal, political, and analytic disagreement. In such settings, interoperability cannot rely on shared interpretation, negotiated semantics, or centralized authority.…

Logic in Computer Science · Computer Science 2026-01-23 Denise M. Case

We prove that Tietze Extension does not always exist in constructive mathematics if closed sets on which the function we are extending are defined as sequentially closed sets. Firstly, we take a discrete metric space as our topological…

General Topology · Mathematics 2025-08-19 Shun Ding , Yang Wan , Luofei Wang , Siqi Xiao

We propose a notion of a generalized order, which can be used for the notion of a strict partial order. We introduce a weak order to replace the usual weak order defined from a strict partial order. In a constructive setting, that usual…

Logic · Mathematics 2019-07-29 Jean S. Joseph

Let $S$ be a finite set, $s=|S|\ge6$. Given a non-negative integer $t$, there exists an inclusion-minimal non-Bondy system $\mathscr{A}$ of size $t$ on $S$ if and only if $s+1\le t\le2s$.

Combinatorics · Mathematics 2026-03-02 T. J. Kepka , P. C. Nemec , J. D. Phillips

Minimizers in the least gradient problem with discontinuous boundary data need not be unique. However, all of them have a similar structure of level sets. Here, we give a full characterization of the set of minimizers in terms of any one of…

Analysis of PDEs · Mathematics 2017-09-08 Wojciech Górny

This paper studies and bounds the effects of approximating loss functions and credal sets on choice functions, under very weak assumptions. In particular, the credal set is assumed to be neither convex nor closed. The main result is that…

Computation · Statistics 2012-03-06 Matthias C. M. Troffaes

In this paper, we investigate optimization problems with nonnegative and orthogonal constraints, where any feasible matrix of size $n \times p$ exhibits a sparsity pattern such that each row accommodates at most one nonzero entry. Our…

Optimization and Control · Mathematics 2025-11-06 Lei Wang , Xin Liu , Xiaojun Chen

In this article I investigate the phenomenon of minimum models of second-order set theories, focusing on Kelley--Morse set theory $\mathsf{KM}$, G\"odel--Bernays set theory $\mathsf{GB}$, and $\mathsf{GB}$ augmented with the principle of…

Logic · Mathematics 2019-09-06 Kameryn J Williams

Recursive relational specifications are commonly used to describe the computational structure of formal systems. Recent research in proof theory has identified two features that facilitate direct, logic-based reasoning about such…

Logic in Computer Science · Computer Science 2010-09-24 Andrew Gacek , Dale Miller , Gopalan Nadathur