O software MAXIMA aplicado ao cálculo diferencial

Pós-graduação em Matemática Universitária - IGCE

A Direct Algorithm for the Type Interference in the Rank 2 Fragment of the Second--Order λ-Calculus

We study the problem of type inference for a family of polymorphic type disciplines containing the power of Core-ML. This family comprises all levels of the stratification of the second-order lambda-calculus by "rank" of types. We show that typability is an undecidable problem at every rank k ≥ 3 of this stratification. While it was already known that typability is decidable at rank ≤ 2, no direct and easy-to-implement algorithm was available. To design such an algorithm, we develop a new notion of reduction and show how to use it to reduce the problem of typability at rank 2 to the problem of acyclic semi-unification. A by-product of our analysis is the publication of a simple solution procedure for acyclic semi-unification.

Insight into the fractional calculus via a spreadsheet

Many students of calculus are not aware that the calculus they have learned is a special case (integer order) of fractional calculus. Fractional calculus is the study of arbitrary order derivatives and integrals and their applications. The article begins by stating a naive question from a student in a paper by Larson (1974) and establishes, for polynomials and exponential functions, that they can be deformed into their derivative using the μ-th order fractional derivatives for 0<μ<1. Through the power of Excel we illustrate the continuous deformations dynamically through conditional formatting. Some applications are discussed and a connection made to mathematics education.

Quantum stochastic calculus associated with quadratic quantum noises

We first study a class of fundamental quantum stochastic processes induced by the generators of a six dimensional non-solvable Lie dagger-algebra consisting of all linear combinations of the generalized Gross Laplacian and its adjoint, annihilation operator, creation operator, conservation, and time, and then we study the quantum stochastic integrals associated with the class of fundamental quantum stochastic processes, and the quantum Ito formula is revisited. The existence and uniqueness of solution of a quantum stochastic differential equation is proved. The unitarity conditions of solutions of quantum stochastic differential equations associated with the fundamental processes are examined. The quantum stochastic calculus extends the Hudson-Parthasarathy quantum stochastic calculus. (C) 2016 AIP Publishing LLC.

Typability and Type Checking in the Second-Order Λ-Calculus Are Equivalent and Undecidable (Preliminary Draft)

We consider the problems of typability[1] and type checking[2] in the Girard/Reynolds second-order polymorphic typed λ-calculus, for which we use the short name "System F" and which we use in the "Curry style" where types are assigned to pure λ -terms. These problems have been considered and proven to be decidable or undecidable for various restrictions and extensions of System F and other related systems, and lower-bound complexity results for System F have been achieved, but they have remained "embarrassing open problems"[3] for System F itself. We first prove that type checking in System F is undecidable by a reduction from semi-unification. We then prove typability in System F is undecidable by a reduction from type checking. Since the reverse reduction is already known, this implies the two problems are equivalent. The second reduction uses a novel method of constructing λ-terms such that in all type derivations, specific bound variables must always be assigned a specific type. Using this technique, we can require that specific subterms must be typable using a specific, fixed type assignment in order for the entire term to be typable at all. Any desired type assignment may be simulated. We develop this method, which we call "constants for free", for both the λK and λI calculi.

Kappa calculus and evidential strength: A note on Åqvist's logical theory of legal evidence

Lennart Åqvist (1992) proposed a logical theory of legal evidence, based on the Bolding-Ekelöf of degrees of evidential strength. This paper reformulates Åqvist's model in terms of the probabilistic version of the kappa calculus. Proving its acceptability in the legal context is beyond the present scope, but the epistemological debate about Bayesian Law isclearly relevant. While the present model is a possible link to that lineof inquiry, we offer some considerations about the broader picture of thepotential of AI & Law in the evidentiary context. Whereas probabilisticreasoning is well-researched in AI, calculations about the threshold ofpersuasion in litigation, whatever their value, are just the tip of theiceberg. The bulk of the modeling desiderata is arguably elsewhere, if one isto ideally make the most of AI's distinctive contribution as envisaged forlegal evidence research.

Constructing probabilistic ATMS using extended incidence calculus

This paper discusses the relations between extended incidence calculus and assumption-based truth maintenance systems (ATMSs). We first prove that managing labels for statements (nodes) in an ATMS is equivalent to producing incidence sets of these statements in extended incidence calculus. We then demonstrate that the justification set for a node is functionally equivalent to the implication relation set for the same node in extended incidence calculus. As a consequence, extended incidence calculus can provide justifications for an ATMS, because implication relation sets are discovered by the system automatically. We also show that extended incidence calculus provides a theoretical basis for constructing a probabilistic ATMS by associating proper probability distributions on assumptions. In this way, we can not only produce labels for all nodes in the system, but also calculate the probability of any of such nodes in it. The nogood environments can also be obtained automatically. Therefore, extended incidence calculus and the ATMS are equivalent in carrying out inferences at both the symbolic level and the numerical level. This extends a result due to Laskey and Lehner.

Model categories for orthogonal calculus

We restate the notion of orthogonal calculus in terms of model categories. This provides a cleaner set of results and makes the role of O(n)-equivariance clearer. Thus we develop model structures for the category of n-polynomial and n-homogeneous functors, along with Quillen pairs relating them. We then classify n-homogeneous functors, via a zig-zag of Quillen equivalences, in terms of spectra with an O(n)-action. This improves upon the classification theorem of Weiss. As an application, we develop a variant of orthogonal calculus by replacing topological spaces with orthogonal spectra.

Mathematica in the classroom: new tools for exploring precalculus and differential calculus

Prémio de Melhor Artigo de Jovem Investigador atribuído pela empresa Timberlake, apresentado na 1ª Conferência Nacional sobre Computação Simbólica no Ensino e na Investigação - CSEI2012, que decorreu no IST nos dias 2 e 3 de Abril.

Some pioneers of the applications of fractional calculus

In the last decades fractional calculus (FC) became an area of intensive research and development. This paper goes back and recalls important pioneers that started to apply FC to scientific and engineering problems during the nineteenth and twentieth centuries. Those we present are, in alphabetical order: Niels Abel, Kenneth and Robert Cole, Andrew Gemant, Andrey N. Gerasimov, Oliver Heaviside, Paul Lévy, Rashid Sh. Nigmatullin, Yuri N. Rabotnov, George Scott Blair.

Exercise sheet 2 pdf

Exercises and solutions in PDF

Exercise sheet 2

Exercises and solutions in LaTex

Exercise sheet 2

Exercises and solutions in LaTex

Exercise sheet 2 pdf

Exercises and solutions in PDF

Virtual communities and strategic learning of calculus in enginery. 'Comunidades virtuales y el aprendizaje estratégico de cálculo en ingeniería'.

Resumen basado en el de la publicación