sorear / metamath-turing-machines Goto Github PK

First of all you made a fantastic job. When I eventually I beleve I understood how all worked I was impressed.

I just discovered metamath and I'm not sure I understood the code correctly so the following that I say might be totally wrong.

If I correctly read the code, the current zf.sql verify that a substitution exist which made the hypotheses match the entry of the stack but not that substitution is unique. According to the following quote of the metamath specification, it looks like the uniqueness is necessary.

"If the label refers to an assertion, a (unique) substitution must exist
that, when made to the mandatory hypotheses of the referenced assertion,
causes them to match the topmost (i.e. most recent) entries of the stack, in
order of occurrence of the mandatory hypotheses, with the topmost stack
entry matching the last mandatory hypothesis of the referenced assertion."

Check out this formulation of ZFC:

http://us.metamath.org/mpeuni/mmzfcnd.html

Hello, this is not a real issue but a general question.

Do you have any plan to add 'list' support in NQL recently? If not, I am also interested to add the support myself. I checked http://us.metamath.org but seems there will be years of reading and learning.

So can you give the shortest learning path for a person to develop and extend NQL, assuming this person has good knowledge of python, Turing machine, original lacnoic language, but lack of knowledge of meta math?

Thanks a lot.
Youhua Li