| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2024-08-27 | ambigus parse fix. The proof goal must be changed, | Simon-Kor | |
| since now some could define a function with overlapping and worng subdomains | |||
| 2024-08-27 | Experimental working commit, programm will compile | Simon-Kor | |
| But the Proof that the domain of the local function is not right. Also if in the definition of our local function we just use f(x) = x then we get a technical ambigus parse | |||
| 2024-08-26 | Implemented the checking for local functions. | Simon-Kor | |
| 2024-08-26 | Non finished attemped to translate a local | Simon-Kor | |
| function defintion from abstract to internal | |||
| 2024-08-26 | I implemented a parsing rule in concrete.hs | Simon-Kor | |
| for local functions and a abstract type in abstract.hs for the proof data structure. | |||
| 2024-08-24 | First atemped to write a new way of local function defintion | Simon-Kor | |
| 2024-08-24 | hlint suggestion | Simon-Kor | |
| 2024-08-24 | Added/Fixed comments | Simon-Kor | |
| 2024-08-24 | naproch sty extension | Simon-Kor | |
| 2024-08-14 | some wishes for NaprocheZF | Simon-Kor | |
| 2024-08-14 | The added proposition and definition should have | Simon-Kor | |
| resloved some proofing complications, but they can prove flase together with lemmas about ordinal, the exat lemma are in urysohn.tex at line 522. | |||
| 2024-08-13 | less urysohn | Simon-Kor | |
| 2024-08-12 | way way way way more urysohn | Simon-Kor | |
| 2024-08-12 | way way way more urysohn | Simon-Kor | |
| 2024-08-12 | way way more urysohn | Simon-Kor | |
| 2024-08-12 | way more urysohn | Simon-Kor | |
| 2024-08-12 | Completed the structure of the proof of Urysohn. | Simon-Kor | |
| Now every single step has to be proven. | |||
| 2024-08-12 | more more way more urysohn | Simon-Kor | |
| 2024-08-11 | more more more urysohn | Simon-Kor | |
| 2024-08-10 | more more urysohn | Simon-Kor | |
| 2024-08-10 | more urysohn | Simon-Kor | |
| 2024-08-10 | more ur<sohn | Simon-Kor | |
| 2024-08-09 | fixed axiomatic error | Simon-Kor | |
| 2024-08-09 | put cardinalit to the right place | Simon-Kor | |
| 2024-08-07 | Created first urysohn formalization | Simon-Kor | |
| 2024-07-23 | Formatting | adelon | |
| 2024-07-23 | Update prover answer prefixes | adelon | |
| 2024-07-23 | Update readme.md | adelon | |
| 2024-07-21 | Further Formalisation on numbers | Simon-Kor | |
| 2024-07-06 | Formalisation of rationals. | Simon-Kor | |
| 2024-07-06 | Formalisation of integers. | Simon-Kor | |
| 2024-07-06 | Finished the formalization of naturals. | Simon-Kor | |
| 2024-07-05 | Proof of 1 is identity on the naturals and begin | Simon-Kor | |
| of Disstributiv law naturals proof | |||
| 2024-07-02 | Further Formalisation of naturals. | Simon-Kor | |
| Such as induction on naturals and addition laws. | |||
| 2024-07-02 | Definition and axioms of naturals. | Simon-Kor | |
| 2024-06-26 | Merge remote-tracking branch 'upstream/main' into formalisation_numbers | Simon-Kor | |
| 2024-06-26 | update gitigonre | Simon-Kor | |
| 2024-06-26 | Working at the numbers.tex | Simon-Kor | |
| 2024-06-25 | Add `\neg` | adelon | |
| 2024-06-25 | Update equivalence.tex | adelon | |
| 2024-06-25 | [Stable] Implented continuous.tex and omitted some proves | Simon-Kor | |
| All changes till here are done such that the check of everything.tex will be a success. There are no logic flaws and false can't be proven with everything out of everthing.tex | |||
| 2024-06-25 | Improvement for the ATP proof time | Simon-Kor | |
| 2024-06-25 | Improvement for the ATP proof time | Simon-Kor | |
| 2024-06-25 | Sorted the structure of numbers.tex | Simon-Kor | |
| 2024-06-25 | definition of equivalence_from_partition can proof false in everything.tex | Simon-Kor | |
| 2024-06-20 | [Stable] Topologgical-space.tex | Simon-Kor | |
| 2024-06-20 | [Report] Task failed and was proven in the same time. | Simon-Kor | |
| The Line 182 has the goal to apply regular in a topological space. But if i try to prove it with Naproche ZF, then the task will be proven and the task fails in the same time. Console Output is the following: time stack exec zf -- --log library/topology/separation.tex -t 30 --dump ./dump [Info] 00:00.11 fof(eqvilance_teethree_closed_neighbourhood_in_open,conjecture,elem(fx,fB)&subseteq(fB,setminus(s__carrier(fX),fA))&subseteq(setminus(s__carrier(fX),fA),fU)). [Info] 00:00.11 fof(eqvilance_teethree_closed_neighbourhood_in_open,conjecture,setminus(s__carrier(fX),setminus(s__carrier(fX),fU))=fU). [Info] 00:00.11 fof(eqvilance_teethree_closed_neighbourhood_in_open,conjecture,?[XN]:(elem(XN,neighbourhoods(fx,fX))&subseteq(XN,fU)&is_closed_in(XN,fX))). [Info] 00:00.21 fof(eqvilance_teethree_closed_neighbourhood_in_open,conjecture,(is_regular(fX)&is_kolmogorov(fX))<=>![XU]:(elem(XU,s__opens(fX))=>![Xx]:(elem(Xx,XU)=>?[XN]:(elem(XN,neighbourhoods(Xx,fX))&subseteq(XN,XU)&is_closed_in(XN,fX))))). [Info] 00:02.34 fof(eqvilance_teethree_closed_neighbourhood_in_open,conjecture,?[XB,XA]:(elem(fx,XB)&subseteq(fC,XA)&inter(XA,XB)=emptyset&elem(XA,s__opens(fX))&elem(XB,s__opens(fX)))). [Info] 00:02.55 fof(eqvilance_teethree_closed_neighbourhood_in_open,conjecture,subseteq(fB,setminus(s__carrier(fX),fA))). [Info] 00:08.11 fof(eqvilance_teethree_closed_neighbourhood_in_open,conjecture,elem(fN,closeds(fX))&elem(fx,fN)&subseteq(fN,fU)). [Info] 00:10.70 fof(eqvilance_teethree_closed_neighbourhood_in_open,conjecture,subseteq(setminus(s__carrier(fX),fA),setminus(s__carrier(fX),setminus(s__carrier(fX),fU)))). [Info] 00:10.98 fof(eqvilance_teethree_closed_neighbourhood_in_open,conjecture,elem(fN,neighbourhoods(fx,fX))). Verification failed: prover found countermodel fof(eqvilance_teethree_closed_neighbourhood_in_open,conjecture,?[XB,XA]:(elem(fx,XB)&subseteq(fC,XA)&inter(XA,XB)=emptyset&elem(XA,s__opens(fX))&elem(XB,s__opens(fX)))).fof(is_regular,axiom,![XX]:(is_regular(XX)<=>![XV]:![Xp,XC]:((elem(Xp,s__carrier(XX))&~elem(Xp,XC)&elem(XC,closeds(XX)))=>?[XU,XC]:(elem(XU,s__opens(XX))&elem(XC,s__opens(XX))&elem(Xp,XU)&subseteq(XC,XV)&inter(XU,XV)=emptyset)))). fof(eqvilance_teethree_closed_neighbourhood_in_open1,axiom,elem(fx,s__carrier(fX))). fof(eqvilance_teethree_closed_neighbourhood_in_open2,axiom,~elem(fx,fC)). fof(eqvilance_teethree_closed_neighbourhood_in_open3,axiom,elem(fC,closeds(fX))). fof(eqvilance_teethree_closed_neighbourhood_in_open4,axiom,fC=setminus(s__carrier(fX),fU)). fof(eqvilance_teethree_closed_neighbourhood_in_open5,axiom,elem(fx,fU)). fof(eqvilance_teethree_closed_neighbourhood_in_open6,axiom,elem(fU,s__opens(fX))). fof(eqvilance_teethree_closed_neighbourhood_in_open7,axiom,is_regular(fX)&is_kolmogorov(fX)). fof(eqvilance_teethree_closed_neighbourhood_in_open8,axiom,inhabited(fX)). fof(eqvilance_teethree_closed_neighbourhood_in_open9,axiom,topological_space(fX)). real 0m14.914s user 0m37.867s sys 0m1.956s | |||
| 2024-06-18 | Merge remote-tracking branch 'upstream/main' | Simon-Kor | |
| 2024-06-18 | Definition of T3 and regular spaces. | Simon-Kor | |
| 2024-06-18 | Update topological-space.tex | adelon | |
