{"type":"review","date_created":"2020-08-26T11:39:30Z","date_updated":"2024-06-19T16:54:28Z","language":[{"iso":"ger"}],"extern":"1","department":[{"_id":"520"}],"status":"public","author":[{"id":"391","first_name":"Volker","last_name":"Peckhaus","full_name":"Peckhaus, Volker"}],"oa":"1","publication":"zbMATH Open, Zbl. 0942.03002","user_id":"391","main_file_link":[{"open_access":"1","url":"https://zbmath.org/0942.03003"}],"year":"2000","_id":"18358","citation":{"short":"V. Peckhaus, zbMATH Open, Zbl. 0942.03002 (2000).","chicago":"Peckhaus, Volker. “Zach, Richard, ‘Completeness before Post: Bernays, Hilbert, and the Development of Propositional Logic’, Bulletin of Symbolic Logic 5 (1999), 331–366.” <i>zbMATH Open, Zbl. 0942.03002</i>, 2000.","apa":"Peckhaus, V. (2000). Zach, Richard, “Completeness before Post: Bernays, Hilbert, and the Development of Propositional Logic”, Bulletin of Symbolic Logic 5 (1999), 331–366. In <i>zbMATH Open, Zbl. 0942.03002</i>.","ama":"Peckhaus V. Zach, Richard, “Completeness before Post: Bernays, Hilbert, and the Development of Propositional Logic”, Bulletin of Symbolic Logic 5 (1999), 331–366. <i>zbMATH Open, Zbl 094203002</i>. Published online 2000.","mla":"Peckhaus, Volker. “Zach, Richard, ‘Completeness before Post: Bernays, Hilbert, and the Development of Propositional Logic’, Bulletin of Symbolic Logic 5 (1999), 331–366.” <i>zbMATH Open, Zbl. 0942.03002</i>, 2000.","ieee":"V. Peckhaus, “Zach, Richard, ‘Completeness before Post: Bernays, Hilbert, and the Development of Propositional Logic’, Bulletin of Symbolic Logic 5 (1999), 331–366,” <i>zbMATH Open, Zbl. 0942.03002</i>. 2000.","bibtex":"@article{Peckhaus_2000, title={Zach, Richard, “Completeness before Post: Bernays, Hilbert, and the Development of Propositional Logic”, Bulletin of Symbolic Logic 5 (1999), 331–366}, journal={zbMATH Open, Zbl. 0942.03002}, author={Peckhaus, Volker}, year={2000} }"},"title":"Zach, Richard, “Completeness before Post: Bernays, Hilbert, and the Development of Propositional Logic”, Bulletin of Symbolic Logic 5 (1999), 331–366"}