Skip to main content

Teaching Syllogistics Using E-learning Tools

  • Conference paper
  • First Online:
E-Learning, E-Education, and Online Training

Abstract

This paper is a study of various strategies for teaching syllogistics as part of a course in basic logic. It is a continuation of earlier studies involving practical experiments with students of Communication using the Syllog system, which makes it possible to develop e-learning tools and to do learning analytics based on log-data. The aim of the present paper is to investigate whether the Syllog e-learning tools can be helpful in logic teaching in order to obtain a better understanding of logic and argumentation in general and syllogisms in particular. Four versions of a course in basic logic involving different teaching methods will be compared.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    See http://syllog.sourceforge.net/ and http://syllog.emergence.dk/2015/.

  2. 2.

    We may express these functors in terms of first order predicate calculus in the following way:

    figure b

    The four basic propositions can be related in terms of negation:

    figure c

    The classical syllogisms occur in four different figures:

    figure d

    where u, v, w \(\in \) {a, e, i, o} and where M, S, P are variables corresponding to “the middle term”, “the subject” and “the predicate” (of the conclusion).

  3. 3.

    It should be noted that (TRANS), which is in fact short for ‘transitivity’, may in fact be read as the syllogism barbara in Fig. 1. Furthermore, by substituting Z by non-Z we get the syllogism celarent in Fig. 1. — Similarly, it is obvious that (SUBST), which is short for ‘substitution’, leads directly to the syllogism darii in Fig. 1, and if Z is replaced by non-Z we get ferio in Fig. 1. The three remaining rules are different from the first two in the sense that they only depend on one premise each. (CONTRA) — which is short for ‘contraposition’ — makes it possible to transform a universally quantified proposition, whereas (MUT) — which is short for ‘mutation’ — makes it possible to transform an existentially quantified proposition. (EX) — which is short for ‘existence’ — makes it possible to derive an existentially quantified proposition from a universally quantified proposition.

  4. 4.

    Using this deductive approach to the syllogisms, it is possible to show a number of interesting results concerning the invalidity of certain syllogistic arguments. For instance, by going through the five rules of inference it is evident that if both premises are existential, then nothing new follows regarding the relation between subject and predicate. The same holds if both premises are negative i.e. o-propositions or e-propositions. The use of the inference rule (EX) has sometimes been seen as controversial, and the 9 syllogisms which depend on this rule have consequently been seen as “questioned”. Clearly (EX) has to be rejected, if we hold that the statement “all S are P” is true given that S is the empty set. Therefore, if this is accepted it should obviously not be permitted to deduce “some” from “all”. If the EX rule is excluded, the number of valid syllogisms is reduced from 24 to 15.

References

  1. Aristotle: Prior analytics. Translated by A.J. Jenkinson. The internet classics archive (1994–2000). http://classics.mit.edu/Aristotle/prior.html

  2. Kabbaj, A., Frasson, C., Kaltenbach, M., Djamen, J.-Y.: A conceptual and contextual object-oriented logic programming: the PROLOG++ language. In: Tepfenhart, W.M., Dick, J.P., Sowa, J.F. (eds.) ICCS 1994. LNAI, vol. 835, pp. 251–274. Springer, Heidelberg (2005)

    Google Scholar 

  3. Kabbaj, A., Janta-Polczynski, M.: From PROLOG++ to PROLOG+CG: a CG object-oriented logic programming language. In: Ganter, B., Mineau, G.W. (eds.) Conceptual Structures: Logical, Linguistic, and Computational Issues. LNCS, vol. 1867, pp. 540–554. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  4. Kabbaj, A., Moulin, B., Gancef, J., Nadeau, D., Rouleau, O.: Uses, improvements, and extensions of Prolog+CG: case studies. In: Delugach, H.S., Stumme, G. (eds.) ICCS-ConceptStruct 2001. LNCS (LNAI), vol. 2120, pp. 346–359. Springer, Heidelberg (2001). doi:10.1007/3-540-44583-8_25

  5. Øhrstrøm, P., Sandborg-Petersen, U., Ploug, T.: Syllog - a tool for logic teaching. In: Proceedings of Artificial Intelligence Workshops 2010 (AIW 2010), Mimos Berhad, pp. 42–55 (2010)

    Google Scholar 

  6. Øhrstrøm, P., Sandborg-Petersen, U., Thorvaldsen, S., Ploug, T.: Classical syllogisms in logic teaching. In: Pfeiffer, H.D., Ignatov, D.I., Poelmans, J., Gadiraju, N. (eds.) ICCS-ConceptStruct 2013. LNCS (LNAI), vol. 7735, pp. 31–43. Springer, Heidelberg (2013). doi:10.1007/978-3-642-35786-2_4

    Chapter  Google Scholar 

  7. Øhrstrøm, P., Sandborg-Petersen, U., Thorvaldsen, S., Ploug, T.: Teaching logic through web-based and gamified quizzing of formal arguments. In: Hernández-Leo, D., Ley, T., Klamma, R., Harrer, A. (eds.) EC-TEL 2013. LNCS, vol. 8095, pp. 410–423. Springer, Heidelberg (2013). doi:10.1007/978-3-642-40814-4_32

    Chapter  Google Scholar 

  8. Øhrstrøm, P., Sandborg-Petersen, U., Thorvaldsen, S., Ploug, T.: Teaching syllogistics using conceptual graphs. In: Hernandez, N., Jäschke, R., Croitoru, M. (eds.) ICCS 2014. LNCS (LNAI), vol. 8577, pp. 217–230. Springer, Heidelberg (2014). doi:10.1007/978-3-319-08389-6_18

    Google Scholar 

  9. Øhrstrøm, P., Sandborg-Petersen, U., Thorvaldsen, S., Ploug, T.: Teaching syllogistics through gamification and interactive proofs. In: Conole, G., Klobučar, T., Rensing, C., Konert, J., Lavoué, É. (eds.) EC-TEL 2015. LNCS, vol. 9307, pp. 609–612. Springer, Heidelberg (2015). doi:10.1007/978-3-319-24258-3_70

    Google Scholar 

  10. Parry, W.T., Hacker, E.A.: Aristotelian Logic. State University of New York Press, New York (1991)

    MATH  Google Scholar 

  11. Sandborg-Petersen, U., Schärfe, H., Øhrstrøm, P.: Online Course in Knowledge Representation Using Conceptual Graphs. Aalborg University (2005). http://cg.huminf.aau.dk

  12. Petersen, U.: Prolog+CG: a maintainer’s perspective. In: de Moor, A., Polovina, S., Delugach, H. (eds.) Proceedings of First Conceptual Structures Interoperability Workshop (CS-TIW 2006). Aalborg University Press, Aalborg (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Peter Øhrstrøm .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

About this paper

Cite this paper

Øhrstrøm, P., Sandborg-Petersen, U., Thorvaldsen, S., Ploug, T. (2017). Teaching Syllogistics Using E-learning Tools. In: Vincenti, G., Bucciero, A., Helfert, M., Glowatz, M. (eds) E-Learning, E-Education, and Online Training. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 180. Springer, Cham. https://doi.org/10.1007/978-3-319-49625-2_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-49625-2_13

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-49624-5

  • Online ISBN: 978-3-319-49625-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics