LNCS

Extensionality axioms are common when reasoning about data collections, such as arrays and functions in program analysis, or sets in mathematics. An extensionality axiom asserts that two collections are equal if they consist of the same elements at the same indices. Using extensionality is often required to show that two collections are equal. A typical example is the set theory theorem (∀x)(∀y)x∪y = y ∪x. Interestingly, while humans have no problem with proving such set identities using extensionality, they are very hard for superposition theorem provers because of the calculi they use. In this paper we show how addition of a new inference rule, called extensionality resolution, allows first-order theorem provers to easily solve problems no modern first-order theorem prover can solve. We illustrate this by running the VAMPIRE theorem prover with extensionality resolution on a number of set theory and array problems. Extensionality resolution helps VAMPIRE to solve problems from the TPTP library of first-order problems that were never solved before by any prover

A new foundational crisis in mathematics, is it really happening?

The article reconsiders the position of the foundations of mathematics after the discovery of HoTT. Discussion that this discovery has generated in the community of mathematicians, philosophers and computer scientists might indicate a new crisis in the foundation of mathematics. By examining the mathematical facts behind HoTT and their relation with the existing foundations, we conclude that the present crisis is not one. We reiterate a pluralist vision of the foundations of mathematics. The article contains a short survey of the mathematical and historical background needed to understand the main tenets of the foundational issues.Comment: Final versio

Superposition for Lambda-Free Higher-Order Logic

We introduce refutationally complete superposition calculi for intentional and extensional clausal $\lambda$-free higher-order logic, two formalisms that allow partial application and applied variables. The calculi are parameterized by a term order that need not be fully monotonic, making it possible to employ the $\lambda$-free higher-order lexicographic path and Knuth-Bendix orders. We implemented the calculi in the Zipperposition prover and evaluated them on Isabelle/HOL and TPTP benchmarks. They appear promising as a stepping stone towards complete, highly efficient automatic theorem provers for full higher-order logic

Linear Pantographic Sheets: Existence and Uniqueness of Weak Solutions

The well-posedness of the boundary value problems for second gradient elasticity has been studied under the assumption of strong ellipticity of the dependence on the second placement gradients (see, e.g., Chambon and Moullet in Comput. Methods Appl. Mech. Eng. 193:2771–2796, 2004 and Mareno and Healey in SIAM J. Math. Anal. 38:103–115, 2006). The study of the equilibrium of planar pantographic lattices has been approached in two different ways: in dell’Isola et al. (Proc. R. Soc. Lond. Ser. A 472:20150, 2016) a discrete model was introduced involving extensional and rotational springs which is also valid in large deformations regimes while in Boutin et al. (Math. Mech. Complex Syst. 5:127–162, 2017) the lattice has been modelled as a set of beam elements interconnected by internal pivots, but the analysis was restricted to the linear case. In both papers a homogenized second gradient deformation energy, quadratic in the neighbourhood of non deformed configuration, is obtained via perturbative methods and the predictions obtained with the obtained continuum model are successfully compared with experiments. This energy is not strongly elliptic in its dependence on second gradients. We consider in this paper also the important particular case of pantographic lattices whose first gradient energy does not depend on shear deformation: this could be considered either a pathological case or an important exceptional case (see Stillwell et al. in Am. Math. Mon. 105:850–858, 1998 and Turro in Angew. Chem., Int. Ed. Engl. 39:2255–2259, 2000). In both cases we believe that such a particular case deserves some attention because of what we can understand by studying it (see Dyson in Science 200:677–678, 1978). This circumstance motivates the present paper, where we address the well-posedness of the planar linearized equilibrium problem for homogenized pantographic lattices. To do so: (i) we introduce a class of subsets of anisotropic Sobolev’s space as the most suitable energy space E relative to assigned boundary conditions; (ii) we prove that the considered strain energy density is coercive and positive definite in E; (iii) we prove that the set of placements for which the strain energy is vanishing (the so-called floppy modes) must strictly include rigid motions; (iv) we determine the restrictions on displacement boundary conditions which assure existence and uniqueness of linear static problems. The presented results represent one of the first mechanical applications of the concept of Anisotropic Sobolev space, initially introduced only on the basis of purely abstract mathematical considerations

Beyond the Object

Object orientation (OO) is regained not only in all components of integrate development media but it remarks in the rest of software world from operating system to last application domain - of course, with different intensity and success. A clear prove of OO application in all situations is the development of a wide range of industrial applications. OO technology allows drawing of relation between the geometry, topology and dimensions of data on a class hierarchy; thus, the observation of the amount of data gained by research in many scientific domains is facilitated through class libraries both for graphic primitives and for events examination. In conformity to all waiting, OO asserts in every distributive system, there are very important the applications for making open systems customer-server and dis-tributed applications in Java. Finally OO application in robot's programming and modeling needn't be omitted. However, far to be panacea, OO has also shades which will be researched so on.object orientation, adaptability, reusability component wares, mega-programming, generative programming.

The Structuralist Thesis Reconsidered

Øystein Linnebo and Richard Pettigrew ([2014]) have recently developed a version of non-eliminative mathematical structuralism based on Fregean abstraction principles. They argue that their theory of abstract structures proves a consistent version of the structuralist thesis that positions in abstract structures only have structural properties. They do this by defining a subset of the properties of positions in structures, so-called fundamental properties, and argue that all fundamental properties of positions are structural. In this paper, we argue that the structuralist thesis, even when restricted to fundamental properties, does not follow from the theory of structures that Linnebo and Pettigrew have developed. To make their account work, we propose a formal framework in terms of Kripke models that makes structural abstraction precise. The formal framework allows us to articulate a revised definition of fundamental properties, understood as intensional properties. Based on this revised definition, we show that the restricted version of the structuralist thesis holds

The Structuralist Thesis Reconsidered

Øystein Linnebo and Richard Pettigrew ([2014]) have recently developed a version of non-eliminative mathematical structuralism based on Fregean abstraction principles. They argue that their theory of abstract structures proves a consistent version of the structuralist thesis that positions in abstract structures only have structural properties. They do this by defining a subset of the properties of positions in structures, so-called fundamental properties, and argue that all fundamental properties of positions are structural. In this paper, we argue that the structuralist thesis, even when restricted to fundamental properties, does not follow from the theory of structures that Linnebo and Pettigrew have developed. To make their account work, we propose a formal framework in terms of Kripke models that makes structural abstraction precise. The formal framework allows us to articulate a revised definition of fundamental properties, understood as intensional properties. Based on this revised definition, we show that the restricted version of the structuralist thesis holds