Tautology testing with a generalized matrix reduction method

AbstractA formalization of the tautology problem in terms of matrices is given. From that a generalized matrix reduction method is derived. Its application to a couple of selected examples indicates a relatively efficient behaviour in testing the validity of a given formula in propositional logic—not only for machines but also for humans. A further result from that formalization is a reduction of the tautology problem to a part of Presburger arithmetic which involves formulas of the ∀∃∃⋯∃-type where all quantifiers have finite range

Let's plan it deductively!

AbstractThe paper describes a transition logic, TL, and a deductive formalism for it. It shows how various important aspects (such as ramification, qualification, specificity, simultaneity, indeterminism etc.) involved in planning (or in reasoning about action and causality for that matter) can be modelled in TL in a rather natural way. (The deductive formalism for) TL extends the linear connection method proposed earlier by the author by embedding the latter into classical logic, so that classical and resource-sensitive reasoning coexist within TL. The attraction of a logical and deductive approach to planning is emphasized and the state of automated deduction briefly described

Investigations into Proof Structures

We introduce and elaborate a novel formalism for the manipulation and analysis of proofs as objects in a global manner. In this first approach the formalism is restricted to first-order problems characterized by condensed detachment. It is applied in an exemplary manner to a coherent and comprehensive formal reconstruction and analysis of historical proofs of a widely-studied problem due to {\L}ukasiewicz. The underlying approach opens the door towards new systematic ways of generating lemmas in the course of proof search to the effects of reducing the search effort and finding shorter proofs. Among the numerous reported experiments along this line, a proof of {\L}ukasiewicz's problem was automatically discovered that is much shorter than any proof found before by man or machine.Comment: This article is a continuation of arXiv:2104.1364

A Procedure for 3-D Contact Stress Analysis of Spiral Bevel Gears

Contact stress distribution of spiral bevel gears using nonlinear finite element static analysis is presented. Procedures have been developed to solve the nonlinear equations that identify the gear and pinion surface coordinates based on the kinematics of the cutting process and orientate the pinion and the gear in space to mesh with each other. Contact is simulated by connecting GAP elements along the intersection of a line from each pinion point (parallel to the normal at the contact point) with the gear surface. A three dimensional model with four gear teeth and three pinion teeth is used to determine the contact stresses at two different contact positions in a spiral bevel gearset. A summary of the elliptical contact stress distribution is given. This information will be helpful to helicopter and aircraft transmission designers who need to minimize weight of the transmission and maximize reliability

Lemmas: Generation, Selection, Application

Noting that lemmas are a key feature of mathematics, we engage in an investigation of the role of lemmas in automated theorem proving. The paper describes experiments with a combined system involving learning technology that generates useful lemmas for automated theorem provers, demonstrating improvement for several representative systems and solving a hard problem not solved by any system for twenty years. By focusing on condensed detachment problems we simplify the setting considerably, allowing us to get at the essence of lemmas and their role in proof search

Manual for automatic generation of finite element models of spiral bevel gears in mesh

The goal of this research is to develop computer programs that generate finite element models suitable for doing 3D contact analysis of faced milled spiral bevel gears in mesh. A pinion tooth and a gear tooth are created and put in mesh. There are two programs: Points.f and Pat.f to perform the analysis. Points.f is based on the equation of meshing for spiral bevel gears. It uses machine tool settings to solve for an N x M mesh of points on the four surfaces, pinion concave and convex, and gear concave and convex. Points.f creates the file POINTS.OUT, an ASCI file containing N x M points for each surface. (N is the number of node points along the length of the tooth, and M is nodes along the height.) Pat.f reads POINTS.OUT and creates the file tl.out. Tl.out is a series of PATRAN input commands. In addition to the mesh density on the tooth face, additional user specified variables are the number of finite elements through the thickness, and the number of finite elements along the tooth full fillet. A full fillet is assumed to exist for both the pinion and gear

General Reference

This chapter stands out from the other chapters in this book. Whereas chapters 2-19 are arranged by subject, this one is a general reference resource guide. It includes almanacs, bibliographies, and guides to the literature, biographical sources (formerly a stand-alone chapter), general-purpose databases, and Internet search sites. Library search tools such as discovery layers are also described here. The Internet continues to have a huge impact on reference services. Some of that influence is via search interfaces like Oxford Reference or general databases like Academic Search Complete. It can also be seen with Internet sources that go beyond the library, like Google Search or Facebook. This chapter hopes to guide reference librarians by describing these changes

Comparison of Gap Elements and Contact Algorithm for 3D Contact Analysis of Spiral Bevel Gears

Three dimensional stress analysis of spiral bevel gears in mesh using the finite element method is presented. A finite element model is generated by solving equations that identify tooth surface coordinates. Contact is simulated by the automatic generation of nonpenetration constraints. This method is compared to a finite element contact analysis conducted with gap elements