{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:29:37Z","timestamp":1743146977732,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031384981"},{"type":"electronic","value":"9783031384998"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,9,2]],"date-time":"2023-09-02T00:00:00Z","timestamp":1693612800000},"content-version":"vor","delay-in-days":244,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We present a simple calculus for deriving statements about the local behaviour of partial, continuous functions over the reals, within a collection of such functions associated with the elements of a finite partial order. We show that the calculus is sound in general and complete for particular partial orders and statements. The motivation for this work is drawn from an attempt to foster digitalisation in secondary-eduction classrooms, in particular in experimental lessons in natural science classes. This provides a way to formally model experiments and to automatically derive the truth of hypotheses made about certain phenomena in such experiments.<\/jats:p>","DOI":"10.1007\/978-3-031-38499-8_9","type":"book-chapter","created":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T23:03:25Z","timestamp":1693609405000},"page":"153-169","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Formal Reasoning About Influence in\u00a0Natural Sciences Experiments"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6800-7135","authenticated-orcid":false,"given":"Florian","family":"Bruse","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1621-0972","authenticated-orcid":false,"given":"Martin","family":"Lange","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00f6ren","family":"M\u00f6ller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,2]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Alur, R., et al.: Hybrid modeling and simulation of biomolecular networks. In: Proceedings of 4th International Workshop on Hybrid Systems: Computation and Control, HSCC 2001, vol. 2034, pp. 19\u201332 (2001)","DOI":"10.1007\/3-540-45351-2_6"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Andrews, P.B.: An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof, 2nd edn. Kluwer Academic Publishers, Alphen aan den Rijn (2002)","DOI":"10.1007\/978-94-015-9934-4"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/978-3-540-68894-5_12","volume-title":"Formal Methods for Computational Systems Biology","author":"L Bortolussi","year":"2008","unstructured":"Bortolussi, L., Policriti, A.: Hybrid systems and biology. In: Bernardo, M., Degano, P., Zavattaro, G. (eds.) SFM 2008. LNCS, vol. 5016, pp. 424\u2013448. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68894-5_12"},{"key":"9_CR4","unstructured":"Bruse, F., Lange, M., M\u00f6ller, S.: The calculus of temporal influence. In: Submitted to the 30th International Symposium on Temporal Representation and Reasoning, TIME-2023 (2023)"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Buss, S.R.: First-order proof theory of arithmetic. In: Handbook of Proof Theory, pp. 79\u2013147. Elsevier, Amsterdam (1998)","DOI":"10.1016\/S0049-237X(98)80017-7"},{"issue":"4","key":"9_CR6","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1093\/bib\/bbm029","volume":"8","author":"C Chaouiya","year":"2007","unstructured":"Chaouiya, C.: Petri net modelling of biological networks. Brief. Bioinf. 8(4), 210\u2013219 (2007)","journal-title":"Brief. Bioinf."},{"key":"9_CR7","series-title":"Undergraduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2355-7","volume-title":"Mathematical Logic","author":"HD Ebbinghaus","year":"1994","unstructured":"Ebbinghaus, H.D., Flum, J., Thomas, W.: Mathematical Logic. Undergraduate Texts in Mathematics, 2nd edn. Springer-Verlag, Heidelberg (1994). https:\/\/doi.org\/10.1007\/978-1-4757-2355-7","edition":"2"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Garg, D., Genovese, V., Negri, S.: Countermodels from sequent calculi in multi-modal logics. In: Proceedings of 27th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2012, pp. 315\u2013324. IEEE (2012)","DOI":"10.1109\/LICS.2012.42"},{"issue":"2","key":"9_CR9","doi-asserted-by":"publisher","first-page":"127","DOI":"10.2307\/421107","volume":"2","author":"L Henkin","year":"1996","unstructured":"Henkin, L.: The discovery of my completeness proofs. Bull. Symb. Logic 2(2), 127\u2013158 (1996)","journal-title":"Bull. Symb. Logic"},{"key":"9_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.compedu.2020.103897","volume":"153","author":"D Hillmayr","year":"2020","unstructured":"Hillmayr, D., Ziernwald, L., Reinhold, F., Hofer, S., Reiss, K.: The potential of digital tools to enhance mathematics and science learning in secondary schools: a context-specific meta-analysis. Comput. Educ. 153, 103897 (2020)","journal-title":"Comput. Educ."},{"key":"9_CR11","unstructured":"Kastaun, M., Meier, M., Hundeshagen, N., Lange, M.: ProfiLL: professionalisierung durch intelligente Lehr-Lernsysteme. In: Bildung, Schule, Digitalisierung, pp. 357\u2013363. Waxmann-Verlag (2020)"},{"issue":"12","key":"9_CR12","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1002\/minf.201000086","volume":"29","author":"I Koch","year":"2010","unstructured":"Koch, I.: Petri nets - a mathematical formalism to analyze chemical reaction networks. Molec. Inf. 29(12), 838\u2013843 (2010). https:\/\/doi.org\/10.1002\/minf.201000086","journal-title":"Molec. Inf."},{"key":"9_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-71549-5","volume-title":"Temporal Logic of Programs","author":"F Kr\u00f6ger","year":"1987","unstructured":"Kr\u00f6ger, F.: Temporal Logic of Programs, 1st edn. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/978-3-642-71549-5","edition":"1"},{"issue":"1","key":"9_CR14","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s11787-014-0097-1","volume":"8","author":"S Negri","year":"2014","unstructured":"Negri, S.: Proofs and countermodels in non-classical logics. Logica Universalis 8(1), 25\u201360 (2014). https:\/\/doi.org\/10.1007\/s11787-014-0097-1","journal-title":"Logica Universalis"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Rademaker, A.: A Proof Theory for Description Logics. Springer Briefs in Computer Science. Springer, Heidelberg (2012)","DOI":"10.1007\/978-1-4471-4002-3"},{"key":"9_CR16","unstructured":"Rathjen, M., Sieg, W.: Proof theory. In: The Stanford Encyclopedia of Philosophy. Metaphysics Research Lab, Stanford University (2020)"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Smullyan, R.M.: First-Order-Logic, 2 edn. Springer, Heidelberg (1968)","DOI":"10.1007\/978-3-642-86718-7"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Sumatokhin, S., Petrova, O., Serovayskaya, D., Chistiakov, F.: Digitalization of school biological education: problems and solutions. In: SHS Web of Conferences, vol. 79, p. 01016. EDP Sciences (2020)","DOI":"10.1051\/shsconf\/20207901016"},{"key":"9_CR19","series-title":"Advances in Experimental Medicine and Biology","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-319-56246-9_27","volume-title":"GeNeDis 2016","author":"G Theocharopoulou","year":"2017","unstructured":"Theocharopoulou, G., Bobori, C., Vlamos, P.: Formal models of biological systems. In: Vlamos, P. (ed.) GeNeDis 2016. AEMB, vol. 988, pp. 325\u2013338. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56246-9_27"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction \u2013 CADE 29"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-38499-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T23:04:11Z","timestamp":1693609451000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-38499-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031384981","9783031384998"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-38499-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"2 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CADE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Automated Deduction","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cade2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/easyconferences.eu\/cade2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"77","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}