INTEGRAL FUNCTIONALS ON C*-ALGEBRA OF VECTOR-VALUED REGULATED FUNCTIONS

In this paper we deal with the notion of regulated functions with values in a C*-algebra A and present examples using a special bi-dimensional C*-algebra of triangular matrices. We consider the Dushnik integral for these functions and shows that a convenient choice of the integrator function produces an integral homomorphism on the C*-algebra of all regulated functions ([a, b], A). Finally we construct a family of linear integral functionals on this C*-algebra.

Dynamical algebra of quasi-exactly-solvable potentials

We show that by using second-order differential operators as a realization of the so(2,1) Lie algebra, we can extend the class of quasi-exactly-solvable potentials with dynamical symmetries. As an example, we dynamically generate a potential of tenth power, which has been treated in the literature using other approaches, and discuss its relation with other potentials of lowest orders. The question of solvability is also studied. © 1991 The American Physical Society.

Theoretical and implementation aspects in the mechanization of the metatheory of programming languages

Interactive theorem provers are tools designed for the certification of formal proofs developed by means of man-machine collaboration. Formal proofs obtained in this way cover a large variety of logical theories, ranging from the branches of mainstream mathematics, to the field of software verification. The border between these two worlds is marked by results in theoretical computer science and proofs related to the metatheory of programming languages. This last field, which is an obvious application of interactive theorem proving, poses nonetheless a serious challenge to the users of such tools, due both to the particularly structured way in which these proofs are constructed, and to difficulties related to the management of notions typical of programming languages like variable binding. This thesis is composed of two parts, discussing our experience in the development of the Matita interactive theorem prover and its use in the mechanization of the metatheory of programming languages. More specifically, part I covers: - the results of our effort in providing a better framework for the development of tactics for Matita, in order to make their implementation and debugging easier, also resulting in a much clearer code; - a discussion of the implementation of two tactics, providing infrastructure for the unification of constructor forms and the inversion of inductive predicates; we point out interactions between induction and inversion and provide an advancement over the state of the art. In the second part of the thesis, we focus on aspects related to the formalization of programming languages. We describe two works of ours: - a discussion of basic issues we encountered in our formalizations of part 1A of the Poplmark challenge, where we apply the extended inversion principles we implemented for Matita; - a formalization of an algebraic logical framework, posing more complex challenges, including multiple binding and a form of hereditary substitution; this work adopts, for the encoding of binding, an extension of Masahiko Sato's canonical locally named representation we designed during our visit to the Laboratory for Foundations of Computer Science at the University of Edinburgh, under the supervision of Randy Pollack.

Algebra of Classical Theoretical Term Reductions in the Sciences

An elementary algebra identifies conceptual and corresponding applicational limitations in John Kemeny and Paul Oppenheim’s (K-O) 1956 model of theoretical reduction in the sciences. The K-O model was once widely accepted, at least in spirit, but seems afterward to have been discredited, or in any event superceeded. Today, the K-O reduction model is seldom mentioned, except to clarify when a reduction in the Kemeny-Oppenheim sense is not intended. The present essay takes a fresh look at the basic mathematics of K-O comparative vocabulary theoretical term reductions, from historical and philosophical standpoints, as a contribution to the history of the philosophy of science. The K-O theoretical reduction model qualifies a theory replacement as a successful reduction when preconditions of explanatory adequacy and comparable systematicization are met, and there occur fewer numbers of theoretical terms identified as replicable syntax types in the most economical statement of a theory’s putative propositional truths, as compared with the theoretical term count for the theory it replaces. The challenge to the historical model developed here, to help explain its scope and limitations, involves the potential for equivocal theoretical meanings of multiple theoretical term tokens of the same syntactical type.

A tool assisting teachers in automating the assessment of programming assignments

Automating the assessment of programming assignments brings benefits for both students and teachers, since it helps the formers to gain a timely feedback and releases the latter from tedious tasks. The related literature in the domain has usually focused on the assessment process and the tools required for it, proposing libraries and systems that teachers can use in this process. However, few of them have work rowards reducing the effort and time teacher require to properly set up new assessente processes. This paper describes our experience with the analysis and design of a new tool to support teachers in visually developing automatic grades of programming assignments, introducing the underlying concepts and technologies and presenting the system architecture.

A generator/grader of problems about syntax of programming languages to be used in an automated exam system /

Thesis (M.S.)--University of Illinois at Urbana-Champaign.

An implementation of a system for the formal definition of programming languages /

Originally presented as the author's thesis, University of Illinois at Urbana-Champaign.

Degrees of unsolvability in the theory of programming languages,

Bibliography: p. 120-123.

The algebra of Mohammed ben Musa /

Includes Arabic text and added t.p.: al-Kitab al-mukhtasar fl hisāb al-jabr wa-al-muqābalah.

The algebra of Mohammed ben Musa /

Photocopy. [Ithaca, N.Y. : Cornell University, Photoduplication Service, 1979].

An introduction to the algebra of quantics

Mode of access: Internet.

An introduction to the algebra of quantics,

Mode of access: Internet.

The Automorphism Group of the Free Algebra of Rank Two

The theorem of Czerniakiewicz and Makar-Limanov, that all the automorphisms of a free algebra of rank two are tame is proved here by showing that the group of these automorphisms is the free product of two groups (amalgamating their intersection), the group of all affine automorphisms and the group of all triangular automorphisms. The method consists in finding a bipolar structure. As a consequence every finite subgroup of automorphisms (in characteristic zero) is shown to be conjugate to a group of linear automorphisms.