| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2024-09-03 | Finished induction begin | Simon-Kor | |
| 2024-09-03 | Inculde hot fix in working branch | Simon-Kor | |
| Merge branch 'feature_function_definitions' into formalisation_numbers | |||
| 2024-09-03 | Hot fix | Simon-Kor | |
| Hot Fix for the wrong Asumtion creation. Now the function will have a image. | |||
| 2024-09-02 | working commit | Simon-Kor | |
| 2024-09-02 | working commit | Simon-Kor | |
| 2024-09-02 | Corrected Contradiction. | Simon-Kor | |
| Contradiction was due to a misstake in the definition in sequence. | |||
| 2024-08-31 | Contradiction in sequence | Simon-Kor | |
| False can be proven with iff_sequence, codom_of_emptyset_can_be_anything,sequence, emptyset_is_function_on_emptyset,id_dom,in_irrefl, suc_subseteq_implies_in,emptyset_subseteq | |||
| 2024-08-31 | working commit | Simon-Kor | |
| 2024-08-30 | working commit | Simon-Kor | |
| 2024-08-29 | working commit | Simon-Kor | |
| 2024-08-28 | working commit | Simon-Kor | |
| 2024-08-27 | working commit | Simon-Kor | |
| 2024-08-27 | Feature Complete | Simon-Kor | |
| Finalised the proof output and goals. The Local Function definition now producces a Function f with the right domain and range, together with the rules presented in cases. Then proof goal of this local definition is set to for all x we have x is element of dom(f) if and only if x is in exactly one of the subdomains. This suffices as welldefindness check on f, besides the right range. Further checks that should be implemented are the correct range of the function. And optional subproof such that the presented goal can be check easily. | |||
| 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 | |
 |
index : naproche-zf.git | |
| Unnamed repository; edit this file 'description' to name the repository. |
| summaryrefslogtreecommitdiff |