Stable map theory:
Abstract: "Map theory (MT) is a foundation of mathematics which is based on [lambda]-calculus instead of logic and has at least the same expressive power as ZFC set theory. This paper presents 'stable map theory' which is much easier to learn, teach and comprehend than 'original...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
København
1996
|
Schriftenreihe: | Datalogisk Institut <København>: DIKU-Rapport
1996,10 |
Schlagworte: | |
Zusammenfassung: | Abstract: "Map theory (MT) is a foundation of mathematics which is based on [lambda]-calculus instead of logic and has at least the same expressive power as ZFC set theory. This paper presents 'stable map theory' which is much easier to learn, teach and comprehend than 'original map theory' from 1992. Pedagogical simplicity is important since MT is a candidate for a common foundation of classical mathematics and computer science. MT has the benefit that it allows a complete integration of classical mathematics and computer science. As a particular example, the free mixing of quantification and general recursion has many applications. The long list of well-foundedness axioms in the original version (which corresponds to the list of proper axioms of ZFC) has been replaced by a single definition of 'classicality' in the stable version. Furthermore, the stable version has been enhanced by axioms of stability, minimality of fixed points and a particular kind of extensionality. The stability axiom represents a change of semantics compared to original MT which is why the new version is called 'stable'. The axioms of minimality of fixed points is particularly important since it allows to prove the axiom of transfinite induction in the original version. This paper presents stable MT and develops original MT in it. As a corollary of this development, also ZFC can be developed in stable MT. In addition, the paper presents an extension of the stable version which resembles NBG but is more general. The paper conjectures two specific structures to be models of stable MT. The stable version sheds some light on why it is consistent to allow infinite descending chains of the membership relation in a ZF-style system (as Aczel did in his theory of non-well-founded sets). This is because the Burali-Forti paradox is avoided by 'limitation' rather than 'well- foundedness' as made explicit in the definition of 'classical mathematical object'." |
Beschreibung: | 71 S. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV011072156 | ||
003 | DE-604 | ||
005 | 19970311 | ||
007 | t | ||
008 | 961121s1996 |||| 00||| engod | ||
035 | |a (OCoLC)39041836 | ||
035 | |a (DE-599)BVBBV011072156 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-91G | ||
084 | |a MAT 040f |2 stub | ||
084 | |a DAT 544f |2 stub | ||
100 | 1 | |a Grue, Klaus |e Verfasser |4 aut | |
245 | 1 | 0 | |a Stable map theory |c Klaus Grue |
264 | 1 | |a København |c 1996 | |
300 | |a 71 S. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Datalogisk Institut <København>: DIKU-Rapport |v 1996,10 | |
520 | 3 | |a Abstract: "Map theory (MT) is a foundation of mathematics which is based on [lambda]-calculus instead of logic and has at least the same expressive power as ZFC set theory. This paper presents 'stable map theory' which is much easier to learn, teach and comprehend than 'original map theory' from 1992. Pedagogical simplicity is important since MT is a candidate for a common foundation of classical mathematics and computer science. MT has the benefit that it allows a complete integration of classical mathematics and computer science. As a particular example, the free mixing of quantification and general recursion has many applications. The long list of well-foundedness axioms in the original version (which corresponds to the list of proper axioms of ZFC) has been replaced by a single definition of 'classicality' in the stable version. Furthermore, the stable version has been enhanced by axioms of stability, minimality of fixed points and a particular kind of extensionality. The stability axiom represents a change of semantics compared to original MT which is why the new version is called 'stable'. The axioms of minimality of fixed points is particularly important since it allows to prove the axiom of transfinite induction in the original version. This paper presents stable MT and develops original MT in it. As a corollary of this development, also ZFC can be developed in stable MT. In addition, the paper presents an extension of the stable version which resembles NBG but is more general. The paper conjectures two specific structures to be models of stable MT. The stable version sheds some light on why it is consistent to allow infinite descending chains of the membership relation in a ZF-style system (as Aczel did in his theory of non-well-founded sets). This is because the Burali-Forti paradox is avoided by 'limitation' rather than 'well- foundedness' as made explicit in the definition of 'classical mathematical object'." | |
650 | 4 | |a Lambda calculus | |
650 | 4 | |a Mappings (Mathematics) | |
830 | 0 | |a Datalogisk Institut <København>: DIKU-Rapport |v 1996,10 |w (DE-604)BV010011493 |9 1996,10 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-007416548 |
Datensatz im Suchindex
_version_ | 1804125562334085120 |
---|---|
any_adam_object | |
author | Grue, Klaus |
author_facet | Grue, Klaus |
author_role | aut |
author_sort | Grue, Klaus |
author_variant | k g kg |
building | Verbundindex |
bvnumber | BV011072156 |
classification_tum | MAT 040f DAT 544f |
ctrlnum | (OCoLC)39041836 (DE-599)BVBBV011072156 |
discipline | Informatik Mathematik |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02882nam a2200325 cb4500</leader><controlfield tag="001">BV011072156</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19970311 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">961121s1996 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)39041836</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011072156</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 040f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 544f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Grue, Klaus</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Stable map theory</subfield><subfield code="c">Klaus Grue</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">København</subfield><subfield code="c">1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">71 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Datalogisk Institut <København>: DIKU-Rapport</subfield><subfield code="v">1996,10</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Map theory (MT) is a foundation of mathematics which is based on [lambda]-calculus instead of logic and has at least the same expressive power as ZFC set theory. This paper presents 'stable map theory' which is much easier to learn, teach and comprehend than 'original map theory' from 1992. Pedagogical simplicity is important since MT is a candidate for a common foundation of classical mathematics and computer science. MT has the benefit that it allows a complete integration of classical mathematics and computer science. As a particular example, the free mixing of quantification and general recursion has many applications. The long list of well-foundedness axioms in the original version (which corresponds to the list of proper axioms of ZFC) has been replaced by a single definition of 'classicality' in the stable version. Furthermore, the stable version has been enhanced by axioms of stability, minimality of fixed points and a particular kind of extensionality. The stability axiom represents a change of semantics compared to original MT which is why the new version is called 'stable'. The axioms of minimality of fixed points is particularly important since it allows to prove the axiom of transfinite induction in the original version. This paper presents stable MT and develops original MT in it. As a corollary of this development, also ZFC can be developed in stable MT. In addition, the paper presents an extension of the stable version which resembles NBG but is more general. The paper conjectures two specific structures to be models of stable MT. The stable version sheds some light on why it is consistent to allow infinite descending chains of the membership relation in a ZF-style system (as Aczel did in his theory of non-well-founded sets). This is because the Burali-Forti paradox is avoided by 'limitation' rather than 'well- foundedness' as made explicit in the definition of 'classical mathematical object'."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Lambda calculus</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mappings (Mathematics)</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Datalogisk Institut <København>: DIKU-Rapport</subfield><subfield code="v">1996,10</subfield><subfield code="w">(DE-604)BV010011493</subfield><subfield code="9">1996,10</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007416548</subfield></datafield></record></collection> |
id | DE-604.BV011072156 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T18:03:32Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007416548 |
oclc_num | 39041836 |
open_access_boolean | |
owner | DE-91G DE-BY-TUM |
owner_facet | DE-91G DE-BY-TUM |
physical | 71 S. |
publishDate | 1996 |
publishDateSearch | 1996 |
publishDateSort | 1996 |
record_format | marc |
series | Datalogisk Institut <København>: DIKU-Rapport |
series2 | Datalogisk Institut <København>: DIKU-Rapport |
spelling | Grue, Klaus Verfasser aut Stable map theory Klaus Grue København 1996 71 S. txt rdacontent n rdamedia nc rdacarrier Datalogisk Institut <København>: DIKU-Rapport 1996,10 Abstract: "Map theory (MT) is a foundation of mathematics which is based on [lambda]-calculus instead of logic and has at least the same expressive power as ZFC set theory. This paper presents 'stable map theory' which is much easier to learn, teach and comprehend than 'original map theory' from 1992. Pedagogical simplicity is important since MT is a candidate for a common foundation of classical mathematics and computer science. MT has the benefit that it allows a complete integration of classical mathematics and computer science. As a particular example, the free mixing of quantification and general recursion has many applications. The long list of well-foundedness axioms in the original version (which corresponds to the list of proper axioms of ZFC) has been replaced by a single definition of 'classicality' in the stable version. Furthermore, the stable version has been enhanced by axioms of stability, minimality of fixed points and a particular kind of extensionality. The stability axiom represents a change of semantics compared to original MT which is why the new version is called 'stable'. The axioms of minimality of fixed points is particularly important since it allows to prove the axiom of transfinite induction in the original version. This paper presents stable MT and develops original MT in it. As a corollary of this development, also ZFC can be developed in stable MT. In addition, the paper presents an extension of the stable version which resembles NBG but is more general. The paper conjectures two specific structures to be models of stable MT. The stable version sheds some light on why it is consistent to allow infinite descending chains of the membership relation in a ZF-style system (as Aczel did in his theory of non-well-founded sets). This is because the Burali-Forti paradox is avoided by 'limitation' rather than 'well- foundedness' as made explicit in the definition of 'classical mathematical object'." Lambda calculus Mappings (Mathematics) Datalogisk Institut <København>: DIKU-Rapport 1996,10 (DE-604)BV010011493 1996,10 |
spellingShingle | Grue, Klaus Stable map theory Datalogisk Institut <København>: DIKU-Rapport Lambda calculus Mappings (Mathematics) |
title | Stable map theory |
title_auth | Stable map theory |
title_exact_search | Stable map theory |
title_full | Stable map theory Klaus Grue |
title_fullStr | Stable map theory Klaus Grue |
title_full_unstemmed | Stable map theory Klaus Grue |
title_short | Stable map theory |
title_sort | stable map theory |
topic | Lambda calculus Mappings (Mathematics) |
topic_facet | Lambda calculus Mappings (Mathematics) |
volume_link | (DE-604)BV010011493 |
work_keys_str_mv | AT grueklaus stablemaptheory |