Guillermo Badia

Has grant

Lecturer

University of Queensland
Country flagAustralia

Research Interests

ApplyKite TwinLearns as you apply

Make your next move.

Prepare your application

Review drafts before you send them.

Explore related searches

About

Dr. Guillermo Badia is a Lecturer at the University of Queensland, Australia. His research focuses on areas such as first-order logic, hybrid logic, and consequence relations, reflected in his recent publications including "Hybrid-Dynamic Ehrenfeucht-Fraïssé Games" and "A Lindström theorem for intuitionistic first-order logic." With expertise in the foundations of reasoning and logical frameworks, he contributes significantly to the academic community.

Recent Grants

Grant: Close

Fuzzy logics for graded reasoning in applied contexts

Open Date: 2022-07-25

Close Date: 2025-07-24

Articles (22)

Year:

2026

Year:

2026

Ehrenfeucht-Fraïssé games provide means to characterize elementary equivalence for first-order logic, and by standard translation also for modal logics. We propose a novel generalization of Ehrenfeucht-Fraïssé games to hybrid-dynamic logics which is direct and fully modular: parameterized by the features of the hybrid language we wish to include, for instance, the modal and hybrid language operators as well as first-order existential quantification. We use these games to establish a new modular Fraïssé-Hintikka theorem for hybrid-dynamic propositional logic and its various fragments. We study the relationship between countable game equivalence (determined by countable Ehrenfeucht-Fraïssé games) and bisimulation (determined by countable back-and-forth systems). In general, the former turns out to be weaker than the latter, but under certain conditions on the language, the two coincide. As a corollary we obtain an analogue of the Hennessy-Milner theorem. We also prove that for reachable image-finite Kripke structures elementary equivalence implies isomorphism.

Year:

2025

Many-valued logics, in general, and real-valued logics, in particular, usually focus on a notion of consequence based on preservation of full truth, typically represented by the value $1$ in the semantics given in the real unit interval $[0,1]$ . In a recent paper [Foundations of Reasoning with Uncertainty via Real-valued Logics, Proceedings of the National Academy of Sciences 121(21): e2309905121, 2024], Ronald Fagin, Ryan Riegel, and Alexander Gray have introduced a new paradigm that allows to deal with inferences in propositional real-valued logics based on a rich class of sentences, multi-dimensional sentences, that talk about combinations of any possible truth values of real-valued formulas. They have proved a strong completeness result that allows one to derive exactly what information can be inferred about the combinations of truth values of a collection of formulas given information about the combinations of truth values of a finite number of other collections of formulas. In this paper, we extend that work to the first-order (as well as modal) logic of multi-dimensional sentences. We give a parameterized axiomatic system that covers any reasonable logic and prove a corresponding completeness theorem, first assuming that the structures are defined over a fixed domain, and later for the logics of varying domains. As a by-product, we also obtain a zero-one law for finitely-valued versions of these logics. Since several first-order real-valued logics are known not to have recursive axiomatizations but only infinitary ones, our system is by force akin to infinitary systems.

Year:

2025

There are known characterisations of several fragments of hybrid logic by means of invariance under bisimulations of some kind. The fragments include $\{\mathord {\downarrow }, \mathord {@}\}$ with or without nominals (Areces, Blackburn, Marx), $\mathord {@}$ with or without nominals (ten Cate), and $\mathord {\downarrow }$ without nominals (Hodkinson, Tahiri). Some pairs of these characterisations, however, are incompatible with one another. For other fragments of hybrid logic no such characterisations were known so far. We prove a generic bisimulation characterisation theorem for all standard fragments of hybrid logic, in particular for the case with $\mathord {\downarrow }$ and nominals, left open by Hodkinson and Tahiri. Our characterisation is built on a common base and for each feature extension adds a specific condition, so it is modular in an engineering sense.

Year:

2025

This paper studies which truth-values are most likely to be taken on finite models by arbitrary sentences of a many-valued predicate logic. The classical zero-one law (independently proved by Fagin and Glebskiĭ et al.) states that every sentence in a purely relational language is almost surely false or almost surely true, meaning that the probability that the formula is true in a randomly chosen finite structures of cardinal n is asymptotically $0$ or $1$ as n grows to infinity. We obtain generalizations of this result for any logic with values in a finite lattice-ordered algebra, and for some infinitely valued logics, including Łukasiewicz logic. The finitely valued case is reduced to the classical one through a uniform translation and Oberschelp’s generalization of the zero-one law. Moreover, it is shown that the complexity of determining the almost sure value of a given sentence is PSPACE-complete (generalizing Grandjean’s result for the classical case), and for some logics we describe completely the set of truth-values that can be taken by sentences almost surely.

Year:

2025

Codd's Theorem, a fundamental result of database theory, asserts that relational algebra and relational calculus have the same expressive power on relational databases. We explore Codd's Theorem for databases over semirings and establish two different versions of this result for such databases: the first version involves the five basic operations of relational algebra, while in the second version the division operation is added to the five basic operations of relational algebra. In both versions, the difference operation of relations is given semantics using semirings with monus, while on the side of relational calculus a limited form of negation is used. The reason for considering these two different versions of Codd's theorem is that, unlike the case of ordinary relational databases, the division operation need not be expressible in terms of the five basic operations of relational algebra for databases over an arbitrary positive semiring; in fact, we show that this inexpressibility result holds for bag databases, as well as for databases over the tropical semiring.

Year:

2025

Year:

2025

Year:

2025

Year:

2024

Year:

2023

Year:

2023

Year:

2023

Year:

2023

Year:

2023

Year:

2023

Year:

2023

Year:

2023

Year:

2023

Year:

2022

Year:

2022

Year:

2022

Collaborators (6)

Daniel Gaina

Assistant Professor

Kyushu University

JAPAN
View details

Guido Sciavicco

University of Ferrara

ITALY
View details

Tomasz Kowalski

Professor

Jagiellonian University

POLAND
View details

David MAKINSON

Honorary Associate professor

University of Queensland

AUSTRALIA
View details

Carles Noguera

Professor of logic

Università degli Studi di Siena

ITALY
View details

Alexander Knapp

Professor

University of Augsburg

GERMANY
View details