The purpose of this research study was to explore the relationship between learning styles, psychological types and multiple-choice standardized achievement examination performance of nurse aide students with typology being the gross indicator using a non-experimental, comparative and descriptive approach. The study sample included nurse aide students (N = 326) seeking nurse aide certification selected through a stratified random sampling technique. The participation rate for completed MBTI® inventory was 58.42% (N = 326). The learning styles and psychological types were measured against the Myers-Briggs Type Indicator® Form M in North American English. The multiple-choice standardized achievement examination performance of nurse aide students was determined by Illinois Nurse Aide Competency Examination (INACE) conducted in January 2017. All the research questions and hypotheses compared mean of overall test scores and means of overall test scores based on specific duty areas (i.e. communicating information, performing basic nursing skills, performing personal skills, performing basic restorative skills, providing mental health and social service needs, and providing for residents’ rights) between different groups using one-way analysis of variance (ANOVA) and one-way multivariate analysis of variance (MANOVA). The findings of the study indicated a statistically significant relationship between mean scores of nurse aide students with Sensing (S) and Intuition (N) learning preferences by perception on overall test performance and test performance based on specific duty areas of the INACE with the mean of nurse aide students with the Sensing (S) learning preference being numerically highest (M = 81.85) than Intuition (N) learning preference (M = 79.96%). Additionally, there were no statistically significant relationships between learning preferences by source of energy (Extraversion – E and Introversion – N), learning preferences by reaction to information or making decisions (Thinking – T and Feeling – F), learning preferences by preference to life style (Judging – J and Perceiving – P), learning preference combinations by orientation to energy and perception (IS, IN, ES, and EN), learning preference combinations by perception and attitude (SP, SJ, NP, and NJ), learning preference combinations by mental process (ST, SF, NF, and NT), and 16 psychological or personality types or learning approaches (ISTJ, ISFJ, INFJ, INTJ, ISTP, ISFP, INFP, INTP, ESTP, ESFP, ENFP, ENTP, ESTJ, ESFJ, ENFJ, and ENTJ) and Illinois Nurse Aide Competency Examination (INACE) performance among nurse aide students. The findings suggested that students with Introversion (I), Sensing (S), Thinking (T), and Perceiving (P) learning preferences had better overall test score on the Illinois Nurse Aide Competency Examination (INACE). Further research with a larger sample is recommended. The findings from the study and review of literature will guide nurse aide trainers and students, improve Illinois Nurse Aide Competency Examination; and increase nurse aide students’ retention efforts by utilizing the MBTI® assessment tool along with understanding and implementing the underlying concepts. Keywords: Personality Type, Psychological Type, Academic Achievement, Academic Aptitude, Type Theory, Standardized MCQ Tests, Standardized Tests, Cognitive Attribute, Academic Success, Achievement Tests, Learning Styles, Myers-Briggs Type Indicator®

Made available in DSpace on 2014-07-29T15:06:26Z (GMT). No. of bitstreams: 1 Dissertacao Mestrado Hiury Correia.pdf: 634437 bytes, checksum: cf6fd2233508dfe9b0a574d4f162b2ba (MD5) Previous issue date: 2010-11-20 / Our dissertation s theme is the Idea that, buried in Frege s unfriendly Logical notation, one finds the notion of abstraction as a key ingredient of his Begriffsschrift. This runs contrary to the ordinary appraisal, such as the one found in Van Heijenoort s introduction to that article. It runs also contrary to Frege s refusal of the possibility of referring to unsaturated entities. Still, we argue that the notion seems to be part both of Frege s philosophical positions such as the idea of quantification as second order predication and of Frege s logical practices. / O tema da nossa dissertação é a idéia de que, por trás da idiossincrática notação lógica utilizada por Frege, podemos encontrar a noção de abstração como componente fundamental de sua Begriffsschrift. Tal posição vai contra a concepção ordinária, como, por exemplo, a que encontramos na introdução de Van Heijenoort àquela obra. Ela contraria, também, a rejeição de Frege à possibilidade de se referir a entidades insaturadas. Argumentamos que a noção de abstração aparece tanto como parte das posições filosóficas de Frege como, por exemplo, a idéia de que a quantificação é uma predicação de segunda ordem como, também, de sua prática lógica.

La vérification automatique de preuves consiste à faire vérifier par un ordinateur la validité de démonstrations d'énoncés mathématiques. Cette vérification étant purement calculatoire, elle offre un haut degré de confiance. Elle est donc particulièrement utile pour vérifier qu'un logiciel critique, c'est-à-dire dont le bon fonctionnement a un impact important sur la sécurité ou la vie des personnes, des entreprises ou des biens, correspond exactement à sa spécification. DEDUKTI est l'un de ces vérificateurs de preuves. Il implémente un système de type, le lambda-Pi-Calcul Modulo, qui est une extension du lambda-calcul avec types dépendants avec des règles de réécriture du premier ordre. Suivant la correspondance de Curry-Howard, DEDUKTI implémente à la fois un puissant langage de programmation et un système logique très expressif. Par ailleurs, ce langage est particulièrement bien adapté à l'encodage d'autres systèmes logiques. On peut, par exemple, importer dans DEDUKTI des théorèmes prouvés en utilisant d'autres outils tels que COQ, HOL ou encore ZENON, ouvrant ainsi la voie à l'interopérabilité entre tous ces systèmes. Le lambda-Pi-Calcul Modulo est un langage très expressif. En contrepartie, certaines propriétés fondamentales du système, telles que l'unicité des types ou la stabilité du typage par réduction, ne sont pas garanties dans le cas général et dépendent des règles de réécriture considérées. Or ces propriétés sont nécessaires pour garantir la cohérence des systèmes de preuve utilisés, mais aussi pour prouver la correction et la complétude des algorithmes de vérification de types implémentés par DEDUKTI. Malheureusement, ces propriétés sont indécidables. Dans cette thèse, nous avons donc cherché à concevoir des critères garantissant la stabilité du typage par réduction et l'unicité des types et qui soient décidables, de manière à pouvoir être implémentés par DEDUKTI. Pour cela, nous donnons une nouvelle définition du lambda-Pi-Calcul Modulo qui rend compte de l'aspect itératif de l'ajout des règles de réécriture dans le système en les explicitant dans le contexte. Une étude détaillée de ce nouveau calcul permet de comprendre qu'on peut ramener le problème de la stabilité du typage par réduction et de l'unicité des types à deux propriétés plus simples, qui sont la compatibilité du produit et le bon typage des règles de réécriture. Nous étudions donc ces deux propriétés séparément et en donnons des conditions suffisantes effectives. Ces idées ont été implémentées dans DEDUKTI, permettant d'augmenter grandement sa généralité et sa fiabilité. / Automatic proof checking is about using a computer to check the validity of proofs of mathematical statements. Since this verification is purely computational, it offers a high degree of confidence. Therefore, it is particularly useful for checking that a critical software, i.e., a software that when malfunctioning may result in death or serious injury to people, loss or severe damage to equipment or environmental harm, corresponds to its specification. DEDUKTI is such a proof checker. It implements a type system, the lambda-Pi-Calculus Modulo, that is an extension of the dependently-typed lambda-calculus with first-order rewrite rules. Through the Curry-Howard correspondence, DEDUKTI implements both a powerful programming language and an expressive logical system. Furthermore, this language is particularly well suited for encoding other proof systems. For instance, we can import in DEDUKTI theorems proved using other tools such as COQ, HOL or ZENON, a first step towards creating interoperability between these systems.The lambda-Pi-Calculus Modulo is a very expressive language. On the other hand, some fundamental properties such as subject reduction (i.e., the stability of typing by reduction) and uniqueness of types are not guaranteed in general and depend on the rewrite rules considered. Yet, these properties are necessary for guaranteeing the coherence of the proof system, but also for provingthe soundness and completeness of the type-checking algorithms implemented in DEDUKTI. Unfortunately, these properties are undecidable. In this thesis, we design new criteria for subject reduction and uniqueness of types that are decidable in order to be implemented in DEDUKTI.For this purpose, we give a new definition of the lambda-Pi-Calculus Modulo that takes into account the iterative aspect of the addition of rewrite rules in the typing context. A detailed study of this new system shows that the problems of subject reduction and uniqueness of types can be reduced to two simpler properties that we call product compatibility and well-typedness of rewrite rules.Hence, we study these two properties separately and give effective sufficient conditions for them to hold.These ideas have been implemented in DEDUKTI, increasing its generality and reliability.

In this thesis we present a formalization of the combinatorial part of the proof of Feit-Higman theorem on generalized polygons. Generalised polygons are abstract geometric structures that generalize ordinary polygons and projective planes. They are closely related to finite groups. The formalization is carried out in Agda, a dependently typed functional programming language and proof assistant based on the intuitionist type theory by Per Martin-Löf.

京都大学 / 0048 / 新制・課程博士 / 博士(情報学) / 甲第22675号 / 情博第728号 / 新制||情||125(附属図書館) / 京都大学大学院情報学研究科通信情報システム専攻 / (主査)教授 五十嵐 淳, 教授 山本 章博, 教授 湊 真一 / 学位規則第4条第1項該当 / Doctor of Informatics / Kyoto University / DFAM

Title: Pupil's personality and solving problems of school Mathematics by heuristic strategies Author: Mgr. Markéta Škutová Supervisor: prof. RNDr. Jarmila Novotná, CSc This thesis deals with the relationship between the type of pupil's personality in the dimension of information reception and their ways of solving problems of school Mathematics with the use of heuristic strategies at the lower secondary education of basic school and in the corresponding years of grammar schools. The theoretical part summarizes the knowledge of heuristic strategies in the teaching of mathematics at the lower secondary education of basic school and their application on examples. Furthermore, the theoretical basis of type theory and its use in education is explained. In the practical part the results of the typological questionnaire are presented and an extensive qualitative analysis of the student's problem solving is offered. The resulting findings are supported by concrete examples of students' solutions. In this diploma thesis, there is evidence that the intuitive pupils use the heuristic strategies of problem solving more often than the sensory pupils and are more successful in solving non-traditional tasks. Keywords: heuristic strategies, MBTI, type theory, problem solving

Dependent type theory is a proven technology for verified functional programming in which programs and their correctness proofs may be developed using the same rules in a single formal system. In practice, large portions of programs developed in this way have no computational relevance to the ultimate result of the program and should therefore be removed prior to program execution. In previous work on identifying and removing irrelevant portions of programs, computational irrelevance is usually treated as an intrinsic property of program expressions. We find that such an approach forces programmers to maintain two copies of commonly used datatypes: a computationally relevant one and a computationally irrelevant one. We instead develop an extrinsic notion of computational irrelevance and find that it yields several benefits including (1) avoidance of the above mentioned code duplication problem; (2) an identification of computational irrelevance with a highly general form of parametric polymorphism; and (3) an elective (i.e., user-directed) notion of proof irrelevance. We also develop a program analysis for identifying irrelevant expressions and show how previously studied types embodying computational irrelevance (including subset types and squash types) are expressible in the extension of type theory developed herein.

In this licentiate thesis we present a proof of the initiality conjecture for Martin-Löf’s type theory with 0, 1, N, A+B, ∏AB, ∑AB, IdA(u,v), countable hierarchy of universes (Ui)iєN closed under these type constructors and with type of elements (ELi(a))iєN. We employ the categorical semantics of contextual categories. The proof is based on a formalization in the proof assistant Agda done by Guillaume Brunerie and the author. This work was part of a joint project with Peter LeFanu Lumsdaine and Anders Mörtberg, who are developing a separate formalization of this conjecture with respect to categories with attributes and using the proof assistant Coq over the UniMath library instead. Results from this project are planned to be published in the future. We start by carefully setting up the syntax and rules for the dependent type theory in question followed by an introduction to contextual categories. We then define the partial interpretation of raw syntax into a contextual category and we prove that this interpretation is total on well-formed input. By doing so, we define a functor from the term model, which is built out of the syntax, into any contextual category and we show that any two such functors are equal. This establishes that the term model is initial among contextual categories. At the end we discuss details of the formalization and future directions for research. In particular, we discuss a memory issue that arose in type checking the formalization and how it was resolved. / <p>Licentiate defense over Zoom.</p>

No description available.

Contracts are legally enforceable agreements between two or more parties. The agreements can contain temporally based conditions, such as actions taken by the contract parties or events that happen, that trigger changes to the state of the contract when the conditions become true. Since the structure of these conditions can be very complex, it can be difficult to write contracts in a natural language in a clear and unambiguous way. A better approach is to have a formal language with a precise semantics to represent contracts. Contracts expressed in such a language have a mathematically precise meaning and can be written, analyzed, and manipulated by software. This thesis presents FCL, a formal language with a precise semantics for writing general contracts that may depend on temporally based conditions. Motivated by carefully selected examples of contracts, we derive a set of desirable requirements that a formal language of contracts should support. Based on the requirements, we clearly de ne the notion of contract and address what it means to fulfill or breach a contract. We present the formal syntax and semantics of FCL. We also successfully formalize different kinds of contracts in FCL and develop a reasoning system for FCL. / Thesis / Doctor of Philosophy (PhD)