{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:26:02Z","timestamp":1740122762543,"version":"3.37.3"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,10,28]],"date-time":"2017-10-28T00:00:00Z","timestamp":1509148800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100006245","name":"Ministry of Science and Technology, Israel","doi-asserted-by":"publisher","award":["817\/15"],"award-info":[{"award-number":["817\/15"]}],"id":[{"id":"10.13039\/501100006245","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Form Methods Syst Des"],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1007\/s10703-017-0301-z","type":"journal-article","created":{"date-parts":[[2017,10,28]],"date-time":"2017-10-28T09:53:34Z","timestamp":1509184414000},"page":"419-430","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Keeping logic in the trivium of computer science: a teaching perspective"],"prefix":"10.1007","volume":"51","author":[{"given":"J. A.","family":"Makowsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Zamansky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,28]]},"reference":[{"key":"301_CR1","volume-title":"Logic of mathematics: a modern course of classical logic","author":"Z Adamowicz","year":"2011","unstructured":"Adamowicz Z, Zbierski P (2011) Logic of mathematics: a modern course of classical logic. Wiley, New York"},{"key":"301_CR2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804090","volume-title":"Computational complexity: a modern approach","author":"S Arora","year":"2009","unstructured":"Arora S, Barak B (2009) Computational complexity: a modern approach. Cambridge University Press, Cambridge"},{"issue":"5","key":"301_CR3","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1145\/2663342","volume":"58","author":"T Ball","year":"2015","unstructured":"Ball T, Zorn B (2015) Teach foundational language principles. Commun ACM 58(5):30\u201331","journal-title":"Commun ACM"},{"key":"301_CR4","unstructured":"Barland I, Felleisen M, Fisler K, Kolaitis P, Vardi MY (2000) Integrating logic into the computer science curriculum. In: Innovation and technology in computer science education"},{"key":"301_CR5","unstructured":"Barwise J, Feferman S (eds) (1985) Model-theoretic logics. In: Perspectives in mathematical logic. Springer, Berlin"},{"key":"301_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-4129-7","volume-title":"Mathematical logic for computer science","author":"M Ben-Ari","year":"2012","unstructured":"Ben-Ari M (2012) Mathematical logic for computer science. Springer, Berlin"},{"key":"301_CR7","volume-title":"The calculus of computation: decision procedures with applications to verification","author":"A Bradley","year":"2007","unstructured":"Bradley A, Manna Z (2007) The calculus of computation: decision procedures with applications to verification. Springer, Berlin"},{"key":"301_CR8","doi-asserted-by":"crossref","DOI":"10.1515\/9780691187068","volume-title":"Fixing frege","author":"J Burgess","year":"2005","unstructured":"Burgess J (2005) Fixing frege. Princeton University Press, Princeton"},{"key":"301_CR9","volume-title":"Handbook of proof theory","author":"S Buss","year":"1998","unstructured":"Buss S (1998) Handbook of proof theory, vol 137. Elsevier, Amsterdam"},{"key":"301_CR10","doi-asserted-by":"crossref","unstructured":"Chamarthi H, Dillinger P, Manolios P, Vroon D (2011) The acl2 sedan theorem proving system. In: International conference on tools and algorithms for the construction and analysis of systems. Springer, pp 291\u2013295","DOI":"10.1007\/978-3-642-19835-9_27"},{"key":"301_CR11","volume-title":"Model checking","author":"EM Clarke","year":"1999","unstructured":"Clarke EM, Grumberg O, Peled D (1999) Model checking. MIT Press, Cambridge"},{"key":"301_CR12","volume-title":"A mathematical introduction to logic","author":"H Enderton","year":"2001","unstructured":"Enderton H, Enderton HB (2001) A mathematical introduction to logic. Academic press, London"},{"key":"301_CR13","volume-title":"Logic for computer science: foundations of automatic theorem proving","author":"JH Gallier","year":"2015","unstructured":"Gallier JH (2015) Logic for computer science: foundations of automatic theorem proving. Courier Dover Publications, New York"},{"key":"301_CR14","series-title":"Mathematical series","volume-title":"Computers and intractability","author":"MG Garey","year":"1979","unstructured":"Garey MG, Johnson DS (1979) Computers and intractability. Mathematical series. W.H. Freeman and Company, San Francisco"},{"key":"301_CR15","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804106","volume-title":"Computational complexity: a conceptual approach","author":"O Goldreich","year":"2008","unstructured":"Goldreich O (2008) Computational complexity: a conceptual approach. Cambridge University Press, Cambridge"},{"key":"301_CR16","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511576430","volume-title":"Handbook of practical logic and automated reasoning","author":"J Harrison","year":"2009","unstructured":"Harrison J (2009) Handbook of practical logic and automated reasoning. Cambridge University Press, Cambridge"},{"key":"301_CR17","first-page":"23","volume-title":"Grundz\u00fcge der theoretischen logik","author":"D Hilbert","year":"1928","unstructured":"Hilbert D, Ackermann W (1928) Grundz\u00fcge der theoretischen logik, vol 1037. Springer, Berlin, p 23"},{"key":"301_CR18","series-title":"Encyclopedia of mathematics and its applications","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511551574","volume-title":"Model theory","author":"W Hodges","year":"1993","unstructured":"Hodges W (1993) Model theory, vol 42. Encyclopedia of mathematics and its applications. Cambridge University Press, Cambridge"},{"key":"301_CR19","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511810275","volume-title":"Logic in computer science: modelling and reasoning about systems","author":"M Huth","year":"2004","unstructured":"Huth M, Ryan M (2004) Logic in computer science: modelling and reasoning about systems. Cambridge University Press, Cambridge"},{"issue":"2","key":"301_CR20","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1145\/505145.505149","volume":"11","author":"D Jackson","year":"2002","unstructured":"Jackson D (2002) Alloy: a lightweight object modelling notation. ACM Trans Softw Eng Methodol (TOSEM) 11(2):256\u2013290","journal-title":"ACM Trans Softw Eng Methodol (TOSEM)"},{"key":"301_CR21","volume-title":"Set theory","author":"T Jech","year":"1978","unstructured":"Jech T (1978) Set theory. Academic Press, London"},{"key":"301_CR22","series-title":"Springer monographs in mathematics","volume-title":"Set theory. The third millenium edition, revised and expanded","author":"T Jech","year":"2003","unstructured":"Jech T (2003) Set theory. The third millenium edition, revised and expanded. Springer monographs in mathematics. Springer, Berlin"},{"key":"301_CR23","volume-title":"The art of computer programming","author":"DE Knuth","year":"1969","unstructured":"Knuth DE (1969) The art of computer programming, vol 1. Addison Wesley, Boston"},{"issue":"5","key":"301_CR24","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1109\/2.841783","volume":"33","author":"TC Lethbridge","year":"2000","unstructured":"Lethbridge TC (2000) What knowledge is important to a software professional? Computer 33(5):44\u201350","journal-title":"Computer"},{"key":"301_CR25","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-07003-1","volume-title":"Elements of finite model theory","author":"L Libkin","year":"2004","unstructured":"Libkin L (2004) Elements of finite model theory. Springer, Berlin"},{"issue":"1\u20134","key":"301_CR26","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s10472-009-9115-z","volume":"53","author":"JA Makowsky","year":"2008","unstructured":"Makowsky JA (2008) From Hilbert\u2019s program to a logic toolbox. Ann Math Artif Intell 53(1\u20134):225\u2013250","journal-title":"Ann Math Artif Intell"},{"key":"301_CR27","unstructured":"Makowsky JA (2015) Teaching logic for computer science: are we teaching the wrong narrative? In: TTL 2015 proceedings of fourth international conference on tools for teaching logic"},{"key":"301_CR28","doi-asserted-by":"crossref","unstructured":"Mendelson E (1987) Introduction to mathematical logic. Wadsworth Publ. Co., Belmont, CA","DOI":"10.1007\/978-1-4615-7288-6"},{"key":"301_CR29","doi-asserted-by":"crossref","unstructured":"Page RL (2003) Software is discrete mathematics. In: ACM SIGPLAN notices, ACM, vol 38.9, pp 79\u201386","DOI":"10.1145\/944705.944713"},{"key":"301_CR30","volume-title":"Computational complexity","author":"C Papadimitriou","year":"1994","unstructured":"Papadimitriou C (1994) Computational complexity. Addison Wesley, Boston"},{"key":"301_CR31","volume-title":"Mathematical logic","author":"J Shoenfield","year":"1967","unstructured":"Shoenfield J (1967) Mathematical logic, vol 21. Addison-Wesley, Boston"},{"key":"301_CR32","volume-title":"Turing computability: theory and applications","author":"RI Soare","year":"2016","unstructured":"Soare RI (2016) Turing computability: theory and applications. Springer, Berlin"},{"key":"301_CR33","doi-asserted-by":"crossref","unstructured":"Spichkova M (2016) Boring formal methods or Sherlock Holmes deduction methods? In: Federation of international conferences on software technologies: applications and foundations. Springer, pp 242\u2013252","DOI":"10.1007\/978-3-319-50230-4_18"},{"key":"301_CR34","unstructured":"Tavolato P, Vogt F (2012) Integrating formal methods into computer science curricula at a university of applied sciences. In: TLA+ workshop at the 18th international symposium on formal methods, Paris, Frankreich"},{"key":"301_CR35","doi-asserted-by":"crossref","unstructured":"ten Cate B, van Benthem J, Vaananen J (2007) Lindstrom theorems for fragments of first-order logic. In: 22nd annual IEEE symposium on logic in computer science, 2007, LICS 2007. IEEE, pp 280\u2013292","DOI":"10.1109\/LICS.2007.29"},{"key":"301_CR36","doi-asserted-by":"crossref","unstructured":"van Benthem J, ten Cate B, V\u00e4\u00e4nanen J (2009) Lindstrom theorems for fragments of first-order logic. Log Methods Comput Sci 5:280\u2013292","DOI":"10.2168\/LMCS-5(3:3)2009"},{"key":"301_CR37","unstructured":"Wikipedia, Liberal arts education. https:\/\/en.wikipedia.org\/wiki\/Liberal_arts_education#Seven_liberal_arts"},{"key":"301_CR38","unstructured":"Wikipedia, Vienna circle. https:\/\/en.wikipedia.org\/wiki\/Vienna_Circle"},{"key":"301_CR39","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/3-540-45499-3_2","volume-title":"Algebraic methodology and software technology","author":"JM Wing","year":"2000","unstructured":"Wing JM (2000) Invited talk: weaving formal methods into the undergraduate computer science curriculum. Algebraic methodology and software technology. Springer, Berlin, pp 2\u20137"},{"key":"301_CR40","doi-asserted-by":"crossref","unstructured":"Zamansky A, Farchi E (2015) Helping the tester get it right: towards supporting agile combinatorial test design. In: 2nd human-oriented formal methods workshop (HOFM 2015)","DOI":"10.1007\/978-3-662-49224-6_4"},{"key":"301_CR41","unstructured":"Zamansky A, Farchi E (2015) Teaching logic to information systems students: challenges and opportunities. In: TTL 2015 proceedings of fourth international conference on tools for teaching logic"},{"key":"301_CR42","unstructured":"Zamansky A, Rogachevsky K, Levy M, Kogan M (2016) How many likes can we get for logic? Exploring the potential of Facebook for enhancing core software engineering courses. In: Proceedings of the European conference on software engineering education"},{"key":"301_CR43","doi-asserted-by":"crossref","unstructured":"Zamansky A, Zohar Y (2016) Mathematical does not mean boring: integrating software assignments to enhance learning of logico-mathematical concepts. In: International conference on advanced information systems engineering. Springer, pp 103\u2013108","DOI":"10.1007\/978-3-319-39564-7_10"},{"key":"301_CR44","unstructured":"Zamansky Z (2017) Teaching logic to information systems students: a student-centric approach. IFCOLOG J Log Appl (forthcoming)"}],"container-title":["Formal Methods in System Design"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10703-017-0301-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10703-017-0301-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10703-017-0301-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,5]],"date-time":"2019-10-05T04:50:45Z","timestamp":1570251045000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10703-017-0301-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,28]]},"references-count":44,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,11]]}},"alternative-id":["301"],"URL":"https:\/\/doi.org\/10.1007\/s10703-017-0301-z","relation":{},"ISSN":["0925-9856","1572-8102"],"issn-type":[{"type":"print","value":"0925-9856"},{"type":"electronic","value":"1572-8102"}],"subject":[],"published":{"date-parts":[[2017,10,28]]}}}