Results for 'Stationary sets'

995 found
Order:
  1.  29
    Reflecting stationary sets and successors of singular cardinals.Saharon Shelah - 1991 - Archive for Mathematical Logic 31 (1):25-53.
    REF is the statement that every stationary subset of a cardinal reflects, unless it fails to do so for a trivial reason. The main theorem, presented in Sect. 0, is that under suitable assumptions it is consistent that REF and there is a κ which is κ+n -supercompact. The main concepts defined in Sect. 1 are PT, which is a certain statement about the existence of transversals, and the “bad” stationary set. It is shown that supercompactness (and even (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   41 citations  
  2.  39
    Splitting stationary sets in.Toshimichi Usuba - 2012 - Journal of Symbolic Logic 77 (1):49-62.
    Let A be a non-empty set. A set $S\subseteq \mathcal{P}(A)$ is said to be stationary in $\mathcal{P}(A)$ if for every f: [A] <ω → A there exists x ∈ S such that x ≠ A and f"[x] <ω ⊆ x. In this paper we prove the following: For an uncountable cardinal λ and a stationary set S in \mathcal{P}(\lambda) , if there is a regular uncountable cardinal κ ≤ λ such that {x ∈ S: x ⋂ κ ∈ (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  3.  62
    Reflecting stationary sets.Menachem Magidor - 1982 - Journal of Symbolic Logic 47 (4):755-771.
    We prove that the statement "For every pair A, B, stationary subsets of ω 2 , composed of points of cofinality ω, there exists an ordinal α such that both A ∩ α and $B \bigcap \alpha$ are stationary subsets of α" is equiconsistent with the existence of weakly compact cardinal. (This completes results of Baumgartner and Harrington and Shelah.) We also prove, assuming the existence of infinitely many supercompact cardinals, the statement "Every stationary subset of ω (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   33 citations  
  4.  14
    Splitting stationary sets from weak forms of Choice.Paul Larson & Saharon Shelah - 2009 - Mathematical Logic Quarterly 55 (3):299-306.
    Working in the context of restricted forms of the Axiom of Choice, we consider the problem of splitting the ordinals below λ of cofinality θ into λ many stationary sets, where θ < λ are regular cardinals. This is a continuation of [4].
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  5.  28
    The stationary set splitting game.Paul B. Larson & Saharon Shelah - 2008 - Mathematical Logic Quarterly 54 (2):187-193.
    The stationary set splitting game is a game of perfect information of length ω1 between two players, unsplit and split, in which unsplit chooses stationarily many countable ordinals and split tries to continuously divide them into two stationary pieces. We show that it is possible in ZFC to force a winning strategy for either player, or for neither. This gives a new counterexample to Σ22 maximality with a predicate for the nonstationary ideal on ω1, and an example of (...)
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  6.  14
    Stationary sets added when forcing squares.Maxwell Levine - 2018 - Archive for Mathematical Logic 57 (7-8):909-916.
    Current research in set theory raises the possibility that \ can be made compatible with some stationary reflection, depending on the parameter \. The purpose of this paper is to demonstrate the difficulty in such results. We prove that the poset \\), which adds a \-sequence by initial segments, will also add non-reflecting stationary sets concentrating in any given cofinality below \. We also investigate the CMB poset, which adds \ in a slightly different way. We prove (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  7.  63
    Stationary sets and infinitary logic.Saharon Shelah & Jouko Väänänen - 2000 - Journal of Symbolic Logic 65 (3):1311-1320.
    Let K 0 λ be the class of structures $\langle\lambda, , where $A \subseteq \lambda$ is disjoint from a club, and let K 1 λ be the class of structures $\langle\lambda, , where $A \subseteq \lambda$ contains a club. We prove that if $\lambda = \lambda^{ is regular, then no sentence of L λ+κ separates K 0 λ and K 1 λ . On the other hand, we prove that if $\lambda = \mu^+,\mu = \mu^{ , and a forcing axiom (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  8. Stationary Sets and Infinitary Logic.Saharon Shelah & Jouko Vaananen - 2000 - Journal of Symbolic Logic 65 (3):1311-1320.
    Let K$^0_\lambda$ be the class of structures $\langle\lambda,<, A\rangle$, where $A \subseteq \lambda$ is disjoint from a club, and let K$^1_\lambda$ be the class of structures $\langle\lambda,<,A\rangle$, where $A \subseteq \lambda$ contains a club. We prove that if $\lambda = \lambda^{<\kappa}$ is regular, then no sentence of L$_{\lambda+\kappa}$ separates K$^0_\lambda$ and K$^1_\lambda$. On the other hand, we prove that if $\lambda = \mu^+,\mu = \mu^{<\mu}$, and a forcing axiom holds, then there is a sentence of L$_{\lambda\lambda}$ which separates K$^0_\lambda$ and (...)
     
    Export citation  
     
    Bookmark   1 citation  
  9.  9
    Forcing axioms, approachability, and stationary set reflection.Sean D. Cox - 2021 - Journal of Symbolic Logic 86 (2):499-530.
    We prove a variety of theorems about stationary set reflection and concepts related to internal approachability. We prove that an implication of Fuchino–Usuba relating stationary reflection to a version of Strong Chang’s Conjecture cannot be reversed; strengthen and simplify some results of Krueger about forcing axioms and approachability; and prove that some other related results of Krueger are sharp. We also adapt some ideas of Woodin to simplify and unify many arguments in the literature involving preservation of forcing (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  10.  46
    Ladder Gaps over Stationary Sets.Uri Abraham & Saharon Shelah - 2004 - Journal of Symbolic Logic 69 (2):518 - 532.
    For a stationary set $S \subseteq \omega_{1}$ and a ladder system C over S, a new type of gaps called C-Hausdorff is introduced and investigated. We describe a forcing model of ZFC in which, for some stationary set S, for every ladder C over S, every gap contains a subgap that is C-Hausdorff. But for every ladder E over \omega_{1} \ S$ there exists a gap with no subgap that is E-Hausdorff. A new type of chain condition, called (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  11. Full reflection of stationary sets below ℵω.Thomas Jech & Saharon Shelah - 1990 - Journal of Symbolic Logic 55 (2):822 - 830.
    It is consistent that, for every n ≥ 2, every stationary subset of ω n consisting of ordinals of cofinality ω k, where k = 0 or k ≤ n - 3, reflects fully in the set of ordinals of cofinality ω n - 1. We also show that this result is best possible.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  12.  34
    On partitions into stationary sets.Karel Prikry & Robert M. Solovay - 1975 - Journal of Symbolic Logic 40 (1):75-80.
  13.  35
    Strong Compactness and Stationary Sets.John Krueger - 2005 - Journal of Symbolic Logic 70 (3):767 - 777.
    We construct a model in which there is a strongly compact cardinal κ such that the set $S(\kappa,\kappa ^{+})=\{a\in P_{\kappa}\kappa ^{-}\colon o,t(a)=(a\cap \kappa)^{+}\})$ is non-stationary.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  14.  22
    Reflection of stationary sets and the tree property at the successor of a singular cardinal.Laura Fontanella & Menachem Magidor - 2017 - Journal of Symbolic Logic 82 (1):272-291.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  15.  13
    Full Reflection of Stationary Sets Below $aleph_omega$.Thomas Jech & Saharon Shelah - 1990 - Journal of Symbolic Logic 55 (2):822-830.
    It is consistent that, for every $n \geq 2$, every stationary subset of $\omega_n$ consisting of ordinals of cofinality $\omega_k$, where $k = 0$ or $k \leq n - 3$, reflects fully in the set of ordinals of cofinality $\omega_{n - 1}$. We also show that this result is best possible.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  16.  51
    Possible behaviours of the reflection ordering of stationary sets.Jiří Witzany - 1995 - Journal of Symbolic Logic 60 (2):534-547.
    If S, T are stationary subsets of a regular uncountable cardinal κ, we say that S reflects fully in $T, S , if for almost all α ∈ T (except a nonstationary set) S ∩ α is stationary in α. This relation is known to be a well-founded partial ordering. We say that a given poset P is realized by the reflection ordering if there is a maximal antichain $\langle X_p; p \in P\rangle$ of stationary subsets of (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark  
  17.  16
    Two Upper Bounds on Consistency Strength of $negsquare{aleph_{omega}}$ and Stationary Set Reflection at Two Successive $aleph{n}$.Martin Zeman - 2017 - Notre Dame Journal of Formal Logic 58 (3):409-432.
    We give modest upper bounds for consistency strengths for two well-studied combinatorial principles. These bounds range at the level of subcompact cardinals, which is significantly below a κ+-supercompact cardinal. All previously known upper bounds on these principles ranged at the level of some degree of supercompactness. We show that by using any of the standard modified Prikry forcings it is possible to turn a measurable subcompact cardinal into ℵω and make the principle □ℵω,<ω fail in the generic extension. We also (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  18.  17
    Covering theorems for the core model, and an application to stationary set reflection.Sean Cox - 2010 - Annals of Pure and Applied Logic 161 (1):66-93.
    We prove covering theorems for K, where K is the core model below the sharp for a strong cardinal, and give an application to stationary set reflection.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  19.  32
    Increasing u 2 by a stationary set preserving forcing.Benjamin Claverie & Ralf Schindler - 2009 - Journal of Symbolic Logic 74 (1):187-200.
    We show that if I is a precipitous ideal on ω₁ and if θ > ω₁ is a regular cardinal, then there is a forcing P = P(I, θ) which preserves the stationarity of all I-positive sets such that in $V^P $ , is a generic iterate of a countable structure . This shows that if the nonstationary ideal on ω₁ is precipitous and $H_\theta ^\# $ exists, then there is a stationary set preserving forcing which increases $\delta (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  20.  21
    Rado's Conjecture implies that all stationary set preserving forcings are semiproper.Philipp Doebler - 2013 - Journal of Mathematical Logic 13 (1):1350001.
    Todorčević showed that Rado's Conjecture implies CC*, a strengthening of Chang's Conjecture. We generalize this by showing that also CC**, a global version of CC*, follows from RC. As a corollary we obtain that RC implies Semistationary Reflection and, i.e. the statement that all forcings that preserve the stationarity of subsets of ω1 are semiproper.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  21.  24
    Stationary Cardinals.Wenzhi Sun - 1993 - Archive for Mathematical Logic 32 (6):429-442.
    This paper will define a new cardinal called aStationary Cardinal. We will show that every weakly∏ 1 1 -indescribable cardinal is a stationary cardinal, every stationary cardinal is a greatly Mahlo cardinal and every stationary set of a stationary cardinal reflects. On the other hand, the existence of such a cardinal is independent of that of a∏ 1 1 -indescribable cardinal and the existence of a cardinal such that every stationary set reflects is also independent (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  22.  41
    Simultaneous stationary reflection and square sequences.Yair Hayut & Chris Lambie-Hanson - 2017 - Journal of Mathematical Logic 17 (2):1750010.
    We investigate the relationship between weak square principles and simultaneous reflection of stationary sets.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  23.  32
    κ-Stationary Subsets of Pκ+Λ, Infinitary Games, and Distributive Laws in Boolean Algebras.Natasha Dobrinen - 2008 - Journal of Symbolic Logic 73 (1):238 - 260.
    We characterize the (κ, Λ, < μ)-distributive law in Boolean algebras in terms of cut and choose games $\scr{G}_{<\mu}^{\kappa}(\lambda)$ , when μ ≤ κ ≤ Λ and κ<κ = κ. This builds on previous work to yield game-theoretic characterizations of distributive laws for almost all triples of cardinals κ, Λ, μ with μ ≤ Λ, under GCH. In the case when μ ≤ κ ≤ Λ and κ<κ = κ, we show that it is necessary to consider whether the κ-stationarity (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  24.  38
    Dense non-reflection for stationary collections of countable sets.David Asperó, John Krueger & Yasuo Yoshinobu - 2010 - Annals of Pure and Applied Logic 161 (1):94-108.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  25.  40
    Indestructibility and stationary reflection.Arthur W. Apter - 2009 - Mathematical Logic Quarterly 55 (3):228-236.
    If κ < λ are such that κ is a strong cardinal whose strongness is indestructible under κ -strategically closed forcing and λ is weakly compact, then we show thatA = {δ < κ | δ is a non-weakly compact Mahlo cardinal which reflects stationary sets}must be unbounded in κ. This phenomenon, however, need not occur in a universe with relatively few large cardinals. In particular, we show how to construct a model where no cardinal is supercompact up (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  26.  52
    Destructibility of stationary subsets of Pκλ.Sakaé Fuchino & Greg Piper - 2005 - Mathematical Logic Quarterly 51 (6):560-569.
    For a regular cardinal κ with κ<κ = κ and κ ≤ λ , we construct generically a subset S of {x ∈ Pκλ : x ∩ κ is a singular ordinal} such that S is stationary in a strong sense but the stationarity of S can be destroyed by a κ+-c. c. forcing ℙ* which does not add any new element of Pκλ . Actually ℙ* can be chosen so that ℙ* is κ-strategically closed. However we show that (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  27.  49
    On splitting stationary subsets of large cardinals.James E. Baumgartner, Alan D. Taylor & Stanley Wagon - 1977 - Journal of Symbolic Logic 42 (2):203-214.
    Let κ denote a regular uncountable cardinal and NS the normal ideal of nonstationary subsets of κ. Our results concern the well-known open question whether NS fails to be κ + -saturated, i.e., are there κ + stationary subsets of κ with pairwise intersections nonstationary? Our first observation is: Theorem. NS is κ + -saturated iff for every normal ideal J on κ there is a stationary set $A \subseteq \kappa$ such that $J = NS \mid A = (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   20 citations  
  28.  76
    Squares, scales and stationary reflection.James Cummings, Matthew Foreman & Menachem Magidor - 2001 - Journal of Mathematical Logic 1 (01):35-98.
    Since the work of Gödel and Cohen, which showed that Hilbert's First Problem was independent of the usual assumptions of mathematics, there have been a myriad of independence results in many areas of mathematics. These results have led to the systematic study of several combinatorial principles that have proven effective at settling many of the important independent statements. Among the most prominent of these are the principles diamond and square discovered by Jensen. Simultaneously, attempts have been made to find suitable (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   102 citations  
  29.  16
    Separating diagonal stationary reflection principles.Gunter Fuchs & Chris Lambie-Hanson - 2021 - Journal of Symbolic Logic 86 (1):262-292.
    We introduce three families of diagonal reflection principles for matrices of stationary sets of ordinals. We analyze both their relationships among themselves and their relationships with other known principles of simultaneous stationary reflection, the strong reflection principle, and the existence of square sequences.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  30.  17
    Club-guessing, stationary reflection, and coloring theorems.Todd Eisworth - 2010 - Annals of Pure and Applied Logic 161 (10):1216-1243.
    We obtain very strong coloring theorems at successors of singular cardinals from failures of certain instances of simultaneous reflection of stationary sets. In particular, the simplest of our results establishes that if μ is singular and , then there is a regular cardinal θ<μ such that any fewer than cf stationary subsets of must reflect simultaneously.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  31.  15
    Stationary and closed rainbow subsets.Shimon Garti & Jing Zhang - 2021 - Annals of Pure and Applied Logic 172 (2):102887.
    We study the structural rainbow Ramsey theory at uncountable cardinals. Compared to the usual rainbow Ramsey theory, the variation focuses on finding a rainbow subset that not only is of a certain cardinality but also satisfies certain structural constraints, such as being stationary or closed in its supremum. In the process of dealing with cardinals greater than ω1, we uncover some connections between versions of Chang's Conjectures and instances of rainbow Ramsey partition relations, addressing a question raised in [18].
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  32.  10
    Quasi-stationary social welfare functions.Susumu Cato - 2020 - Theory and Decision 89 (1):85-106.
    This paper examines collective decision-making with an infinite-time horizon setting. First, we establish a result on the collection of decisive sets: if there are at least four alternatives and Arrow’s axioms are satisfied on the selfish domain, then the collection of decisive sets forms an ultrafilter. Second, we impose generalized versions of stationarity axiom for social preferences, which are substantially weaker than the standard version. We show that if any of our generalized versions are satisfied in addition to (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  33.  17
    Suslin's hypothesis does not imply stationary antichains.Chaz Schlindwein - 1993 - Annals of Pure and Applied Logic 64 (2):153-167.
    Schlindwein, C., Suslin's hypothesis does not imply stationary antichains, Annals of Pure and Applied Logic 64 153–167. Shelah has shown that Suslin's hypothesis does not imply every Aronszajn tree is special. We improve this result by constructing a model of Suslin's hypothesis in which some Aronszajn tree has no antichain whose levels constitute a stationary set. The main point is a new preservation theorem, the proof of which illustrates the usefulness of certain ideas in [8, Section 1].
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  34.  9
    Nowhere precipitousness of the non-stationary ideal over.Yo Matsubara & Saharon Shelah - 2002 - Journal of Mathematical Logic 2 (01):81-89.
    We prove that if λ is a strong limit singular cardinal and κ a regular uncountable cardinal < λ, then NSκλ, the non-stationary ideal over [Formula: see text], is nowhere precipitous. We also show that under the same hypothesis every stationary subset of [Formula: see text] can be partitioned into λκ disjoint stationary sets.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  35.  21
    Strong downward Löwenheim–Skolem theorems for stationary logics, II: reflection down to the continuum.Sakaé Fuchino, André Ottenbreit Maschio Rodrigues & Hiroshi Sakai - 2021 - Archive for Mathematical Logic 60 (3):495-523.
    Continuing, we study the Strong Downward Löwenheim–Skolem Theorems of the stationary logic and their variations. In Fuchino et al. it has been shown that the SDLS for the ordinary stationary logic with weak second-order parameters \. This SDLS is shown to be equivalent to an internal version of the Diagonal Reflection Principle down to an internally stationary set of size \. We also consider a version of the stationary logic and show that the SDLS for this (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  36.  8
    Local saturation of the non-stationary ideal over Pκλ.Toshimichi Usuba - 2007 - Annals of Pure and Applied Logic 149 (1-3):100-123.
    Starting with a λ-supercompact cardinal κ, where λ is a regular cardinal greater than or equal to κ, we produce a model with a stationary subset S of such that , the ideal generated by the non-stationary ideal over together with , is λ+-saturated. Using this model we prove the consistency of the existence of such a stationary set together with the Generalized Continuum Hypothesis . We also show that in our model we can make -saturated, where (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  37.  38
    Fat sets and saturated ideals.John Krueger - 2003 - Journal of Symbolic Logic 68 (3):837-845.
    We strengthen a theorem of Gitik and Shelah [6] by showing that if κ is either weakly inaccessible or the successor of a singular cardinal and S is a stationary subset of κ such that $NS_{\kappa} \upharpoonright S$ is saturated then $\kappa \S$ is fat. Using this theorem we derive some results about the existence of fat stationary sets. We then strengthen some results due to Baumgartner and Taylor [2], showing in particular that if I is a (...)
    Direct download (10 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  38.  62
    Forcing closed unbounded sets.Uri Abraham & Saharon Shelah - 1983 - Journal of Symbolic Logic 48 (3):643-657.
    We discuss the problem of finding forcing posets which introduce closed unbounded subsets to a given stationary set.
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   30 citations  
  39.  53
    Non‐saturation of the non‐stationary ideal on Pκ (λ) with λ of countable cofinality.Pierre Matet - 2012 - Mathematical Logic Quarterly 58 (1-2):38-45.
    Given a regular uncountable cardinal κ and a cardinal λ > κ of cofinality ω, we show that the restriction of the non-stationary ideal on Pκ to the set of all a with equation image is not λ++-saturated . We actually prove the stronger result that there is equation image with |Q| = λ++ such that A∩B is a non-cofinal subset of Pκ for any two distinct members A, B of Q, where NGκ, λ denotes the game ideal on (...)
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  40.  15
    Orders of Indescribable Sets.Alex Hellsten - 2006 - Archive for Mathematical Logic 45 (6):705-714.
    We extract some properties of Mahlo’s operation and show that some other very natural operations share these properties. The weakly compact sets form a similar hierarchy as the stationary sets. The height of this hierarchy is a large cardinal property connected to saturation properties of the weakly compact ideal.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  41.  21
    The de Broglie wave packet for a simple stationary state.L. Mackinnon - 1979 - Foundations of Physics 9 (9-10):787-791.
    A simple stationary state is set up by combining the two de Broglie waves from two particles traveling in one direction with equal and opposite velocities. By considering the waves forming this state from the point of view of all possible observers moving in the same direction, it is shown that the basic standing wave pattern does not alter, but that the particle will be confined to a small region stationary relative to this pattern. This region is similar (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  42.  23
    The Generalization of de Finetti's Representation Theorem to Stationary Probabilities.Jan von Plato - 1982 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1982:137 - 144.
    de Finetti's representation theorem of exchangeable probabilities as unique mixtures of Bernoullian probabilities is a special case of a result known as the ergodic decomposition theorem. It says that stationary probability measures are unique mixtures of ergodic measures. Stationarity implies convergence of relative frequencies, and ergodicity the uniqueness of limits. Ergodicity therefore captures exactly the idea of objective probability as a limit of relative frequency (up to a set of measure zero), without the unnecessary restriction to probabilistically independent events (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  43.  7
    Construction of Value Chain E-Commerce Model Based on Stationary Wavelet Domain Deep Residual Convolutional Neural Network.Chenyuan Wang - 2020 - Complexity 2020:1-15.
    This paper mainly analyzes the current situation of e-commerce in domestic SMEs and points out that there are limited initial investment and difficulty in financing in China’s SMEs; e-commerce control is not scientific; e-commerce personnel of SMEs are not of high quality, in the case of improper setting of the e-commerce sector and shortage of talents, rigid management model, and outdated management concepts. By using the loss function and the value chain management theory of the deep learning in the (...) wavelet domain residual learning model, the e-commerce model of SMEs is newly constructed, and the e-commerce department as the core department of the enterprise is proposed. By training the optimal parameters of the deep residual network and comparing the results with other models, the method of this paper has a good effect against the sample. The original loss function based on the residual learning model deep learning is modified to solve the original model fuzzy problem, which improves the effect and has good robustness. Finally, based on the wavelet residual depth residual evaluation method, this paper evaluates the application effect of this model and proposes relevant suggestions for improving this model, including rationalizing and perfecting the external value chain coordination mechanism, establishing the e-commerce value chain sharing center, and promoting integration of e-commerce business, strengthening measures and recommendations in various aspects of e-commerce information construction. At last, taking the business activities of a company as an example, applying the theory described in this paper to specific practice proves the feasibility and practical value of the theory. (shrink)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  44.  7
    Local weak presaturation of the strongly non‐stationary ideal.Masahiro Shioya & Naoki Yamaura - 2020 - Mathematical Logic Quarterly 66 (1):99-103.
    We give a model of set theory in which the strongly non‐stationary ideal over is weakly presaturated below some canonical set. Here μ is a regular uncountable cardinal. The model is the forcing extension with the Lévy collapse of a Woodin cardinal to the successor of μ. This improves on results of Goldring and of the first author.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  45.  11
    A Set-Theoretic Analysis of the Black Hole Entropy Puzzle.Gábor Etesi - 2023 - Foundations of Physics 54 (1):1-28.
    Motivated by the known mathematical and physical problems arising from the current mathematical formalization of the physical spatio-temporal continuum, as a substantial technical clarification of our earlier attempt (Etesi in Found Sci 25:327–340, 2020), the aim in this paper is twofold. Firstly, by interpreting Chaitin’s variant of Gödel’s first incompleteness theorem as an inherent uncertainty or fuzziness present in the set of real numbers, a set-theoretic entropy is assigned to it using the Kullback–Leibler relative entropy of a pair of Riemannian (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  46.  24
    Strongly adequate sets and adding a club with finite conditions.John Krueger - 2014 - Archive for Mathematical Logic 53 (1-2):119-136.
    We continue the study of adequate sets which we began in (Krueger in Forcing with adequate sets of models as side conditions) by introducing the idea of a strongly adequate set, which has an additional requirement on the overlap of two models past their comparison point. We present a forcing poset for adding a club to a fat stationary subset of ω 2 with finite conditions, thereby showing that a version of the forcing posets of Friedman (Set (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  47.  48
    Beyond Malthusianism: Demography and Technology in John Stuart Mill's Stationary State*: Robert Kurfirst.Robert Kurfirst - 1991 - Utilitas 3 (1):53-67.
    In his evaluation of the major social reform movements of his era, Mill chastised well-meaning reformers for their reluctance to elevate Malthusianism to a position of prominence in their efforts. He was convinced that the key to the material, mental, and moral improvement of the poor and the workers lay in a reduction of their physical numbers and in the behavioural modifications entailed by such a diminution, whereas most other reformers looked elsewhere for solutions. A favourite assumption about the proper (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  48.  9
    On the size of closed unbounded sets.James E. Baumgartner - 1991 - Annals of Pure and Applied Logic 54 (3):195-227.
    We study various aspects of the size, including the cardinality, of closed unbounded subsets of [λ]<κ, especially when λ = κ+n for n ε ω. The problem is resolved into the study of the size of certain stationary sets. Relative to the existence of an ω1-Erdös cardinal it is shown consistent that ωω3 < ωω13 and every closed unbounded subsetof [ω3]<ω2 has cardinality ωω13. A weakening of the ω1-Erdös property, ω1-remarkability, is defined and shown to be retained under (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   18 citations  
  49.  15
    On a Possibly Pure Set-Theoretic Contribution to Black Hole Entropy.Gábor Etesi - 2020 - Foundations of Science 25 (2):327-340.
    Continuity as appears to us immediately by intuition differs from its current formalization, the arithmetical continuum or equivalently the set of real numbers used in modern mathematical analysis. Motivated by the known mathematical and physical problems arising from this formalization of the continuum, our aim in this paper is twofold. Firstly, by interpreting Chaitin’s variant of Gödel’s first incompleteness theorem as an inherent uncertainty or fuzziness of the arithmetical continuum, a formal set-theoretic entropy is assigned to the arithmetical continuum. Secondly, (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  50.  26
    Forcing with adequate sets of models as side conditions.John Krueger - 2017 - Mathematical Logic Quarterly 63 (1-2):124-149.
    We present a general framework for forcing on ω2 with finite conditions using countable models as side conditions. This framework is based on a method of comparing countable models as being membership related up to a large initial segment. We give several examples of this type of forcing, including adding a function on ω2, adding a nonreflecting stationary subset of, and adding an ω1‐Kurepa tree.
    No categories
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   7 citations  
1 — 50 / 995