Submitted by Celso Magalhaes (celsomagalhaes@ufrrj.br) on 2017-05-31T17:28:56Z No. of bitstreams: 1 2016 - Pablo Vieira Carvalho Silva.pdf: 1591495 bytes, checksum: 23e5c1de4092f3df312f440079012ae0 (MD5) / Made available in DSpace on 2017-05-31T17:28:56Z (GMT). No. of bitstreams: 1 2016 - Pablo Vieira Carvalho Silva.pdf: 1591495 bytes, checksum: 23e5c1de4092f3df312f440079012ae0 (MD5) Previous issue date: 2016-06-30 / Coordena??o de Aperfei?oamento de Pessoal de N?vel Superior - CAPES / The mathematical logic has been removed and forgotten from the curriculum minimum of basic education for some time, despite the clear benefit that it can add to the student?s cognitive not only in mathematics study but also in his day by day decision-making. This study aims to rescue the discussion of its importance to the study in the basic levels, not doing it by traditional ways, but through problem solving techniques also using the Polya phases. Joining to this work, there are activities that were applied to a first year group of high school at a public school in Rio de Janeiro. / A l?gica matem?tica h? algum tempo foi retirada e esquecida do curr?culo m?nimo do ensino b?sico da educa??o brasileira, mesmo diante dos claros benef?cios que a mesma pode acrescentar ao cognitivo do educando n?o s? no estudo da matem?tica como em tomadas de decis?es do seu dia a dia. Este trabalho tem por finalidade resgatar a discuss?o de sua import?ncia para o estudo nas s?ries b?sicas, n?o o fazendo por vias tradicionais, mas sim atrav?s de t?cnicas de resolu??o de problemas utilizando tamb?m para isso as fases de Polya. Junto deste trabalho, apresentamos atividades aplicadas ao primeiro ano do ensino m?dio de uma escola estadual do Rio de Janeiro

Orientador: Marcelo Esteban Coniglio / Tese (doutorado) - Universidade Estadual de Campinas, Instituto de Filosofia e Ciências Humanas / Made available in DSpace on 2018-08-25T18:45:14Z (GMT). No. of bitstreams: 1 Testa_RafaelRodrigues_D.pdf: 1707390 bytes, checksum: 77a5315394cfd4052cf1fe8733d0559c (MD5) Previous issue date: 2014 / Resumo: A Revisão de Crenças estuda como agentes racionais mudam suas crenças ao receberem novas informações. O sistema AGM, trabalho mais influente desta área apresentado por Alchourrón, Gärdenfos e Makinson, postula critérios de racionalidade para os diferentes tipos de mudança de crenças e oferece construções explícitas para tais - a equivalência entre os postulados e operações é chamado de teroema da representação. Trabalhos recentes mostram como o paradigma AGM pode ser compatível com diferentes lógicas não-clássicas, o que é chamado de AGM-compatibilidade - este é o caso da família de lógicas paraconsistentes que analisamos, as Lógicas da Inconsistência Formal (LFIs, da sigla em inglês). A despeito da AGM-compatibilidade, ao se partir de uma nova lógica sua racionalidade subjacente deve ser entendida e sua linguagem deve ser efetivamente usada. Propomos assim novas construções que de fato capturam a intuição presente na LFIs - é o que chamamos de sistema AGMo. Com isso, possibilitamos a estas lógicas uma nova interpretação, na esteira da epistemologia formal. Em uma abordagem alternativa, ao se partir da AGM-compatibilidade os resultados AGM podem ser diretamente aplicados às LFIs - o que chamamos de sistema AGMp. Em ambas abordagens, provamos os respectivos teoremas da representação sempre que necessário / Abstract: Belief Revision studies how rational agents change their beliefs when they receive new information. The AGM system, most influential work in this area of study investigated by Alchourrón, Gärdenfos and Makinson, postulates rationality criteria for different types of belief change and provides explicit constructions for them - the equivalence between the postulates and operations is called representation theorem. Recent studies show how the AGM paradigm can be compliant with different non-classical logics, which is called the AGM-compliance - this is the case of the paraconsistent logics family we analyze in this thesis, the Logics of Formal Inconsistency (LFIs). Despite the AGM-compliance, when a new logic is taken into account its underlying rationality must be understood and its language should be used. In that way new constructions are proposed, which actually captures the intuition of LFIs - what we call the AGMo system. Thus, we provide a new interpretation for these logics, more in line with formal epistemology. In an alternative approach, by considering the AGM-compliance, we show how the AGM results can be directly applied to LFIs -- resulting the AGMp system. In both approaches, we prove the corresponding representation theorems where needed / Doutorado / Filosofia / Doutor em Filosofia

Orientador: Walter Alexandre Carnielli / Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Filosofia e Ciências Humanas / Made available in DSpace on 2018-08-25T21:09:00Z (GMT). No. of bitstreams: 1 Almeida_HenriqueAntunes_M.pdf: 1516387 bytes, checksum: 2608439ba585a23431d2aa295b1b8876 (MD5) Previous issue date: 2014 / Resumo: Neste trabalho, abordamos o Teorema de Frege sob uma perspectiva exclusivamente técnica. Primeiramente, propomos uma caracterização geral de linguagens de segunda ordem que sejam adequadas para formalizar quaisquer teorias fregeanas ¿ teorias que resultam da introdução de um ou mais princípios de abstração a um sistema dedutivo de lógica de segunda ordem; fornecemos uma semântica e um sistema dedutivo para essas linguagens e elaboramos alguns resultados metateóricos acerca desse sistema. Em segundo lugar, apresentamos uma exposicão detalhada da prova do Teorema de Frege, enunciado como uma relação entre a Aritmética de Frege e a Aritmética de Dedekind-Peano. Por fim, provamos a equiconsistência entre essas teorias e a Aritmética de Peano de Segunda Ordem / Abstract: In this work, we discuss Frege¿s Theorem under an exclusively technical perspective. First, we propose a general caracterization of second-order languages suitable to formalize all Fregean theories ¿ theories that result from the introduction of one or more abstraction principles to a deductive system of second-order logic; we also furnish a semantics and a deductive system for these languages and establish a few metatheorical results about the system. Second, we present a detailed proof of Frege¿s Theorem, formulated as a relation between Frege¿s Arithmetic and Dedekind-Peano Arithemtic. Finally, we prove the equiconsistency between these theories and Peano Second-Order Arithmetic / Mestrado / Filosofia / Mestre em Filosofia

Orientador: Walter Alexandre Carnielli / Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Filosofia e Ciências Humanas / Made available in DSpace on 2018-08-19T13:14:11Z (GMT). No. of bitstreams: 1 Oliveira_AntonioMarmodaCunha_M.pdf: 7643012 bytes, checksum: 1904b2b114fcf86253069cc0fe63eedb (MD5) Previous issue date: 2011 / Resumo: Neste trabalho investigaremos, do ponto de vista da lógica e da filosofia, os fenômenos pragmáticos conhecidos como pressuposição e implicatura, relacionando-os a traços mais gerais da racionalidade humana, como economia e consistência, e ao pluralismo da lógica atual, incluindo alguns tópicos de contenda entre a tradição clássica e as propostas alternativas recentes. Grice articulou uma análise destes fenômenos assentes em princípios para a conversação ou interação entre entes racionais e cooperativos. Divergimos da tradição griceana, postulando que as implicaturas são processadas por "clivagem de informações", ou por verificação de outros critérios lógicos, ao invés da mera exploração de máximas. Partindo de conceitos precisamente definidos, como pressuposição e implicatura, é possível construir um arcabouço lógico, a denominar sistemas pressuposicionais, que estendem outros sistemas lógicos (como, por exemplo, o cálculo proposicional) e cujos resultados exporemos / Abstract: In this work we shall, from the logical and philosophical standpoint, investigate two pragmatic phenomena known as presupposition and implicature, associating them to more general features of human rationality, such as economy and consistency, and to the current logical pluralism, including some controversies between the classical tradition and more recent alternative approaches. Grice has articulated an analysis of such phenomena based on principles governing conversation or interaction between cooperative and rational beings. We dissent from the gricean tradition, and proposing that implicatures are processed by the 'sieving of information', rather than by the mere exploitation of maxims. By providing precise definitions to the concepts of presupposition and implicature, it is possible to build a logical framework, to be called presuppositional systems, which either extend or generalise other logical systems (such as the propositional calculus, for instance), the results of which we shall present hereinafter / Mestrado / Filosofia / Mestre em Filosofia

Introduced by C.C. Chang in the 1950s, MV algebras are to many-valued (Łukasiewicz) logics what boolean algebras are to two-valued logic. More recently, effect algebras were introduced by physicists to describe quantum logic. In this thesis, we begin by investigating how these two structures, introduced decades apart for wildly different reasons, are intimately related in a mathematically precise way. We survey some connections between MV/effect algebras and more traditional algebraic structures. Then, we look at the categorical structure of effect algebras in depth, and in particular see how the partiality of their operations cause things to be vastly more complicated than their totally defined classical analogues. In the final chapter, we discuss coordinatization of MV algebras and prove some new theorems and construct some new concrete examples, connecting these structures up (requiring a detour through effect algebras!) to boolean inverse semigroups.

I explore five topics in topology using set-theoretic techniques. The first of these is a generalization of 2-point sets called slice sets. I show that, for any small-in-cardinality subset A of the real line, there is a subset of the plane meeting every line in a topological copy of A. Under Martin's Axiom, I show how to improve this result to any totally disconnected A. Secondly, I show that it is consistent with and independent of ZFC to have a topologically rigid subset of the real line that is smaller than the continuum. Thirdly, I define and examine a new cardinal function related to cleavability. Fourthly, I explore the Toronto Problem and prove that any uncountable, Hausdorff, non-discrete Toronto space that is not regular falls into one of two strictly-defined classes. I also prove that for every infinite cardinality there are precisely 3 non-T1 Toronto spaces up to homeomorphism. Lastly, I examine a notion of dimension called the "neight", and prove several theorems that give a lower bound for this cardinal function.

Programs have precise semantics, so we can use mathematical proof to establish their properties. These proofs are often too large to validate with the usual "social process" of mathematics, so instead we create and check them with theorem-proving software. This software must be advanced enough to make the proof process tractable, but this very sophistication casts doubt upon the whole enterprise: who verifies the verifier? We begin with a simple proof checker, Level 1, that only accepts proofs composed of the most primitive steps, like Instantiation and Cut. This program is so straightforward the ordinary, social process can establish its soundness and the consistency of the logical theory it implements (so we know theorems are "always true"). Next, we develop a series of increasingly capable proof checkers, Level 2, Level 3, etc. Each new proof checker accepts new kinds of proof steps which were not accepted in the previous levels. By taking advantage of these new proof steps, higher-level proofs can be written more concisely than lower-level proofs, and can take less time to construct and check. Our highest-level proof checker, Level 11, can be thought of as a simplified version of the ACL2 or NQTHM theorem provers. One contribution of this work is to show how such systems can be verified. To establish that the Level 11 proof checker can be trusted, we first use it, without trusting it, to prove the fidelity of every Level n to Level 1: whenever Level n accepts a proof of some phi, there exists a Level 1 proof of phi. We then mechanically translate the Level 11 proof for each Level n into a Level n - 1 proof---that is, we create a Level 1 proof of Level 2's fidelity, a Level 2 proof of Level 3's fidelity, and so on. This layering shows that each level can be trusted, and allows us to manage the sizes of these proofs. In this way, our system proves its own fidelity, and trusting Level 11 only requires us to trust Level 1. / text

Hoare and He's Unifying Theories of Programming (UTP) provides a rich model of programs as relational predicates. This theory is intended to provide a single framework in which any programming paradigms, languages, and features, can be modelled, compared and contrasted. The UTP already has models for several programming formalisms, such as imperative programming, higher-order programming (e.g. programing with procedures), several styles of concurrent programming (or reactive systems), class-based object-orientation, and transaction processing. We believe that the UTP ought to be able to represent all significant computer programming language formalisms, in order for it to be considered a unifying theory. One gap in the UTP work is that of object-based object-orientation, such as that presented in Abadi and Cardelli's untyped object calculi (sigma-calculi). These sigma-calculi provide a prominent formalism of object-based object-oriented (OO) programs, which models programs as objects. We address this gap within this dissertation by presenting an embedding of an Abadi--Cardelli-style object calculus in the UTP. More formally, the thesis that his dissertation argues is that it is possible to provide an object-based object rientation to the UTP, with value- and reference-based objects, and a fully abstract model of references. We have made three contributions to our area of study: first, to extend the UTP with a notion of object-based object orientation, in contrast with the existing class-based models; second, to provide an alternative model of pointers (references) for the UTP that supports both value-based compound values (e.g. objects) and references (pointers), in contrast to existing UTP models with pointers that have reference-based compound values; and third, to model an Abadi-Cardelli notion of an object in the UTP, and thus demonstrate that it can unify this style of object formalism.

This thesis studies the categorical formalisation of quantum computing, through the prism of type theory, in a three-tier process. The first stage of our investigation involves the creation of the dagger lambda calculus, a lambda calculus for dagger compact categories. Our second contribution lifts the expressive power of the dagger lambda calculus, to that of a quantum programming language, by adding classical control in the form of complementary classical structures and dualisers. Finally, our third contribution demonstrates how our lambda calculus can be applied to various well known problems in quantum computation: Quantum Key Distribution, the quantum Fourier transform, and the teleportation protocol.

Alternating timed automata are a powerful extension of classical Alur-Dill timed automata that are closed under all Boolean operations. They have played a key role, among others, in providing verification algorithms for prominent specification formalisms such as Metric Temporal Logic. Unfortunately, when interpreted over an infinite dense time domain (such as the reals), alternating timed automata have an undecidable language emptiness problem. In this thesis we consider restrictions on this model that restore the decidability of the language emptiness problem. We consider the restricted class of safety alternating timed automata, which can encode a corresponding Safety fragment of Metric Temporal Logic. This thesis connects these two formalisms with insertion channel machines, a model of faulty communication, and demonstrates that the three formalisms are interreducible. We thus prove a non-elementary lower bound for the language emptiness problem for 1-clock safety alternating timed automata and further obtain a new proof of decidability for this problem. Complementing the restriction to safety properties, we consider interpreting the automata over bounded dense time domains. We prove that the time-bounded language emptiness problem is decidable but non-elementary for unrestricted alternating timed automata. The language emptiness problem for alternating timed automata is a special case of a much more general and abstract logical problem: Church's synthesis problem. Given a logical specification S(I,O), Church's problem is to determine whether there exists an operator F that implements the specification in the sense that S(I,F(I)) holds for all inputs I. It is a classical result that the synthesis problem is decidable in the case that the specification and implementation are given in monadic second-order logic over the naturals. We prove that this decidability extends to MSO over the reals with order and furthermore to MSO over every fixed bounded interval of the reals with order and the +1 relation.