345 research outputs found
Epistemic systems and Flagg and Friedman's translation
In 1986, Flagg and Friedman \cite{ff} gave an elegant alternative proof of
the faithfulness of G\"{o}del (or Rasiowa-Sikorski) translation
of Heyting arithmetic to Shapiro's epistemic arithmetic . In
\S 2, we shall prove the faithfulness of without using
stability, by introducing another translation from an epistemic system to
corresponding intuitionistic system which we shall call \it the modified
Rasiowa-Sikorski translation\rm . That is, this introduction of the new
translation simplifies the original Flagg and Friedman's proof. In \S 3, we
shall give some applications of the modified one for the disjunction property
() and the numerical existence property () of
Heyting arithmetic. In \S 4, we shall show that epistemic Markov's rule
in is proved via . So and are equivalent. In \S 5, we
shall give some relations among the translations treated in the previous
sections. In \S 6, we shall give an alternative proof of Glivenko's theorem. In
\S 7, we shall propose several(modal-)epistemic versions of Markov's rule for
Horsten's modal-epistemic arithmetic . And, as in \S 4, we shall study
some meta-implications among those versions of Markov's rules in and
one in . Friedman and Sheard gave a modal analogue (i.e.
Theorem in \cite{fs}) of Friedman's theorem (i.e. Theorem 1 in
\cite {friedman}): \it Any recursively enumerable extension of which
has also has \rm . In \S 8, we shall give a proof
of our \it Fundamental Conjecture \rm proposed in Inou\'{e}
\cite{ino90a} as follows: This is a new type of proofs. In \S 9, I
shall give discussions.Comment: 33 page
Making Presentation Math Computable
This Open-Access-book addresses the issue of translating mathematical expressions from LaTeX to the syntax of Computer Algebra Systems (CAS). Over the past decades, especially in the domain of Sciences, Technology, Engineering, and Mathematics (STEM), LaTeX has become the de-facto standard to typeset mathematical formulae in publications. Since scientists are generally required to publish their work, LaTeX has become an integral part of today's publishing workflow. On the other hand, modern research increasingly relies on CAS to simplify, manipulate, compute, and visualize mathematics. However, existing LaTeX import functions in CAS are limited to simple arithmetic expressions and are, therefore, insufficient for most use cases. Consequently, the workflow of experimenting and publishing in the Sciences often includes time-consuming and error-prone manual conversions between presentational LaTeX and computational CAS formats. To address the lack of a reliable and comprehensive translation tool between LaTeX and CAS, this thesis makes the following three contributions. First, it provides an approach to semantically enhance LaTeX expressions with sufficient semantic information for translations into CAS syntaxes. Second, it demonstrates the first context-aware LaTeX to CAS translation framework LaCASt. Third, the thesis provides a novel approach to evaluate the performance for LaTeX to CAS translations on large-scaled datasets with an automatic verification of equations in digital mathematical libraries. This is an open access book
Admissible types-to-PERs relativization in higher-order logic
Relativizing statements in Higher-Order Logic (HOL) from types to sets is useful for improving productivity when working with HOL-based interactive theorem provers such as HOL4, HOL Light and Isabelle/HOL. This paper provides the first comprehensive definition and study of types-to-sets relativization in HOL, done in the more general form of types-to-PERs (partial equivalence relations). We prove that, for a large practical fragment of HOL which includes container types such as datatypes and codatatypes, types-to-PERs relativization is admissible, in that the provability of the original, type-based statement implies the provability of its relativized, PER-based counterpart. Our results also imply the admissibility of a previously proposed axiomatic extension of HOL with local type definitions. We have implemented types-to-PERs relativization as an Isabelle tool that performs relativization of HOL theorems on demand
Formalizing Chemical Physics using the Lean Theorem Prover
Chemical theory can be made more rigorous using the Lean theorem prover, an
interactive theorem prover for complex mathematics. We formalize the Langmuir
and BET theories of adsorption, making each scientific premise clear and every
step of the derivations explicit. Lean's math library, mathlib, provides
formally verified theorems for infinite geometries series, which are central to
BET theory. While writing these proofs, Lean prompts us to include mathematical
constraints that were not originally reported. We also illustrate how Lean
flexibly enables the reuse of proofs that build on more complex theories
through the use of functions, definitions, and structures. Finally, we
construct scientific frameworks for interoperable proofs, by creating
structures for classical thermodynamics and kinematics, using them to formalize
gas law relationships like Boyle's Law and equations of motion underlying
Newtonian mechanics, respectively. This approach can be extended to other
fields, enabling the formalization of rich and complex theories in science and
engineering
- …