Orientador: Itala M. Loffredo D'Ottaviano / Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Filosofia e Ciencias Humanas / Made available in DSpace on 2018-08-14T10:11:26Z (GMT). No. of bitstreams: 1 Monte_DanielLiberalino_M.pdf: 782756 bytes, checksum: ced0a8839833d10d1339f55cc58ca32f (MD5) Previous issue date: 2009 / Resumo: O presente trabalho tem por objetivo examinar, sob a perspectiva lógico- filosófica da paraconsistência e da modalidade, as relações entre os conceitos lógico-filosófico-formais de negação paraconsistente e o conceito de modalidade. Nosso objetivo central consiste no exame de um operador modal de negação paraconsistente. Examinamos conhecidos resultados envolvendo os operadores modais e paraconsistentes, como as lógicas modais normais K, T, S4, S5 e outras lógicas modais; algumas lógicas paraconsistentes, incluindo a lógica modal paraconsistente Z. Além disso, realizamos uma análise crítica concernente às relações entre o conhecido Quadrado de Oposições Aristotélico e a negação paraconsistente, contribuindo para o tema com alguns argumentos. Finalmente, investigamos a questão de como a generalização do Quadrado de Oposições Aristotélico, dita Teoria de n-Oposições, se relaciona com o tema da modalidade, da paraconsistência e da geometrização lógica, propondo idéias para este último. / Abstract: The present work aims to investigate, under the logical-philosophical perspective of paraconsistency and modality, relations between the logical-philosophical-formal concept of paraconsistent negation and the concept of modality. Our main task is the analysis of a modal operator of paraconsistent negation. We have examined some known results involving modal and paraconsistent operators, such as the modal normal logics K, T, S4, S5 and other modal logics; some paraconsistent logics, including modal paraconsistent logic Z. We also have proceeded a critical analysis concerning relations between the well known Aristotle's Square of Oppositions and paraconsistent negation, contributing to the theme with some arguments. Finally, we have investigated the question of how the generalization of the Square of Oppositions, through the n-Oppositions Theory, may be related to the themes of modality, paraconsistency and logic geometrization, proposing some ideas. / Mestrado / Mestre em Filosofia

The current study examined the impact of self-presentation and self-esteem concerns on goal choice. Subjects who were high or low in self-esteem worked on a series of analogies and were presented with noncontingent or contingent success feedback. They were then told that their performance on an upcoming puzzle task would be either public or private. Subjects were then allowed to choose a goal level for the upcoming task. Subsequent performance on a standard test was measured. In general, males chose more difficult goals than did females and high esteem subjects chose more difficult goals than did low esteem subjects. Analyses indicated that when low esteem male subjects were given noncontingent success feedback and were led to believe that their choice of goal was public, they reported lower performance expectations and showed a tendency to choose more difficult goals than did comparison groups. No performance differences emerged across any of the experimental conditions. The results are discussed within goal setting theory and in light of previous research on self-handicapping. The implications of this investigation for future research are also considered. / M.S.

Akademisk avhandling--Stockholm. Universitet. / Bibliography: p. [106]-109.

Orientador: Itala Maria Loffredo D'Ottaviano / Tese (doutorado) - Universidade Estadual de Campinas, Instituto de Filosofia e Ciencias Humanas / Made available in DSpace on 2018-09-11T21:14:41Z (GMT). No. of bitstreams: 1 Bueno-Soler_Juliana_D.pdf: 1230879 bytes, checksum: c04ce9e8061c154854f6283749f9c12b (MD5) Previous issue date: 2009 / Resumo: O presente trabalho tem por objetivo investigar o papel da negação no âmbito das modalidades, de forma a poder esclarecer até que ponto a negação pode ser atenuada, controlada ou mesmo totalmente eliminada em favor da melhor expressabilidade lógica de certas teorias, asserções ou raciocínios que sofrem os efeitos da negação. Contudo, atenuar ou eliminar a negação tem um alto preço: métodos tradicionais em lógica podem deixar de ser válidos e certos resultados, como teoremas de completude para sistemas lógicos, podem ser derrogados. Do ponto de vista formal, a questão central que investigamos aqui e até que ponto tais métodos podem ser restabelecidos. Com tal finalidade, iniciamos nosso estudo a partir do que denominamos sistemas anódicos" (sem negação) e, a posteriori, introduzimos gradativamente o elemento catódico" (negações, com diversas gradações e diferentes características) nos sistemas modais por meio de combinações com certas lógicas paraconsistentes, as chamadas lógicas da inconsistência formal (LFIs). Todos os sistemas tratados são semanticamente caracterizados por semânticas de mundos possíveis; resultados de incompletude são também obtidos e discutidos. Obtemos ainda semânticas modais de traduções possíveis para diversos desses sistemas. Avançamos na direção das multimodalidades, investigando os assim chamados sistemas multimodais anódicos e catódicos. Finalmente, procuramos avaliar criticamente o alcance e o interesse dos resultados obtidos na direção da racionalidade sensível à negação. / Abstract: The present work aims to investigate the role of negations in the scope of modalities and in the reasoning expressed by modalities. The investigation starts from what we call anodic" systems (without any form of negation) and gradually reaches the cathodic" elements, where negations are introduced by means of combining modal logics with certain paraconsistent logics known as logics of formal inconsistency (LFIs). We obtain completeness results for all treated systems, and also show that certain incompleteness results can be obtained. The class of the investigated systems includes all normal modal logics that are extended by means of the schema Gk;l;m;n due to E. J. Lemmon and D. Scott combined with LFIs. We also tackle the question of obtaining modal possible-translations semantics for these systems. Analogous results are analyzed in the scope of multimodalities, where anodic as much as cathodic logics are studied. Finally, we advance a critical evaluation of the reach and scope of all the results obtained to what concerns expressibility of reasoning considered to be sensible to negation. We also critically assess the obtained results in contrast with problems of rationality that are sensible to negation. / Doutorado / Doutor em Filosofia

This thesis presents TransLucid, a low-level, purely declarative, intensional programming language. Built on a simple algebra and with just a small number of primitives, TransLucid programs define arbitrary dimensional infinite data structures, which are then queried to produce results. The formal foundations of TransLucid come from the work in intensional logic by Montague and Scott. The background chapters give a history of intensional logic and its predecessors in the Western world, as well as a history of intensional programming and Lucid, the first intensional programming language. The semantics of TransLucid are fully specified in the form of operational semantics. Three levels of semantics are given, in increasing order of efficiency, with the sequential warehouse semantics, the most efficient, being presented together with a proof that any expression will be evaluated by only examining relevant dimensions in the current context. The language is then extended in three important ways, by adding versioned identifiers, (declarative) side-effects and timestamped equations and demands. Adding versioned identifiers to TransLucid enriches the expressiveness of the language and allows the encoding of a variety of programming paradigms, ranging from manipulating large data-cubes to pattern-matching. Adding side-effects supports one of the main reasons for TransLucid: namely, to provide a target language, together with a methodology, for translating the main programming paradigms, thus creating a uniform end platform that can be the focus for optimisation and program verification. A translation of imperative programs into TransLucid is given. Timestamped equations and demands enable TransLucid to become a language for synchronous programming in real-time systems, as well as allowing runtime updates to a program's equations. The language TransLucid represents a decisive advance in declarative programming. It has applications in many fields of computer science and opens up exciting new avenues of research.

This thesis presents TransLucid, a low-level, purely declarative, intensional programming language. Built on a simple algebra and with just a small number of primitives, TransLucid programs define arbitrary dimensional infinite data structures, which are then queried to produce results. The formal foundations of TransLucid come from the work in intensional logic by Montague and Scott. The background chapters give a history of intensional logic and its predecessors in the Western world, as well as a history of intensional programming and Lucid, the first intensional programming language. The semantics of TransLucid are fully specified in the form of operational semantics. Three levels of semantics are given, in increasing order of efficiency, with the sequential warehouse semantics, the most efficient, being presented together with a proof that any expression will be evaluated by only examining relevant dimensions in the current context. The language is then extended in three important ways, by adding versioned identifiers, (declarative) side-effects and timestamped equations and demands. Adding versioned identifiers to TransLucid enriches the expressiveness of the language and allows the encoding of a variety of programming paradigms, ranging from manipulating large data-cubes to pattern-matching. Adding side-effects supports one of the main reasons for TransLucid: namely, to provide a target language, together with a methodology, for translating the main programming paradigms, thus creating a uniform end platform that can be the focus for optimisation and program verification. A translation of imperative programs into TransLucid is given. Timestamped equations and demands enable TransLucid to become a language for synchronous programming in real-time systems, as well as allowing runtime updates to a program's equations. The language TransLucid represents a decisive advance in declarative programming. It has applications in many fields of computer science and opens up exciting new avenues of research.

Two main questions are addressed in this dissertation, namely: 1. What is the correct higher-order modal theory; 2. What does it take for theories to be equivalent. The whole dissertation consists of an extended argument in defence of the joint truth of two higher-order modal theories, namely, Plantingan Moderate Contingentism, a higher-order necessitist theory advocated by Plantinga (1974) and committed to the contingent being of some individuals, and Williamsonian Thorough Necessitism, a higher-order necessitist theory advocated by Williamson (2013) and committed to the necessary being of every possible individual. The case for the truth of these two theories relies on defences of the following metaphysical theses: i) Thorough Serious Actualism, according to which no things could have been related and yet be nothing, ii) Higher-Order Necessitism, according to which necessarily, every higher-order entity is necessarily something. It is shown that Thorough Serious Actualism and Higher-Order Necessitism are both implicit commitments of very weak logical theories. Prima facie, Plantingan Moderate Contingentism and Williamsonian Thorough Necessitism are jointly inconsistent. The argument for their joint truth thus relies also on showing i) their equivalence, and ii) that the dispute between Plantingans and Williamsonians is merely verbal. The case for i) and ii) relies on the Synonymy Account, an account of theory equivalence developed and defended in the dissertation. According to the account, theories are equivalent just in case they have the same structure of entailments and commitments, and the occupiers of the places in that structure are the same propositions. An immediate consequence of the Synonymy Account is that proponents of synonymous theories are engaged in merely verbal disputes. The Synonymy Account is also applied to the debate between noneists and Quineans, revealing that what is in question in that debate is what are the expressive resources available to describe the world.

In the last 30 years there has been growing interest in and a greater appreciation of the unique contributions that medieval authors have made to the history of logic. In this thesis, we compare and contrast the modal logics of Robert Kilwardby and John Buridan and explore how their two conceptions of modality relate to and differ from modern notions of modal logic. We develop formal reconstructions of both authors' logics, making use of a number of different formal techniques. In the case of Robert Kilwardby we show that using his distinction between per se and per accidens modalities, he is able to provide a consistent interpretation of the apodictic fragment of Aristotle's modal syllogism and that, by generalising this distinction to hypothetical construction, he can develop an account of connexive logic. In the case of John Buridan we show that his modal logic is a natural extension of the usual Kripke-style possible worlds semantics, and that this modal logic can be shown to be sound and complete relative to a proof-theoretic formalisation of Buridan's treatment of the expository syllogism.

In classical propositional logic (CPL) logical reasoning is formalised as logical entailment and can be computed by means of tableau and resolution proof procedures. Unfortunately CPL is not expressive enough and using first order logic (FOL) does not solve the problem either since proof procedures for these logics are not decidable. Modal propositional logics (MPL) on the other hand are both decidable and more expressive than CPL. It therefore seems reasonable to apply tableau and resolution proof systems to MPL in order to compute logical entailment in MPL. Although some of the principles in CPL are present in MPL, there are complexities in MPL that are not present in CPL. Tableau and resolution proof systems which address these issues and others will be surveyed here. In particular the work of Abadi & Manna (1986), Chan (1987), del Cerro & Herzig (1988), Fitting (1983, 1990) and Gore (1995) will be reviewed. / Computing / M. Sc. (Computer Science)

In classical propositional logic (CPL) logical reasoning is formalised as logical entailment and can be computed by means of tableau and resolution proof procedures. Unfortunately CPL is not expressive enough and using first order logic (FOL) does not solve the problem either since proof procedures for these logics are not decidable. Modal propositional logics (MPL) on the other hand are both decidable and more expressive than CPL. It therefore seems reasonable to apply tableau and resolution proof systems to MPL in order to compute logical entailment in MPL. Although some of the principles in CPL are present in MPL, there are complexities in MPL that are not present in CPL. Tableau and resolution proof systems which address these issues and others will be surveyed here. In particular the work of Abadi & Manna (1986), Chan (1987), del Cerro & Herzig (1988), Fitting (1983, 1990) and Gore (1995) will be reviewed. / Computing / M. Sc. (Computer Science)