The growing demand for software tools that encourage and support students in learning design and algorithm implementation, has allowed the creation of such software systems. In this paper we present a new and innovati...
详细信息
ISBN:
(纸本)9783319624280;9783319624273
The growing demand for software tools that encourage and support students in learning design and algorithm implementation, has allowed the creation of such software systems. In this paper we present a new and innovative affective tutoring system, for logic and algorithmic programming, based on block techniques. Our approach combines the Google Blockly's interface with gamification techniques and exercises that are monitored according to the emotional state of the student. Depending on the expressed emotion (boring, engagement, frustration, and neutral), the system evaluates a number of variables to determine whether the student requires assistance. Tests have shown that the detection of the emotional state of the student, affect favorably the student evaluations.
We develop a functional abstraction principle for the type-free algorithmic logic introduced in our earlier work. Our approach is based on the standard combinators but is supplemented by the novel use of evaluation tr...
详细信息
We develop a functional abstraction principle for the type-free algorithmic logic introduced in our earlier work. Our approach is based on the standard combinators but is supplemented by the novel use of evaluation trees. Then we show that the abstraction principle leads to a Curry fixed point, a statement C that asserts C double right arrow A where A is any given statement. When A is false, such a C yields a paradoxical situation. As discussed in our earlier work, this situation leaves one no choice but to restrict the use of a certain class of implicational rules including modus ponens.
There is significant interest in type-free systems that allow flexible self-application. Such systems are of interest in property theory, natural language semantics, the theory of truth, theoretical computer science, ...
详细信息
There is significant interest in type-free systems that allow flexible self-application. Such systems are of interest in property theory, natural language semantics, the theory of truth, theoretical computer science, the theory of classes, and category theory. While there are a variety of proposed type-free systems, there is a particularly natural type-free system that we believe is prototypical: the logic of recursive algorithms. algorithmic logic is the study of basic statements concerning algorithms and the algorithmic rules of inference between such statements. As shown in [1], the threat of paradoxes, such as the Curry paradox, requires care in implementing rules of inference in this context. As in any type-free logic, some traditional rules will fail. The first part of the paper develops a rich collection of inference rules that do not lead to paradox. The second part identifies traditional rules of logic that are paradoxical in algorithmic logic, and so should be viewed with suspicion in type-free logic generally.
The main objective of this work is to measure the impact of the "PB Scratch" in the comprehension of algorithmic logic in students of the first semester of the Systems Engineering Degree program at Unidad Ce...
详细信息
ISBN:
(纸本)9781728119298
The main objective of this work is to measure the impact of the "PB Scratch" in the comprehension of algorithmic logic in students of the first semester of the Systems Engineering Degree program at Unidad Central del Valle Del Cauca, Tulua-Colombia. Two methodological phases were developed. In the first phase, the competency-based evaluation of the "know-how" and the "doing" matrix was applied through workshops by the teacher in order to measure the levels of achievement in the application and usage of the programming languages "Code-Blocks" and "PB Scratch". In the second phase, an evaluation matrix was designed and applied by combining the competence-based approach and the tool "Bloom Taxonomy" to establish learning objectives. In the application of the two phases, results of significant impact with the usage and application of "PB Scratch" were evidenced.
A language is considered in which the reader can express such properties of block-structured programs with recursive functions as correctness and partial correctness. The semantics of this language is fully described ...
详细信息
A language is considered in which the reader can express such properties of block-structured programs with recursive functions as correctness and partial correctness. The semantics of this language is fully described by a set of schemes of axioms and inference rules. The completeness theorem and the soundness theorem for this axiomatization are proved.
algorithmic properties of nondeterministic programs are studied and axiomatized completely. Nondeterministic programs require two kinds of algorithmic formulas describing their behaviour: ΔKa – all computations of t...
详细信息
algorithmic properties of nondeterministic programs are studied and axiomatized completely. Nondeterministic programs require two kinds of algorithmic formulas describing their behaviour: ΔKa – all computations of the program K are finite and all results satisfy a and ∇Ka – there exists a finite computation such that its result satisfies the formula a.
The paper is a continuation of the considerations connected with non-deterministic algorithmic logic. We will formulate a Hilbert style axiomatization basing on the analogous one defined for algorithmic logic. The mai...
详细信息
The paper is a continuation of the considerations connected with non-deterministic algorithmic logic. We will formulate a Hilbert style axiomatization basing on the analogous one defined for algorithmic logic. The main result is the theorem asserting that every consistent non-deterministic algorithmic theory possesses a model.
In this paper we consider recursive implicit definitions of functors and predicates in algorithmic logic [1], [5], [9], which may be regarded as procedures (compare A. Salwicki [10]). We examine the possibility of eli...
详细信息
In this paper we consider recursive implicit definitions of functors and predicates in algorithmic logic [1], [5], [9], which may be regarded as procedures (compare A. Salwicki [10]). We examine the possibility of elimination of defined symbols from algorithmic formulas. We prove that the halting property of a procedure is not definable by means of formulas of extended algorithmic logic [1] (with classical quantifiers). As corollary we obtain that extended algorithmic logic has not Beth-property.
The aim of propositional algorithmic logic is to investigate the properties of program connectives. Complete axiomatic systems for deterministic as well as for nondeterministic interpretations of program variables are...
详细信息
The aim of propositional algorithmic logic is to investigate the properties of program connectives. Complete axiomatic systems for deterministic as well as for nondeterministic interpretations of program variables are presented. They constitute basic sets of tools useful in the practice of provingthe properties of program schemes. Propositional theories of data structures, e.g. the arithmetic of natural numbers and stacks, are constructed. This shows that in many aspects PAL is close to first-order algorithmic logic. Tautologies of PAL become tautologies of algorithmic logic after replacing program variables by programs and propositional variables by formulas. Another corollary to the completeness theorem asserts that it is possible to eliminate nondeterministic program variables and replace them by schemes with deterministic atoms.
暂无评论