Bruno Dinis

dblp:141/9610 · also Bruno Miguel Antunes Dinis · DBLP profile ↗
← Back
6ranked-venue papers
6as first author
5since 2021 · last 2025
0000-0003-2143-3289ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 6 · 6 first-author · 5 since 2021
YearPublicationVenuePosition
2025 On definable Skolem functions and trichotomy
abstract
In this paper we give an explicit characterization of o-minimal structures with definable Skolem functions/definable choice. Such structures are, after naming finitely many elements from the prime model, a union of finitely many trivial points each defined over ∅ and finitely many open intervals each a union of a ∅-definable family of group-intervals with fixed positive elements.
Bruno Dinis, Mário J. Edmundo
Ann. Pure Appl. Log.1
2023 Stateful Realizers for Nonstandard Analysis
abstract
In this paper we propose a new approach to realizability interpretations for nonstandard arithmetic. We deal with nonstandard analysis in the context of (semi)intuitionistic realizability, focusing on the Lightstone-Robinson construction of a model for nonstandard analysis through an ultrapower. In particular, we consider an extension of the $\lambda$-calculus with a memory cell, that contains an integer (the state), in order to indicate in which slice of the ultrapower $\cal{M}^{\mathbb{N}}$ the computation is being done. We pay attention to the nonstandard principles (and their computational content) obtainable in this setting. In particular, we give non-trivial realizers to Idealization and a non-standard version of the LLPO principle. We then discuss how to quotient this product to mimic the Lightstone-Robinson construction.
Bruno Dinis, Étienne Miquey
Log. Methods Comput. Sci.1
2021 Realizability with Stateful Computations for Nonstandard Analysis
abstract
In this paper we propose a new approach to realizability interpretations for nonstandard arithmetic. We deal with nonstandard analysis in the context of intuitionistic realizability, focusing on the Lightstone-Robinson construction of a model for nonstandard analysis through an ultrapower. In particular, we consider an extension of the λ-calculus with a memory cell, that contains an integer (the state), in order to indicate in which slice of the ultrapower ℳ^{ℕ} the computation is being done. We shall pay attention to the nonstandard principles (and their computational content) obtainable in this setting. We then discuss how this product could be quotiented to mimic the Lightstone-Robinson construction.
Bruno Dinis, Étienne Miquey
CSL1
2021 Fundamental group in o-minimal structures with definable Skolem functions
Bruno Dinis, Mário J. Edmundo, Marcello Mamino
Ann. Pure Appl. Log.1
2021 A parametrised functional interpretation of Heyting arithmetic
Bruno Dinis, Paulo Oliva
Ann. Pure Appl. Log.1
2018 Intuitionistic nonstandard bounded modified realisability and functional interpretation
Bruno Dinis, Jaime Gaspar
Ann. Pure Appl. Log.1