Pseudo-Hierarchies in Admissible Set Theory without Foundation and Explicit Mathematics. Probst, D. Ph.D. Thesis, Universität Bern, Institut für Informatik und angewandte Mathematik, 2005. Paper bibtex @PhdThesis{pro05b,
Author = {Dieter Probst},
Title = {Pseudo-Hierarchies in Admissible Set Theory without
Foundation and Explicit Mathematics},
School = {Universit{\"a}t Bern},
Address = {Institut f{\"u}r Informatik und angewandte Mathematik},
url = {2005/pro05b.pdf},
year = 2005
}
Downloads: 0
{"_id":"yeW6uMPp977rf3F32","bibbaseid":"probst-pseudohierarchiesinadmissiblesettheorywithoutfoundationandexplicitmathematics-2005","authorIDs":[],"author_short":["Probst, D."],"bibdata":{"bibtype":"phdthesis","type":"phdthesis","author":[{"firstnames":["Dieter"],"propositions":[],"lastnames":["Probst"],"suffixes":[]}],"title":"Pseudo-Hierarchies in Admissible Set Theory without Foundation and Explicit Mathematics","school":"Universität Bern","address":"Institut für Informatik und angewandte Mathematik","url":"2005/pro05b.pdf","year":"2005","bibtex":"@PhdThesis{pro05b,\n Author = {Dieter Probst},\n Title = {Pseudo-Hierarchies in Admissible Set Theory without\n Foundation and Explicit Mathematics},\n School = {Universit{\\\"a}t Bern},\n Address = {Institut f{\\\"u}r Informatik und angewandte Mathematik},\n url = {2005/pro05b.pdf},\n year = 2005\n}\n\n","author_short":["Probst, D."],"key":"pro05b","id":"pro05b","bibbaseid":"probst-pseudohierarchiesinadmissiblesettheorywithoutfoundationandexplicitmathematics-2005","role":"author","urls":{"Paper":"http://home.inf.unibe.ch/~brambi/2005/pro05b.pdf"},"downloads":0},"bibtype":"phdthesis","biburl":"http://home.inf.unibe.ch/~brambi/ltg.bib","creationDate":"2020-02-26T09:06:59.031Z","downloads":0,"keywords":[],"search_terms":["pseudo","hierarchies","admissible","set","theory","without","foundation","explicit","mathematics","probst"],"title":"Pseudo-Hierarchies in Admissible Set Theory without Foundation and Explicit Mathematics","year":2005,"dataSources":["jFQMeatnEb8qn3qdH"]}