Corrigendum to “Weak Arithmetics and Kripke Models”

We give a corrected proof of the main result in the paper [2] mentioned in the title. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

On the asymptotics of fault probability in least‐recently‐used caching with Zipf‐type request distribution

We consider the least‐recently‐used cache replacement rule with a Zipf‐type page request distribution and investigate an asymptotic property of the fault probability with respect to an increase of cache size. We first derive the asymptotics of the fault probability for the independent‐request model and then extend this derivation to a general dependent‐request model, where our result shows that under some weak assumptions the fault probability is asymptotically invariant with regard to dependence in the page request process. In a previous study, a similar result was derived by applying a Poisson embedding technique, where a continuous‐time proof was given through some assumptions based on a continuous‐time modeling. The Poisson embedding, however, is just a technique used for the proof and the problem is essentially on a discrete‐time basis; thus, it is preferable to make assumptions, if any, directly in the discrete‐time setting. We consider a general dependent‐request model and give a direct discrete‐time proof under different assumptions. A key to the proof is that the numbers of requests for respective pages represent conditionally negatively associated random variables. © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2006     

An intuitionistic formula hierarchy based on high‐school identities

We revisit the notion of intuitionistic equivalence and formal proof representations by adopting the view of formulas as exponential polynomials. After observing that most of the invertible proof rules of intuitionistic (minimal) propositional sequent calculi are formula (i.e., sequent) isomorphisms corresponding to the high‐school identities, we show that one can obtain a more compact variant of a proof system, consisting of non‐invertible proof rules only, and where the invertible proof rules have been replaced by a formula normalization procedure. Moreover, for certain proof systems such as the G4ip sequent calculus of Vorob'ev, Hudelmaier, and Dyckhoff, it is even possible to see all of the non‐invertible proof rules as strict inequalities between exponential polynomials; a careful combinatorial treatment is given in order to establish this fact. Finally, we extend the exponential polynomial analogy to the first‐order quantifiers, showing that it gives rise to an intuitionistic hierarchy of formulas, resembling the classical arithmetical hierarchy, and the first one that classifies formulas while preserving isomorphism.     

Quasi‐Periodic Almost‐Collision Orbits in the Spatial Three‐Body Problem

In a system of particles, quasi‐periodic almost‐collision orbits are collisionless orbits along which two bodies become arbitrarily close to each other—the lower limit of their distance is zero but the upper limit is strictly positive—and are quasi‐periodic in a regularized system up to a change of time. Their existence was shown in the restricted planar circular three‐body problem by A.~Chenciner and J. Llibre, and in the planar three‐body problem by J. Féjoz. In the spatial three‐body problem, the existence of a set of positive measure of such orbits was predicted by C. Marchal. In this article, we present a proof of this fact.© 2015 Wiley Periodicals, Inc.     

A constructive proof of the Peter‐Weyl theorem

We present a new and constructive proof of the Peter‐Weyl theorem on the representations of compact groups. We use the Gelfand representation theorem for commutative C*‐algebras to give a proof which may be seen as a direct generalization of Burnside's algorithm [3]. This algorithm computes the characters of a finite group. We use this proof as a basis for a constructive proof in the style of Bishop. In fact, the present theory of compact groups may be seen as a natural continuation in the line of Bishop's work on locally compact, but Abelian, groups [2]. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Blow‐up criterion for two‐dimensional magneto‐micropolar fluid equations with partial viscosity

In this paper, we derive a blow‐up criterion of smooth solutions to the incompressible magneto‐micropolar fluid equations with partial viscosity in two space dimensions. Our proof is based on careful Hölder estimates of heat and transport equations and the standard Littlewood–Paley theory. Copyright © 2011 John Wiley & Sons, Ltd.     

Erratum to: “A linear vizing‐like relation relating the size and total domination number of a graph”

The proof of the main theorem in the paper [1] is incorrect as it is missing an important case. Here we complete the proof by giving the missing case. © 2007 Wiley Periodicals, Inc. J Graph Theory 54: 350–353, 2007     

Linear Clique‐Width for Hereditary Classes of Cographs

The class of cographs is known to have unbounded linear clique‐width. We prove that a hereditary class of cographs has bounded linear clique‐width if and only if it does not contain all quasi‐threshold graphs or their complements. The proof borrows ideas from the enumeration of permutation classes.     

A Gallai–Edmonds‐type structure theorem for path‐matchings

As a generalization of matchings, Cunningham and Geelen introduced the notion of path‐matchings. We give a structure theorem for path‐matchings which generalizes the fundamental Gallai–Edmonds structure theorem for matchings. Our proof is purely combinatorial. © 2004 Wiley Periodicals, Inc. J Graph Theory 46: 93–102, 2004     

A rainbow blow‐up lemma

We prove a rainbow version of the blow‐up lemma of Komlós, Sárközy, and Szemerédi for μn‐bounded edge colorings. This enables the systematic study of rainbow embeddings of bounded degree spanning subgraphs. As one application, we show how our blow‐up lemma can be used to transfer the bandwidth theorem of Böttcher, Schacht, and Taraz to the rainbow setting. It can also be employed as a tool beyond the setting of μn‐bounded edge colorings. Kim, Kühn, Kupavskii, and Osthus exploit this to prove several rainbow decomposition results. Our proof methods include the strategy of an alternative proof of the blow‐up lemma given by Rödl and Ruciński, the switching method, and the partial resampling algorithm developed by Harris and Srinivasan.     

Blow‐up profiles of solutions for the exponential reaction‐diffusion equation

We consider the blow‐up of solutions for a semilinear reaction‐diffusion equation with exponential reaction term. It is known that certain solutions that can be continued beyond the blow‐up time possess a non‐constant self‐similar blow‐up profile. Our aim is to find the final time blow‐up profile for such solutions. The proof is based on general ideas using semigroup estimates. The same approach works also for the power nonlinearity. Copyright © 2011 John Wiley & Sons, Ltd.     

On hyper‐torre isols

In this paper we present a contribution to a classical result of E. Ellentuck in the theory of regressive isols. E. Ellentuck introduced the concept of a hyper‐torre isol, established their existence for regressive isols, and then proved that associated with these isols a special kind of semi‐ring of isols is a model of the true universal‐recursive statements of arithmetic. This result took on an added significance when it was later shown that for regressive isols, the property of being hyper‐torre is equivalent to being hereditarily odd‐even. In this paper we present a simplification to the original proof for establishing that equivalence. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Identification problem for a one‐dimensional vibrating system

We discuss an inverse problem of determining a coefficient matrix and an initial value for a one‐dimensional non‐symmetric hyperbolic system of the first order by means of boundary values over a time interval. Provided that a time interval is sufficiently long and a given initial value satisfies some non‐degeneracy condition, we characterize coefficient matrices and initial values realizing the same boundary values. In the case where the initial value is fixed, we can prove the uniqueness in determining all the components of the coefficient matrices. The proof is based on a transformation formula and spectral properties. Copyright © 2005 John Wiley & Sons, Ltd.     

A Minkowski Inequality for Hypersurfaces in the Anti‐de Sitter‐Schwarzschild Manifold

We prove a sharp inequality for hypersurfaces in the n‐dimensional anti‐de Sitter‐Schwarzschild manifold for general n ≥ 3. This inequality generalizes the classical Minkowski inequality for surfaces in the three‐dimensional euclidean space and has a natural interpretation in terms of the Penrose inequality for collapsing null shells of dust. The proof relies on a new monotonicity formula for inverse mean curvature flow and uses a geometric inequality established by the first author in [3].© 2015 Wiley Periodicals, Inc.     

A Fourier pseudospectral method for the “good” Boussinesq equation with second‐order temporal accuracy

In this article, we discuss the nonlinear stability and convergence of a fully discrete Fourier pseudospectral method coupled with a specially designed second‐order time‐stepping for the numerical solution of the “good” Boussinesq equation. Our analysis improves the existing results presented in earlier literature in two ways. First, a convergence for the solution and convergence for the time‐derivative of the solution are obtained in this article, instead of the convergence for the solution and the convergence for the time‐derivative, given in De Frutos, et al., Math Comput 57 (1991), 109–122. In addition, we prove that this method is unconditionally stable and convergent for the time step in terms of the spatial grid size, compared with a severe restriction time step restriction required by the proof in De Frutos, et al., Math Comput 57 (1991), 109–122.© 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 31: 202–224, 2015     

Boolos‐style proofs of limitative theorems

Boolos's proof of incompleteness is extended straightforwardly to yield simple “diagonalization‐free” proofs of some classical limitative theorems of logic. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Glivenko like theorems in natural expansions of BCK‐logic

The classical Glivenko theorem asserts that a propositional formula admits a classical proof if and only if its double negation admits an intuitionistic proof. By a natural expansion of the BCK‐logic with negation we understand an algebraizable logic whose language is an expansion of the language of BCK‐logic with negation by a family of connectives implicitly defined by equations and compatible with BCK‐congruences. Many of the logics in the current literature are natural expansions of BCK‐logic with negation. The validity of the analogous of Glivenko theorem in these logics is equivalent to the validity of a simple one‐variable formula in the language of BCK‐logic with negation. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Non‐homogeneous boundary value problem for the Chan–Bodner–Linholm model

This paper proves global in time existence and uniqueness of large solutions for a problem in non‐linear inelasticity with non‐homogeneous boundary conditions. The proof is based on the non‐linear non‐autonomous semigroup method. Copyright © 2000 John Wiley & Sons, Ltd.     

A stochastic Lagrangian representation of the three‐dimensional incompressible Navier‐Stokes equations

In this paper we derive a probabilistic representation of the deterministic three‐dimensional Navier‐Stokes equations based on stochastic Lagrangian paths. The particle trajectories obey SDEs driven by a uniform Wiener process; the inviscid Weber formula for the Euler equations of ideal fluids is used to recover the velocity field. This method admits a self‐contained proof of local existence for the nonlinear stochastic system and can be extended to formulate stochastic representations of related hydrodynamic‐type equations, including viscous Burgers equations and Lagrangian‐averaged Navier‐Stokes alpha models. © 2007 Wiley Periodicals, Inc.