The potential benefits of cognitive skills in enhancing mathematics ability have been claimed by numerous researchers. Since mathematics requires a complete understanding and grasp of abstract concepts, it is essential to explore how learning with metacognitive skills affects mathematics learning. Thus, the study investigates the students' metacognitive awareness and conceptual understanding of integers. A descriptive-correlational method approach was utilized, and it was carried out on 303 seventh-grade students. The data were obtained using a metacognitive awareness inventory and achievement test on (...) integers. It was further revealed that the students have average metacognitive awareness and performed well in the fundamental operation of integers. Follow-up qualitative analysis revealed that students who were high achievers had the best understanding, average achievers had corrected or incomplete understanding, and low achievers had a functional misconception of integers. Moreover, the student's metacognitive awareness was significantly related to their conceptual understanding of integers. This indicates that student's higher-order thinking skills, such as metacognition, are essential since they are associated with building conceptual skills. Thus, teachers should encourage students' metacognitive awareness to improve students' conceptual understanding of integers. The study provides relevant information for educational managers on the potential factors to be considered in improving mathematics education practices, particularly in promoting metacognition among high school students. (shrink)

Robots as social companions in close proximity to humans have a strong potential of becoming more and more prevalent in the coming years, especially in the realms of elder day care, child rearing, and education. As human beings, we have the fascinating ability to emotionally bond with various counterparts, not exclusively with other human beings, but also with animals, plants, and sometimes even objects. Therefore, we need to answer the fundamental ethical questions that concern human-robot-interactions per se, and we need (...) to address how we conceive of »good lives«, as more and more of the aspects of our daily lives will be interwoven with social robots. (shrink)

The ability to solve problems is a prerequisite in preparing mathematics preservice teachers. This study assessed preservice teachers’ problem-solving difficulties and performance, particularly in worded problems on number sense, measurement, geometry, algebra, and probability. Also, academic profile differences in the preservice teacher’s problem-solving performance and common errors were determined. A descriptive-comparative research design was employed with 158 random respondents. Data were gathered face-to-face during the first semester of the school year 2022-2023, and data were analyzed with the aid of jamovi (...) software, ensuring ethical measures. Overall findings revealed that the preservice teachers experienced average difficulty in solving problems. The low performance of the preservice teachers on the given problems was also demonstrated. Further analysis revealed a significant difference between the preservice teachers’ problem-solving performance based on their subject preference and program. Moreover, the error analysis revealed that the preservice teachers incurred comprehension errors in misrepresentation, misinterpretation, and miscalculation. These results will serve as a measure for policymakers and curriculum developers of the teacher education institution concerned to make relevant enhancements to the math courses offered in the elementary and secondary education programs. (shrink)

Mathematical confidence and critical thinking are essential in preparing preservice teachers. Thus, this study explored the perceived confidence and critical thinking levels in mathematics of elementary and secondary preservice teachers. A descriptive-correlational-comparative research design was employed, with a sample of 107 randomly selected preservice teachers enrolled in the Bachelor in Elementary and Secondary Education programs of a state university in West Philippines. The study used arithmetic mean, standard deviation, Spearman’s rank-order correlation, and independent samples t-test to analyze and draw conclusions (...) from the data. The findings revealed that the preservice teachers have high confidence and critical thinking skills. Their program significantly correlates with their perceived critical thinking and confidence level. Besides, the preservice teachers’ confidence levels and perceived critical thinking skills significantly correlate. Further analysis found significant confidence and critical thinking differences favoring the secondary over the elementary preservice teachers. These findings provide insights that would benefit mathematics educators in providing priority programs to enhance the preparation of future math teachers. (shrink)

In 1988, J. Ivlev proposed some (non-normal) modal systems which are semantically characterized by four-valued non-deterministic matrices in the sense of A. Avron and I. Lev. Swap structures are multialgebras (a.k.a. hyperalgebras) of a special kind, which were introduced in 2016 by W. Carnielli and M. Coniglio in order to give a non-deterministic semantical account for several paraconsistent logics known as logics of formal inconsistency, which are not algebraizable by means of the standard techniques. Each swap structure induces naturally a (...) non-deterministic matrix. The aim of this paper is to obtain a swap structures semantics for some Ivlev-like modal systems proposed in 2015 by M. Coniglio, L. Fariñas del Cerro and N. Peron. Completeness results will be stated by means of the notion of Lindenbaum–Tarski swap structures, which constitute a natural generalization to multialgebras of the concept of Lindenbaum–Tarski algebras. (shrink)

One of the most expected properties of a logical system is that it can be algebraizable, in the sense that an algebraic counterpart of the deductive machinery could be found. Since the inception of da Costa's paraconsistent calculi, an algebraic equivalent for such systems have been searched. It is known that these systems are non self-extensional (i.e., they do not satisfy the replacement property). More than this, they are not algebraizable in the sense of Blok-Pigozzi. The same negative results hold (...) for several systems of the hierarchy of paraconsistent logics known as Logics of Formal Inconsistency (LFIs). Because of this, these logics are uniquely characterized by semantics of non-deterministic kind. This paper offers a solution for two open problems in the domain of paraconsistency, in particular connected to algebraization of LFIs, by obtaining several LFIs weaker than C1, each of one is algebraizable in the standard Lindenbaum-Tarski's sense by a suitable variety of Boolean algebras extended with operators. This means that such LFIs satisfy the replacement property. The weakest LFI satisfying replacement presented here is called RmbC, which is obtained from the basic LFI called mbC. Some axiomatic extensions of RmbC are also studied, and in addition a neighborhood semantics is defined for such systems. It is shown that RmbC can be defined within the minimal bimodal non-normal logic E+E defined by the fusion of the non-normal modal logic E with itself. Finally, the framework is extended to first-order languages. RQmbC, the quantified extension of RmbC, is shown to be sound and complete w.r.t. BALFI semantics. (shrink)

Why are natural theories pre-well-ordered by consistency strength? In previous work, an approach to this question was proposed. This approach was inspired by Martin's Conjecture, one of the most prominent conjectures in recursion theory. Fixing a reasonable subsystem $T$ of arithmetic, the goal was to classify the recursive functions that are monotone with respect to the Lindenbaum algebra of $T$. According to an optimistic conjecture, roughly, every such function must be equivalent to an iterate $\mathsf{Con}_T^\alpha$ of the consistency operator (...) ``in the limit'' within the ultrafilter of sentences that are true in the standard model. In previous work the author established the first case of this optimistic conjecture; roughly, every recursive monotone function is either as weak as the identity operator in the limit or as strong as $\mathsf{Con}_T$ in the limit. Yet in this note we prove that this optimistic conjecture fails already at the next step; there are recursive monotone functions that are neither as weak as $\mathsf{Con}_T$ in the limit nor as strong as $\mathsf{Con}_T^2$ in the limit. In fact, for every $\alpha$, we produce a function that is cofinally equivalent to $\mathsf{Con}^\alpha_T$ yet cofinally equivalent to $\mathsf{Con}_T$. (shrink)

This is a collection of new investigations and discoveries on the history of a great tradition, the Lvov-Warsaw School of logic , philosophy and mathematics, by the best specialists from all over the world. The papers range from historical considerations to new philosophical, logical and mathematical developments of this impressive School, including applications to Computer Science, Mathematics, Metalogic, Scientific and Analytic Philosophy, Theory of Models and Linguistics.

In the study of modal and nonclassical logics, translations have frequently been employed as a way of measuring the inferential capabilities of a logic. It is sometimes claimed that two logics are “notational variants” if they are translationally equivalent. However, we will show that this cannot be quite right, since first-order logic and propositional logic are translationally equivalent. Others have claimed that for two logics to be notational variants, they must at least be compositionally intertranslatable. The definition of compositionality these (...) accounts use, however, is too strong, as the standard translation from modal logic to first-order logic is not compositional in this sense. In light of this, we will explore a weaker version of this notion that we will call schematicity and show that there is no schematic translation either from first-order logic to propositional logic or from intuitionistic logic to classical logic. (shrink)

Starting from certain metalogical results, I argue that first-order logical truths of classical logic are a priori and necessary. Afterwards, I formulate two arguments for the idea that first-order logical truths are also analytic, namely, I first argue that there is a conceptual connection between aprioricity, necessity, and analyticity, such that aprioricity together with necessity entails analyticity; then, I argue that the structure of natural deduction systems for FOL displays the analyticity of its truths. Consequently, each philosophical approach to these (...) truths should account for this evidence, i.e., that first-order logical truths are a priori, necessary, and analytic, and it is my contention that the semantic account is a better candidate. (shrink)

We discuss central aspects of history of the concept of an affine differentiable manifold, as a proposal confirming the need for using some quantitative methods (drawn from elementary Model Theory) in Mathematical Historiography. In particular, we prove that this geometric structure is a syntactic rigid designator in the sense of Kripke-Putnam.