{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T00:11:02Z","timestamp":1693354262712},"reference-count":9,"publisher":"Cambridge University Press (CUP)","issue":"3","license":[{"start":{"date-parts":[[2014,3,12]],"date-time":"2014-03-12T00:00:00Z","timestamp":1394582400000},"content-version":"unspecified","delay-in-days":6036,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. symb. log."],"published-print":{"date-parts":[[1997,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Let <jats:italic>L = \u3008&lt;, +, h<jats:sub>q<\/jats:sub>, 1\u3009<jats:sub>q\u2208\u211a<\/jats:sub><\/jats:italic> where \u211a is the set of rational numbers and <jats:italic>hq<\/jats:italic> is a one-place function symbol corresponding to multiplication by <jats:italic>q<\/jats:italic>. Then the <jats:italic>L<\/jats:italic>-theory of Scott's model for intuitionistic analysis is decidable.<\/jats:p>","DOI":"10.2307\/2275579","type":"journal-article","created":{"date-parts":[[2006,5,6]],"date-time":"2006-05-06T23:01:58Z","timestamp":1146956518000},"page":"917-924","source":"Crossref","is-referenced-by-count":1,"title":["Decidability of Scott's model as an ordered \u211a-vectorspace"],"prefix":"10.1017","volume":"62","author":[{"given":"Mikl\u00f3s","family":"Erd\u00e9lyi-Szab\u00f3","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2014,3,12]]},"reference":[{"key":"S0022481200016091_ref008","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(88)90040-1"},{"key":"S0022481200016091_ref007","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(86)90023-0"},{"key":"S0022481200016091_ref006","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(84)90030-7"},{"key":"S0022481200016091_ref003","first-page":"1","article-title":"Decidability of second order theories and automata on infinite trees","volume":"141","author":"Rabin","year":"1969","journal-title":"Transactions of the American Mathematical Society"},{"key":"S0022481200016091_ref004","first-page":"194","article-title":"Extending the topological interpretation to intuitionistic analysis","volume":"20","author":"Scott","year":"1968","journal-title":"Compositio Mathematica"},{"key":"S0022481200016091_ref002","unstructured":"Erd\u00e9lyi-Szab\u00f3 M. , Decidability in the constructive theory of reals as an ordered \u211a-vectorspace, Ph.D. thesis ."},{"key":"S0022481200016091_ref009","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(90)90067-C"},{"key":"S0022481200016091_ref005","first-page":"235","volume-title":"Intuitionism and proof theory","author":"Scott","year":"1970"},{"key":"S0022481200016091_ref001","volume-title":"Foundations of constructive analysis","author":"Bishop","year":"1967"}],"container-title":["Journal of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0022481200016091","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T20:24:34Z","timestamp":1557606274000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0022481200016091\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,9]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1997,9]]}},"alternative-id":["S0022481200016091"],"URL":"https:\/\/doi.org\/10.2307\/2275579","relation":{},"ISSN":["0022-4812","1943-5886"],"issn-type":[{"value":"0022-4812","type":"print"},{"value":"1943-5886","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,9]]}}}