{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:14:10Z","timestamp":1725455650593},"publisher-location":"Berlin\/Heidelberg","reference-count":11,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540571841"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0022568","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T06:14:45Z","timestamp":1131862485000},"page":"190-201","source":"Crossref","is-referenced-by-count":0,"title":["A syntactic consistency proof for NaDSet"],"prefix":"10.1007","author":[{"given":"Paul C.","family":"Gilmore","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","unstructured":"Borm, Eric: Interactive Theorem Proving in NaDSet. Dept of Computer Science UBC MSc Thesis. In preparation"},{"key":"22_CR2","volume-title":"Proof Theory and Logical Complexity. Vol. I","author":"J. Girard","year":"1987","unstructured":"Girard, Jean-Yves: Proof Theory and Logical Complexity. Vol. I, Bibliopolis, Napoli (1987)"},{"key":"22_CR3","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1017\/S0022481200031261","volume":"51","author":"P. C. Gilmore","year":"1986","unstructured":"Gilmore, Paul C.: Natural Deduction Based Set Theories: A New Resolution of the Old Paradoxes. J. Symbolic Logic 51 (1986) 393\u2013411","journal-title":"J. Symbolic Logic"},{"key":"22_CR4","unstructured":"Gilmore, Paul C.: How Many Real Numbers are There?. TR89-7, Dept of Computer Science, UBC, revised November 1992. To appear in The Annals of Pure and Applied Logic."},{"key":"22_CR5","unstructured":"Gilmore, Paul C.: The Consistency and Completeness of an Extended NaDSet. TR91-17, Dept of Computer Science, UBC, revised November 1992."},{"key":"22_CR6","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1007\/BF03025253","volume":"15","author":"P. C. Gilmore","year":"1993","unstructured":"Gilmore, Paul C.: Logic, Sets and Mathematics. The Mathematical Intelligencer, 15 (1993) 10\u201319.","journal-title":"The Mathematical Intelligencer"},{"key":"22_CR7","unstructured":"Gilmore, Paul C.: Lecture Notes on NaDSet. In preparation"},{"key":"22_CR8","unstructured":"Gilmore, Paul C., Tsiknis, George K.: Logical Foundations for Programming Semantics. To appear in Theoretical Computer Science"},{"key":"22_CR9","unstructured":"Gilmore, Paul C., Tsiknis, George K.: A Logic for Category Theory. To appear in Theoretical Computer Science"},{"key":"22_CR10","unstructured":"Gilmore, Paul C., Tsiknis, George K.: Formalizations of an Extended NaDSet. TR91-15, Dept of Computer Science, UBC."},{"key":"22_CR11","volume-title":"The Collected Papers of Gerhard Gentzen","author":"M.E. Szabo","year":"1969","unstructured":"Szabo, M.E.: The Collected Papers of Gerhard Gentzen. North-Holland, Amsterdam, London (1969)"}],"container-title":["Lecture Notes in Computer Science","Computational Logic and Proof Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0022568.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:49:04Z","timestamp":1607550544000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0022568"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540571841"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/bfb0022568","relation":{},"subject":[]}}