TLAPM is the proof manager, the central component of TLAPS. (The other components are the backend provers invoked for actually proving the individual steps.)
Stephan On 25 Apr 2024, at 21:04, marta zhango <martazhango@xxxxxxxxx> wrote:
This is all very confusing, now there is also TLAPM. What is TLAPM ? On Friday, April 26, 2024 at 5:10:55 AM UTC+12 marta zhango wrote:
I would like to make a structured proof of a theorem for humans to read, rather than all the requirements of a proof
system to check. Would the formalised structure constitute a TLA, TLA+, TLA+2 ? Having looked at implementations in Coq, they are almost impossible to decipher if one is not engrossed in programming. At this very moment, all I want
to do is write a more structured proof that one based on prose.
Leslie talks much about the structured proofs of TLA+ for teaching mathematics, rather than its full TLAPS prover.
On Friday, April 26, 2024 at 4:55:24 AM UTC+12 Stephan Merz wrote:
I am getting very confused. About (1) an easy outline of a proof and (2) the complete code for a proof system to check it.
The complete code for checking a proof can be enormously complicated, especially when one has to declare a significant
number of functions and constructs.
of Spivak’s proof. That is not the actual complete code for a proof system to check it, am I right ?
That paper was written before TLAPS was developed, and we never tried to port the example to the prover. For one thing, we do not currently have support for reasoning about real numbers (but this may change, see Gunasekera et al. [1]). As you say, the effort of a machinechecked proof depends a lot on the operations that are involved in the statement. More complex proofs will require a library of definitions and lemmas that establish basic facts of the respective domain. Of course, you can always fake that to a certain extent and just state unproved lemmas (effectively axioms) that you consider to be obvious — as Lamport does in the proof in the paper that you refer to. Now, about comment regarding the proof in Cantor10.tla. Is that the actual complete code for a proof system to check the correctness of the proof ? Or is it a description of the proof.
That is the entire input needed for TLAPS for checking the theorem. Of course, Cantor’s theorem is stated in elementary set theory, so most of the proof is automated. You can look at other examples within the TLAPS distribution to get an idea of what other proofs look like. And there are similar collections for Coq, Isabelle or Lean etc. I want to write some proofs from signal processing that are more formal than the standard way of showing a proof in a textbook, but not as complicated as the complete code required by a proof system. What would you suggest ?
As said above, you’ll have to start building up a collection of elementary facts in order to prove anything meaningful. I cannot tell you whether TLAPS is appropriate or not for what you have in mind. I suggest starting small with one or two proof assistants before deciding if it’s worth the effort. If you do not have any experience with machinechecked proofs, be warned that it can be both superaddictive and involve a steep learning curve.
Stephan
On Friday, April 26, 2024 at 3:46:36 AM UTC+12 Stephan Merz wrote:
The proof appearing at the beginning of appendix B of the paper you point to is checked by TLAPS, cf. also [1] that has 10 different versions of the proof that are all checked by TLAPS. The proof in Cantor10.tla is even more succinct than the one appearing in the paper. For instance, consider the TLA+2 Proof of Cantor’s Theorem ( see first theorem of appendix B in
That would be more suitable than a TLAPS version of it. TLAPS is a translation of a TLA+2 Proof
for checking the proof. In such a description correct ?
As you say, a detailed proof written in a way that enables it to be checked by an automated system
requires substantial effortfrom the user.
For a textbook, an outline of the proof using TLA+2 could be the formal proof. Which can then be
checked out by coding the corresponding instructions for a proof checker.
On Friday, April 26, 2024 at 2:20:42 AM UTC+12 Stephan Merz wrote:
Could you elaborate on what you mean by referring to TLA as a way to outline a proof? TLA stands for Temporal Logic of Actions, so it is a logic rather than a proof system – although the TLA paper [1] includes proof rules that can be (mainly) used in paperandpencil proofs.
Like Coq and Lean, TLAPS is a mechanical proof assistant that allows you to write a detailed proof and have it checked by the system. These tools indeed require substantial effort from the user, but unlike model checkers such as TLC they can (in principle) verify correctness properties for arbitrary specifications, not only finitestate systems.
Stephan
There seems to exist a big difference between TLA and TLAPIS. TLA is a way to outline a proof, whilst TLAPIS, Coq, Lean provide ways to check whether a proof is correct. With the proof checkers being quite long and time consuming to construct.
In this correct ?
 You received this message because you are subscribed to the Google Groups "tlaplus" group. To unsubscribe from this group and stop receiving emails from it, send an email to tlaplus+u...@xxxxxxxxxxxxxxxx.
 You received this message because you are subscribed to the Google Groups "tlaplus" group. To unsubscribe from this group and stop receiving emails from it, send an email to tlaplus+u...@xxxxxxxxxxxxxxxx.
 You received this message because you are subscribed to the Google Groups "tlaplus" group.To unsubscribe from this group and stop receiving emails from it, send an email to tlaplus+unsubscribe@xxxxxxxxxxxxxxxx.To view this discussion on the web visit https://groups.google.com/d/msgid/tlaplus/95b0937e361c4d2999e660f5924d3ee7n%40googlegroups.com.

You received this message because you are subscribed to the Google Groups "tlaplus" group.
To unsubscribe from this group and stop receiving emails from it, send an email to tlaplus+unsubscribe@xxxxxxxxxxxxxxxx.
To view this discussion on the web visit https://groups.google.com/d/msgid/tlaplus/489B9BB5D92847E2BC3A2331D4297E09%40gmail.com.
