Zobrazeno 1 - 10
of 72
pro vyhledávání: '"Paulo Oliva"'
Autor:
Paulo Oliva, Philipp Zahn
Publikováno v:
Games, Vol 12, Iss 4, p 86 (2021)
In economic theory, an agent chooses from available alternatives—modeled as a set. In decisions in the field or in the lab, however, agents do not have access to the set of alternatives at once. Instead, alternatives are represented by the outside
Externí odkaz:
https://doaj.org/article/e0df8570c91d42878e77255b085120f2
Autor:
Gilda Ferreira, Paulo Oliva
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 47, Iss Proc. CL&C 2010, Pp 21-33 (2011)
Several proof translations of classical mathematics into intuitionistic mathematics have been proposed in the literature over the past century. These are normally referred to as negative translations or double-negation translations. Among those, the
Externí odkaz:
https://doaj.org/article/1b7b185bbad84e7681dfc61ac9184a08
Autor:
Gilda Ferreira, Paulo Oliva
Publikováno v:
Logical Methods in Computer Science, Vol Volume 7, Issue 1 (2011)
We present three different functional interpretations of intuitionistic linear logic ILL and show how these correspond to well-known functional interpretations of intuitionistic logic IL via embeddings of IL into ILL. The main difference from previou
Externí odkaz:
https://doaj.org/article/6446971faea24b6e93829d64deaa6e60
Autor:
Rob Arthan, Paulo Oliva
Publikováno v:
Studia Logica. 109:341-365
This paper presents an algebraic framework for investigating proposed translations of classical logic into intuitionistic logic, such as the four negative translations introduced by Kolmogorov, Gödel, Gentzen and Glivenko. We view these asvariant se
Publikováno v:
Studia Logica. 109:313-339
This paper proposes a generalization of the Kripke semantics of intuitionistic logicIL appropriate forintuitionistic Łukasiewicz logicIŁL —a logic in the intersection betweenIL and (classical) Łukasiewicz logic. This generalised Kripke semantics
Autor:
Rob Arthan, Paulo Oliva
Publikováno v:
Journal of Logic and Analysis. 13
In this paper we present a quantitative analysis of the first and second Borel-Cantelli Lemmas and of two of their generalisations: the Erdős–Rényi Theorem, and the Kochen-Stone Theorem. We will see that the first three results have direct quanti
Publikováno v:
Biblioteca Digital de Teses e Dissertações da Universidade Estadual de Campinas (UNICAMP)
Universidade Estadual de Campinas (UNICAMP)
instacron:UNICAMP
Universidade Estadual de Campinas (UNICAMP)
instacron:UNICAMP
Orientador: Roberto Feijo de Figueiredo Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Civil Resumo: Este trabalho teve por objetivo avaliar a produção de lodo em um Reator Anaeróbio de Fluxo Ascendente e Man
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c38d94fc694e28607d8c6435c43f8e7e
https://doi.org/10.47749/t/unicamp.1995.96325
https://doi.org/10.47749/t/unicamp.1995.96325
Autor:
Bruno Dinis, Paulo Oliva
Publikováno v:
5th International Workshop on Trends in Linear Logic and Applications (TLLA 2021)
5th International Workshop on Trends in Linear Logic and Applications (TLLA 2021), Jun 2021, Rome (virtual), Italy
HAL
5th International Workshop on Trends in Linear Logic and Applications (TLLA 2021), Jun 2021, Rome (virtual), Italy
HAL
International audience; This paper presents an abstract parametrised functional interpretation of Affine Logic. It is based on families of parameters allowing for different degrees of freedom on the design of the interpretation. In this way we are ab
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::496c3a045c376662601a8f205015d108
https://hal-lirmm.ccsd.cnrs.fr/lirmm-03271508/file/TLLA_2021_paper_3.pdf
https://hal-lirmm.ccsd.cnrs.fr/lirmm-03271508/file/TLLA_2021_paper_3.pdf
Publikováno v:
Journal of Logic and Computation. 29:555-575
We present an effective proof (with explicit bounds) of the Podelski and Rybalchenko Termination Theorem. The sub-recursive bounds we obtain make use of bar recursion, in the form of the product of selection functions, as this is used to interpret th
Autor:
Paulo Oliva, Martín Hötzel Escardó
Publikováno v:
The Journal of Symbolic Logic. 82:590-607
This paper considers a generalisation of selection functions over an arbitrary strong monad $T$, as functionals of type $J^T_R X = (X \to R) \to T X$. It is assumed throughout that $R$ is a $T$-algebra. We show that $J^T_R$ is also a strong monad, an