{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T06:41:49Z","timestamp":1648622509482},"reference-count":83,"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":13341,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. symb. log."],"published-print":{"date-parts":[[1977,9]]},"DOI":"10.2307\/2272881","type":"journal-article","created":{"date-parts":[[2006,5,6]],"date-time":"2006-05-06T21:45:08Z","timestamp":1146951908000},"page":"437-479","source":"Crossref","is-referenced-by-count":0,"title":["European meeting of the Association for Symbolic Logic"],"prefix":"10.1017","volume":"42","member":"56","published-online":{"date-parts":[[2014,3,12]]},"reference":[{"key":"S0022481200034885_ref031","volume-title":"Combinatory logic","volume":"1","year":"1958"},{"key":"S0022481200034885_ref095","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1970-0253897-3"},{"key":"S0022481200034885_ref059","first-page":"555","volume":"8","year":"1967","journal-title":"Soviet Mathematics, Doklady"},{"key":"S0022481200034885_ref057","doi-asserted-by":"publisher","DOI":"10.1145\/321978.321991"},{"key":"S0022481200034885_ref056","first-page":"569","volume-title":"Information Processing 74"},{"key":"S0022481200034885_ref055","volume-title":"Monografie Matematyczne","year":"1963"},{"key":"S0022481200034885_ref054","first-page":"160","volume":"241","journal-title":"Journal f\u00fcr Mathematik"},{"key":"S0022481200034885_ref053","first-page":"425","year":"1969","journal-title":"Notre Dame Journal of Formal Logic"},{"key":"S0022481200034885_ref052","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1958-0095135-X"},{"key":"S0022481200034885_ref051","first-page":"455","volume-title":"Acta Mathematica Academiae Scientiarum Hungaricae","year":"1957"},{"key":"S0022481200034885_ref050","doi-asserted-by":"publisher","DOI":"10.1215\/S0012-7094-62-02951-4"},{"key":"S0022481200034885_ref049","first-page":"884","year":"1969","journal-title":"Canadian Journal of Mathematics"},{"key":"S0022481200034885_ref048","volume":"25","year":"1967","journal-title":"American Mathematical Society Colloquium Publications"},{"key":"S0022481200034885_ref047","first-page":"283","volume-title":"Zeitschrift f\u00fcr Mathemathische Logik und Grundlagen der Mathematik","volume":"7","year":"1961"},{"key":"S0022481200034885_ref046","volume-title":"Many-valued logics","year":"1952"},{"key":"S0022481200034885_ref045","first-page":"10","volume-title":"Archiv f\u00fcr Mathematische Logik und Grundlagenforschung","volume":"14","year":"1971"},{"key":"S0022481200034885_ref044","volume-title":"Introduction to mathematical logic","year":"1973"},{"key":"S0022481200034885_ref043","doi-asserted-by":"publisher","DOI":"10.1007\/BF01982047"},{"key":"S0022481200034885_ref042","first-page":"109","volume-title":"Fundamenta Mathematicae","volume":"59","year":"1966"},{"key":"S0022481200034885_ref041","first-page":"47","volume-title":"Models and ultraproducts","year":"1969"},{"key":"S0022481200034885_ref040","first-page":"1125\u00b71127","volume-title":"omptes Rendus de L'Acad\u00e9mie des Sciences","year":"1976"},{"key":"S0022481200034885_ref038","first-page":"77","volume-title":"Annales Scientifiques de l'Universit\u00e9 de Clermont-Ferrand","year":"1976"},{"key":"S0022481200034885_ref037","first-page":"67","volume-title":"University of California Publications in Mathematics","year":"1960"},{"key":"S0022481200034885_ref036","first-page":"409","volume":"34","year":"1969","journal-title":"Applications of strict \u03a01 1 predicates to infinitary logic"},{"key":"S0022481200034885_ref035","volume-title":"Combinators, \u03bb-terms and proof theory","year":"1972"},{"key":"S0022481200034885_ref034","doi-asserted-by":"publisher","DOI":"10.1305\/ndjfl\/1093956080"},{"key":"S0022481200034885_ref098","first-page":"51","volume":"9","year":"1974","journal-title":"International Logic Review"},{"key":"S0022481200034885_ref096","first-page":"239","volume":"35","year":"1970","journal-title":"A note on computable real fields"},{"key":"S0022481200034885_ref030","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1936-1501858-0"},{"key":"S0022481200034885_ref094","first-page":"77","volume-title":"Russian Mathematical Surveys","volume":"16","year":"1961"},{"key":"S0022481200034885_ref093","first-page":"341","volume":"95","year":"1960","journal-title":"Transactions of the American Mathematical Society"},{"key":"S0022481200034885_ref092","first-page":"339","volume-title":"Metamathematical investigations of intuitionistic arithmetic and analysis","year":"1973"},{"key":"S0022481200034885_ref091","first-page":"11","volume":"27","year":"1962","journal-title":"Disjunction and existence under implication in elementary intuitionistic formalisms"},{"key":"S0022481200034885_ref090","volume-title":"Proceedings of the 2nd Scandinavian Logic Symposium","year":"1971"},{"key":"S0022481200034885_ref029","volume-title":"Automata, Languages and Programming"},{"key":"S0022481200034885_ref028","first-page":"179","volume-title":"Formal Languages Description Languages for Computer Programming","year":"1966"},{"key":"S0022481200034885_ref027","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0029521"},{"key":"S0022481200034885_ref025","volume-title":"Proceedings of the Second Colloquium in Set Theory and Hierarchy Theory, Lecture Notes in Mathematics"},{"key":"S0022481200034885_ref089","volume-title":"Proceedings of Symposia in Pure Mathematics","volume":"17","year":"1970"},{"key":"S0022481200034885_ref023","first-page":"213","volume":"40","year":"1975","journal-title":"On N0-categorical modules"},{"key":"S0022481200034885_ref088","volume-title":"Consistency and related metamathematical properties","year":"1975"},{"key":"S0022481200034885_ref021","first-page":"98","volume-title":"Seminar in Mathematics","volume":"8","year":"1968"},{"key":"S0022481200034885_ref086","doi-asserted-by":"publisher","DOI":"10.1007\/BF02123402"},{"key":"S0022481200034885_ref020","first-page":"61","volume":"121","year":"1972","journal-title":"Trudy Matemati\u010deskogo Instiuta im. V. A. Steklova 121 = Proceedings of the Steklov Institute of Mathematics"},{"key":"S0022481200034885_ref085","doi-asserted-by":"publisher","DOI":"10.1007\/BF02121661"},{"key":"S0022481200034885_ref084","first-page":"117","volume":"12","year":"1975","journal-title":"Bollettino delta Unione Matemalica Italiana"},{"key":"S0022481200034885_ref083","doi-asserted-by":"publisher","DOI":"10.1007\/BF02121663"},{"key":"S0022481200034885_ref081","volume-title":"Logic Conference","year":"1974"},{"key":"S0022481200034885_ref019","first-page":"563","volume":"32","year":"1967","journal-title":"Decidability of the monadic predicate calculus with unary function symbols"},{"key":"S0022481200034885_ref018","first-page":"45","volume":"41","year":"1976","journal-title":"A reduction class containing formulas with one monadic predicte and one binary function symbol"},{"key":"S0022481200034885_ref017","first-page":"97","volume-title":"Selected problems of algebra and logic","year":"1973"},{"key":"S0022481200034885_ref016","doi-asserted-by":"publisher","DOI":"10.1007\/BF02306690"},{"key":"S0022481200034885_ref015","first-page":"628","volume":"38","year":"1973","journal-title":"Prefix classes of Krom formulas"},{"key":"S0022481200034885_ref014","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19650110210"},{"key":"S0022481200034885_ref013","doi-asserted-by":"publisher","DOI":"10.2307\/1970290"},{"key":"S0022481200034885_ref078","volume-title":"Intuitionism and proof theory","year":"1970"},{"key":"S0022481200034885_ref012","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19750210109"},{"key":"S0022481200034885_ref077","first-page":"1","volume":"144","year":"1969","journal-title":"Transactions of the American Mathematical Society"},{"key":"S0022481200034885_ref011","first-page":"489","volume":"39","year":"1974","journal-title":"Single premise Post canonical forms defined over one-letter alphabets"},{"key":"S0022481200034885_ref076","doi-asserted-by":"publisher","DOI":"10.1147\/rd.126.0465"},{"key":"S0022481200034885_ref075","first-page":"222","volume-title":"Proceeding of the Symposium on \u03bb-Calculus and Computer Science Theory","year":"1975"},{"key":"S0022481200034885_ref010","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(73)80005-4"},{"key":"S0022481200034885_ref074","first-page":"557","volume-title":"IEEE Transactions on electronic computers","volume":"12","year":"1963"},{"key":"S0022481200034885_ref073","volume-title":"Aritm\u00e9tica Booleana"},{"key":"S0022481200034885_ref071","volume-title":"Publica\u00e7\u00e3o Interna No. 18","year":"1974"},{"key":"S0022481200034885_ref070","volume-title":"Publi\u00e7\u00e3cao Interna No. 17","year":"1974"},{"key":"S0022481200034885_ref106","doi-asserted-by":"publisher","DOI":"10.1145\/321941.321944"},{"key":"S0022481200034885_ref105","first-page":"57","volume":"63","year":"1975","journal-title":"Mathematical Centre Tracts"},{"key":"S0022481200034885_ref104","first-page":"389","volume":"10","year":"1961","journal-title":"Institute of Radio Engineers Transactions on Electronic Computers"},{"key":"S0022481200034885_ref009","volume-title":"Eine einfache Methode zur Bestimmung der Unl\u00f6sbarkeitsgrade von Entscheidungsproblemen kombinatorischer Systeme","year":"1975"},{"key":"S0022481200034885_ref008","volume-title":"ISILC Logic Conference","volume":"499","year":"1975"},{"key":"S0022481200034885_ref007","first-page":"1464","volume":"14","year":"1973","journal-title":"Soviet Mathematics, Doklady"},{"key":"S0022481200034885_ref006","doi-asserted-by":"publisher","DOI":"10.1007\/BF02242317"},{"key":"S0022481200034885_ref005","first-page":"79","volume-title":"First ACM Symposium on the Theory of Computation","year":"1969"},{"key":"S0022481200034885_ref004","first-page":"347","volume":"40","year":"1975","journal-title":"Constructive set theory"},{"key":"S0022481200034885_ref069","volume-title":"Publi\u00e7\u00e3cdo Interna No. 16","year":"1974"},{"key":"S0022481200034885_ref003","volume-title":"An intuitionistic theory of types: Predicative part, preprint","year":"1974"},{"key":"S0022481200034885_ref068","first-page":"287","volume-title":"\u03bb-calculus and computer science theory","year":"1974"},{"key":"S0022481200034885_ref067","volume-title":"Automata Languages and Programming","year":"1976"},{"key":"S0022481200034885_ref066","first-page":"365","volume":"35","year":"1976","journal-title":"Studia Logica"},{"key":"S0022481200034885_ref062","volume-title":"Combinatory logic","year":"1958"},{"key":"S0022481200034885_ref061","volume-title":"Annals of Mathematical Studies","year":"1941"},{"key":"S0022481200034885_ref063","volume-title":"Combinatory logic. II","year":"1972"}],"container-title":["Journal of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0022481200034885","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T21:16:18Z","timestamp":1558991778000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0022481200034885\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977,9]]},"references-count":83,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1977,9]]}},"alternative-id":["S0022481200034885"],"URL":"https:\/\/doi.org\/10.2307\/2272881","relation":{},"ISSN":["0022-4812","1943-5886"],"issn-type":[{"value":"0022-4812","type":"print"},{"value":"1943-5886","type":"electronic"}],"subject":[],"published":{"date-parts":[[1977,9]]}}}