scholarly journals Physical and Mathematical Fluid Mechanics

Water ◽  
2020 ◽  
Vol 12 (8) ◽  
pp. 2199
Author(s):  
Markus Scholle

Fluid mechanics has emerged as a basic concept for nearly every field of technology. Despite there being a well-developed mathematical theory and available commercial software codes, the computation of solutions of the governing equations of motion is still challenging, especially due to the nonlinearity involved, and there are still open questions regarding the underlying physics of fluid flow, especially with respect to the continuum hypothesis and thermodynamic local equilibrium. The aim of this Special Issue is to reference recent advances in the field of fluid mechanics both in terms of developing sophisticated mathematical methods for finding solutions of the equations of motion, on the one hand, and on novel approaches to the physical modelling beyond the continuum hypothesis and thermodynamic local equilibrium, on the other.

1978 ◽  
Vol 43 (3) ◽  
pp. 613-613 ◽  
Author(s):  
Stephen C. Kleene

Gödel has called to my attention that p. 773 is misleading in regard to the discovery of the finite axiomatization and its place in his proof of the consistency of GCH. For the version in [1940], as he says on p. 1, “The system Σ of axioms for set theory which we adopt [a finite one] … is essentially due to P. Bernays …”. However, it is not at all necessary to use a finite axiom system. Gödel considers the more suggestive proof to be the one in [1939], which uses infinitely many axioms.His main achievement regarding the consistency of GCH, he says, really is that he first introduced the concept of constructible sets into set theory defining it as in [1939], proved that the axioms of set theory (including the axiom of choice) hold for it, and conjectured that the continuum hypothesis also will hold. He told these things to von Neumann during his stay at Princeton in 1935. The discovery of the proof of this conjecture On the basis of his definition is not too difficult. Gödel gave the proof (also for GCH) not until three years later because he had fallen ill in the meantime. This proof was using a submodel of the constructible sets in the lowest case countable, similar to the one commonly given today.


1985 ◽  
Vol 50 (3) ◽  
pp. 569-579
Author(s):  
Robert S. Wolf

AbstractWe prove (in ZFC Set Theory) that all infinite games whose winning sets are of the following forms are determined:(1) (A − S) ∪ B, where A is , , and the game whose winning set is B is “strongly determined” (meaning that all of its subgames are determined).(2) A Boolean combination of sets and sets smaller than the continuum.This also enables us to show that strong determinateness is not preserved under complementation, improving a result of Morton Davis which required the continuum hypothesis to prove this fact.Various open questions related to the above results are discussed. Our main conjecture is that (2) above remains true when is replaced by “Borel”.


Author(s):  
Antony N. Beris ◽  
Brian J. Edwards

In the opening chapters of the book, we saw how a variety of conservative phenomena could be described through the Poisson bracket of classical physics. As already mentioned, the majority of systems with which engineers and physicists must deal reveal dissipative phenomena inherent to their nature. In the last chapter we offered a concise overview of nonequilibrium thermodynamics as traditionally applied to describe, close to equilibrium, dissipative dynamic phenomena. In this chapter, we lay the groundwork for the incorporation of non-conservative effects into an equation of Hamiltonian form, and show several well-known examples in way of proof that such a thesis is, in fact, tenable. The unified formulation of conservative and dissipative processes based on the fundamental equations of motion is not a new idea. Among the most complete treatments is the one offered by the Brussels school of thermodynamics [Prigogine et al., 1973; Prigogine, 1973; Henin, 1974] based on a modified Liouville/von Neumann equation. This is a seminal work where, using the mathematical approach of projection operators and relying only on first principles, it is demonstrated how large isolated dynamic systems may present dissipative properties in some asymptotic limit. A key characteristic of their theory is that dissipative phenomena arise spontaneously without the need of any macroscopic assumptions, including that of local equilibrium [Prigogine et al., 1973, p. 6]. The main value, however, is mostly theoretical, demonstrating the compatibility of dissipative, irreversible, processes with the reversible dynamics of elemental processes through a “symmetry-breaking process.” The value of the theory in applications is limited since it relies on a quantum mechanical equation for the density matrix ρ which is, in general, very difficult to solve except for highly simplified problems [Henin, 1974]. In a nutshell, we hope to offer with the present work a macroscopic equivalent of the Brussels school theory which, at the expense of the introduction of the local equilibrium assumption, attempts to unify the description of dynamic and dissipative phenomena from a continuum, macroscopic viewpoint. The main tool to achieve that goal is the extension of the Poisson bracket formalism, analyzed in chapter 5, to dissipative continua.


1984 ◽  
Vol 49 (3) ◽  
pp. 754-773 ◽  
Author(s):  
A. P. Hiller ◽  
J. Zimbarg

The universe of sets, V, is usually seen as an entity structured in successive levels, each level being made up of objects and collections of objects belonging to the previous levels. This process of obtaining sets and axioms for set theory can be seen in Scott [74] and Shoenfield [77].The approach we want to take differs from the previous one very strongly: the seeds from which we want to generate our universe of classes are to be the one-variable predicates (given by one-free-variable formulas) of the formal language we shall be using. In other words, any one-variable predicate of the language is to be represented as a class in our universe. In this sense, we view our theory as being about a self-referential language, a language whose predicates refer to objects which are predicates of the language itself.We want, in short, a system such that: (i) any predicate may be represented by an object to be studied by the theory itself; (ii) the axioms for the theory may be derived from the general principle that we are dealing with a language that aims at describing its own predicates; and (iii) the theory should be strong enough to derive ZFC and suggest answers to the existence of large cardinals and to the continuum hypothesis.An objection to such a project arises immediately: in view of the Russell-Zermelo paradox, how is it possible to have all predicates of the language as elements of the universe? This objection will be easy to deal with: we shall provide our language with a type structure to avoid paradox.


Author(s):  
Kyriakos Keremedis ◽  
Eleftherios Tachtsis ◽  
Eliza Wajch

AbstractIn the absence of the axiom of choice, the set-theoretic status of many natural statements about metrizable compact spaces is investigated. Some of the statements are provable in $$\mathbf {ZF}$$ ZF , some are shown to be independent of $$\mathbf {ZF}$$ ZF . For independence results, distinct models of $$\mathbf {ZF}$$ ZF and permutation models of $$\mathbf {ZFA}$$ ZFA with transfer theorems of Pincus are applied. New symmetric models of $$\mathbf {ZF}$$ ZF are constructed in each of which the power set of $$\mathbb {R}$$ R is well-orderable, the Continuum Hypothesis is satisfied but a denumerable family of non-empty finite sets can fail to have a choice function, and a compact metrizable space need not be embeddable into the Tychonoff cube $$[0, 1]^{\mathbb {R}}$$ [ 0 , 1 ] R .


2007 ◽  
Vol 72 (1) ◽  
pp. 171-206 ◽  
Author(s):  
Denis R. Hirschfeldt ◽  
Richard A. Shore

AbstractWe investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus in particular on the principles ADS (Ascending or Descending Sequence), which states that every infinite linear order has either an infinite descending sequence or an infinite ascending sequence, and CAC (Chain-AntiChain), which states that every infinite partial order has either an infinite chain or an infinite antichain. It is wellknown that Ramsey's Theorem for pairs () splits into a stable version () and a cohesive principle (COH). We show that the same is true of ADS and CAC, and that in their cases the stable versions are strictly weaker than the full ones (which is not known to be the case for and ). We also analyze the relationships between these principles and other systems and principles previously studied by reverse mathematics, such as WKL0, DNR, and BΣ2. We show, for instance, that WKL0 is incomparable with all of the systems we study. We also prove computability-theoretic and conservation results for them. Among these results are a strengthening of the fact, proved by Cholak, Jockusch, and Slaman, that COH is -conservative over the base system RCA0. We also prove that CAC does not imply DNR which, combined with a recent result of Hirschfeldt, Jockusch. Kjos-Hanssen, Lempp, and Slaman, shows that CAC does not imply (and so does not imply ). This answers a question of Cholak, Jockusch, and Slaman.Our proofs suggest that the essential distinction between ADS and CAC on the one hand and on the other is that the colorings needed for our analysis are in some way transitive. We formalize this intuition as the notions of transitive and semitransitive colorings and show that the existence of homogeneous sets for such colorings is equivalent to ADS and CAC, respectively. We finish with several open questions.


Sign in / Sign up

Export Citation Format

Share Document