Characterizations of pretameness and the Ord-cc

It is well known that pretameness implies the forcing theorem, and that pretameness is characterized by the preservation of the axioms of ${\mathsf{ZF}}^{?}$, that is $\mathsf{ZF}$ without the power set axiom, or equivalently, by the preservation of the axiom scheme of replacement, for class forcing over models of $\mathsf{ZF}$. We show that pretameness in fact has various other characterizations, for instance in terms of the forcing theorem, the preservation of the axiom scheme of separation, the forcing equivalence of partial orders and their dense suborders, and the existence of nice names for sets of ordinals. These results show that pretameness is a strong dividing line between well and badly behaved notions of class forcing, and that it is exactly the right notion to consider in applications of class forcing. Furthermore, for most properties under consideration, we also present a corresponding characterization of the Ord-chain condition.     

Four and more

We isolate several large classes of definable proper forcings and show how they include many partial orderings used in practice.     

Flow structure of wake behind a rotationally oscillating circular cylinder

Flow around a circular cylinder oscillating rotationally with a relatively high forcing frequency has been investigated experimentally. The dominant parameters affecting this experiment are the Reynolds number (Re), oscillation amplitude (θ_A), and frequency ratio F_R=f_f/f_n, where f_f is the forcing frequency and f_n is the natural frequency of vortex shedding. Experiments were carried out under conditions of Re=4.14×10³, 0°θ_A60° and 0.0F_R2.0. Rotational oscillation of the cylinder significantly modified the flow structure in the near-wake. Depending on the frequency ratio F_R, the cylinder wake showed five different flow regimes, each with a distinct wake structure. The vortex formation length and the vortex shedding frequency were greatly changed before and after the lock-on regime where vortices shed at the same frequency as the forcing frequency. The lock-on phenomenon always occurred at F_R=1.0 and the frequency range of the lock-on regime expanded with increasing oscillation amplitude θ_A. In addition, the drag coefficient was reduced when the frequency ratio F_R was less than 1.0 (F_R<1.0) while fixing the oscillation amplitude at θ_A=30°. When the oscillation amplitude θ_A was used as a control parameter at a fixed frequency ratio F_R=1.0 (lock-on regime), the drag reduction effect was observed at all oscillation amplitudes except for the case of θ_A=30°. This type of active flow control method can be used effectively in aerodynamic applications while optimizing the forcing parameters.     

Intrinsically Hyperarithmetical Sets

The main result proved in the paper is that on every recursive structure the intrinsically hyperarithmetical sets coincide with the relatively intrinsically hyperarithmetical sets. As a side effect of the proof an effective version of the Kueker's theorem on definability by means of infinitary formulas is obtained. Mathematics Subject Classification: 03D70, 03D75.     

A globally convergent inexact Newton method with a new choice for the forcing term

In inexact Newton methods for solving nonlinear systems of equations, an approximation to the step s _k of the Newton’s system J(x _k )s=−F(x _k ) is found. This means that s _k must satisfy a condition like ‖F(x _k )+J(x _k )s _k ‖≤η _k ‖F(x _k )‖ for a forcing term η _k ∈[0,1). Possible choices for η _k have already been presented. In this work, a new choice for η _k is proposed. The method is globalized using a robust backtracking strategy proposed by Birgin et al. (Numerical Algorithms 32:249–260, 2003), and its convergence properties are proved. Several numerical experiments with boundary value problems are presented. The numerical performance of the proposed algorithm is analyzed by the performance profile tool proposed by Dolan and Moré (Mathematical Programming Series A 91:201–213, 2002). The results obtained show a competitive inexact Newton method for solving academic and applied problems in several areas. Supported by FAPESP, CNPq, PRONEX-Optimization.     

The strength of Mac Lane set theory

Saunders Mac Lane has drawn attention many times, particularly in his book Mathematics: Form and Function, to the system of set theory of which the axioms are Extensionality, Null Set, Pairing, Union, Infinity, Power Set, Restricted Separation, Foundation, and Choice, to which system, afforced by the principle, , of Transitive Containment, we shall refer as . His system is naturally related to systems derived from topos-theoretic notions concerning the category of sets, and is, as Mac Lane emphasises, one that is adequate for much of mathematics. In this paper we show that the consistency strength of Mac Lane's system is not increased by adding the axioms of Kripke–Platek set theory and even the Axiom of Constructibility to Mac Lane's axioms; our method requires a close study of Axiom H, which was proposed by Mitchell; we digress to apply these methods to subsystems of Zermelo set theory , and obtain an apparently new proof that is not finitely axiomatisable; we study Friedman's strengthening of , and the Forster–Kaye subsystem of , and use forcing over ill-founded models and forcing to establish independence results concerning and ; we show, again using ill-founded models, that proves the consistency of ; turning to systems that are type-theoretic in spirit or in fact, we show by arguments of Coret and Boffa that proves a weak form of Stratified Collection, and that is a conservative extension of for stratified sentences, from which we deduce that proves a strong stratified version of ; we analyse the known equiconsistency of with the simple theory of types and give Lake's proof that an instance of Mathematical Induction is unprovable in Mac Lane's system; we study a simple set theoretic assertion—namely that there exists an infinite set of infinite sets, no two of which have the same cardinal—and use it to establish the failure of the full schema of Stratified Collection in ; and we determine the point of failure of various other schemata in . The paper closes with some philosophical remarks.     

Lifting elementary embeddings <Emphasis Type="Italic">j</Emphasis>: <Emphasis Type="Italic">V</Emphasis><Subscript>λ</Subscript> → <Emphasis Type="Italic">V</Emphasis><Subscript>λ</Subscript>

We describe a fairly general procedure for preserving I₃ embeddings j: V _λ → V _λ via λ-stage reverse Easton iterated forcings. We use this method to prove that, assuming the consistency of an I₃ embedding, V = HOD is consistent with the theory ZFC + WA where WA is an axiom schema in the language {∈, j} asserting a strong but not inconsistent form of “there is an elementary embedding V → V”. This improves upon an earlier result in which consistency was established assuming an I₁ embedding.      

Semi‐proper forcing,remarkable cardinals,and Bounded Martin's Maximum

We show that L(?) absoluteness for semi‐proper forcings is equiconsistent with the existence of a remarkable cardinal, and hence by [6] with L(?) absoluteness for proper forcings. By [7], L(?) absoluteness for stationary set preserving forcings gives an inner model with a strong cardinal. By [3], the Bounded Semi‐Proper Forcing Axiom (BSPFA) is equiconsistent with the Bounded Proper Forcing Axiom (BPFA), which in turn is equiconsistent with a reflecting cardinal. We show that Bounded Martin's Maximum (BMM) is much stronger than BSPFA in that if BMM holds, then for every X ∈ V , X^# exists. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Fractional weak discrepancy and split semiorders

The fractional weak discrepancywd_F(P) of a poset P=(V,?) was introduced in Shuchat et al. (2007) [6] as the minimum nonnegative k for which there exists a function f:V→R satisfying (i) if a?b then f(a)+1≤f(b) and (ii) if a∥b then |f(a)−f(b)|≤k. In this paper we generalize results in Shuchat et al. (2006, 2009) [5] and [7] on the range of wd_F for semiorders to the larger class of split semiorders. In particular, we prove that for such posets the range is the set of rationals that can be represented as r/s for which 0≤s−1≤r<2s.     

The upper connected geodetic number and forcing connected geodetic number of a graph

For a connected graph G of order p≥2, a set S⊆V(G) is a geodetic set of G if each vertex v∈V(G) lies on an x-y geodesic for some elements x and y in S. The minimum cardinality of a geodetic set of G is defined as the geodetic number of G, denoted by g(G). A geodetic set of cardinality g(G) is called a g-set of G. A connected geodetic set of G is a geodetic set S such that the subgraph G[S] induced by S is connected. The minimum cardinality of a connected geodetic set of G is the connected geodetic number of G and is denoted by g_c(G). A connected geodetic set of cardinality g_c(G) is called a g_c-set of G. A connected geodetic set S in a connected graph G is called a minimal connected geodetic set if no proper subset of S is a connected geodetic set of G. The upper connected geodetic number is the maximum cardinality of a minimal connected geodetic set of G. We determine bounds for and determine the same for some special classes of graphs. For positive integers r,d and n≥d+1 with r≤d≤2r, there exists a connected graph G with , and . Also, for any positive integers 2≤a<b≤c, there exists a connected graph G such that g(G)=a, g_c(G)=b and . A subset T of a g_c-set S is called a forcing subset for S if S is the unique g_c-set containing T. A forcing subset for S of minimum cardinality is a minimum forcing subset of S. The forcing connected geodetic number of S, denoted by f_c(S), is the cardinality of a minimum forcing subset of S. The forcing connected geodetic number of G, denoted by f_c(G), is f_c(G)=min{f_c(S)}, where the minimum is taken over all g_c-sets S in G. It is shown that for every pair a,b of integers with 0≤a≤b−4, there exists a connected graph G such that f_c(G)=a and g_c(G)=b.