{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T20:13:42Z","timestamp":1771272822927,"version":"3.50.1"},"reference-count":46,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1988,12,1]],"date-time":"1988-12-01T00:00:00Z","timestamp":596937600000},"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":8994,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1988,12]]},"DOI":"10.1016\/0304-3975(88)90115-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"297-340","source":"Crossref","is-referenced-by-count":30,"title":["Towards a computation system based on set theory"],"prefix":"10.1016","volume":"60","author":[{"given":"Michael J.","family":"Beeson","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(88)90115-6_BIB1","series-title":"Lectures on Non-Well-Founded Sets","author":"Aczel","year":"1988"},{"key":"10.1016\/0304-3975(88)90115-6_BIB2","series-title":"The Lambda Calculus: Its Syntax and Semantics","author":"Barendregt","year":"1981"},{"key":"10.1016\/0304-3975(88)90115-6_BIB3","series-title":"Logic, Methodology, and Philosophy of Science VII","article-title":"Proving programs and programming proofs","author":"Beeson","year":"1986"},{"key":"10.1016\/0304-3975(88)90115-6_BIB4","series-title":"Foundations of Constructive Mathematics: Metamathematical Studies","author":"Beeson","year":"1985"},{"key":"10.1016\/0304-3975(88)90115-6_BIB5","series-title":"Foundations of Constructive Analysis","author":"Bishop","year":"1967"},{"key":"10.1016\/0304-3975(88)90115-6_BIB6","first-page":"29","article-title":"The mathematical language AUTOMATH, its usage and some of its extensions","volume":"125","author":"de Bruijn","year":"1970"},{"key":"10.1016\/0304-3975(88)90115-6_BIB7","article-title":"Begr\u00fcndung der Mengenlehre unabh\u00e4ngig vom logischen Satz vom ausgeschlossen Dritten, Erster Teil: Allgemeine Mengenlehre","volume":"Vol. 1","author":"Brouwer","year":"1975"},{"key":"10.1016\/0304-3975(88)90115-6_BIB8","series-title":"Tech. Rept.","article-title":"A kernel language for modules and abstract data types","author":"Burstall","year":"1984"},{"key":"10.1016\/0304-3975(88)90115-6_BIB9","series-title":"Implementing Mathematics with the NuPrl Proof Development System","author":"Constable","year":"1986"},{"key":"10.1016\/0304-3975(88)90115-6_BIB10","article-title":"Introduction to the PL\u29f8CV2 Programming Logic","volume":"135","author":"Constable","year":"1982"},{"key":"10.1016\/0304-3975(88)90115-6_BIB11","series-title":"Proc. IBM Logic of Programs Conf.","first-page":"72","article-title":"The type theory of PL\u29f8CV3","volume":"131","author":"Constable","year":"1982"},{"key":"10.1016\/0304-3975(88)90115-6_BIB12","series-title":"Combinatory Logic","author":"Curry","year":"1958"},{"key":"10.1016\/0304-3975(88)90115-6_BIB13","series-title":"Essays on the Theory of Numbers","author":"Dedekind","year":"1963"},{"key":"10.1016\/0304-3975(88)90115-6_BIB14","series-title":"Algebra and Logic","first-page":"87","article-title":"A language and axioms for explicit mathematics","volume":"450","author":"Feferman","year":"1975"},{"key":"10.1016\/0304-3975(88)90115-6_BIB15","series-title":"Logic Colloquium '78: Proc. Logic Coll. at Mons, 1978","first-page":"159","article-title":"Constructive theories of functions and classes","author":"Feferman","year":"1979"},{"key":"10.1016\/0304-3975(88)90115-6_BIB16","series-title":"Foundations of Set Theory","author":"Fraenkel","year":"1958"},{"key":"10.1016\/0304-3975(88)90115-6_BIB17_1","volume":"Band I","author":"Frege","year":"1893"},{"key":"10.1016\/0304-3975(88)90115-6_BIB17_2","volume":"Band II","author":"Frege","year":"1903"},{"key":"10.1016\/0304-3975(88)90115-6_BIB17_3","series-title":"Translations from the Philosophical Writings of Gottlieb Frege","year":"1980"},{"key":"10.1016\/0304-3975(88)90115-6_BIB18","series-title":"Cambridge Summer School in Mathematical Logic","first-page":"113","article-title":"Some applications of Kleene's methods for intuitionistic systems","volume":"337","author":"Friedman","year":"1973"},{"key":"10.1016\/0304-3975(88)90115-6_BIB19","doi-asserted-by":"crossref","first-page":"315","DOI":"10.2307\/2272068","article-title":"The consistency of classical set theory relative to a set theory with intuitionistic logic","volume":"38","author":"Friedman","year":"1973","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(88)90115-6_BIB20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2307\/1971023","article-title":"Set theoretic foundations for constructive analysis","volume":"105","author":"Friedman","year":"1977","journal-title":"Ann. of Math."},{"key":"10.1016\/0304-3975(88)90115-6_BIB21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0001-8708(85)90103-3","article-title":"The lack of definable witnesses and provably recursive functions in intuitionistic set theories","volume":"57","author":"Friedman","year":"1985","journal-title":"Adv. in Math."},{"key":"10.1016\/0304-3975(88)90115-6_BIB22","article-title":"The Algos system","author":"Graves","year":"1985","journal-title":"Language of Data Project"},{"key":"10.1016\/0304-3975(88)90115-6_BIB23","first-page":"213","article-title":"Liberal constructive set theory","volume":"873","author":"Greenleaf","year":"1981"},{"key":"10.1016\/0304-3975(88)90115-6_BIB24","article-title":"Edinburgh LCF: A Mechanized Logic of Computation","volume":"78","author":"Gordon","year":"1979"},{"key":"10.1016\/0304-3975(88)90115-6_BIB25","series-title":"Cantorian Set Theory and Limitation of Size","author":"Hallett","year":"1984"},{"key":"10.1016\/0304-3975(88)90115-6_BIB26","year":"1967"},{"key":"10.1016\/0304-3975(88)90115-6_BIB27","doi-asserted-by":"crossref","first-page":"161","DOI":"10.2977\/prims\/1195182982","article-title":"Extracting Lisp programs from constructive proofs: a formal theory of constructive mathematics based on Lisp","volume":"19","author":"Hayashi","year":"1983","journal-title":"Publ. Res. Inst. Math. Sci."},{"key":"10.1016\/0304-3975(88)90115-6_BIB28","series-title":"From Frege to G\u00f6del: A Source Book in Mathematical Logic, 1878-1931","first-page":"129","article-title":"On the foundations of logic and arithmetic","author":"Hilbert","year":"1967"},{"key":"10.1016\/0304-3975(88)90115-6_BIB29","series-title":"From Frege to G\u00f6del: A source Book in Mathematic Logic, 1878-1931","first-page":"367","article-title":"On the infinite","author":"Hilbert","year":"1967"},{"key":"10.1016\/0304-3975(88)90115-6_BIB30","first-page":"1","article-title":"Recursive functionals and quantifiers of finite types I","volume":"91","author":"Kleene","year":"1959","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(88)90115-6_BIB31_1","first-page":"646","article-title":"O principe tertium non datur","volume":"32","author":"Kolmogorov","year":"1925","journal-title":"Mat. Sb."},{"key":"10.1016\/0304-3975(88)90115-6_BIB31_2","series-title":"From Frege to G\u00f6del: A Source Book in Mathematical Logic, 1878-1931","first-page":"414","article-title":"O principe tertium non datur","author":"Kolmogorov","year":"1967"},{"key":"10.1016\/0304-3975(88)90115-6_BIB32","doi-asserted-by":"crossref","first-page":"170","DOI":"10.2307\/2322871","article-title":"Algorithmic thinking and mathematical thinking","volume":"92","author":"Knuth","year":"1985","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0304-3975(88)90115-6_BIB33","series-title":"Logic Colloquium '73","first-page":"73","article-title":"An intuitionistic theory of types: predicative part","author":"Martin-L\u00f6f","year":"1975"},{"key":"10.1016\/0304-3975(88)90115-6_BIB34","series-title":"Logic, Methodology, and Philosophy of Science VI","first-page":"153","article-title":"Constructive mathematics and computer programming","author":"Martin-L\u00f6f","year":"1982"},{"key":"10.1016\/0304-3975(88)90115-6_BIB35","first-page":"37","article-title":"Les antinomies de Russell et de Burali-Forti et le probl\u00e8me fondamental de la th\u00e9ories des ensembles","volume":"19","author":"Mirimanoff","year":"1917","journal-title":"Enseign. Math."},{"key":"10.1016\/0304-3975(88)90115-6_BIB36","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF00348540","article-title":"The concept of function in the 19th and 20th centuries, in particular with regard to the discussions between Baire, Borel, and Lebesgue","volume":"9","author":"Monna","year":"1972","journal-title":"Arch. Hist. Exact Sci."},{"key":"10.1016\/0304-3975(88)90115-6_BIB37","series-title":"Logic Colloquium '69","first-page":"199","article-title":"Axioms for computation theories\u2014first draft","author":"Moschovakis","year":"1971"},{"key":"10.1016\/0304-3975(88)90115-6_BIB38","series-title":"From Frege to G\u00f6del: A Source Book in Mathematical Logic, 1878-1931","first-page":"393","article-title":"An axiomatization of set theory","author":"von Neumann","year":"1967"},{"key":"10.1016\/0304-3975(88)90115-6_BIB39","series-title":"From Frege to G\u00f6del: A Source Book in Mathematical Logic, 1878-1931","first-page":"83","article-title":"The principles of arithmetic, presented by a new method","author":"Peano","year":"1967"},{"key":"10.1016\/0304-3975(88)90115-6_BIB40","first-page":"261","article-title":"Untersuchungen \u00fcber die Grundlagen der Mengenlehre","volume":"65","author":"Zermelo","year":"1908","journal-title":"Investigations in the foundations of set theory I"},{"key":"10.1016\/0304-3975(88)90115-6_BIB41","doi-asserted-by":"crossref","first-page":"347","DOI":"10.2307\/2272159","article-title":"Constructive set theory","volume":"40","author":"Myhill","year":"1975","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(88)90115-6_BIB42","doi-asserted-by":"crossref","first-page":"730","DOI":"10.2307\/2274128","article-title":"An interpretation of Marti-L\u00f6f's type theory in a type-free theory of propositions","volume":"49","author":"Smith","year":"1984","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(88)90115-6_BIB43","article-title":"The Consistency of the Axiom of Choice and of the Generalized Continuum Hypothesis with the Axioms of Set Theory","volume":"3","author":"G\u00f6del","year":"1940"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397588901156?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397588901156?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:54:22Z","timestamp":1555113262000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397588901156"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,12]]},"references-count":46,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1988,12]]}},"alternative-id":["0304397588901156"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(88)90115-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1988,12]]}}}