Results 11 to 20 of about 1,323,506 (183)
International Journal of Mathematics and Mathematical Sciences, 1990 It is proved in [1] & [2] that a set bounded in an inductive limit E=indlim En of Fréchet spaces is also bounded in some En iff E is fast complete. In the case of arbitrary locally convex spaces En every bounded set in a fast complete indlim En is quasi ...
Jan Kucera
doaj +3 more sources
On interpretations of bounded arithmetic and bounded set theory
Notre Dame Journal of Formal Logic, 2008 In a recent paper, Kaye and Wong proved the following result, which they considered to belong to the folklore of mathematical logic. THEOREM: The first-order theories of Peano arithmetic and ZF with the axiom of infinity negated are bi-interpretable ...
Pettigrew, Richard
core +5 more sources
International Journal of Mathematics and Mathematical Sciences, 1991 It is shown that a union of two quasi-bounded sets, as well as the closure of a quasi-bounded set, may not be quasi-bounded.
Carlos Bosch +2 more
doaj +2 more sources
Proceedings of the American Mathematical Society, 1966 Abstract : Two characterizations of bounded regular sets are given. In addition, certain bounded regular sets are related to their commutative closure. (Author)
Ginsburg, Seymour, Spanier, Edwin H.
openaire +2 more sources
A lower bound on opaque sets [PDF]
Computational Geometry, 2019 13 pages, 10 ...
Akitoshi Kawamura +3 more
openaire +5 more sources
Setting lower bounds on truthfulness [PDF]
Games and Economic Behavior, 2018 We present and discuss general techniques for proving inapproximability results for truthful mechanisms. We make use of these techniques to prove lower bounds on the approximability of several non-utilitarian multi-parameter problems. In particular, we demonstrate the strength of our techniques by exhibiting a lower bound of $2-\frac{1}{m}$ for the ...
Ahuva Mu'alem, Michael Schapira
openaire +2 more sources
Theoretical Economics, 2021 I study a class of macroeconomic models in which all firms can costlessly choose any price at each date from an interval (indexed to last period's price level) that includes a positive lower bound. I prove three results that are valid for any such half‐closed interval (regardless of how near zero the left endpoint is).
openaire +3 more sources
A generalized cut-set bound [PDF]
2009 IEEE International Symposium on Information Theory, 2009 In this paper, we generalize the well known cut-set bound to the problem of lossy transmission of functions of arbitrarily correlated sources over a discrete memoryless multiterminal network.
Amin Aminzadeh Gohari, Venkat Anantharam
openaire +2 more sources
Reconfiguration on sparse graphs [PDF]
, 2015 A vertex-subset graph problem Q defines which subsets of the vertices of an input graph are feasible solutions. A reconfiguration variant of a vertex-subset problem asks, given two feasible solutions S and T of size k, whether it is possible to transform
A Dawar +16 more
core +2 more sources
Bounding the Set of Quantum Correlations [PDF]
Physical Review Letters, 2007 We introduce a hierarchy of conditions necessarily satisfied by any distribution P(ab) representing the probabilities for two separate observers to obtain outcomes a and b when making local measurements on a shared quantum state. Each condition in this hierarchy is formulated as a semidefinite program. Our approach can be used to obtain upper-bounds on
Navascués, Miguel +2 more
openaire +5 more sources