{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T00:10:20Z","timestamp":1758586220902,"version":"3.44.0"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032046994","type":"print"},{"value":"9783032047007","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-04700-7_31","type":"book-chapter","created":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T23:45:44Z","timestamp":1758498344000},"page":"420-433","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Quantum First-Order Logics and\u00a0Quantum Natural Deduction"],"prefix":"10.1007","author":[{"given":"Tomoyuki","family":"Yamakami","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,9,11]]},"reference":[{"key":"31_CR1","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/0022-0000(90)90022-D","volume":"41","author":"DAM Barrington","year":"1990","unstructured":"Barrington, D.A.M., Immerman, N., Straubing, H.: On uniformity within NC$$^1$$. J. Comput. System Sci. 41, 274\u2013306 (1990)","journal-title":"J. Comput. System Sci."},{"key":"31_CR2","doi-asserted-by":"publisher","first-page":"823","DOI":"10.2307\/1968621","volume":"37","author":"G Birkhoff","year":"1936","unstructured":"Birkhoff, G., von Neumann, J.: The logic of quantum mechanics. Ann. Math. 37, 823\u2013843 (1936)","journal-title":"Ann. Math."},{"key":"31_CR3","doi-asserted-by":"publisher","first-page":"1411","DOI":"10.1137\/S0097539796300921","volume":"26","author":"E Bernstein","year":"1997","unstructured":"Bernstein, E., Vazirani, U.: Quantum complexity theory. SIAM J. Comput. 26, 1411\u20131473 (1997)","journal-title":"SIAM J. Comput."},{"key":"31_CR4","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s11229-010-9783-6","volume":"179","author":"A Baltag","year":"2011","unstructured":"Baltag, A., Smets, S.: Quantum logic as a dynamic logic. Synthese 179, 285\u2013306 (2011)","journal-title":"Synthese"},{"key":"31_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511676277","volume-title":"Logical Fondations of Proof Complexity","author":"S Cook","year":"2010","unstructured":"Cook, S., Nguyen, P.: Logical Fondations of Proof Complexity. Cambridge University Press, Cambridge (2010)"},{"key":"31_CR6","unstructured":"Fagin, R.: Gneralized first-order spectra and polynomial-time recognizable sets. In: Karp, R. (ed.) Complexity of Computation. SIAM-AMS Proceedings, vol. 7, pp. 27\u201341 (1974)"},{"key":"31_CR7","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/BF01201353","volume":"39","author":"GKE Gentzen","year":"1934","unstructured":"Gentzen, G.K.E.: Untersuchungen \u00fcber das logische Schlie\u00dfen. I. Math. Zeitschrift 39, 176\u2013210 (1934)","journal-title":"Math. Zeitschrift"},{"key":"31_CR8","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/BF01201363","volume":"39","author":"GKE Gentzen","year":"1935","unstructured":"Gentzen, G.K.E.: Untersuchungen \u00fcber das logische Schlie\u00dfen. II. Math. Zeitschrift 39, 405\u2013431 (1935)","journal-title":"Math. Zeitschrift"},{"key":"31_CR9","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0019-9958(84)80062-5","volume":"61","author":"Y Gurevich","year":"1984","unstructured":"Gurevich, Y., Lewis, H.R.: A logic for constant-depth circuits. Inform. Control 61, 65\u201374 (1984)","journal-title":"Inform. Control"},{"key":"31_CR10","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/S0019-9958(86)80029-8","volume":"68","author":"N Immerman","year":"1986","unstructured":"Immerman, N.: Relational queries computable in polynomial time. Inform. Control 68, 86\u2013104 (1986)","journal-title":"Inform. Control"},{"key":"31_CR11","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1137\/0216051","volume":"16","author":"N Immerman","year":"1987","unstructured":"Immerman, N.: Languages that capture complexity classes. SIAM J. Comput. 16, 760\u2013778 (1987)","journal-title":"SIAM J. Comput."},{"key":"31_CR12","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1137\/0218043","volume":"18","author":"N Immerman","year":"1989","unstructured":"Immerman, N.: Expressibility and parallel complexity. SIAM J. Comput. 18, 625\u2013638 (1989)","journal-title":"SIAM J. Comput."},{"key":"31_CR13","first-page":"6","volume":"1","author":"S Ja\u015bkowski","year":"1934","unstructured":"Ja\u015bkowski, S.: On the rules of suppositions in formal logic. Stud. Log. 1, 6\u201332 (1934)","journal-title":"Stud. Log."},{"key":"31_CR14","doi-asserted-by":"crossref","unstructured":"Kitaev, A.Y., Shen, A.H., Vyalyi, M.N.: Classical and Quantumn Computation. Graduate Studies in Mathematics. Americal Mathematical Society (2002)","DOI":"10.1090\/gsm\/047"},{"key":"31_CR15","unstructured":"Kornell, A.: Discrete quantum structures. arXiv:2004.04377v6 (2022)"},{"key":"31_CR16","doi-asserted-by":"crossref","unstructured":"Yamakami, T.: Quantum NP and a quantum hierarchy. In: Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science (TCS 2002), Kluwer Academic Press (under the title of Foundations of Information Technology in the Era of Network and Mobile Computing), The International Federation for Information Processing, vol. 96 (Track 1), pp. 323\u2013336 (2002)","DOI":"10.1007\/978-0-387-35608-2_27"},{"key":"31_CR17","doi-asserted-by":"publisher","first-page":"1546","DOI":"10.1017\/jsl.2020.45","volume":"85","author":"T Yamakami","year":"2020","unstructured":"Yamakami, T.: A schematic definition of quantum polynomial time computability. J. Symb. Log. 85, 1546\u20131587 (2020)","journal-title":"J. Symb. Log."},{"key":"31_CR18","doi-asserted-by":"crossref","unstructured":"Yamakami, T.: Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice. Inf. Comput. 286, article 104783 (2022)","DOI":"10.1016\/j.ic.2021.104783"},{"key":"31_CR19","doi-asserted-by":"publisher","first-page":"710","DOI":"10.1017\/S0960129524000264","volume":"34","author":"T Yamakami","year":"2024","unstructured":"Yamakami, T.: Elementary quantum recursion schemes that capture quantum polylogaritmic-time\/space computability of quantum functions. Math. Struct. Comput. Sci. 34, 710\u2013745 (2024)","journal-title":"Math. Struct. Comput. Sci."},{"key":"31_CR20","doi-asserted-by":"crossref","unstructured":"Yamakami, T.: Quantum first-order logics that capture logarithmic-time\/space quantum computability. In: Proceedings of the 20th Conference on Computability in Europe (CiE 2024). Lecture Notes in Computer Science, vol. 14773, pp. 311\u2013323. Springer (2024). A complete and corrected version is available at arXiv:2501.12007 (2025)","DOI":"10.1007\/978-3-031-64309-5_25"},{"key":"31_CR21","doi-asserted-by":"crossref","unstructured":"Ying, M.: Hoare logic for quantum programs. arXiv:0906.4586v1 (2009)","DOI":"10.1145\/1507244.1507249"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-04700-7_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T23:45:47Z","timestamp":1758498347000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-04700-7_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,11]]},"ISBN":["9783032046994","9783032047007"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-04700-7_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,11]]},"assertion":[{"value":"11 September 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FCT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Fundamentals of Computation Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wroc\u0142aw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fct2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/fct.ii.uni.wroc.pl","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}