{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T05:35:20Z","timestamp":1649136920188},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,11,14]],"date-time":"2009-11-14T00:00:00Z","timestamp":1258156800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Arch. Math. Logic"],"published-print":{"date-parts":[[2010,1]]},"DOI":"10.1007\/s00153-009-0161-3","type":"journal-article","created":{"date-parts":[[2009,11,13]],"date-time":"2009-11-13T10:15:29Z","timestamp":1258107329000},"page":"69-89","source":"Crossref","is-referenced-by-count":4,"title":["Effectively inseparable Boolean algebras in lattices of sentences"],"prefix":"10.1007","volume":"49","author":[{"given":"V. Yu.","family":"Shavrukov","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,11,14]]},"reference":[{"key":"161_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-22156-3","volume-title":"Metamathematics of First-Order Arithmetic","author":"P. H\u00e1jek","year":"1993","unstructured":"H\u00e1jek P., Pudl\u00e1k P.: Metamathematics of First-Order Arithmetic. Springer-Verlag, Berlin (1993)"},{"key":"161_CR2","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1006\/aima.1997.1687","volume":"133","author":"L. Harrington","year":"1998","unstructured":"Harrington L., Nies A.: Coding in the partial order of enumerable sets. Adv. Math. 133, 133\u2013162 (1998)","journal-title":"Adv. Math."},{"key":"161_CR3","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511551574","volume-title":"Model Theory","author":"W. Hodges","year":"1993","unstructured":"Hodges W.: Model Theory. Cambridge University Press, Cambridge (1993)"},{"key":"161_CR4","first-page":"329","volume-title":"Proceedings from 5th Scandinavian Logic Symposium","author":"P. Lindstr\u00f6m","year":"1979","unstructured":"Lindstr\u00f6m P.: Some results on interpretability. In: Jensen, F.V., Mayoh, B.H., M\u00f8ller, K.K. (eds) Proceedings from 5th Scandinavian Logic Symposium, pp. 329\u2013361. Aalborg University Press, Aalborg (1979)"},{"key":"161_CR5","doi-asserted-by":"crossref","first-page":"436","DOI":"10.2307\/2045318","volume":"91","author":"P. Lindstr\u00f6m","year":"1984","unstructured":"Lindstr\u00f6m P.: On partially conservative sentences and interpretability. Proc. Amer. Math. Soc. 91, 436\u2013443 (1984)","journal-title":"Proc. Amer. Math. Soc."},{"key":"161_CR6","volume-title":"Aspects of Incompleteness","author":"P. Lindstr\u00f6m","year":"2003","unstructured":"Lindstr\u00f6m P.: Aspects of Incompleteness, 2nd ed. A K Peters, Natick (2003)","edition":"2"},{"key":"161_CR7","unstructured":"Lindstr\u00f6m, P., Shavrukov, V.Yu.: The \u2200\u2203 theory of Peano \u03a31 sentences. J. Math. Log. (to appear)"},{"key":"161_CR8","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1090\/pspum\/042\/791050","volume-title":"Recursion Theory","author":"W. Maass","year":"1985","unstructured":"Maass W.: Major subsets and automorphisms of recursively enumerable sets. In: Nerode, A., Shore, R.A. (eds) Recursion Theory, pp. 21\u201332. American Mathematical Society, Providence (1985)"},{"key":"161_CR9","doi-asserted-by":"crossref","first-page":"397","DOI":"10.2307\/2274228","volume":"50","author":"F. Montagna","year":"1985","unstructured":"Montagna F., Sorbi A.: Universal recursion theoretic properties of r.e. preordered structures. J. Symb. Log. 50, 397\u2013406 (1985)","journal-title":"J. Symb. Log."},{"key":"161_CR10","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1090\/pspum\/042\/791067","volume-title":"Recursion Theory.","author":"A. Nerode","year":"1985","unstructured":"Nerode A., Remmel J.: A survey of lattices of r.e. substructures. In: Nerode, A., Shore, R.A. (eds) Recursion Theory., pp. 323\u2013375. American Mathematical Society, Providence (1985)"},{"key":"161_CR11","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1112\/S0024609397003548","volume":"29","author":"A. Nies","year":"1997","unstructured":"Nies A.: Intervals of the lattice of computably enumerable sets and effective boolean algebras. Bull. London Math. Soc. 29, 683\u2013692 (1997)","journal-title":"Bull. London Math. Soc."},{"key":"161_CR12","unstructured":"Nies A. Coding methods in computability theory and complexity theory. Habilitationsschrift, Universit\u00e4t Heidelberg (1998)"},{"key":"161_CR13","doi-asserted-by":"crossref","first-page":"4989","DOI":"10.1090\/S0002-9947-00-02652-0","volume":"352","author":"A. Nies","year":"2000","unstructured":"Nies A.: Effectively dense Boolean algebras and their applications. Trans. Amer. Math. Soc. 352, 4989\u20135012 (2000)","journal-title":"Trans. Amer. Math. Soc."},{"key":"161_CR14","doi-asserted-by":"crossref","first-page":"56","DOI":"10.2307\/2270052","volume":"33","author":"M.B. Pour-El","year":"1968","unstructured":"Pour-El M.B.: Effectively extensible theories. J. Symb. Log. 33, 56\u201368 (1968)","journal-title":"J. Symb. Log."},{"key":"161_CR15","doi-asserted-by":"crossref","first-page":"141","DOI":"10.4064\/fm-61-2-141-163","volume":"61","author":"M.B. Pour-El","year":"1997","unstructured":"Pour-El M.B., Kripke S.: Deduction-preserving \u201cRecursive Isomorphisms\u201d between theories. Fund. Math. 61, 141\u2013163 (1997)","journal-title":"Fund. Math."},{"key":"161_CR16","doi-asserted-by":"crossref","first-page":"79","DOI":"10.2307\/2275733","volume":"62","author":"V.Yu. Shavrukov","year":"1997","unstructured":"Shavrukov V.Yu.: Undecidability in diagonalizable algebras. J. Symb. Log. 62, 79\u2013116 (1997)","journal-title":"J. Symb. Log."}],"container-title":["Archive for Mathematical Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-009-0161-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00153-009-0161-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-009-0161-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T15:36:43Z","timestamp":1558625803000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00153-009-0161-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11,14]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,1]]}},"alternative-id":["161"],"URL":"https:\/\/doi.org\/10.1007\/s00153-009-0161-3","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"value":"0933-5846","type":"print"},{"value":"1432-0665","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,11,14]]}}}