Solid-state processing of metal material is a very complex physical and chemical process, which is coupled by a series of variations including heat transfer, momentum transfer, mass transfer, and phase change. Applying three-dimensional finite element numerical method to the simulation of solid-state processing can perform analysis of metal material’s forging processes before production trial production, can obtain their relevant information such as material flow law, temperature field, and strain field under the minimum physical test conditions, thereby predicting metal material’s (...) forming defects and improving their forging quality. On the basis of summarizing and analyzing previous research works, this paper expounded the current status and significance of solid-state processing of metal materials, elaborated the development background, current status, and future challenges of 3D finite element numerical simulation, introduced the discrimination method and free surface solution method of numerical simulation calculation, conducted finite element model’s geometric assumptions, material selection, element division, model establishment, parameter selection, and initial and boundary condition determination, and simulated and analyzed rheological casting, remelting heating, thixoforming, and rotary piercing processes of metal materials. The results show that the 3D finite element numerical method can not only simulate various processes of flow field, temperature field, stress field, and microstructure in solid-state processing but also can provide a reliable basis for effectively obtaining a reasonable description and finding a more optimized design plan for metal material processing in a short time, which plays an important role in understanding and analyzing solid metal forming process, controlling and optimizing process parameters, guiding and mastering rheological casting, and secondary heating and rotary piercing of metal materials. (shrink)

Despite being one of the most dependable methods used by applied mathematicians and engineers in handling complex systems, the finite element method commits variational crimes. This paper contextualizes the concept of variational crime within a broader account of mathematical practice by explaining the tradeoff between complexity and accuracy involved in the construction of numerical methods. We articulate two standards of accuracy used to determine whether inexact solutions are good enough and show that, despite violating the justificatory principles of one, (...) the finite element method nevertheless succeeds in obtaining its legitimacy from the other. (shrink)

This contribution sheds light on the role of infinite idealization in structural analysis, by exploring how infinite elements and finite element methods are combined in civil engineering models. This combination, I claim, should be read in terms of a ‘complementarity function’ through which the representational ideal of completeness is reached in engineering model-building. Taking a cue from Weisberg’s definition of multiple-model idealization, I highlight how infinite idealizations are primarily meant to contribute to the prediction of structural behavior in (...) Multiphysics approaches. (shrink)

This contribution sheds light on the role of infinite idealization in structural analysis, by exploring how infinite elements and finite element methods are combined in civil engineering models. This combination, I claim, should be read in terms of a ‘complementarity function’ through which the representational ideal of completeness is reached in engineering model-building. Taking a cue from Weisberg’s definition of multiple-model idealization, I highlight how infinite idealizations are primarily meant to contribute to the prediction of structural behavior in (...) Multiphysics approaches. (shrink)

The Alperin-Goldschmidt Fusion Theorem [1, 5], when combined with pushing up [7], was a useful tool in the classification of the finite simple groups. Similar theorems are needed in the study of simple groups of finite Morley rank, in the even type case (that is, when the Sylow 2-subgroups are of bounded exponent, as in algebraic groups over fields of characteristic 2). In that context a body of results relating to fusion of 2-elements and the structure of (...) 2-local subgroups is needed: pushing up, and the classification of groups with strongly or weakly embedded subgroups, or have strongly closed abelian subgroups (c.f, [2]). Two theorems of Alperin-Goldschmidt type are proved here. Both are needed in applications.The following is an exact analog of the Alperin-Goldschmidt Fusion Theorem for groups of finite Morley rank, in the case of 2-elements:Theorem 1.1.Let G be a group of finite Morley rank, and P a Sylow2-subgroup of G.If A, B⊆P are conjugate in G, then there are subgroups Hi≤Pand elementsxi∈N(Hi)for1 ≤i≤n,and an elementy∈N(P),such that for all i:1.Hiis a tame intersection of two Sylow2-subgroups;2.CP(Hi) ≤Hi;3.N(Hi)/Hiis2-isolatedand(a)(b). (shrink)

In this paper, we present an intensive investigation of the finite volume method compared to the finite difference methods. In order to show the main difference in the way of approaching the solution, we take the Burgers equation and the Buckley–Leverett equation as examples to simulate the previously mentioned methods. On the one hand, we simulate the results of the finite difference methods using the schemes of Lax–Friedrichs and Lax–Wendroff. On the other hand, we apply Godunov’s scheme (...) to simulate the results of the finite volume method. Moreover, we show how starting with a variational formulation of the problem, the finite element technique provides piecewise formulations of functions defined by a collection of grid data points, while the finite difference technique begins with a differential formulation of the problem and continues to discretize the derivatives. Finally, some graphical and numerical comparisons are provided to illustrate and corroborate the differences between these two main methods. (shrink)

Quasi-set theory is a ZFU-like axiomatic set theory, which deals with two kinds of ur-elements: M-atoms, objects like the atoms of ZFU, and m-atoms, items for which the usual identity relation is not defined. One of the motivations to advance such a theory is to deal properly with collections of items like particles in non-relativistic quantum mechanics when these are understood as being non-individuals in the sense that they may be indistinguishable although identity does not apply to them. According (...) to some authors, this is the best way to understand quantum objects. The fact that identity is not defined for m-atoms raises a technical difficulty: it seems impossible to follow the usual procedures to define the cardinal of collections involving these items. In this paper we propose a definition of finite cardinals in quasi-set theory which works for collections involving m-atoms. (shrink)

We present a necessary and sufficient condition for the embeddability of a finite principally decomposable lattice into the computably enumerable degrees preserving greatest element.

The variety of Heyting algebras has two well-behaved locally finite reducts, the variety of bounded distributive lattices and the variety of implicative semilattices. The variety of bounded distributive lattices is generated by the →-free reducts of Heyting algebras, while the variety of implicative semilattices is generated by the ∨-free reducts. Each of these reducts gives rise to canonical formulas that generalize Jankov formulas and provide an axiomatization of all superintuitionistic logics. The ∨-free reducts of Heyting algebras give rise to (...) the -canonical formulas that we studied in an earlier work. Here we introduce the -canonical formulas, which are obtained from the study of the →-free reducts of Heyting algebras. We prove that every si-logic is axiomatizable by -canonical formulas. We also discuss the similarities and differences between these two kinds of canonical formulas. One of the main ingredients of these formulas is a designated subset D of pairs of elements of a finite subdirectly irreducible Heyting algebra A. When D=A2, we show that the -canonical formula of A is equivalent to the Jankov formula of A. On the other hand, when D=∅, the -canonical formulas produce a new class of si-logics we term stable si-logics. We prove that there are continuum many stable si-logics and that all stable si-logics have the finite model property. We also compare stable si-logics to splitting and subframe si-logics. (shrink)

We study properties of certain subclasses of the Dedekind finite sets in set theory without the axiom of choice with respect to the comparability of their elements and to the boundedness of such classes, and we answer related open problems from Herrlich’s “The Finite and the Infinite.” The main results are as follows: 1. It is relatively consistent with ZF that the class of all finite sets is not the only finiteness class such that any two (...) of its elements are comparable. 2. The principle “Small Violations of Choice” —introduced by A. Blass—implies that the class of all Dedekind finite sets is bounded above. 3. “The class of all Dedekind finite sets is bounded above” is true in every permutation model of ZFA in which the class of atoms is a set, and in every symmetric model of ZF. 4. There exists a model of ZFA set theory in which the class of all atoms is a proper class and in which the class of all infinite Dedekind finite sets is not bounded above. 5. There exists a model of ZF in which the class of all infinite Dedekind finite sets is not bounded above. (shrink)

This article introduces the notion of duplex elements of the finite rings and corresponding neutrosophic rings. The authors establish duplex ring Dup(R) and neutrosophic duplex ring Dup(R)I)) by way of various illustrations. The tables of different duplicities are constructed to reveal the comparison between rings Dup(Zn), Dup(Dup(Zn)) and Dup(Dup(Dup(Zn ))) for the cyclic ring Zn . The proposed duplicity structures have several algebraic systems with dissimilar consequences. Author’s characterize finite rings with R + R is different from (...) the duplex ring Dup(R). However, this characterization supports that R + R = Dup(R) for some well known rings, namely zero rings and finite fields. (shrink)

We define a property for varieties V, the f.r.p. . If it applies to a finitely based V then V is strongly finitely based in the sense of [14], see Theorem 2. Moreover, we obtain finite axiomatizability results for certain propositional logics associated with V, in its generality comparable to well-known finite base results from equational logic. Theorem 3 states that each variety generated by a 2-element algebra has the f.r.p. Essentially this implies finite axiomatizability of a (...) 2-valued logic in any finite language. (shrink)

We explore a network architecture introduced by Elman (1988) for predicting successive elements of a sequence. The network uses the pattern of activation over a set of hidden units from time-step 25-1, together with element t, to predict element t + 1. When the network is trained with strings from a particular finite-state grammar, it can learn to be a perfect finite-state recognizer for the grammar. When the network has a minimal number of hidden units, patterns on (...) the hidden units come to correspond to the nodes of the grammar, although this correspondence is not necessary for the network to act as a perfect finite-state recognizer. We explore the conditions under which the network can carry information about distant sequential contingencies across intervening elements. Such information is maintained with relative ease if it is.. (shrink)

We introduce insertion domains that support the placement of new, higher, vertices into finite trees. We prove that every nonincreasing insertion domain has an element with simple structural properties in the style of classical Ramsey theory. This result is proved using standard large cardinal axioms that go well beyond the usual axioms for mathematics. We also establish that this result cannot be proved without these large cardinal axioms. We also introduce insertion rules that specify the placement of new, higher, (...) vertices into finite trees. We prove that every insertion rule greedily generates a tree with these same structural properties; and every decreasing insertion rule generates (or admits) a tree with these same structural properties. It is also necessary and sufficient to use the same large cardinals (in the precise sense of Corollary D.25). The results suggest new areas of research in discrete mathematics called "Ramsey tree theory" and "greedy Ramsey theory" which demonstrably require more than the usual axioms for mathematics. (shrink)

We continue the exploration of various aspects of divisibility of ultrafilters, adding one more relation to the picture: multiplicative finite embeddability. We show that it lies between divisibility relations \ and \. The set of its minimal elements proves to be very rich, and the \-hierarchy is used to get a better intuition of this richness. We find the place of the set of \-maximal ultrafilters among some known families of ultrafilters. Finally, we introduce new notions of largeness (...) of subsets of \, and compare it to other such notions, important for infinite combinatorics and topological dynamics. (shrink)

By operations on models we show how to relate completeness with respect to permissivenominal models to completeness with respect to nominal models with finite support. Models with finite support are a special case of permissive-nominal models, so the construction hinges on generating from an instance of the latter, some instance of the former in which sufficiently many inequalities are preserved between elements. We do this using an infinite generalisation of nominal atoms-abstraction. The results are of interest in (...) their own right, but also, we factor the mathematics so as to maximise the chances that it could be used off-the-shelf for other nominal reasoning systems too. Models with infinite support can be easier to work with, so it is useful to have a semi-automatic theorem to transfer results from classes of infinitely-supported nominal models to the more restricted class of models with finite support. In conclusion, we consider different permissive-nominal syntaxes and nominal models and discuss how they relate to the results proved here. (shrink)

The aim of this paper is to give, using the Kripke semantics for intuitionism, a representation of finitely generated free Heyting algebras. By means of the representation we determine in a constructive way some set of "special elements" of such algebras. Furthermore, we show that many algebraic properties which are satisfied by the free algebra on one generator are not satisfied by free algebras on more than one generator.

A cutset of H is a subset of ∪ H which meets every element of H.H has the finite cutset property if every cutset of H contains a finite one. We study this notion, and in particular how it is related to the compactness of H for the natural topology. MSC: 04A20, 54D30.

We compare diverse degrees of compactness and finiteness in Boolean algebras with each other and investigate the influence of weak choice principles. Our arguments rely on a discussion of infinitary distributive laws and generalized prime elements in Boolean algebras. In ZF set theory without choice, a Boolean algebra is Dedekind finite if and only if it satisfies the ascending chain condition. The Denumerable Subset Axiom implies finiteness of Boolean algebras with compact top, whereas the converse fails in ZF. (...) Moreover, we derive from DS the atomicity of continuous Boolean algebras. Some of the results extend to more general structures like pseudocomplemented semilattices. (shrink)