38 resultados para Predicative
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
Pós-graduação em Linguística e Língua Portuguesa - FCLAR
Resumo:
Pós-graduação em Educação Matemática - IGCE
Resumo:
Pós-graduação em Linguística e Língua Portuguesa - FCLAR
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
Pós-graduação em Linguística e Língua Portuguesa - FCLAR
Resumo:
This study offers an analysis of classification of the main issues of logic and logical thinking found in competitive tendering and math tests, according to their concepts and characteristics, whether involving mathematics, or not. Moreover, a research on the evolutionary historic processes of logic according to three major crises of the foundations of mathematics was conducted. This research helped to define Logic as a science that is quite distinctive from Mathematics. In order to relate the logical and the mathematical thinking, three types of knowledge, according to Piaget, were presented, with the logical-mathematical one being among them. The study also includes an insight on the basic concepts of propositional and predicative logic, which aids in the classification of issues of logical thinking, formal logic or related to algebraic, and geometric or arithmetic knowledge, according to the Venn diagrams. Furthermore, the key problems - that are most frequently found in tests are resolved and classified, as it was previously described. As a result, the classification in question was created and exemplified with eighteen logic problems, duly solved and explained
Resumo:
This study offers an analysis of classification of the main issues of logic and logical thinking found in competitive tendering and math tests, according to their concepts and characteristics, whether involving mathematics, or not. Moreover, a research on the evolutionary historic processes of logic according to three major crises of the foundations of mathematics was conducted. This research helped to define Logic as a science that is quite distinctive from Mathematics. In order to relate the logical and the mathematical thinking, three types of knowledge, according to Piaget, were presented, with the logical-mathematical one being among them. The study also includes an insight on the basic concepts of propositional and predicative logic, which aids in the classification of issues of logical thinking, formal logic or related to algebraic, and geometric or arithmetic knowledge, according to the Venn diagrams. Furthermore, the key problems - that are most frequently found in tests are resolved and classified, as it was previously described. As a result, the classification in question was created and exemplified with eighteen logic problems, duly solved and explained
Resumo:
Die vorliegende Arbeit wurde durch die Erkenntnis motiviert, daß die Theorie der Intentionalität ohne eine Theorie der impliziten Intentionalität unvollständig ist. Die Anlage einer solchen Theorie gründet in der Annahme, daß die impliziten ("ergänzenden oder "mit-bewußten") Erfahrungsinhalte Inhalte intentional wirksam sind: daß sie zur "Konstitution" der intentionalen Objekte – im Sinne vom Husserl und Gurwitsch – beitragen. Die Bedingungen und Umstände dieser Wirksamkeit herauszuarbeiten, ist das Hauptziel der vorliegenden Untersuchungen. Dazu wurde (1) eine phänomenologische Theorie des impliziten Inhalts kritisch expliziert, und (2) diese anhand einiger aktueller Ansätze der analytischen Philosophie auf die Probe gestellt. Im phänomenologischen Teil der Arbeit wurden zuerst die methodologischen Voraussetzungen von Gurwitschs gestalttheoretischer Neuformulierung des Husserlschen Projekts unter Berücksichtigung der sogenannten Konstanzannahme kritisch untersucht. Weiterhin wurden Husserls Noema-Konzeption und seine Horizontlehre aus der Perspektive von Gurwitschs Feldtheorie des Bewußtseins expliziert, und in der Folge Gurwitschs dreifache Gliederung des Bewußtseinsfeldes – das Kopräsenz-Kohärenz-Relevanz-Schema – um die phänomenologischen Begriffe "Potentialität", "Typik" und "Motivation" erweitert. Die Beziehungen, die diesen Begriffen zugrunde liegen, erwiesen sich als "mehr denn bloß kontigent, aber als weniger denn logisch oder notwendig" (Mulligan). An Beispielen aus der analytischen Philosphie der Wahrnehmung (Dretske, Peacocke, Dennett, Kelly) und der Sprache (Sperber, Wilson, Searle) wurde das phänomenologische Konzept des impliziten Inhalts kritisch beurteilt und weiterentwickelt. Hierbei wurde(n) unter anderem (1) der Zusammenhang zwischen dem phänomenologischen Begriff "vorprädikativer Inhalt" und dem analytischen Begriff "nichtkonzeptueller Inhalt" aufgezeigt und (2) Kriterien für die Zuschreibung impliziter Überzeugungen in den typischen Fällen der prädikativen Intentionalität zusammengetragen und systematisiert.
Resumo:
In this thesis we provide a characterization of probabilistic computation in itself, from a recursion-theoretical perspective, without reducing it to deterministic computation. More specifically, we show that probabilistic computable functions, i.e., those functions which are computed by Probabilistic Turing Machines (PTM), can be characterized by a natural generalization of Kleene's partial recursive functions which includes, among initial functions, one that returns identity or successor with probability 1/2. We then prove the equi-expressivity of the obtained algebra and the class of functions computed by PTMs. In the the second part of the thesis we investigate the relations existing between our recursion-theoretical framework and sub-recursive classes, in the spirit of Implicit Computational Complexity. More precisely, endowing predicative recurrence with a random base function is proved to lead to a characterization of polynomial-time computable probabilistic functions.