Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "forcing" wg kryterium: Temat


Tytuł:
Goldstern–Judah–Shelah preservation theorem for countable support iterations
Autorzy:
Repický, Miroslav
Powiązania:
https://bibliotekanauki.pl/articles/1208549.pdf
Data publikacji:
1994
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
countable support iterated forcing
proper forcing
preservation theorem for iterated forcing
Opis:
[1] T. Bartoszyński, Additivity of measure implies additivity of category, Trans. Amer. Math. Soc. 281 (1984), 209-213. [2] T. Bartoszyński and H. Judah, Measure and Category, in preparation. [3] D. H. Fremlin, Cichoń's diagram, Publ. Math. Univ. Pierre Marie Curie 66, Sém. Initiation Anal., 1983/84, Exp. 5, 13 pp. [4] M. Goldstern, Tools for your forcing construction, in: Set Theory of the Reals, Conference of Bar-Ilan University, H. Judah (ed.), Israel Math. Conf. Proc. 6, 1992, 307-362. [5] H. Judah and M. Repický, No random reals in countable support iterations, preprint. [6] H. Judah and S. Shelah, The Kunen-Miller chart (Lebesgue measure, the Baire property, Laver reals and preservation theorems for forcing), J. Symbolic Logic 55 (1990), 909-927. [7] A. W. Miller, Some properties of measure and category, Trans. Amer. Math. Soc. 266 (1981), 93-114. [8] J. Pawlikowski, Why Solovay real produces Cohen real, J. Symbolic Logic 51 (1986), 957-968. [9] J. Raisonnier and J. Stern, The strength of measurability hypotheses, Israel J. Math. 50 (1985), 337-349. [10] M. Repický, Properties of measure and category in generalized Cohen's and Silver's forcing, Acta Univ. Carol. - Math. Phys. 28 (1987), 101-115. [11] S. Shelah, Proper Forcing, Springer, Berlin, 1984. [12] J. Truss, Sets having caliber $ℵ_1$, in: Logic Colloquium 76, Stud. Logic Found. Math. 87, North-Holland, 1977, 595-612.
Źródło:
Fundamenta Mathematicae; 1994, 144, 1; 55-72
0016-2736
Pojawia się w:
Fundamenta Mathematicae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On infinite partitions of lines and space
Autorzy:
Erdös, Paul
Jackson, Steve
Mauldin, R.
Powiązania:
https://bibliotekanauki.pl/articles/1205459.pdf
Data publikacji:
1997
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
transfinite recursion
Martin's Axiom
forcing
geometry
infinite partitions
Opis:
Given a partition P:L → ω of the lines in $ℝ^n$, n ≥ 2, into countably many pieces, we ask if it is possible to find a partition of the points, $Q:ℝ^n → ω$, so that each line meets at most m points of its color. Assuming Martin's Axiom, we show this is the case for m ≥ 3. We reduce the problem for m = 2 to a purely finitary geometry problem. Although we have established a very similar, but somewhat simpler, version of the geometry conjecture, we leave the general problem open. We consider also various generalizations of these results, including to higher dimension spaces and planes.
Źródło:
Fundamenta Mathematicae; 1997, 152, 1; 75-95
0016-2736
Pojawia się w:
Fundamenta Mathematicae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Almost disjoint families and property (a)
Autorzy:
Szeptycki, Paul
Vaughan, Jerry
Powiązania:
https://bibliotekanauki.pl/articles/1205285.pdf
Data publikacji:
1998
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
property (a), density
extent
almost disjoint families
Ψ-space
CH
GCH
Martin's Axiom
$\got p = \got c$
Cohen forcing
Q-set
weakly inaccessible cardinal.
Opis:
We consider the question: when does a Ψ-space satisfy property (a)? We show that if $|A| < \got p$ then the Ψ-space Ψ(A) satisfies property (a), but in some Cohen models the negation of CH holds and every uncountable Ψ-space fails to satisfy property (a). We also show that in a model of Fleissner and Miller there exists a Ψ-space of cardinality $\got p$ which has property (a). We extend a theorem of Matveev relating the existence of certain closed discrete subsets with the failure of property (a).
Źródło:
Fundamenta Mathematicae; 1998, 158, 3; 229-240
0016-2736
Pojawia się w:
Fundamenta Mathematicae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Dominating analytic families
Autorzy:
Kamburelis, Anastasis
Powiązania:
https://bibliotekanauki.pl/articles/1205372.pdf
Data publikacji:
1998
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
measure algebra
Cohen algebra
Suslin c.c.c. forcing
distributivity
Opis:
Let A be an analytic family of sequences of sets of integers. We show that either A is dominated or it contains a continuum of almost disjoint sequences. From this we obtain a theorem by Shelah that a Suslin c.c.c. forcing adds a Cohen real if it adds an unbounded real.
Źródło:
Fundamenta Mathematicae; 1998, 156, 1; 73-83
0016-2736
Pojawia się w:
Fundamenta Mathematicae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
X-minimal patterns and a generalization of Sharkovskiĭs theorem
Autorzy:
Bobok, Jozef
Kuchta, Milan
Powiązania:
https://bibliotekanauki.pl/articles/1205370.pdf
Data publikacji:
1998
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
iteration
periodic orbit
cycle
pattern
minimal
forcing relation
Sharkovskiĭ s theorem
Opis:
We study the law of coexistence of different types of cycles for a continuous map of the interval. For this we introduce the notion of eccentricity of a pattern and characterize those patterns with a given eccentricity that are simplest from the point of view of the forcing relation. We call these patterns X-minimal. We obtain a generalization of Sharkovskiĭ's Theorem where the notion of period is replaced by the notion of eccentricity.
Źródło:
Fundamenta Mathematicae; 1998, 156, 1; 33-66
0016-2736
Pojawia się w:
Fundamenta Mathematicae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Covering of the null ideal may have countable cofinality
Autorzy:
Shelah, Saharon
Powiązania:
https://bibliotekanauki.pl/articles/1204998.pdf
Data publikacji:
1999-06-17
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
null sets
cardinal invariants of the continuum
iterated forcing
ccc forcing
Opis:
We prove that it is consistent that the covering number of the ideal of measure zero sets has countable cofinality.
Źródło:
Fundamenta Mathematicae; 2000, 166, 1-2; 109-136
0016-2736
Pojawia się w:
Fundamenta Mathematicae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Local convergence of inexact Newton methods under affine invariant conditions and hypotheses on the second Fréchet derivative
Autorzy:
Argyros, Ioannis
Powiązania:
https://bibliotekanauki.pl/articles/1338691.pdf
Data publikacji:
1999
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
superlinear
Fréchet derivative
weak convergence
inexact Newton method
strong
forcing sequence
Banach space
Opis:
We use inexact Newton iterates to approximate a solution of a nonlinear equation in a Banach space. Solving a nonlinear equation using Newton iterates at each stage is very expensive in general. That is why we consider inexact Newton methods, where the Newton equations are solved only approximately, and in some unspecified manner. In earlier works [2], [3], natural assumptions under which the forcing sequences are uniformly less than one were given based on the second Fréchet derivative of the operator involved. This approach showed that the upper error bounds on the distances involved are smaller compared with the corresponding ones using hypotheses on the first Fréchet derivative. However, the conditions on the forcing sequences were not given in affine invariant form. The advantages of using conditions given in affine invariant form were explained in [3], [10]. Here we reproduce all the results obtained in [3] but using affine invariant conditions.
Źródło:
Applicationes Mathematicae; 1999, 26, 4; 457-465
1233-7234
Pojawia się w:
Applicationes Mathematicae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The forcing geodetic number of a graph
Autorzy:
Chartrand, Gary
Zhang, Ping
Powiązania:
https://bibliotekanauki.pl/articles/744241.pdf
Data publikacji:
1999
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
geodetic set
geodetic number
forcing geodetic number
Opis:
For two vertices u and v of a graph G, the set I(u, v) consists of all vertices lying on some u-v geodesic in G. If S is a set of vertices of G, then I(S) is the union of all sets I(u,v) for u, v ∈ S. A set S is a geodetic set if I(S) = V(G). A minimum geodetic set is a geodetic set of minimum cardinality and this cardinality is the geodetic number g(G). A subset T of a minimum geodetic set S is called a forcing subset for S if S is the unique minimum geodetic set containing T. The forcing geodetic number $f_G(S)$ of S is the minimum cardinality among the forcing subsets of S, and the forcing geodetic number f(G) of G is the minimum forcing geodetic number among all minimum geodetic sets of G. The forcing geodetic numbers of several classes of graphs are determined. For every graph G, f(G) ≤ g(G). It is shown that for all integers a, b with 0 ≤ a ≤ b, a connected graph G such that f(G) = a and g(G) = b exists if and only if (a,b) ∉ {(1,1),(2,2)}.
Źródło:
Discussiones Mathematicae Graph Theory; 1999, 19, 1; 45-58
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Embedding Cohen algebras using pcf theory
Autorzy:
Shelah, Saharon
Powiązania:
https://bibliotekanauki.pl/articles/1204996.pdf
Data publikacji:
2000
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
set theory
pcf
forcing
Opis:
Using a theorem from pcf theory, we show that for any singular cardinal ν, the product of the Cohen forcing notions on κ, κ < ν, adds a generic for the Cohen forcing notion on $ν^+$.
Źródło:
Fundamenta Mathematicae; 2000, 166, 1-2; 83-86
0016-2736
Pojawia się w:
Fundamenta Mathematicae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On a problem of Steve Kalikow
Autorzy:
Shelah, Saharon
Powiązania:
https://bibliotekanauki.pl/articles/1205000.pdf
Data publikacji:
2000
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
set theory
forcing
continuity
Kalikow
free subset
Opis:
The Kalikow problem for a pair (λ,κ) of cardinal numbers,λ > κ (in particular κ = 2) is whether we can map the family of ω-sequences from λ to the family of ω-sequences from κ in a very continuous manner. Namely, we demand that for η,ν ∈ ω we have: η, ν are almost equal if and only if their images are. We show consistency of the negative answer, e.g., for $ℵ_ω$ but we prove it for smaller cardinals. We indicate a close connection with the free subset property and its variants.
Źródło:
Fundamenta Mathematicae; 2000, 166, 1-2; 137-151
0016-2736
Pojawia się w:
Fundamenta Mathematicae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On what I do not understand (and have something to say): Part I
Autorzy:
Shelah, Saharon
Powiązania:
https://bibliotekanauki.pl/articles/1204995.pdf
Data publikacji:
2000
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
set theory
cardinal arithmetic
pcf theory
forcing
iterated forcing
large continuum
nep
nicely definable forcing
combinatorial set theory
Boolean algebras
set-theoretic algebra
partition calculus
Ramsey theory
Opis:
This is a non-standard paper, containing some problems in set theory I have in various degrees been interested in. Sometimes with a discussion on what I have to say; sometimes, of what makes them interesting to me, sometimes the problems are presented with a discussion of how I have tried to solve them, and sometimes with failed tries, anecdotes and opinions. So the discussion is quite personal, in other words, egocentric and somewhat accidental. As we discuss many problems, history and side references are erratic, usually kept to a minimum ("see ..." means: see the references there and possibly the paper itself). The base were lectures in Rutgers, Fall '97, and reflect my knowledge then. The other half, [122], concentrating on model theory, will subsequently appear. I thank Andreas Blass and Andrzej Rosłanowski for many helpful comments.
Źródło:
Fundamenta Mathematicae; 2000, 166, 1-2; 1-82
0016-2736
Pojawia się w:
Fundamenta Mathematicae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
HIROMB, an operational eddy-resolving model for the Baltic Sea
Autorzy:
Funkquist, L.
Powiązania:
https://bibliotekanauki.pl/articles/972865.pdf
Data publikacji:
2001
Wydawca:
Instytut Morski w Gdańsku
Tematy:
HIROMB
forcing
Opis:
HIROMB is a 3-dimensional baroclinic model of the North Sea and the Baltic Sea, designed for daily operational use. The model is mainly developed by Eckhard Kleine at the German Federal Maritime and Hydrographic Agency (BSH) in Hamburg, Germany, and is based on a similar model, running in operational mode at that institution. The operational forecasts at SMHI starled already in 1995 with a daily 24-hour forecast and were later extended to 48 hours. The model is forced by SMHI's operational atmospheric model (HIRLAM), but also by river runoff from an operational hydrological model and wave radiation stress from a wind wave model. The present version of the model is set up on a nested grid, where a 12 nautical mile (nm) grid covers the whole area, while Skagerrak, Kattegat, the Belt Sea and the Baltic Sea are covered with a 1 nm grid. A parallelized version of the model has been developed and runs on a distributed memory parallel computer.
Źródło:
Biuletyn Instytutu Morskiego w Gdańsku; 2001, 28, 2; 7-16
1230-7424
2450-5536
Pojawia się w:
Biuletyn Instytutu Morskiego w Gdańsku
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
HIROMB, an operational eddy-resolving model for the Baltic Sea
Autorzy:
Funkquist, L.
Powiązania:
https://bibliotekanauki.pl/articles/1920629.pdf
Data publikacji:
2001
Wydawca:
Instytut Morski w Gdańsku
Tematy:
HIROMB
forcing
Opis:
HIROMB is a 3-dimensional baroclinic model of the North Sea and the Baltic Sea, designed for daily operational use. The model is mainly developed by Eckhard Kleine at the German Federal Maritime and Hydrographic Agency (BSH) in Hamburg, Germany, and is based on a similar model, running in operational mode at that institution. The operational forecasts at SMHI starled already in 1995 with a daily 24-hour forecast and were later extended to 48 hours. The model is forced by SMHI's operational atmospheric model (HIRLAM), but also by river runoff from an operational hydrological model and wave radiation stress from a wind wave model. The present version of the model is set up on a nested grid, where a 12 nautical mile (nm) grid covers the whole area, while Skagerrak, Kattegat, the Belt Sea and the Baltic Sea are covered with a 1 nm grid. A parallelized version of the model has been developed and runs on a distributed memory parallel computer.
Źródło:
Biuletyn Instytutu Morskiego w Gdańsku; 2001, 28, 2; 7-16
1230-7424
2450-5536
Pojawia się w:
Biuletyn Instytutu Morskiego w Gdańsku
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
PFS scheme for forcing better service in best effort IP network
Autorzy:
Fudała, M.
Burakowski, W.
Powiązania:
https://bibliotekanauki.pl/articles/308195.pdf
Data publikacji:
2004
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
IP-based network
better than best effort service
priority forcing scheme
Opis:
The paper presents recent results corresponding to a new strategy for source traffic generating, named priority forcing scheme (PFS), allowing Internet users for getting better than best effort service in IP network. The concept of PFS assumes that an application, called PFS application, sends to the network a volume of additional traffic for the purpose of making the reservations for the data traffic in the overloaded router queues along the packet path in the IP network. The emitted redundant packets, named R-packets, should be rather of small size comparing to the data packets, named D-packets. The PFS scheme assumes that the R-packets waiting in a queue can be replaced by the arriving D-packets and belonging to the same flow. In this way, the D-packets can experience a prioritised service comparing to the packets produced by a non-PFS application. Notice that the proposed solution does not require any quality of service (QoS) mechanisms implemented in the network, like scheduler, dropping, marking etc., except R- and D-packets identification and replacing. We discuss the PFS efficiency for forcing priority in the overloaded conditions. Moreover simple system analysis is also presented. Finally, the profits of using PFS scheme are illustrated by examples corresponding to FTP (TCP controlled traffic) and VoIP (UDP streaming traffic) applications.
Źródło:
Journal of Telecommunications and Information Technology; 2004, 2; 23-28
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Wpływ barwy światła na jakość tulipanów pędzonych metodą plus 5 stopni C
Effect of light colour on the quality of tulips forcing by plus 5 degrees Celsius method
Autorzy:
Woźny, A.
Jerzy, M.
Powiązania:
https://bibliotekanauki.pl/articles/11364464.pdf
Data publikacji:
2004
Wydawca:
Uniwersytet Przyrodniczy w Lublinie. Wydawnictwo Uniwersytetu Przyrodniczego w Lublinie
Tematy:
swiatlo sztuczne
cebulki kwiatowe
tulipany
barwa swiatla
rosliny ozdobne
pedzenie roslin
artificial light
flower bulb
light colour
plant forcing
tulip
ornamental plant
Opis:
Cebule czterech odmian tulipanów pędzono przy sztucznym świetle, pod lampami jarzeniowymi typu TLD emitującymi światło białe, niebieskie, czerwone, żółte i zielone. Natężenie napromienienia kwantowego wynosiło 12,5 i 25 μmol·m⁻²·s⁻¹. Długość dnia odpowiednio 6 i 12 godzin. Istotny wpływ na jakość tulipanów zaobserwowano przy wysokim natężeniu napromienienia kwantowego i długim dniu. Tulipany pędzone przy świetle czerwonym miały najdłuęsze pędy, o największej masie i najbardziej okazałych kwiatach. Światło niebieskie wpłynęło na poprawę sztywności łodyg i liści.
Four cultivars of tulips were forced in artificial light using fluorescent lamps TLD types, which emitted white, blue, red, yellow and green light. Quantum irradiance was determined on 12.5 and 25 μmol·m⁻²·s⁻¹. Daylength was 6 and 12-hour respectively. Significant influence on the quality of tulips was observed under high quantum irradiance and long day. Tulips forced under red light have the highest shoots, the greatest weight and flowers. The blue light improved stems and leaves rigidity.
Źródło:
Acta Scientiarum Polonorum. Hortorum Cultus; 2004, 03, 2; 3-11
1644-0692
Pojawia się w:
Acta Scientiarum Polonorum. Hortorum Cultus
Dostawca treści:
Biblioteka Nauki
Artykuł

Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies