Carles Noguera

Professor of logic

Università degli Studi di Siena
Country flagItaly

Research Interests

ApplyKite TwinLearns as you apply

Make your next move.

Prepare your application

Review drafts before you send them.

Explore related searches

About

Carles Noguera is a Research Professor at the Università degli Studi di Siena, Italy. His research focuses on various aspects of logic, particularly in the areas of many-valued logics, reasoning through real-valued first-order logics, and fuzzy logics. Recent publications include works on asymptotic truth-value laws and graded model theory.

Articles (19)

Year:

2026

Year:

2026

Year:

2026

In this paper, we study two operators, inquisitive disjunction and inquisitive existential quantifier, in the context of first-order intuitionistic logic with constant domains. We explain that these operators allow us to express types of intuitionistic propositions. We first provide this language with a relational semantics and formulate a sound axiomatic system. Completeness of the system for the full language is presented as an open problem but we prove completeness for a rich fragment of the language adapting the methods developed by Gianluca Grilleti in the context of classical inquisitive logic. We also develop a general algebraic framework in which we characterize the class of “Kripkean algebras” generated by the relational semantics. In this way, we obtain our first algebraic characterization of the logic of intuitionistic types. We further characterize the class of all homomorphic images of “Kripkean algebras” that we call “inquisitive algebras”, thus obtaining a second, more general algebraic semantics for this logic.

Year:

2026

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

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

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:

2023

Year:

2023

Year:

2023

Year:

2022

Year:

2022

Year:

2022

Year:

2021

Year:

2021

Year:

2021

Year:

2020

Collaborators (2)

Guido Sciavicco

University of Ferrara

ITALY
View details

Guillermo Badia

Lecturer

University of Queensland

AUSTRALIA
View details