8,727 research outputs found
Tool support for reasoning in display calculi
We present a tool for reasoning in and about propositional sequent calculi.
One aim is to support reasoning in calculi that contain a hundred rules or
more, so that even relatively small pen and paper derivations become tedious
and error prone. As an example, we implement the display calculus D.EAK of
dynamic epistemic logic. Second, we provide embeddings of the calculus in the
theorem prover Isabelle for formalising proofs about D.EAK. As a case study we
show that the solution of the muddy children puzzle is derivable for any number
of muddy children. Third, there is a set of meta-tools, that allows us to adapt
the tool for a wide variety of user defined calculi
Univalent Foundations and the UniMath Library
We give a concise presentation of the Univalent Foundations of mathematics outlining the main ideas, followed by a discussion of the UniMath library of formalized mathematics implementing the ideas of the Univalent Foundations (section 1), and the challenges one faces in attempting to design a large-scale library of formalized mathematics (section 2). This leads us to a general discussion about the links between architecture and mathematics where a meeting of minds is revealed between architects and mathematicians (section 3). On the way our odyssey from the foundations to the "horizon" of mathematics will lead us to meet the mathematicians David Hilbert and Nicolas Bourbaki as well as the architect Christopher Alexander
A Measure Theoretic Approach to Problems of Number Theory with Applications to the Proof of the Prime Number Theorem
In this paper we demonstrate how the principles of measure theory can be applied effectively to problems of number theory. Initially, necessary concepts from number theory will be presented. Next, we state standard concepts and results from measure theory to which we will need to refer. We then develop our repertoire of measure theoretic machinery by constructing the needed measures and defining a generalized version of the multiplicative convolution of measures. A suitable integration by parts formula, one that is general enough to handle various combinations of measures, will then be derived. At this juncture we will be ready to demonstrate the effectiveness of measure theory tactics on number theory problems. Specifically, due to its highly receptive nature to measure theoretic techniques, the prime number theorem will be proved. First, we prove the theorem by what is termed an elementary method. Secondly, the Riemann zeta function is employed to enable us to give a much shorter proof. In both cases, we borrow the ideas from several sources and apply them to our proofs. The approach taken in this paper, however, is distinctive in the sense that the driving force of the proofs is measure theory. Although there is greater overhead in learning the appropriate material used in this approach, we argue that once this material is understood it can be beneficially applied to problems of suitable complexity
- …