{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,20]],"date-time":"2024-06-20T07:12:37Z","timestamp":1718867557058},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2015,5,5]],"date-time":"2015-05-05T00:00:00Z","timestamp":1430784000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Philos Logic"],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s10992-015-9354-x","type":"journal-article","created":{"date-parts":[[2015,5,4]],"date-time":"2015-05-04T08:36:07Z","timestamp":1430728567000},"page":"697-711","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["On Rules"],"prefix":"10.1007","volume":"44","author":[{"given":"Rosalie","family":"Iemhoff","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,5]]},"reference":[{"key":"9354_CR1","doi-asserted-by":"crossref","unstructured":"Baader, F., & Snyder, W. (2001). Unification theory, Handbook of automated reasoning: Elsevier.","DOI":"10.1016\/B978-044450813-3\/50010-2"},{"issue":"2","key":"9354_CR2","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1093\/logcom\/exq020","volume":"21","author":"S Babenyshev","year":"2011","unstructured":"Babenyshev, S., & Rybakov, V.V. (2011). Linear Temporal Logic LTL: Basis for Admissible Rules. Journal of Logic and Computation, 21(2), 157\u2013177.","journal-title":"Journal of Logic and Computation"},{"issue":"1","key":"9354_CR3","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF02259858","volume":"31","author":"A Chagrov","year":"1992","unstructured":"Chagrov, A. (1992). A Decidable Modal Logic with Undecidable Admissibility Problem. Algebra and Logic, 31(1), 53\u201361. (in Russian).","journal-title":"Algebra and Logic"},{"issue":"2","key":"9354_CR4","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1215\/00294527-2009-004","volume":"50","author":"P Cintula","year":"2009","unstructured":"Cintula, P., & Metcalfe, G. (2009). Structural completeness in fuzzy logics. Notre Dame Journal of Formal Logic, 50(2), 153\u2013183.","journal-title":"Notre Dame Journal of Formal Logic"},{"key":"9354_CR5","unstructured":"Cintula, P., & Metcalfe, G. Admissible Rules in the Implication-Negation Fragment of Intuitionistic Logic, Submitted."},{"key":"9354_CR6","first-page":"816","volume":"19","author":"AI Citkin","year":"1978","unstructured":"Citkin, A.I. (1978). On structurally complete superintuitionistic logics. Soviet Mathematics Doklady, 19, 816\u2013819.","journal-title":"Soviet Mathematics Doklady"},{"key":"9354_CR7","first-page":"19","volume":"5","author":"W Dzik","year":"1995","unstructured":"Dzik, W. (1995). On Structural completeness of some nonclassical predicate calculi. Reports on Mathematical Logic, 5, 19\u201326.","journal-title":"Reports on Mathematical Logic"},{"key":"9354_CR8","first-page":"37","volume":"38","author":"W Dzik","year":"2004","unstructured":"Dzik, W. (2004). Chains of structurally complete predicate logics with the application of Prucnal\u2019s substitution. Reports on Mathematical Logic, 38, 37\u201348.","journal-title":"Reports on Mathematical Logic"},{"issue":"2","key":"9354_CR9","doi-asserted-by":"crossref","first-page":"859","DOI":"10.2307\/2586506","volume":"64","author":"S Ghilardi","year":"1999","unstructured":"Ghilardi, S. (1999). Unification in intuitionistic logic. Journal of Symbolic Logic, 64 (2), 859\u2013880.","journal-title":"Journal of Symbolic Logic"},{"key":"9354_CR10","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/S0168-0072(99)00032-9","volume":"102","author":"S Ghilardi","year":"2000","unstructured":"Ghilardi, S. (2000). Best solving modal equations. Annals of Pure and Applied Logic, 102, 183\u2013198.","journal-title":"Annals of Pure and Applied Logic"},{"issue":"3","key":"9354_CR11","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1093\/jigpal\/10.3.229","volume":"10","author":"S Ghilardi","year":"2002","unstructured":"Ghilardi, S. (2002). A resolution\/tableaux algorithm for projective approximations in IPC. Logic Journal of the IGPL, 10(3), 227\u2013241.","journal-title":"Logic Journal of the IGPL"},{"issue":"1-3","key":"9354_CR12","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.apal.2003.11.010","volume":"127","author":"S Ghilardi","year":"2004","unstructured":"Ghilardi, S. (2004). Unification, Finite Duality and Projectivity in Varieties of Heyting Algebras. Annals of Pure and Applied Logic, 127(1-3), 99\u2013115.","journal-title":"Annals of Pure and Applied Logic"},{"key":"9354_CR13","doi-asserted-by":"crossref","unstructured":"Goudsmit, J.G., & Iemhoff, R. On unification and admissible rules in Gabbay\u2013de Jongh logics. Annals of Pure and Applied Logic. to appear.","DOI":"10.1016\/j.apal.2013.09.003"},{"key":"9354_CR14","first-page":"1","volume":"313","author":"JG Goudsmit","year":"2013","unstructured":"Goudsmit, J.G. (2013). The Admissible Rules of B D 2 and GSc. Logic Group Preprint Series, 313, 1\u201323.","journal-title":"Logic Group Preprint Series"},{"key":"9354_CR15","first-page":"1","volume":"315","author":"JG Goudsmit","year":"2013","unstructured":"Goudsmit, J.G. (2013). Admissibility and Refutation: Some Characterisations of Intermediate Logics. Logic Group Preprint Series, 315, 1\u201323.","journal-title":"Logic Group Preprint Series"},{"issue":"1","key":"9354_CR16","doi-asserted-by":"crossref","first-page":"281","DOI":"10.2307\/2694922","volume":"66","author":"R Iemhoff","year":"2001","unstructured":"Iemhoff, R. (2001). On the admissible rules of intuitionistic propositional logic. Journal of Symbolic Logic, 66(1), 281\u2013294.","journal-title":"Journal of Symbolic Logic"},{"issue":"1","key":"9354_CR17","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1305\/ndjfl\/1107220674","volume":"46","author":"R Iemhoff","year":"2005","unstructured":"Iemhoff, R. (2005). Intermediate logics and Visser\u2019s rules. Notre Dame Journal of Formal Logic, 46(1), 65\u201381.","journal-title":"Notre Dame Journal of Formal Logic"},{"key":"9354_CR18","doi-asserted-by":"crossref","unstructured":"Iemhoff, R. A syntactic approach to unification in transitive reflexive modal logics. Notre Dame Journal of Formal Logic. to appear.","DOI":"10.1215\/00294527-345997"},{"issue":"1-2","key":"9354_CR19","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/j.apal.2008.10.011","volume":"159","author":"R Iemhoff","year":"2009","unstructured":"Iemhoff, R., & Metcalfe, G. (2009). Proof theory for admissible rules. Annals of Pure and Applied Logic, 159(1-2), 171\u2013186.","journal-title":"Annals of Pure and Applied Logic"},{"key":"9354_CR20","unstructured":"Iemhoff, R., & Metcalfe, G. (2009). Hypersequent systems for the admissible rules of modal and intermediate logics In Artemov, S., & Nerode, A. (Eds.), Lecture Notes in Computer Science 5407 - Proceedings of LFCS \u201909, (pp. 230\u2013245): Springer."},{"key":"9354_CR21","unstructured":"Iemhoff, R., & Rozi\u00e8re, P. Unification in fragments of intermediate logics. Journal of Symbolic Logic. to appear."},{"issue":"4","key":"9354_CR22","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1093\/logcom\/exi029","volume":"15","author":"E Je\u0159\u00e1bek","year":"2005","unstructured":"Je\u0159\u00e1bek, E. (2005). Admissible rules of modal logics. Journal of Logic and Computation, 15(4), 411\u2013431.","journal-title":"Journal of Logic and Computation"},{"key":"9354_CR23","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/s00153-006-0028-9","volume":"46","author":"E Je\u0159\u00e1bek","year":"2007","unstructured":"Je\u0159\u00e1bek, E. (2007). Complexity of admissible rules. Archive for Mathematical Logic, 46, 73\u201392.","journal-title":"Archive for Mathematical Logic"},{"issue":"3","key":"9354_CR24","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1093\/jigpal\/jzn004","volume":"16","author":"E Je\u0159\u00e1bek","year":"2008","unstructured":"Je\u0159\u00e1bek, E. (2008). Independent bases of admissible rules. Logic Journal of the IGPL, 16(3), 249\u2013267.","journal-title":"Logic Journal of the IGPL"},{"key":"9354_CR25","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.2178\/jsl\/1254748686","volume":"74","author":"E Je\u0159\u00e1bek","year":"2009","unstructured":"Je\u0159\u00e1bek, E. (2009). Canonical rules. Journal of Symbolic Logic, 74, 1171\u20131205.","journal-title":"Journal of Symbolic Logic"},{"issue":"2","key":"9354_CR26","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1093\/logcom\/exp078","volume":"20","author":"E Je\u0159\u00e1bek","year":"2010","unstructured":"Je\u0159\u00e1bek, E. (2010). Admissible rules of \u0141ukasiewicz logic. Journal of Logic and Computation, 20(2), 425\u2013447.","journal-title":"Journal of Logic and Computation"},{"issue":"6","key":"9354_CR27","doi-asserted-by":"crossref","first-page":"1149","DOI":"10.1093\/logcom\/exp082","volume":"20","author":"E Je\u0159\u00e1bek","year":"2010","unstructured":"Je\u0159\u00e1bek, E. (2010). Bases of admissible rules of \u0141ukasiewicz logic. Journal of Logic and Computation, 20(6), 1149\u20131163.","journal-title":"Journal of Logic and Computation"},{"key":"9354_CR28","unstructured":"Je\u0159\u00e1bek, E. (2011). Blending margins, preprint, pp.1\u20139."},{"key":"9354_CR29","first-page":"119","volume":"4","author":"I Johansson","year":"1937","unstructured":"Johansson, I. (1937). Der Minimalkalk\u00fcl, ein reduzierter intuitionistischer Formalismus. Compositio Mathematica, 4, 119\u2013136.","journal-title":"Compositio Mathematica"},{"key":"9354_CR30","doi-asserted-by":"crossref","unstructured":"Lorenzen, P. (1955). Einf\u00fchrung in die operative Logic und Mathematik, Volume 78 of Grundlehren der mathematischen Wissenschaften: Springer.","DOI":"10.1007\/978-3-662-01539-1"},{"key":"9354_CR31","first-page":"21","volume":"22","author":"P Minari","year":"1988","unstructured":"Minari, P., & Wronski, A. (1988). The property (HD) in intermediate logics: a partial solution of a problem of H. Ono. Reports on Mathematical Logic, 22, 21\u201325.","journal-title":"Reports on Mathematical Logic"},{"issue":"32","key":"9354_CR32","first-page":"85","volume":"V","author":"G Mints","year":"1972","unstructured":"Mints, G. (1972). Derivability of admissible rules, in Studies in constructive mathematics and mathematical logic. Zap. Nauchn. Sem. LOMI, V(32), 85\u201389. Nauka, Leningrad.","journal-title":"Zap. Nauchn. Sem. LOMI"},{"issue":"7-8","key":"9354_CR33","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1016\/j.apal.2013.01.001","volume":"164","author":"S Odintsov","year":"2013","unstructured":"Odintsov, S., & Rybakov, V.V. (2013). Unification and Admissible rules for paraconsistent minimal Johanssons logic J and positive intuitionistic logic IPC+. Annals of Pure and Applied Logic, 164(7-8), 771\u2013784.","journal-title":"Annals of Pure and Applied Logic"},{"issue":"5","key":"9354_CR34","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1093\/jigpal\/jzn014","volume":"16","author":"JS Olson","year":"2008","unstructured":"Olson, J.S., Raftery, J.G., & Alten, C.J.V. (2008). Structural completeness in substructural logics. Logic Journal of the IGPL, 16(5), 453\u2013495.","journal-title":"Logic Journal of the IGPL"},{"key":"9354_CR35","first-page":"349","volume":"19","author":"WA Pogorzelski","year":"1971","unstructured":"Pogorzelski, W.A. (1971). Structural completeness of the propositional calculus. Bulletin de l\u2019Academie Polonaise des Sciences, S\u00e9rie de sciences math\u00e9matiques, astronomiques et physiques, 19, 349\u2013351.","journal-title":"Bulletin de l\u2019Academie Polonaise des Sciences, S\u00e9rie de sciences math\u00e9matiques, astronomiques et physiques"},{"issue":"1","key":"9354_CR36","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1002\/malq.19750210138","volume":"21","author":"WA Pogorzelski","year":"1975","unstructured":"Pogorzelski, W.A., & Prucnal, T. (1975). Structural completeness of the first-order predicate calculus. Mathematical Logic Quarterly, 21(1), 315\u2013320.","journal-title":"Mathematical Logic Quarterly"},{"issue":"1","key":"9354_CR37","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF02120824","volume":"32","author":"T Prucnal","year":"1973","unstructured":"Prucnal, T. (1973). On the structural completeness of some pure implicational propositional calculi. Studia Logica, 32(1), 45\u201350.","journal-title":"Studia Logica"},{"issue":"3","key":"9354_CR38","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF00405383","volume":"38","author":"T Prucnal","year":"1979","unstructured":"Prucnal, T. (1979). On two problems of Harvey Friedman. Studia Logica, 38(3), 247\u2013262.","journal-title":"Studia Logica"},{"key":"9354_CR39","first-page":"103","volume":"6","author":"T Prucnal","year":"1976","unstructured":"Prucnal, T. (1976). Structural completeness of Medvedev\u2019s propositional calculus. Reports on Mathematical Logic, 6, 103\u2013105.","journal-title":"Reports on Mathematical Logic"},{"key":"9354_CR40","unstructured":"Rozi\u00e8re, P. (1992). Regles admissibles en calcul propositionnel intuitionniste, PhD thesis, Universit\u00e9 Paris VII."},{"issue":"1","key":"9354_CR41","first-page":"37","volume":"24","author":"V Rybakov","year":"1995","unstructured":"Rybakov, V. (1995). Even tabular modal logics sometimes do not have independent base for admissible rules. Bulletin of the Section of Logic, 24(1), 37\u201340.","journal-title":"Bulletin of the Section of Logic"},{"key":"9354_CR42","unstructured":"Rybakov, V. (1997). Admissibility of Logical Inference Rules: Elsevier."},{"issue":"50","key":"9354_CR43","doi-asserted-by":"crossref","first-page":"4323","DOI":"10.1016\/j.tcs.2010.09.012","volume":"411","author":"V Rybakov","year":"2010","unstructured":"Rybakov, V. (2010). Rules admissible in transitive temporal logic TS4, sufficient condition. Theoretical Computer Science, 411(50), 4323\u20134332.","journal-title":"Theoretical Computer Science"},{"issue":"5","key":"9354_CR44","doi-asserted-by":"crossref","first-page":"1199","DOI":"10.1093\/logcom\/exr022","volume":"22","author":"V Rybakov","year":"2012","unstructured":"Rybakov, V. (2012). Writing out unifiers in linear temporal logic. Journal of Logic and Computation, 22(5), 1199\u20131206.","journal-title":"Journal of Logic and Computation"},{"key":"9354_CR45","first-page":"75","volume":"23","author":"R Skura","year":"1989","unstructured":"Skura, R. (1989). A complete syntactical characterization of the intuitionistic logic. Reports on Mathematical Logic, 23, 75\u201380.","journal-title":"Reports on Mathematical Logic"},{"issue":"4","key":"9354_CR46","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1305\/ndjfl\/1093634487","volume":"33","author":"J Slaney","year":"1992","unstructured":"Slaney, J., & Meyer, R. (1992). A Structurally Complete Fragment of Relevant Logic. Notre Dame Journal of Formal Logic, 33(4), 561\u2013566.","journal-title":"Notre Dame Journal of Formal Logic"},{"issue":"12","key":"9354_CR47","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1002\/malq.201110001","volume":"58","author":"K S\u0142omczy\u0144ska","year":"2012","unstructured":"S\u0142omczy\u0144ska, K. (2012). Algebraic semantics for the ( \u21d4 , \u00ac \u00ac ) $(\\leftrightarrow ,\\neg \\neg )$ \u2013fragment of IPC. Mathematical Logic Quarterly, 58 (12), 29\u201337.","journal-title":"Mathematical Logic Quarterly"},{"key":"9354_CR48","doi-asserted-by":"crossref","unstructured":"Troelstra, A., & Schwichtenberg, H. (2000). Basic Proof Theory: Cambridge University Press.","DOI":"10.1017\/CBO9781139168717"},{"issue":"1","key":"9354_CR49","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1305\/ndjfl\/1039096308","volume":"40","author":"A Visser","year":"1999","unstructured":"Visser, A. (1999). Rules and Arithmetics. Notre Dame Journal of Formal Logic, 40(1), 116\u2013140.","journal-title":"Notre Dame Journal of Formal Logic"},{"issue":"1-3","key":"9354_CR50","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/S0168-0072(01)00081-1","volume":"114","author":"A Visser","year":"2002","unstructured":"Visser, A. (2002). Substitutions of \u03a3 1 0 $\\Sigma _{1}^{0}$ -sentences: explorations between intuitionistic propositional logic and intuitionistic arithmetic. Annals of Pure and Applied Logic, 114 (1-3), 227\u2013271.","journal-title":"Annals of Pure and Applied Logic"},{"issue":"1","key":"9354_CR51","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1305\/ndjfl\/1093636011","volume":"33","author":"T Williamson","year":"1992","unstructured":"Williamson, T. (1992). An Alternative Rule of Disjunction in Modal Logic. Notre Dame Journal of Formal Logic, 33(1), 89\u2013100.","journal-title":"Notre Dame Journal of Formal Logic"},{"issue":"3","key":"9354_CR52","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1305\/ndjfl\/1093634728","volume":"34","author":"T Williamson","year":"1993","unstructured":"Williamson, T. (1993). Some Admissible Rules in Nonnormal Modal Systems. Notre Dame Journal of Formal Logic, 34 (3), 378\u2013400.","journal-title":"Notre Dame Journal of Formal Logic"},{"key":"9354_CR53","first-page":"69","volume":"38","author":"P Wojtylak","year":"2004","unstructured":"Wojtylak, P. (2004). On a problem of H. Friedman and its solution by T. Prucnal. Reports on Mathematical Logic, 38, 69\u201386.","journal-title":"Reports on Mathematical Logic"},{"issue":"4","key":"9354_CR54","doi-asserted-by":"crossref","first-page":"article 25","DOI":"10.1145\/1380572.1380574","volume":"9","author":"F Wolter","year":"2008","unstructured":"Wolter, F., & Zakharyaschev, M. (2008). Undecidability of the Unification and Admissibility Problems for Modal and Description Logics. ACM Transactions on Computational Logic, 9(4), article 25.","journal-title":"ACM Transactions on Computational Logic"},{"key":"9354_CR55","first-page":"105","volume":"29","author":"A Wro\u0144ski","year":"1995","unstructured":"Wro\u0144ski, A. (1995). Transparent Unification Problem. Reports on Mathematical Logic, 29, 105\u2013107.","journal-title":"Reports on Mathematical Logic"},{"key":"9354_CR56","doi-asserted-by":"crossref","unstructured":"W\u00f3jcicki, R. (1988). Theory of Logical Calculi: Basic Theory of Consequence Operations, Synthese Library \/ Vol. 199: Kluwer Academic Publishers.","DOI":"10.1007\/978-94-015-6942-2"},{"issue":"1","key":"9354_CR57","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1070\/SM1991v068n01ABEH002104","volume":"68","author":"M Zakharyaschev","year":"1991","unstructured":"Zakharyaschev, M. (1991). Modal companions of superintuitionistic logics: syntax, semantics, and preservation theorems. Mathematics of the USSR, Sbornik, 68(1), 277\u2013289.","journal-title":"Mathematics of the USSR, Sbornik"},{"issue":"4","key":"9354_CR58","doi-asserted-by":"crossref","first-page":"1377","DOI":"10.2307\/2275372","volume":"57","author":"M Zakharyaschev","year":"1992","unstructured":"Zakharyaschev, M. (1992). Canonical formulas for K4. Part I: Basic results. Journal of Symbolic Logic, 57(4), 1377\u20131402.","journal-title":"Journal of Symbolic Logic"},{"issue":"2","key":"9354_CR59","doi-asserted-by":"crossref","first-page":"421","DOI":"10.2307\/2275669","volume":"61","author":"M Zakharyaschev","year":"1996","unstructured":"Zakharyaschev, M. (1996). Canonical formulas for K4. Part II: Cofinal subframe logics. Journal of Symbolic Logic, 61(2), 421\u2013449.","journal-title":"Journal of Symbolic Logic"},{"issue":"3","key":"9354_CR60","doi-asserted-by":"crossref","first-page":"950","DOI":"10.2307\/2275581","volume":"62","author":"M Zakharyaschev","year":"1997","unstructured":"Zakharyaschev, M. (1997). Canonical formulas for K4. Part III: the finite model property. Journal of Symbolic Logic, 62(3), 950\u2013975.","journal-title":"Journal of Symbolic Logic"}],"container-title":["Journal of Philosophical Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10992-015-9354-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10992-015-9354-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10992-015-9354-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,24]],"date-time":"2019-08-24T14:02:10Z","timestamp":1566655330000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10992-015-9354-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,5]]},"references-count":60,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["9354"],"URL":"https:\/\/doi.org\/10.1007\/s10992-015-9354-x","relation":{},"ISSN":["0022-3611","1573-0433"],"issn-type":[{"value":"0022-3611","type":"print"},{"value":"1573-0433","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5,5]]}}}