{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T04:12:32Z","timestamp":1748751152086,"version":"3.41.0"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319276823"},{"type":"electronic","value":"9783319276830"}],"license":[{"start":{"date-parts":[[2015,12,10]],"date-time":"2015-12-10T00:00:00Z","timestamp":1449705600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-27683-0_24","type":"book-chapter","created":{"date-parts":[[2015,12,9]],"date-time":"2015-12-09T21:16:29Z","timestamp":1449695789000},"page":"349-363","source":"Crossref","is-referenced-by-count":0,"title":["The Complexity of Disjunction in Intuitionistic Logic"],"prefix":"10.1007","author":[{"given":"R.","family":"Ramanujam","sequence":"first","affiliation":[]},{"given":"Vaishnavi","family":"Sundararajan","sequence":"additional","affiliation":[]},{"given":"S. P.","family":"Suresh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,10]]},"reference":[{"issue":"4","key":"24_CR1","doi-asserted-by":"publisher","first-page":"706","DOI":"10.1145\/155183.155225","volume":"15","author":"M Abadi","year":"1993","unstructured":"Abadi, M., Burrows, M., Lampson, B., Plotkin, G.: A calculus for access control in distributed systems. ACM TOPLAS 15(4), 706\u2013734 (1993)","journal-title":"ACM TOPLAS"},{"key":"24_CR2","unstructured":"Baskar, A., Naldurg, P., Raghavendra, K.R., Suresh, S.P.: Primal infon logic: derivability in polynomial time. In: FSTTCS 2013, LIPIcs, vol. 24, pp. 163\u2013174 (2013)"},{"key":"24_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-642-15155-2_11","volume-title":"Mathematical Foundations of Computer Science 2010","author":"A Baskar","year":"2010","unstructured":"Baskar, A., Ramanujam, R., Suresh, S.P.: A DEXPTIME-complete Dolev-Yao theory with distributive encryption. In: Hlinen\u00fd, P., Kucera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 102\u2013113. Springer, Heidelberg (2010)"},{"issue":"1","key":"24_CR4","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1093\/logcom\/exs018","volume":"24","author":"LD Beklemishev","year":"2014","unstructured":"Beklemishev, L.D., Gurevich, Y.: Propositional primal logic with disjunction. J. Log. Comp. 24(1), 257\u2013282 (2014)","journal-title":"J. Log. Comp."},{"key":"24_CR5","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198537793.001.0001","volume-title":"Modal Logic","author":"A Chagrov","year":"1997","unstructured":"Chagrov, A., Zakharyaschev, M.: Modal Logic. Clarendon Press, Oxford (1997)"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Comon-Lundh, H., Shmatikov, V.: Intruder deductions, constraint solving and insecurity decisions in presence of exclusive or. In: LICS 2003, pp. 271\u2013280 (2003)","DOI":"10.1109\/LICS.2003.1210067"},{"key":"24_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-540-39910-0_10","volume-title":"Verification: Theory and Practice","author":"H Comon-Lundh","year":"2003","unstructured":"Comon-Lundh, H., Treinen, R.: Easy intruder deductions. In: Dershowitz, N. (ed.) Verification: Theory and Practice. LNCS, vol. 2772, pp. 225\u2013242. Springer, Heidelberg (2003)"},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1109\/TIT.1983.1056650","volume":"29","author":"D Dolev","year":"1983","unstructured":"Dolev, D., Yao, A.: On the security of public-key protocols. IEEE Trans. Inf. Theory 29, 198\u2013208 (1983)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"24_CR9","doi-asserted-by":"publisher","first-page":"67","DOI":"10.2307\/2272344","volume":"39","author":"DM Gabbay","year":"1974","unstructured":"Gabbay, D.M., de Jongh, D.H.J.: A sequence of decidable finitely axiomatizable intermediate logics with the disjunction property. J. Sym. Log. 39(1), 67\u201378 (1974)","journal-title":"J. Sym. Log."},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Gurevich, Y., Neeman, I.: DKAL: Distributed-knowledge authorization language. In: 21st IEEE CSF Symposium, pp. 149\u2013162. IEEE Press, New York (2008)","DOI":"10.1109\/CSF.2008.8"},{"issue":"2","key":"24_CR11","first-page":"9:1","volume":"12","author":"Y Gurevich","year":"2011","unstructured":"Gurevich, Y., Neeman, I.: Logic of infons: the propositional case. ACM Trans. Comp. Log. 12(2), 9:1\u20139:28 (2011)","journal-title":"ACM Trans. Comp. Log."},{"issue":"3","key":"24_CR12","first-page":"427","volume":"161","author":"H Kurokawa","year":"2009","unstructured":"Kurokawa, H.: Hypersequent calculi for intuitionistic logic with classical atoms. APAL 161(3), 427\u2013446 (2009)","journal-title":"APAL"},{"issue":"5","key":"24_CR13","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1016\/j.ipl.2015.01.003","volume":"115","author":"M Magirius","year":"2015","unstructured":"Magirius, M., Mundhenk, M., Palenta, R.: The complexity of primal logic with disjunction. IPL 115(5), 536\u2013542 (2015)","journal-title":"IPL"},{"issue":"2","key":"24_CR14","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1145\/151261.151265","volume":"40","author":"DA McAllester","year":"1993","unstructured":"McAllester, D.A.: Automatic Recognition of Tractability in Inference Relations. JACM 40(2), 284\u2013303 (1993)","journal-title":"JACM"},{"key":"24_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/978-3-319-13841-1_4","volume-title":"Information Systems Security","author":"R Ramanujam","year":"2014","unstructured":"Ramanujam, R., Sundararajan, V., Suresh, S.P.: Extending Dolev-Yao with assertions. In: Prakash, A., Shyamasundar, R. (eds.) ICISS 2014. LNCS, vol. 8880, pp. 50\u201368. Springer, Heidelberg (2014)"},{"key":"24_CR16","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1016\/S0304-3975(02)00490-5","volume":"299","author":"M Rusinowitch","year":"2003","unstructured":"Rusinowitch, M., Turuani, M.: Protocol insecurity with finite number of sessions and composed keys is NP-complete. TCS 299, 451\u2013475 (2003)","journal-title":"TCS"},{"key":"24_CR17","unstructured":"Sakharov, A.: Median logic. Technical report, St. Petersberg Mathematical Society (2004). http:\/\/www.mathsoc.spb.ru\/preprint\/2004\/index.html"}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27683-0_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T18:39:36Z","timestamp":1748716776000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27683-0_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,10]]},"ISBN":["9783319276823","9783319276830"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27683-0_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015,12,10]]}}}