{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T11:57:11Z","timestamp":1759147031376},"reference-count":22,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1995,9,1]],"date-time":"1995-09-01T00:00:00Z","timestamp":809913600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6529,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Pure and Applied Logic"],"published-print":{"date-parts":[[1995,9]]},"DOI":"10.1016\/0168-0072(94)00058-b","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T22:40:50Z","timestamp":1052779250000},"page":"89-106","source":"Crossref","is-referenced-by-count":7,"title":["Understanding uniformity in Feferman's explicit mathematics"],"prefix":"10.1016","volume":"75","author":[{"given":"Thomas","family":"Gla\u00df","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0168-0072(94)00058-B_BIB1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-68952-9","article-title":"Foundations of Constructive Mathematics","author":"Beeson","year":"1985"},{"key":"10.1016\/0168-0072(94)00058-B_BIB2","series-title":"Foundations of Constructive Analysis","author":"Bishop","year":"1967"},{"key":"10.1016\/0168-0072(94)00058-B_BIB3","doi-asserted-by":"crossref","first-page":"360","DOI":"10.2307\/2274059","article-title":"On the relation between choice and comprehension principles in second order arithmetic","volume":"51","author":"Cantini","year":"1986","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0168-0072(94)00058-B_BIB4","series-title":"Symposium on Automatic Demonstration","first-page":"29","article-title":"The mathematical language AUTOMATH, its usage, and some of its extensions","volume":"Vol. 125","author":"de Bruijn","year":"1970"},{"key":"10.1016\/0168-0072(94)00058-B_BIB5","series-title":"Algebra and Logic","first-page":"87","article-title":"A language and axioms for explicit mathematics","volume":"Vol. 450","author":"Feferman","year":"1975"},{"key":"10.1016\/0168-0072(94)00058-B_BIB6","series-title":"Generalized Recursion Theory II","first-page":"55","article-title":"Recursion theory and set theory: a marriage of convenience","volume":"Vol. 94","author":"Feferman","year":"1978"},{"key":"10.1016\/0168-0072(94)00058-B_BIB7","series-title":"Logic Colloquium '78","first-page":"159","article-title":"Constructive theories of functions and classes","volume":"Vol. 97","author":"Feferman","year":"1979"},{"key":"10.1016\/0168-0072(94)00058-B_BIB8","series-title":"Logic Colloquium '82","first-page":"95","article-title":"Inductively presented systems and the formalization of meta-mathematics","volume":"Vol. 108","author":"Feferman","year":"1982"},{"key":"10.1016\/0168-0072(94)00058-B_BIB9","series-title":"The L.E.J. Brouwer Centenary Symposium","first-page":"77","article-title":"Monotone inductive definitions","volume":"Vol. 110","author":"Feferman","year":"1982"},{"key":"10.1016\/0168-0072(94)00058-B_BIB10","doi-asserted-by":"crossref","first-page":"364","DOI":"10.2307\/2274509","article-title":"Hilbert's program relativized: proof-theoretical and foundational reductions","volume":"53","author":"Feferman","year":"1988","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0168-0072(94)00058-B_BIB11","series-title":"Iterated Inductive Definitions and Subsystems of Analysis: Recent Proof-Theoretical Studies","first-page":"78","article-title":"Proof-theoretic equivalence between classical and constructive theories for analysis","volume":"Vol. 897","author":"Feferman","year":"1981"},{"key":"10.1016\/0168-0072(94)00058-B_BIB12","first-page":"557","article-title":"Systems of second order arithmetic with restricted induction. I, II","volume":"41","author":"Friedman","year":"1976","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0168-0072(94)00058-B_BIB13","series-title":"Logic and Algorithmic","first-page":"207","article-title":"Proof-theoretic investigations of inductive definitions I","volume":"Vol. 30","author":"Girard","year":"1982"},{"key":"10.1016\/0168-0072(94)00058-B_BIB14","article-title":"Theories for Admissible Sets. A Unifying Approach to Proof Theory","volume":"Vol. 2","author":"J\u00e4ger","year":"1986"},{"key":"10.1016\/0168-0072(94)00058-B_BIB15","first-page":"241","article-title":"Interpretation of non-finitist proofs, I","volume":"16","author":"Kreisel","year":"1951","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0168-0072(94)00058-B_BIB16","article-title":"Proof Theory. An Introduction","volume":"Vol. 1407","author":"Pohlers","year":"1989"},{"key":"10.1016\/0168-0072(94)00058-B_BIB17","series-title":"Untersuchungen zu Teilsystemen der Zahlentheorie zweiter Stufe und der Mengenlehre mit einer zwischen \u039421-CA und \u039421-CA + BI liegenden Beweisst\u00e4rke","author":"Rathjen","year":"1989"},{"key":"10.1016\/0168-0072(94)00058-B_BIB18","article-title":"Proof Theory","volume":"Vol. 225","author":"Sch\u00fctte","year":"1977"},{"key":"10.1016\/0168-0072(94)00058-B_BIB19","series-title":"Proof Theory","first-page":"432","article-title":"Subsystems of Z2 and reverse mathematics","volume":"Vol. 81","author":"Simpson","year":"1987"},{"key":"10.1016\/0168-0072(94)00058-B_BIB20","doi-asserted-by":"crossref","first-page":"349","DOI":"10.2307\/2274508","article-title":"Partial realizations of Hilbert's program","volume":"53","author":"Simpson","year":"1988","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0168-0072(94)00058-B_BIB21","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0168-0072(89)90019-5","article-title":"Monotone inductive definitions in a constructive theory of functions and classes","volume":"42","author":"Takahashi","year":"1989","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/0168-0072(94)00058-B_BIB22","article-title":"Proof Theory","volume":"Vol. 81","author":"Takeuti","year":"1987"}],"container-title":["Annals of Pure and Applied Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016800729400058B?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016800729400058B?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,10]],"date-time":"2023-04-10T14:07:07Z","timestamp":1681135627000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016800729400058B"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,9]]},"references-count":22,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1995,9]]}},"alternative-id":["016800729400058B"],"URL":"https:\/\/doi.org\/10.1016\/0168-0072(94)00058-b","relation":{},"ISSN":["0168-0072"],"issn-type":[{"value":"0168-0072","type":"print"}],"subject":[],"published":{"date-parts":[[1995,9]]}}}