Related papers: Back to Classics: Teaching Limits Through Infinite…
In this pedagogical text aimed at those wanting to start thinking about or brush up on probabilistic inference, I review the rules by which probability distribution functions can (and cannot) be combined. I connect these rules to the…
The definition of who is or what makes a ``mathematician" is an important and urgent issue to be addressed in the mathematics community. Too often, a narrower definition of who is considered a mathematician (and what is considered…
A comparison of Landin's form of lambda calculus with Church's shows that, independently of the lambda calculus, there exists a mechanism for converting functions with arguments indexed by variables to the usual kind of function where the…
Defeasible rules are used in providing computable representations of legal documents and, more recently, have been suggested as a basis for explainable AI. Such applications draw attention to the scalability of implementations. The…
Researchers have started using LLM agents in place of human subjects in behavioural and political-science experiments, often as a cheaper substitute for laboratory pools. The substitution does not hold up in strategic settings: humans and…
We address the problem of evaluating an $L$-function when only a small number of its Dirichlet coefficients are known. We use the approximate functional equation in a new way and find that is possible to evaluate the $L$-function more…
It is a common knowledge that the integer functions definable in simply typed lambda-calculus are exactly the extended polynomials. This is indeed the case when one interprets integers over the type (p->p)->p->p where p is a base type…
This paper studies the problem of learning computable functions in the limit by extending Gold's inductive inference framework to incorporate \textit{computational observations} and \textit{restricted input sources}. Complimentary to the…
Fuzzy Description Logics (FDLs) are logic-based formalisms used to represent and reason with vague or imprecise knowledge. It has been recently shown that reasoning in most FDLs using truth values from the interval [0,1] becomes undecidable…
We can measure the complexity of a logical formula by counting the number of alternations between existential and universal quantifiers. Suppose that an elementary first-order formula $\varphi$ (in $\mathcal{L}_{\omega,\omega}$) is…
One-loop functions with loop masses larger than external masses and momenta can always be expanded in terms of external masses and momenta. The precision requested for observables determines the number of the expansion terms retained in the…
When teaching an elementary logic course to students who have a general scientific background but have never been exposed to logic, we have to face the problem that the notions of deduction rule and of derivation are completely new to them,…
This paper frames calculus as a global, centuries-long development rather than a subject that began only with Newton and Leibniz. Drawing on ideas from Greek, Indian, Islamic, and later European mathematics, it highlights how concepts like…
Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus involving induction and co-induction. These proof principles…
The Lambek calculus can be considered as a version of non-commutative intuitionistic linear logic. One of the interesting features of the Lambek calculus is the so-called "Lambek's restriction," that is, the antecedent of any provable…
Explicit bounds on the tails of the zeta function $\zeta$ are needed for applications, notably for integrals involving $\zeta$ on vertical lines or other paths going to infinity. Here we bound weighted $L^2$ norms of tails of $\zeta$. Two…
We investigate the possibility of a semantic account of the execution time (i.e. the number of \beta_v-steps leading to the normal form, if any) for the shuffling calculus, an extension of Plotkin's call-by-value {\lambda}-calculus. For…
A first order inference system, called R-calculus, is defined to develop the specifications. It is used to eliminate the laws which is not consistent with the user's requirements. The R-calculus consists of the structural rules, an axiom, a…
We derive the classical limit of quantum mechanics by describing the center of mass of a system constituted by a large number of particles. We will show that in that limit the commutator between the position and velocity of the center of…
In this article we discuss an important students' misconception about derivatives, that the expression of the derivative of the function contains the information as to whether the function is differentiable or not where the expression is…