On constructivity and the Rosser property: a closer look at some Gödelean proofs

The proofs of Kleene, Chaitin and Boolos for Gödel's First Incompleteness Theorem are studied from the perspectives of constructivity and the Rosser property. A proof of the incompleteness theorem has the Rosser property when the independence of the true but unprovable sentence can be shown by assuming only the (simple) consistency of the theory. It is known that Gödel's own proof for his incompleteness theorem does not have the Rosser property, and we show that neither do Kleene's or Boolos' proofs. However, we show that a variant of Chaitin's proof can have the Rosser property. The proofs of Gödel, Rosser and Kleene are constructive in the sense that they explicitly construct, by algorithmic ways, the independent sentence(s) from the theory. We show that the proofs of Chaitin and Boolos are not constructive, and they prove only the mere existence of the independent sentences.     

A convergence result for history-dependent quasivariational inequalities

In this paper, we consider a general class of history-dependent quasivariational inequalities with constraints. Our aim is to study the behavior of the solution with respect to the set of constraints and, in this matter, we prove a continuous dependence result. The proof is based on various estimates and monotonicity arguments. Then, we consider two mathematical models which describe the equilibrium of a viscoplastic and viscoelastic body, respectively, in contact with a deformable foundation. The variational formulation of each model is in a form of a history-dependent quasivariational inequality for the displacement field, governed by a set of constraints. We prove the unique weak solvability of each model, then we use our abstract result to prove the continuous dependence of the solution with respect to the set of constraints.     

Strongly stable real infinitesimally symplectic mappings

We prove that a mapA εsp(σ,R), the set of infinitesimally symplectic maps, is strongly stable if and only if its centralizerC(A) insp(σ,R) contains only semisimple elements. Using the theorem that everyB insp(σ,R) close toA is conjugate by a real symplectic map to an element ofC(A), we give a new proof of the openness of the set of strongly stable maps. Then we prove that the set of strongly stable maps is the interior of the set of all infinitesimally symplectic maps with purely imaginary or zero eigenvalues, and the connected components of this set are described. Finally, we give a new proof of the analytic conjugacy theorem for an analytic curve through a given strongly stable map.     

Applications of Feller–Reuter–Riley Transition Functions

A Feller–Reuter–Riley function is a Markov transition function whose corresponding semigroup maps the set of the real-valued continuous functions vanishing at infinity into itself. The aim of this paper is to investigate applications of such functions in the dual problem, Markov branching processes, and the Williams-matrix. The remarkable property of a Feller–Reuter–Riley function is that it is a Feller minimal transition function with a stable q-matrix. By using this property we are able to prove that, in the theory of branching processes, the branching property is equivalent to the requirement that the corresponding transition function satisfies the Kolmogorov forward equations associated with a stable q-matrix. It follows that the probabilistic definition and the analytic definition for Markov branching processes are actually equivalent. Also, by using this property, together with the Resolvent Decomposition Theorem, a simple analytical proof of the Williams' existence theorem with respect to the Williams-matrix is obtained. The close link between the dual problem and the Feller–Reuter–Riley transition functions is revealed. It enables us to prove that a dual transition function must satisfy the Kolmogorov forward equations. A necessary and sufficient condition for a dual transition function satisfying the Kolmogorov backward equations is also provided.     

Asymptotics for wave equations with Wentzell boundary conditions and boundary damping

We are concerned with linear wave equations with Wentzell boundary conditions of dynamical type, where only one velocity feedback force acts on the Wentzell boundary. By using the theory of strongly continuous semigroups of linear operators, we prove that the energies of the solutions are strongly stable. Moreover, we show in the one dimensional case that there are solutions decaying at arbitrarily slow rates.     

Global convergence of a kinetic model of chemotaxis to a perturbed Keller–Segel model

We consider a class of kinetic models of chemotaxis with two positive non-dimensional parameters coupled to a parabolic equation of the chemo-attractant. If both parameters are set equal zero, we have the classical Keller–Segel model for chemotaxis. We prove global existence of solutions of this two-parameters kinetic model and prove convergence of this model to models of chemotaxis with global existence when one of these two parameters is set equal zero. In one case, we find as a limit model a kinetic model of chemotaxis while in the other case we find a perturbed Keller–Segel model with global existence of solutions.     

Homogeneous models for unidimensional theories

A stable theory is called unidimensional if any two of its nonalgebraic types are nonorthogonal. In the paper we consider some problems concerning homogeneous models of unidimensional theories. For homogeneous models, in particular, we prove an analog of the theorem of Shelah which states that the concepts of unidimensionality and saturation are equivalent in any sufficiently saturated model of that theory.Translated fromAlgebra i Logika, Vol. 34, No. 1, pp. 61–78, January–February, 1995.     

Specification on the interval

We study the consequences of discontinuities on the specification property for interval maps. After giving a necessary and sufficient condition for a piecewise monotonic, piecewise continuous map to have this property, we show that for a large and natural class of families of such maps (including the -transformations), the set of parameters for which the specification property holds, though dense, has zero Lebesgue measure. Thus, regarding the specification property, the general case is at the opposite of the continuous case solved by A.M. Blokh (Russian Math. Surveys 38 (1983), 133-134) (for which we give a proof).

     

Positive solutions for Robin problem involving the -Laplacian

Consider Robin problem involving the p(x)-Laplacian on a smooth bounded domain Ω as follows

Applying the sub-supersolution method and the variational method, under appropriate assumptions on f, we prove that there exists λ_*>0 such that the problem has at least two positive solutions if λ(0,λ_*), has at least one positive solution if λ=λ_*<+∞ and has no positive solution if λ>λ_*. To prove the results, we prove a norm on W^1,p(x)(Ω) without the part of ||_L^p(x)(Ω) which is equivalent to usual one and establish a special strong comparison principle for Robin problem.     

On the existence of product stochastic measures

In this paper, we prove that the existence of product stochastic measures depends on the axiom-system of set theory: If one accepts the axiom of choice, the answer is negative, and we give a counter-example where the product stochastic measure doesn't exist; but in the Solovay model (one kind of set theory which refuses the axiom of choice), the answer is positive, and we give a proof.     

Statistical experiments and their conical measures

Summary In the theory of functional analytic comparison of statistical experiments (started by L. LeCam) one can characterize equivalence classes of experiments by conical measures (in the sense of G. Choquet). We begin with a short proof of the (known) fact that any conical measure with normed resultant belongs to an experiment class. Then we are concerned with the special case of dominated experiments which are characterized by the extendability of their conical measures to finite concrete measures. These results are in close connection with a paper of E.N. Torgersen (Mixtures and products of dominated experiments. Ann. Statist. 5, 44–64 (1977)).After this we study class properties of experiments which are expressible in terms of their conical measures. Simple examples are domination, existence of bounded densities and compactness. It follows the investigation of a more profound class property which we call extremality and which generalizes the concept of an experiment with a sufficient and boundedly complete subalgebra. Finally we prove that the extreme points of the compact convex set of conical measures with normed resultant are just the conical measures of the extremal experiments.     

Strong convergence of estimators in nonlinear autoregressive models

In the paper we prove rates of strong convergence of M-estimators for the parameters in a general nonlinear autoregressive model. In the proofs we utilize a variational principle from stochastic optimization theory which was proved by Shapiro (Ann. Oper. Res. 30 (1991) 169). The application of the general theory is illustrated in the case of continuous threshold models.     

The dual quasisemigroup and controllability of evolution equations

We study the notion of dual quasisemigroups of bounded linear operators as a generalization of that for strongly continuous semigroup and prove some properties similar to the dual of a semigroup, among other things we prove that for reflexive Banach spaces the dual quasisemigroup is strongly continuous on (0,+∞). This allows us to extend some recent criteria of controllability to a general class of evolution equations in reflexive Banach spaces.     

Generalization of the Gale–Ryser Theorem

We prove an inequality for the Kostka–Foulkes polynomials K_λ,μ(q) and give a criteria for the existence of a unique configuration of the given type (λ, μ). As a corollary, we obtain a nontrivial lower bound for the Kostka numbers which is a generalization the Gale–Ryser theorem on an existence of a (0,1)-matrix with given sums of rows and columns. A new proof of the Berenstein–Zelevinsky weight-multiplicity-one criteria is given.     

A generalization of the Shapley–Ichiishi result

The Shapley–Ichiishi result states that a game is convex if and only if the convex hull of marginal vectors equals the core. In this paper, we generalize this result by distinguishing equivalence classes of balanced games that share the same core structure. We then associate a system of linear inequalities with each equivalence class, and we show that the system defines the class. Application of this general theorem to the class of convex games yields an alternative proof of the Shapley–Ichiishi result. Other applications range from computation of stable sets in non-cooperative game theory to determination of classes of TU games on which the core correspondence is additive (even linear). For the case of convex games we prove that the theorem provides the minimal defining system of linear inequalities. An example shows that this is not necessarily true for other equivalence classes of balanced games.     

Function Decompositions Related to the Luzin N-property

We introduce a class of continuous completely regular functions satisfying the N-property. We obtain a decomposition of an arbitrary continuous function into the sum of two functions the first of which is completely regular and the second does not enjoy the N-property. We define a class of strongly regular Borel functions for which we prove the Luzin N-property. We demonstrate that the image of every Lebesgue measurable set of a strongly regular function is measurable. From an arbitrary Borel function we extract a strongly regular function and a function that does not enjoy the N-property.     

Submodels of Kripke models

A Kripke model ? is a submodel of another Kripke model ℳ if ? is obtained by restricting the set of nodes of ℳ. In this paper we show that the class of formulas of Intuitionistic Predicate Logic that is preserved under taking submodels of Kripke models is precisely the class of semipositive formulas. This result is an analogue of the Łoś-Tarski theorem for the Classical Predicate Calculus. In Appendix A we prove that for theories with decidable identity we can take as the embeddings between domains in Kripke models of the theory, the identical embeddings. This is a well known fact, but we know of no correct proof in the literature. In Appendix B we answer, negatively, a question posed by Sam Buss: whether there is a classical theory T, such that ℋT is HA. Here ℋT is the theory of all Kripke models ℳ such that the structures assigned to the nodes of ℳ all satisfy T in the sense of classical model theory. Received: 4 February 1999 / Published online: 25 January 2001     

Stable model categories are categories of modules

A stable model category is a setting for homotopy theory where the suspension functor is invertible. The prototypical examples are the category of spectra in the sense of stable homotopy theory and the category of unbounded chain complexes of modules over a ring. In this paper we develop methods for deciding when two stable model categories represent ‘the same homotopy theory’. We show that stable model categories with a single compact generator are equivalent to modules over a ring spectrum. More generally stable model categories with a set of generators are characterized as modules over a ‘ring spectrum with several objects’, i.e., as spectrum valued diagram categories. We also prove a Morita theorem which shows how equivalences between module categories over ring spectra can be realized by smashing with a pair of bimodules. Finally, we characterize stable model categories which represent the derived category of a ring. This is a slight generalization of Rickard's work on derived equivalent rings. We also include a proof of the model category equivalence of modules over the Eilenberg-Mac Lane spectrum HR and (unbounded) chain complexes of R-modules for a ring R.     

A bijective proof of the hook-length formula

A well-known theorem of Frame, Robinson, and, Thrall states that if λ is a partition of n, then the number of Standard Young Tableaux of shape λ is n! divided by the product of the hook-lengths. We give a new combinatorial proof of this formula by exhibiting a bijection between the set of unsorted Young Tableaux of shape λ, and the set of pairs (T, S), where T is a Standard Young Tableau of shape λ and S is a “Pointer” Tableau of shape λ.     

Externally definable sets and dependent pairs

We prove that externally definable sets in first order NIP theories have honest definitions, giving a new proof of Shelah’s expansion theorem. Also we discuss a weak notion of stable embeddedness true in this context. Those results are then used to prove a general theorem on dependent pairs, which in particular answers a question of Baldwin and Benedikt on naming an indiscernible sequence.