{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T05:19:33Z","timestamp":1780723173963,"version":"3.54.1"},"reference-count":67,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,11,9]],"date-time":"2020-11-09T00:00:00Z","timestamp":1604880000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,11,9]],"date-time":"2020-11-09T00:00:00Z","timestamp":1604880000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100008969","name":"Alfred Kordelinin S\u00e4\u00e4ti\u00f6","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100008969","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003125","name":"Suomen Kulttuurirahasto","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003125","id-type":"DOI","asserted-by":"publisher"}]},{"name":"University of Helsinki including Helsinki University Central Hospital"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Minds &amp; Machines"],"published-print":{"date-parts":[[2021,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In computational complexity theory, decision problems are divided into complexity classes based on the amount of computational resources it takes for algorithms to solve them. In theoretical computer science, it is commonly accepted that only functions for solving problems in the complexity class P, solvable by a deterministic Turing machine in polynomial time, are considered to be tractable. In cognitive science and philosophy, this tractability result has been used to argue that only functions in P can feasibly work as computational models of human cognitive capacities. One interesting area of computational complexity theory is descriptive complexity, which connects the expressive strength of systems of logic with the computational complexity classes. In descriptive complexity theory, it is established that only first-order (classical) systems are connected to P, or one of its subclasses. Consequently, second-order systems of logic are considered to be computationally intractable, and may therefore seem to be unfit to model human cognitive capacities. This would be problematic when we think of the role of logic as the foundations of mathematics. In order to express many important mathematical concepts and systematically prove theorems involving them, we need to have a system of logic stronger than classical first-order logic. But if such a system is considered to be intractable, it means that the logical foundation of mathematics can be prohibitively complex for human cognition. In this paper I will argue, however, that this problem is the result of an unjustified direct use of computational complexity classes in cognitive modelling. Placing my account in the recent literature on the topic, I argue that the problem can be solved by considering computational complexity for humanly relevant problem solving algorithms and input sizes.<\/jats:p>","DOI":"10.1007\/s11023-020-09545-4","type":"journal-article","created":{"date-parts":[[2020,11,9]],"date-time":"2020-11-09T06:03:52Z","timestamp":1604901832000},"page":"75-98","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Descriptive Complexity, Computational Tractability, and the Logical and Cognitive Foundations of Mathematics"],"prefix":"10.1007","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8572-1453","authenticated-orcid":false,"given":"Markus","family":"Pantsar","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,11,9]]},"reference":[{"key":"9545_CR1","unstructured":"Aaronson, S. (2009). BQP and the Polynomial Hierarchy. Proc. 42nd Symposium on Theory of Computing (STOC 2009), Association for Computing Machinery, 141\u2013 150."},{"key":"9545_CR2","volume-title":"Computability: G\u00f6del, Turing, Church, and beyond","author":"S Aaronson","year":"2012","unstructured":"Aaronson, S. (2012). Why philosophers and cognitive scientists should care about computational complexity. In J. Copeland, et al. (Eds.), Computability: G\u00f6del, Turing, Church, and beyond. Cambridge: MIT Press."},{"issue":"5","key":"9545_CR3","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1090\/S0002-9904-1976-14122-5","volume":"82","author":"K Appel","year":"1976","unstructured":"Appel, K., & Haken, W. (1976). Every planar map is four colorable. Bulletin of the American mathematical Society, 82(5), 711\u2013712.","journal-title":"Bulletin of the American mathematical Society"},{"key":"9545_CR4","volume-title":"Computational complexity. A modern approach","author":"S Arora","year":"2007","unstructured":"Arora, S., & Barak, B. (2007). Computational complexity. A modern approach. Cambridge: Cambridge University Press."},{"key":"9545_CR5","volume-title":"Computational Complexity and Natural Language","author":"RC Berwick","year":"1987","unstructured":"Berwick, R. C., Barton, G. E, Jr., & Ristad, E. S. (1987). Computational Complexity and Natural Language. Cambridge, MA: MIT Press."},{"issue":"2","key":"9545_CR6","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/321386.321395","volume":"14","author":"M Blum","year":"1967","unstructured":"Blum, M. (1967). A machine-independent theory of the complexity of recursive functions. Journal of the ACM (JACM), 14(2), 322\u2013336.","journal-title":"Journal of the ACM (JACM)"},{"key":"9545_CR7","doi-asserted-by":"crossref","unstructured":"Boole, G. (1854). An investigation of the laws of thought: on which are founded the mathematical theories of logic and probabilities. Dover,. Publications.","DOI":"10.5962\/bhl.title.29413"},{"issue":"1","key":"9545_CR8","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/S0010-0277(98)00006-7","volume":"66","author":"M Brysbaert","year":"1998","unstructured":"Brysbaert, M., Fias, W., & No\u00ebl, M. (1998). The Whorfian hypothesis and numerical cognition: Is \u201ctwenty-four\u201d processed in the same way as \u201cfour-and-twenty\u201d? Cognition, 66(1), 51\u201377.","journal-title":"Cognition"},{"key":"9545_CR500","doi-asserted-by":"crossref","unstructured":"Buijsman, S. & Pantsar M. (2020). Complexity of mental integer addition. Journal of Numerical Cognition, 6(1), 148\u2013163.","DOI":"10.5964\/jnc.v6i1.218"},{"issue":"58","key":"9545_CR9","doi-asserted-by":"crossref","first-page":"345","DOI":"10.2307\/2371045","volume":"58","author":"A Church","year":"1936","unstructured":"Church, A. (1936). An unsolvable problem of elementary number theory. American Journal of Mathematics., 58(58), 345\u2013363.","journal-title":"American Journal of Mathematics."},{"key":"9545_CR10","unstructured":"Cobham, A. (1964). The intrinsic computational difficulty of functions, Proceedings of the 1964 Congress on Logic, Mathematics and the Methodology of Science, 24\u201330."},{"key":"9545_CR11","doi-asserted-by":"crossref","first-page":"117","DOI":"10.7551\/mitpress\/2930.003.0009","volume-title":"Explanation and cognition","author":"R Cummins","year":"2000","unstructured":"Cummins, R. (2000). How to solve it. \u201cHow does it work?\u201d vs. \u201cWhat are the laws?\u201d Two conceptions of psychological explanation. In F. Keil & R. Wilson (Eds.), Explanation and cognition (pp. 117\u2013145). Cambridge, MA: MIT Press."},{"key":"9545_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized complexity","author":"RG Downey","year":"1999","unstructured":"Downey, R. G., & Fellows, M. R. (1999). Parameterized complexity. New York: Springer-Verlag."},{"issue":"3","key":"9545_CR13","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J Edmonds","year":"1965","unstructured":"Edmonds, J. (1965). Paths, trees, and flowers. Canadian Journal of Mathematics, 17(3), 449\u2013467.","journal-title":"Canadian Journal of Mathematics"},{"key":"9545_CR14","doi-asserted-by":"crossref","unstructured":"Fabry, R.E. (2020). The cerebral, extra-cerebral bodily, and socio-cultural dimensions of enculturated arithmetical cognition. Synthese, 197, 3685\u20133720.","DOI":"10.1007\/s11229-019-02238-1"},{"key":"9545_CR501","doi-asserted-by":"publisher","unstructured":"Fabry, R.E. & Pantsar, M. (2019). A fresh look at research strategies in computational cognitive science: The case of enculturated mathematical problem solving. Synthese. https:\/\/doi.org\/10.1007\/s11229-019-02276-9","DOI":"10.1007\/s11229-019-02276-9"},{"key":"9545_CR15","unstructured":"Fagin, R. (1974). Generalized First-order Spectra and Polynomial-time Recognizable Sets. In R.Karp (ed.): Complexity of Computation, SIAM-AMS Proceedings, Vol. 7, 43-73."},{"key":"9545_CR16","doi-asserted-by":"crossref","unstructured":"Fraenkel, A. S., & Lichtenstein, D. (1981, July). Computing a perfect strategy for $$\\text{n}\\times \\text{ n }$$ chess requires time exponential in n. In International Colloquium on Automata, Languages, and Programming. Springer: Berlin, Heidelberg, 278-293.","DOI":"10.1007\/3-540-10843-2_23"},{"key":"9545_CR17","volume-title":"The Foundations of Arithmetic","author":"G Frege","year":"1884","unstructured":"Frege, G. (1884). The Foundations of Arithmetic. Oxford: Basil Blackwell."},{"issue":"3","key":"9545_CR18","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1023\/A:1017503201702","volume":"11","author":"M Frixione","year":"2001","unstructured":"Frixione, M. (2001). Tractable competence. Minds and Machines, 11(3), 379\u2013397.","journal-title":"Minds and Machines"},{"key":"9545_CR19","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: W.H. Freeman."},{"issue":"1","key":"9545_CR20","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1037\/0033-295X.115.1.230","volume":"115","author":"G Gigerenzer","year":"2008","unstructured":"Gigerenzer, G., Hoffrage, U., & Goldstein, D. G. (2008). Fast and frugal heuristics are plausible models of cognition: Reply to Dougherty, Franco-Watkins, and Thomas (2008). Psychological Review, 115(1), 230\u2013239.","journal-title":"Psychological Review"},{"issue":"3","key":"9545_CR21","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1145\/1412700.1412710","volume":"39","author":"O Goldreich","year":"2008","unstructured":"Goldreich, O. (2008). Computational complexity: A conceptual perspective. ACM Sigact News, 39(3), 35\u201339.","journal-title":"ACM Sigact News"},{"key":"9545_CR22","first-page":"14","volume-title":"Computer Science Logic 1999","author":"M Grohe","year":"1999","unstructured":"Grohe, M. (1999). Descriptive and parameterized complexity. In J. Flum & M. Rodriguez-Artalejo (Eds.), Computer Science Logic 1999 (pp. 14\u201331). Berlin, Heidelberg: Springer."},{"key":"9545_CR23","unstructured":"Hemaspaandra, L. (2018). 17.5 Complexity classes. In K.H. Rosen (ed.): Handbook of Discrete and Combinatorial Mathematics. Discrete Mathematics and Its Applications (2nd ed.), CRC Press, pp. 1308\u2013 1314."},{"key":"9545_CR24","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511624919","volume-title":"Principles of mathematics revisited","author":"J Hintikka","year":"1996","unstructured":"Hintikka, J. (1996). Principles of mathematics revisited. New York: Cambridge University Press."},{"key":"9545_CR25","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1016\/S0049-237X(08)70066-1","volume":"126","author":"J Hintikka","year":"1989","unstructured":"Hintikka, J., & Sandu, G. (1989). Informational independence as a semantical phenomenon. Studies in Logic and the Foundations of Mathematics, 126, 571\u2013589.","journal-title":"Studies in Logic and the Foundations of Mathematics"},{"key":"9545_CR26","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511551574","volume-title":"Model theory","author":"W Hodges","year":"1993","unstructured":"Hodges, W. (1993). Model theory. Cambridge: Cambridge University Press."},{"key":"9545_CR27","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2105.001.0001","volume-title":"Connectionism and the philosophy of psychology","author":"T Horgan","year":"1996","unstructured":"Horgan, T., & Tienson, J. (1996). Connectionism and the philosophy of psychology. Cambridge, MA: MIT Press."},{"issue":"10","key":"9545_CR28","first-page":"1127","volume":"42","author":"N Immerman","year":"1995","unstructured":"Immerman, N. (1995). Descriptive complexity: A logician\u2019s approach to computation. Notices of the American Mathematical Society, 42(10), 1127\u20131133.","journal-title":"Notices of the American Mathematical Society"},{"key":"9545_CR29","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0539-5","volume-title":"Descriptive complexity","author":"N Immerman","year":"1999","unstructured":"Immerman, N. (1999). Descriptive complexity. New York: Springer Science & Business Media."},{"key":"9545_CR30","doi-asserted-by":"crossref","unstructured":"Isaac, A. M., Szymanik, J., & Verbrugge, R. (2014). Logic and complexity in cognitive science. In Johan van Benthem on logic and information dynamics (pp. 787-824). Springer International Publishing.","DOI":"10.1007\/978-3-319-06025-5_30"},{"key":"9545_CR31","unstructured":"Lample, G. & Charton, F. (2019). Deep Learning for Symbolic Mathematics. arXiv:1912.01412"},{"key":"9545_CR502","doi-asserted-by":"crossref","unstructured":"Lucas, J. R. (1961). Minds, machines and G\u00f6del. Philosophy, 112\u2013127.","DOI":"10.1017\/S0031819100057983"},{"key":"9545_CR32","volume-title":"Vision: A computational investigation into the human representation and processing of visual information","author":"D Marr","year":"1982","unstructured":"Marr, D. (1982). Vision: A computational investigation into the human representation and processing of visual information. San Francisco: W.H. Freeman and Company."},{"key":"9545_CR33","volume-title":"Mathematical cognition: A case of enculturation. Open MIND","author":"R Menary","year":"2015","unstructured":"Menary, R. (2015). Mathematical cognition: A case of enculturation. Open MIND. Frankfurt a. M.: MIND Group."},{"issue":"1\u20134","key":"9545_CR34","first-page":"363","volume":"188","author":"M Mostowski","year":"2012","unstructured":"Mostowski, M., & Szymanik, J. (2012). Semantic bounds for everyday language. Semiotica, 188(1\u20134), 363\u2013372.","journal-title":"Semiotica"},{"issue":"1","key":"9545_CR35","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0004-3702(82)90012-1","volume":"18","author":"A Newell","year":"1982","unstructured":"Newell, A. (1982). The knowledge level. Artificial intelligence, 18(1), 87\u2013127.","journal-title":"Artificial intelligence"},{"issue":"288","key":"9545_CR36","doi-asserted-by":"crossref","first-page":"2033","DOI":"10.1090\/S0025-5718-2013-02787-1","volume":"83","author":"T Oliveira e Silva","year":"2014","unstructured":"Oliveira e Silva, T., Herzog, S., & Pardi, S., (2014). Empirical verification of the even Goldbach conjecture and computation of prime gaps up to $$4{*}10^{{1}^{8}}$$. Mathematics of Computation, 83(288), 2033\u20132060.","journal-title":"Mathematics of Computation"},{"key":"9545_CR503","unstructured":"Pantsar, M. (2009). Truth, Proof and G\u00f6delian Arguments: A Defence of Tarskian Truth in Mathematics. Philosophical Studies from the University of Helsinki, Vol. 23, Helsinki: the University of Helsinki."},{"key":"9545_CR504","doi-asserted-by":"crossref","unstructured":"Pantsar, M. (2014). An empirically feasible approach to the epistemology of arithmetic. Synthese, 191(17), 4201\u20134229.","DOI":"10.1007\/s11229-014-0526-y"},{"key":"9545_CR505","doi-asserted-by":"crossref","unstructured":"Pantsar, M. (2019a). The enculturated move from proto-arithmetic to arithmetic. Frontiers in Psychology, 10, 1454.","DOI":"10.3389\/fpsyg.2019.01454"},{"key":"9545_CR506","doi-asserted-by":"publisher","unstructured":"Pantsar, M. (2019b). Cognitive and computational complexity: Considerations from mathematical problem solving. Erkenntnis. https:\/\/doi.org\/10.1007\/s10670-019-00140-3.","DOI":"10.1007\/s10670-019-00140-3"},{"key":"9545_CR507","doi-asserted-by":"crossref","unstructured":"Pantsar, M. (2020). Mathematical cognition and enculturation: introduction to the Synthese special issue. Synthese, 197, 3647\u20133655.","DOI":"10.1007\/s11229-019-02478-1"},{"key":"9545_CR37","volume-title":"Computational complexity","author":"C Papadimitriou","year":"1994","unstructured":"Papadimitriou, C. (1994). Computational complexity. Boston: Addison-Wesley."},{"key":"9545_CR38","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198519737.001.0001","volume-title":"The Emperor\u2019s new mind: Concerning computers, minds and the laws of physics","author":"R Penrose","year":"1989","unstructured":"Penrose, R. (1989). The Emperor\u2019s new mind: Concerning computers, minds and the laws of physics. Oxford: Oxford University Press."},{"key":"9545_CR39","volume-title":"Shadows of the Mind. A Search for the Missing Science of Consciousness","author":"R Penrose","year":"1994","unstructured":"Penrose, R. (1994). Shadows of the Mind. A Search for the Missing Science of Consciousness. Oxford: Oxford University Press."},{"issue":"1","key":"9545_CR40","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1023\/A:1021348629167","volume":"13","author":"G Piccinini","year":"2003","unstructured":"Piccinini, G. (2003). Alan Turing and the mathematical objection. Minds and Machines, 13(1), 23\u201348.","journal-title":"Minds and Machines"},{"issue":"12","key":"9545_CR41","first-page":"1473","volume":"43","author":"C Pomerance","year":"1996","unstructured":"Pomerance, C. (1996). A tale of two sieves. Notices of the American Mathematical Society, 43(12), 1473\u20131485.","journal-title":"Notices of the American Mathematical Society"},{"key":"9545_CR42","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2004.001.0001","volume-title":"Computation and cognition: Towards a foundation of cognitive science","author":"ZW Pylyshyn","year":"1984","unstructured":"Pylyshyn, Z. W. (1984). Computation and cognition: Towards a foundation of cognitive science. Cambridge, MA: MIT Press."},{"key":"9545_CR43","volume-title":"The Language Complexity Game","author":"ES Ristad","year":"1993","unstructured":"Ristad, E. S. (1993). The Language Complexity Game. Cambridge, MA: MIT Press."},{"key":"9545_CR44","volume-title":"Principles of Mathematics","author":"B Russell","year":"1903","unstructured":"Russell, B. (1903). Principles of Mathematics. New York: Norton."},{"key":"9545_CR45","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107298019","volume-title":"Understanding Machine Learning - from Theory to Algorithms","author":"Shai Shalev-Shwartz","year":"2014","unstructured":"Shalev-Shwartz, Shai, & Ben-David, Shai. (2014). Understanding Machine Learning - from Theory to Algorithms. Cambridge: Cambridge University Press."},{"issue":"5","key":"9545_CR46","doi-asserted-by":"crossref","first-page":"e96223","DOI":"10.1371\/journal.pone.0096223","volume":"9","author":"F Soler-Toscano","year":"2014","unstructured":"Soler-Toscano, F., Zenil, H., Delahaye, J. P., & Gauvrit, N. (2014). Calculating Kolmogorov complexity from the output frequency distributions of small turing machines. PLoS ONE, 9(5), e96223.","journal-title":"PLoS ONE"},{"key":"9545_CR47","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","volume":"3","author":"LJ Stockmeyer","year":"1977","unstructured":"Stockmeyer, L. J. (1977). The polynomial-time hierarchy. Theoretical Computer Science, 3, 1\u201322.","journal-title":"Theoretical Computer Science"},{"key":"9545_CR48","unstructured":"Szymanik, J. (2016). Quantifiers and Cognition: Logical and Computational Perspectives, Studies in Linguistics and Philosophy Vol. 96, Springer."},{"key":"9545_CR49","doi-asserted-by":"crossref","unstructured":"Szymanik, J., & Verbrugge, R. (2018). Tractability and the computational mind. In M. Sprevak & M. Colombo (Eds.), The Routledge Handbook of the Computational Mind (pp. 339\u2013354). Routledge.","DOI":"10.4324\/9781315643670-26"},{"issue":"3","key":"9545_CR50","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1017\/S0140525X00079577","volume":"13","author":"JK Tsotsos","year":"1990","unstructured":"Tsotsos, J. K. (1990). Analyzing vision at the complexity level. Behavioral and Brain Sciences, 13(3), 423\u2013445.","journal-title":"Behavioral and Brain Sciences"},{"key":"9545_CR51","first-page":"230","volume":"42","author":"AM Turing","year":"1936","unstructured":"Turing, A. M. (1936). On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society, 42, 230\u2013265.","journal-title":"Proceedings of the London Mathematical Society"},{"key":"9545_CR52","unstructured":"Turing, A.M. (1948). Intelligent Machinery, reprinted in D.C. Ince (1992) (ed): Collected Works of A.M. Turing: Mechanical Intelligence, Amsterdam: North Holland, 87\u2013 106."},{"key":"9545_CR53","doi-asserted-by":"crossref","first-page":"939","DOI":"10.1080\/03640210801897856","volume":"32","author":"I van Rooij","year":"2008","unstructured":"van Rooij, I. (2008). The tractable cognition thesis. Cognitive Science, 32, 939\u2013984.","journal-title":"Cognitive Science"},{"key":"9545_CR54","doi-asserted-by":"crossref","DOI":"10.1017\/9781107358331","volume-title":"Cognition and Intractability: A Guide to Classical and Parameterized Complexity Analysis","author":"I Van Rooij","year":"2019","unstructured":"Van Rooij, I., Blokpoel, M., Kwisthout, J., & Wareham, T. (2019). Cognition and Intractability: A Guide to Classical and Parameterized Complexity Analysis. Cambridge: Cambridge University Press."},{"key":"9545_CR55","unstructured":"Vardi, M. Y. (1982). The complexity of relational query languages, In STOC\u201982: Proceedings of the 14th Annual ACM Symposium on Theory of Computing. New York: ACM Press, 137\u2013 146."},{"key":"9545_CR56","doi-asserted-by":"crossref","unstructured":"Vollmer, H. (1999). Introduction to Circuit Complexity. A uniform approach. Texts in Theoretical Computer Science. Berlin: Springer-Verlag.","DOI":"10.1007\/978-3-662-03927-4"},{"issue":"4","key":"9545_CR57","doi-asserted-by":"crossref","first-page":"504","DOI":"10.2307\/2687796","volume":"7","author":"J V\u00e4\u00e4n\u00e4nen","year":"2001","unstructured":"V\u00e4\u00e4n\u00e4nen, J. (2001). Second-order logic and foundations of mathematics. Bulletin of Symbolic Logic, 7(4), 504\u2013520.","journal-title":"Bulletin of Symbolic Logic"},{"key":"9545_CR58","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511611193","volume-title":"Dependence Logic: A New Approach to Independence Friendly Logic","author":"J V\u00e4\u00e4n\u00e4nen","year":"2007","unstructured":"V\u00e4\u00e4n\u00e4nen, J. (2007). Dependence Logic: A New Approach to Independence Friendly Logic. New York: Cambridge University Press."},{"key":"9545_CR59","unstructured":"V\u00e4\u00e4n\u00e4nen, J. (2019). Second-order and Higher-order Logic, in E. Zalta (ed.): The Stanford Encyclopedia of Philosophy. Fall 2020 edition. https:\/\/plato.stanford.edu\/archives\/fall2020\/entries\/logic-higher-order. Retrieved July 30th 2020."}],"container-title":["Minds and Machines"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11023-020-09545-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11023-020-09545-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11023-020-09545-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,17]],"date-time":"2024-08-17T03:42:37Z","timestamp":1723866157000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11023-020-09545-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,9]]},"references-count":67,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["9545"],"URL":"https:\/\/doi.org\/10.1007\/s11023-020-09545-4","relation":{},"ISSN":["0924-6495","1572-8641"],"issn-type":[{"value":"0924-6495","type":"print"},{"value":"1572-8641","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,11,9]]},"assertion":[{"value":"11 May 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 October 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 November 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}