{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T00:57:24Z","timestamp":1648861044790},"reference-count":63,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1993,4,1]],"date-time":"1993-04-01T00:00:00Z","timestamp":733622400000},"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":7412,"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":[[1993,4]]},"DOI":"10.1016\/0304-3975(93)90189-z","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"253-290","source":"Crossref","is-referenced-by-count":2,"title":["Logical foundations for programming semantics"],"prefix":"10.1016","volume":"111","author":[{"given":"Paul C","family":"Gilmore","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George K","family":"Tsiknis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(93)90189-Z_BIB1","first-page":"479","article-title":"A cook's tour of countable nondeterminism","volume":"Vol. 115","author":"Apt","year":"1981"},{"issue":"13","key":"10.1016\/0304-3975(93)90189-Z_BIB2","first-page":"309","article-title":"Semantic entailment and formal derivability","volume":"18","author":"Beth","year":"1955","journal-title":"Mededelingen de Koninklijke Nederlandse Akademie der Wetenschappen, Afdeeling Letterkunde, Nieuwe Reeks"},{"key":"10.1016\/0304-3975(93)90189-Z_BIB3","author":"Church","year":"1941"},{"key":"10.1016\/0304-3975(93)90189-Z_BIB4","series-title":"Introduction to Mathematical Logic, Vol I","author":"Church","year":"1956"},{"key":"10.1016\/0304-3975(93)90189-Z_BIB5","first-page":"435","article-title":"Semantics and termination of nondeterministic recursive programs","author":"de Bakker","year":"1976","journal-title":"Proc. 3rd Coll. on Automata, Languages and Programming"},{"key":"10.1016\/0304-3975(93)90189-Z_BIB6","author":"Dijkstra","year":"1976"},{"key":"10.1016\/0304-3975(93)90189-Z_BIB7","first-page":"149","article-title":"Categorical foundations and foundations of category theory","author":"Feferman","year":"1977"},{"key":"10.1016\/0304-3975(93)90189-Z_BIB8","doi-asserted-by":"crossref","first-page":"75","DOI":"10.2307\/2274093","article-title":"Towards useful type-free theories I","volume":"49","author":"Feferman","year":"1984","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(93)90189-Z_BIB9","author":"Fitch","year":"1952"},{"key":"10.1016\/0304-3975(93)90189-Z_BIB10_1","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1007\/BF01201353","article-title":"Untersuchungen \u00fcber das logische Schliessen","volume":"39","author":"Gentzen","year":"1935","journal-title":"Math. Z."},{"key":"10.1016\/0304-3975(93)90189-Z_BIB10_2","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/BF01201363","article-title":"Untersuchungen \u00fcber das logische Schliessen","volume":"39","author":"Gentzen","year":"1935","journal-title":"Math. Z."},{"key":"10.1016\/0304-3975(93)90189-Z_BIB11","unstructured":"P.C. Gilmore, A formalized naive set theory, a paper presented at the summer conf. on intuitionism and proof theory, Buffalo, New York (1968)."},{"key":"10.1016\/0304-3975(93)90189-Z_BIB12","article-title":"A consistent naive set theory: Foundations for a formal theory of computation","author":"Gilmore","year":"1971","journal-title":"IBM Research Report RC 3413"},{"key":"10.1016\/0304-3975(93)90189-Z_BIB13","first-page":"99","article-title":"Combining unrestricted abstraction with universal quantification","author":"Gilmore","year":"1980"},{"key":"10.1016\/0304-3975(93)90189-Z_BIB14","doi-asserted-by":"crossref","first-page":"393","DOI":"10.2307\/2274063","article-title":"Natural deduction based set theories: A new resolution of the old paradoxes","volume":"51","author":"Gilmore","year":"1986","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(93)90189-Z_BIB15","article-title":"The SET conceptual model and the domain graph method of table design","author":"Gilmore","year":"1987"},{"key":"10.1016\/0304-3975(93)90189-Z_BIB16","article-title":"Justifications and applications of the SET conceptual model","author":"Gilmore","year":"1987"},{"key":"10.1016\/0304-3975(93)90189-Z_BIB17","series-title":"Proc. 6th Entity Relationship Conf.","first-page":"95","article-title":"A foundation for the entity relationship approach: How and why","author":"Gilmore","year":"1988"},{"key":"10.1016\/0304-3975(93)90189-Z_BIB18_1","article-title":"How many real numbers are there?","author":"Gilmore","year":"1989"},{"key":"10.1016\/0304-3975(93)90189-Z_BIB18_2","article-title":"How many real numbers are there?","author":"Gilmore","year":"1992","journal-title":"Ann. Pure and Appl. Logic"},{"key":"10.1016\/0304-3975(93)90189-Z_BIB19","unstructured":"P.C. Gilmore, The consistency and completeness of an extended NaDSet, in preparation."},{"key":"10.1016\/0304-3975(93)90189-Z_BIB20","doi-asserted-by":"crossref","unstructured":"P.C. Gilmore, Logic, sets and mathematics, Math. Intelligencer, to appear.","DOI":"10.1007\/BF03025253"},{"key":"10.1016\/0304-3975(93)90189-Z_BIB21","unstructured":"P.C. Gilmore, Non-well-founded sets in NaDSet, in preparation."},{"key":"10.1016\/0304-3975(93)90189-Z_BIB22","doi-asserted-by":"crossref","DOI":"10.1016\/0304-3975(93)90188-Y","article-title":"A logic for category theory","author":"Gilmore","year":"1990"},{"key":"10.1016\/0304-3975(93)90189-Z_BIB23","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0304-3975(93)90188-Y","article-title":"A logic for category theory","volume":"111","author":"Gilmore","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90189-Z_BIB24","article-title":"Formulations of an extended NaDSet","author":"Gilmore","year":"1991"},{"key":"10.1016\/0304-3975(93)90189-Z_BIB25","article-title":"Solving domain equations in NaDSet","author":"Gilmore","year":"1991"},{"key":"10.1016\/0304-3975(93)90189-Z_BIB26","series-title":"The Denotational Description of Programming Languages, An Introduction","author":"Gordon","year":"1979"},{"key":"10.1016\/0304-3975(93)90189-Z_BIB27","first-page":"73","article-title":"A proof generating system for higher-order logic, VLSI specification","author":"Gordon","year":"1987"},{"key":"10.1016\/0304-3975(93)90189-Z_BIB28","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1145\/512760.512773","article-title":"A metalanguage for interactive proof in LCF","author":"Gordon","year":"1978","journal-title":"Proc. 5th ACM SIGACT-SIGPLAN Conf. on Principles of Programming Languages"},{"key":"10.1016\/0304-3975(93)90189-Z_BIB29","volume":"Vol. 30","author":"Gray","year":"1984"},{"key":"10.1016\/0304-3975(93)90189-Z_BIB30","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1109\/TCOM.1983.1095720","article-title":"Modular verification of computer communication protocols","volume":"Com-31","author":"Hailpern","year":"1983","journal-title":"IEEE Trans. Comm."},{"key":"10.1016\/0304-3975(93)90189-Z_BIB31","series-title":"The Semantics of Programming Languages","author":"Hennessy","year":"1990"},{"key":"10.1016\/0304-3975(93)90189-Z_BIB32","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1145\/363235.363259","article-title":"An axiomatic basis for computer programming","volume":"12","author":"Hoare","year":"1969","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(93)90189-Z_BIB33","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1145\/359576.359585","article-title":"Communicating sequential processes","volume":"2","author":"Hoare","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(93)90189-Z_BIB34","year":"1985"},{"key":"10.1016\/0304-3975(93)90189-Z_BIB35","series-title":"Introduction to Metamathematics","author":"Kleene","year":"1952"},{"key":"10.1016\/0304-3975(93)90189-Z_BIB36_1","article-title":"Categorical algebra and set-theoretical foundations","author":"MacLane","year":"1967"},{"key":"10.1016\/0304-3975(93)90189-Z_BIB36_2","first-page":"231","article-title":"Categorical algebra and set-theoretical foundations","author":"MacLane","year":"1967"},{"key":"10.1016\/0304-3975(93)90189-Z_BIB37","first-page":"215","article-title":"Verification of concurrent programs: The temporal framework","author":"Manna","year":"1981"},{"key":"10.1016\/0304-3975(93)90189-Z_BIB38","author":"Manna","year":"1984"},{"key":"10.1016\/0304-3975(93)90189-Z_BIB39","series-title":"The Logical Basis for Computer Programming, Vol. 2: Deductive Systems","author":"Manna","year":"1990"},{"key":"10.1016\/0304-3975(93)90189-Z_BIB40","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/800235.807067","article-title":"Implementation and applications of Scott's logic for computable functions","volume":"7","author":"Milner","year":"1972","journal-title":"Proc. ACM Conf. on Proving Assertions about Programs, SIGPLAN Notices"},{"key":"10.1016\/0304-3975(93)90189-Z_BIB41","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF00268134","article-title":"An axiomatic proof technique for parallel programs, I","volume":"6","author":"Owicki","year":"1976","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(93)90189-Z_BIB42","first-page":"59","article-title":"Fixpoint induction and the proofs of program properties","volume":"5","author":"Park","year":"1970","journal-title":"Machine Intelligence"},{"key":"10.1016\/0304-3975(93)90189-Z_BIB43","first-page":"504","article-title":"On the semantics of fair parallelism","volume":"Vol. 86","author":"Park","year":"1980"},{"key":"10.1016\/0304-3975(93)90189-Z_BIB44","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1137\/0205035","article-title":"A powerdomain construction","volume":"5","author":"Plotkin","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(93)90189-Z_BIB45","article-title":"A structural approach to operational semantics","author":"Plotkin","year":"1981"},{"key":"10.1016\/0304-3975(93)90189-Z_BIB46","volume":"3","author":"Prawitz","year":"1965"},{"key":"10.1016\/0304-3975(93)90189-Z_BIB47","series-title":"Mathematical Logic","author":"van Orman Quine","year":"1951"},{"key":"10.1016\/0304-3975(93)90189-Z_BIB48","series-title":"Beweisetheorie","author":"Sch\u00fctte","year":"1960"},{"key":"10.1016\/0304-3975(93)90189-Z_BIB49","article-title":"Outline of a mathematical theory of computation","author":"Scott","year":"1970"},{"key":"10.1016\/0304-3975(93)90189-Z_BIB50","first-page":"97","volume":"Vol. 274","author":"Scott","year":"1972"},{"key":"10.1016\/0304-3975(93)90189-Z_BIB51","first-page":"577","article-title":"Domains for denotational semantics","volume":"Vol. 140","author":"Scott","year":"1982"},{"key":"10.1016\/0304-3975(93)90189-Z_BIB52","unstructured":"D.S. Scott, A language for semantics, presentation to Mathematical Foundations of Programming Semantics, Carnegie Mellon Univ., 1991."},{"key":"10.1016\/0304-3975(93)90189-Z_BIB53","series-title":"First Order Logic","author":"Smullyan","year":"1968"},{"key":"10.1016\/0304-3975(93)90189-Z_BIB54","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0022-0000(78)90048-X","article-title":"Power Domains","volume":"16","author":"Smyth","year":"1978","journal-title":"J. Comput. System. Sci."},{"key":"10.1016\/0304-3975(93)90189-Z_BIB55","series-title":"Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory","author":"Stoy","year":"1977"},{"key":"10.1016\/0304-3975(93)90189-Z_BIB56","series-title":"The Collected Papers of Gerhard Gentzen","author":"Szabo","year":"1969"},{"key":"10.1016\/0304-3975(93)90189-Z_BIB57_1","first-page":"261","article-title":"Der Wahrheitsbegriff in den formalisierten Sprachen","volume":"1","author":"Tarski","year":"1936","journal-title":"Studia Philosophica"},{"key":"10.1016\/0304-3975(93)90189-Z_BIB57_2","first-page":"152","article-title":"Der Wahrheitsbegriff in den formalisierten Sprachen","author":"Tarski","year":"1956"},{"key":"10.1016\/0304-3975(93)90189-Z_BIB58","article-title":"Applications of a natural deduction based set theory","author":"Tsiknis","year":"1991"},{"key":"10.1016\/0304-3975(93)90189-Z_BIB59","series-title":"Introduction to the Foundations of Mathematics","author":"Wilder","year":"1958"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390189Z?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390189Z?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:22:13Z","timestamp":1555129333000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759390189Z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,4]]},"references-count":63,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1993,4]]}},"alternative-id":["030439759390189Z"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(93)90189-z","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1993,4]]}}}