Verification logic: An arithmetical interpretation for negative introspection. - Juan P. Aguilera 001; David Fernández-Duque (Advances in Modal Logic, 2016)

Compactness in Infinitary Gödel Logics. - Juan P. Aguilera 001 (WoLLIC, 2016)

Cut Elimination for Gödel Logic with an Operator Adding a Constant. - Juan P. Aguilera 001; Matthias Baaz (WoLLIC, 2016)

Strong Completeness of Provability Logic for Ordinal Spaces. - Juan P. Aguilera 001; David Fernández-Duque (J. Symb. Log., 2017)

Verification logic. - Juan Pablo Aguilera Ozuna; David Fernández-Duque (J. Log. Comput., 2017)

On the maximization of menu-dependent interval orders. - Juan P. Aguilera 001; Levent Ülkü (Soc. Choice Welf., 2017)

Ten problems in Gödel logic. - Juan P. Aguilera 001; Matthias Baaz (Soft Comput., 2017)

Unsound Inferences Make Proofs Shorter. - Juan P. Aguilera 001; Matthias Baaz (J. Symb. Log., 2019)

Determinate logic and the Axiom of Choice. - Juan P. Aguilera 001 (Ann. Pure Appl. Log., 2020)

$F_ sigma $ GAMES AND REFLECTION IN $L( mathbb {R})$. - Juan P. Aguilera 001 (J. Symb. Log., 2020)

PROVABLY $ Delta_1$ GAMES. - Juan P. Aguilera 001; D. W. Blue (J. Symb. Log., 2020)

The Consistency strength of Long Projective Determinacy. - Juan P. Aguilera 001; Sandra Müller (J. Symb. Log., 2020)

A characterization of Σ11-reflecting ordinals. - Juan P. Aguilera 001 (Ann. Pure Appl. Log., 2021)

Long games and σ-projective sets. - Juan P. Aguilera 001; Sandra Müller; Philipp Schlicht (Ann. Pure Appl. Log., 2021)

Shortening Clopen Games. - Juan P. Aguilera 001 (J. Symb. Log., 2021)

The order of Reflection. - Juan P. Aguilera 001 (J. Symb. Log., 2021)

Gδσ GAMES AND INDUCTION ON REALS. - Juan P. Aguilera 001; Philip D. Welch (J. Symb. Log., 2021)

Feedback hyperjump. - Juan P. Aguilera 001; Robert S. Lubarsky (J. Log. Comput., 2021)

A Gödel Calculus for Linear Temporal Logic. - Juan P. Aguilera 001; Martín Diéguez; David Fernández-Duque; Brett McLean (KR, 2022)

A Non-hyperarithmetical Gödel Logic. - Juan P. Aguilera 001; Jan Bydzovsky; David Fernández-Duque (LFCS, 2022)

Time and Gödel: Fuzzy Temporal Reasoning in PSPACE. - Juan P. Aguilera 001; Martín Diéguez; David Fernández-Duque; Brett McLean (WoLLIC, 2022)

The number of axioms. - Juan P. Aguilera 001; Matthias Baaz; Jan Bydzovsky (Ann. Pure Appl. Log., 2022)

Noetherian Gödel logics. - Juan P. Aguilera 001; Jan Bydzovsky; David Fernández-Duque (J. Log. Comput., 2022)

The Löwenheim-Skolem theorem for Gödel logic. - Juan P. Aguilera 001 (Ann. Pure Appl. Log., 2023)

A topological completeness theorem for transfinite provability logic. - Juan P. Aguilera 001 (Arch. Math. Log., 2023)

Strong Completeness of the Closed Fragment of GLP. - Juan P. Aguilera 001; Grigorii Stepanov (AiML, 2024)

Higher-Order Feedback Computation. - Juan P. Aguilera 001; Robert S. Lubarsky; Leonardo Pacheco (CiE, 2024)

A One-Page Proof of a Theorem of Beleznay. - Juan P. Aguilera 001; Martina Iannella (Bull. Symb. Log., 2024)

Fundamental Logic Is Decidable. - Juan P. Aguilera 001; Jan Bydzovsky (ACM Trans. Comput. Log., 2024)

Gödel-Dummett linear temporal logic. - Juan P. Aguilera 001; Martín Diéguez; David Fernández-Duque; Brett McLean (Artif. Intell., 2025)

Constructive Quantum Logics. - Juan P. Aguilera 001; Guillaume Massas (CoRR, 2025)