Automated theorem proving (ATP) for Propositional Classical Logic is an algorithm to check the validity of a formula. It is a very well-known problem which is decidable but co-NP-complete. There are many algorithms for this problem. In this paper, an educationally oriented implementation of Semantic Tableaux method is described. The program has…

We present an analysis of students' formal constructions in mathematics regarding to syntactic, semantic and pragmatic aspects. The analyzed tasks correspond to students of the Course of Mathematics for the admission to the university. Our study was qualitative, consisted in the identification, analysis and interpretation, focused in logic…

This article discusses a variety of examples in errors in mathematical reasoning, the source of which is due to the tension between the syntax (form of mathematical expression) and semantics (underlying ideas or meaning). This article suggests that the heightened awareness of syntactic and semantic reasoning, and the consequent resolution of the…

It is widely attested that university students face considerable difficulties with reasoning in analysis, especially when dealing with statements involving two different quantifiers. We focus in this paper on a specific mistake which appears in proofs where one applies twice or more a statement of the kind "for all X, there exists Y such that R(X,…