In Defense of Logical Universalism: Taking Issue with Jean van Heijenoort

Van Heijenoort??s main contribution to history and philosophy of modern logic was his distinction between two basic views of logic, first, the absolutist, or universalist, view of the founding fathers, Frege, Peano, and Russell, which dominated the first, classical period of history of modern logic, and, second, the relativist, or model-theoretic, view, inherited from Boole, Schr?der, and L?wenheim, which has dominated the second, contemporary period of that history. In my paper, I present the man Jean van Heijenoort (Sect. 1); then I describe his way of arguing for the second view (Sect. 2); and finally I come down in favor of the first view (Sect. 3). There, I specify the version of universalism for which I am prepared to argue (Sect. 3, introduction). Choosing ZFC to play the part of universal, logical (in a nowadays forgotten sense) system, I show, through an example, how the usual model theory can be naturally given its proper place, from the universalist point of view, in the logical framework of ZFC; I outline another, not rival but complementary, semantics for admissible extensions of ZFC in the very same logical framework; I propose a way to get universalism out of the predicaments in which universalists themselves believed it to be (Sect. 3.1). Thus, if universalists of the classical period did not, in fact, construct these semantics, it was not that their universalism forbade them, in principle, to do so. The historical defeat of universalism was not technical in character. Neither was it philosophical. Indeed, it was hardly more than the victory of technicism over the very possibility of a philosophical dispute (Sect. 3.2).     

Results on Bent Functions

In this paper, we present three results on bent functions: a construction, a restriction, and a characterization. Starting with a single bent function, in a simple but very effective way, the construction produces a large number of new bent functions in the same number of variables. The restriction imposes new conditions on the directional derivatives of bent functions. Certain non-existence results that were previously obtained through computer search follow easily from these conditions. The characterization describes bent functions as certain solutions of a system of quadratic equations. Interesting new properties of bent functions are obtained using the characterization.     

The Sine-Gordon regime of the Landau–Lifshitz equation with a strong easy-plane anisotropy

It is well-known that the dynamics of biaxial ferromagnets with a strong easy-plane anisotropy is essentially governed by the Sine-Gordon equation. In this paper, we provide a rigorous justification to this observation. More precisely, we show the convergence of the solutions to the Landau–Lifshitz equation for biaxial ferromagnets towards the solutions to the Sine-Gordon equation in the regime of a strong easy-plane anisotropy. Moreover, we establish the sharpness of our convergence result.This result holds for solutions to the Landau–Lifshitz equation in high order Sobolev spaces. We first provide an alternative proof for local well-posedness in this setting by introducing high order energy quantities with better symmetrization properties. We then derive the convergence from the consistency of the Landau–Lifshitz equation with the Sine-Gordon equation by using well-tailored energy estimates. As a by-product, we also obtain a further derivation of the free wave regime of the Landau–Lifshitz equation.     

Second-Order Optimality and Beyond: Characterization and Evaluation Complexity in Convexly Constrained Nonlinear Optimization

High-order optimality conditions for convexly constrained nonlinear optimization problems are analysed. A corresponding (expensive) measure of criticality for arbitrary order is proposed and extended to define high-order \(\epsilon \)-approximate critical points. This new measure is then used within a conceptual trust-region algorithm to show that if derivatives of the objective function up to order \(q \ge 1\) can be evaluated and are Lipschitz continuous, then this algorithm applied to the convexly constrained problem needs at most \(O(\epsilon ^{-(q+1)})\) evaluations of f and its derivatives to compute an \(\epsilon \)-approximate qth-order critical point. This provides the first evaluation complexity result for critical points of arbitrary order in nonlinear optimization. An example is discussed, showing that the obtained evaluation complexity bounds are essentially sharp.     

Surjectivity of quotient maps for algebraic (ℂ,+)-actions and polynomial maps with contractible fibers

In this paper we establish two results concerning algebraic (,+)-actions on ⁿ . First, let be an algebraic (,+)-action on ³. By a result of Miyanishi, its ring of invariants is isomorphic to [t ₁,t ₂]. Iff ₁,f ₂ generate this ring, the quotient map of is the mapF:³²,x(f ₁(x), f₂(x)). By using some topological arguments we prove thatF is always surjective. Secon, we are interested in dominant polynomial mapsF: ^{n n-1} whose connected components of their generic fibers are contractible. For such maps, we prove the existence of an algebraic (,+)-action on ⁿ for whichF is invariant. Moreover we give some conditions so thatF*([t ₁,...,t _n-1 ]) is the ring of invariants of .Dedicated to all my friends and my family     

Non-abelian Hopf cohomology II—The general case

We introduce and study non-abelian cohomology sets of Hopf algebras with coefficients in Hopf comodule algebras. We prove that these sets generalize as well Serre's non-abelian group cohomology theory as the cohomological theory constructed by the authors in a previous article. We establish their functoriality and compute explicit examples. Further we classify Hopf torsors.     

Using local search to speed up filtering algorithms for?some NP-hard constraints

This paper proposes to use local search inside filtering algorithms of combinatorial structures for which achieving a desired level of consistency is too computationally expensive. Local search quickly provides supports for many variable-value pairs, thus reducing the effort required to check and potentially filter the rest of them. The idea is demonstrated on the SomeDifferent constraint, a graph coloring substructure. An experimental evaluation confirms its significant computational gain in many cases.     

Counting all bent functions in dimension eight 99270589265934370305785861242880

Based on the classification of the homogeneous Boolean functions of degree 4 in 8 variables we present the strategy that we used to count the number of all bent functions in dimension 8. There are $$99270589265934370305785861242880 \approx 2^{106}$$ such functions in total. Furthermore, we show that most of the bent functions in dimension 8 are nonequivalent to Maiorana?CMcFarland and partial spread functions.