Related papers: Valuations in G\"{o}del Logic, and the Euler Chara…
This paper studies which truth-values are most likely to be taken on finite models by arbitrary sentences of a many-valued predicate logic. We obtain generalizations of Fagin's classical zero-one law for any logic with values in a finite…
It is well known that sometimes Euler sums (i.e., alternating multiple zeta values) can be expressed as $\Q$-linear combinations of multiple zeta values (MZVs). In her thesis Glanois presented a criterion for motivic Euler sums to be…
This article extends classical one variable results about Euler products defined by integral valued polynomial or analytic functions to several variables. We show there exists a meromorphic continuation up to a presumed natural boundary,…
Model theoretic results such as Characterization and Definability give important information about different logics. It is well known that the proofs of those results for several modal logics have, somehow, the same 'taste'. A general proof…
The paper proposes and studies temporal logics for attributed words, that is, data words with a (finite) set of (attribute,value)-pairs at each position. It considers a basic logic which is a semantical fragment of the logic…
We provide a framework to derive a variational formulation for $-\log\mathbb{E}_\nu\left[e^{-f}\right]$ for a large class of measures $\nu$. We use a family of perturbations of the identity $(W^u)$ whose invertibility we characterize thanks…
In this paper we prove Chaitin's ``heuristic principle'', {\it the theorems of a finitely-specified theory cannot be significantly more complex than the theory itself}, for an appropriate measure of complexity. We show that the measure is…
Doubts are raised concerning the usual interpretation of the alleged failure, by quantum mechanics, of the distributive law of classical logic. The difficulty raised by incompatible sets of observables is overcome within an epistemic…
Given a definable function $f: S \to \mathbb{R}$ on a definable set $S$, we study sublevel sets of the form $S^f_t \coloneqq \{x \in S: f(x) \leq t\}$ for all $t \in \mathbb{R}$. Using o-minimal structures, we prove that the Euler…
Logical formalisms provide a natural and concise means for specifying and reasoning about preferences. In this paper, we propose lexicographic logic, an extension of classical propositional logic that can express a variety of preferences,…
A co-valuation is, essentially, a minimal finite cover. We introduce a logic based on co-valuations, which play the role of valuations of free variables in classical first-order logic, and show that the fundamental tools of model theory --…
In this paper we present a transformation of finite propositional default theories into so-called propositional argumentation systems. This transformation allows to characterize all notions of Reiter's default logic in the framework of…
Logic-based argumentation is a well-established formalism modelling nonmonotonic reasoning. It has been playing a major role in AI for decades, now. Informally, a set of formulas is the support for a given claim if it is consistent,…
We study the Euler characteristic of a hypersurface in $(\mathbb{C}^*)^2 \times (\mathbb{C}^*)^n$ defined by a polynomial whose monomial support corresponds to lattice points in $\Delta_1 \times \Delta_1 \times \Delta_n$ as the coefficients…
This chapter presents probability logic as a rationality framework for human reasoning under uncertainty. Selected formal-normative aspects of probability logic are discussed in the light of experimental evidence. Specifically, probability…
Multi-valued functions are common in computable analysis (built upon the Type 2 Theory of Effectivity), and have made an appearance in complexity theory under the moniker search problems leading to complexity classes such as PPAD and PLS…
Many important properties of multi-agent systems refer to the participants' ability to achieve a given goal, or to prevent the system from an undesirable event. Among intelligent agents, the goals are often of epistemic nature, i.e.,…
The first contribution of this paper is the presentation of a Pavelka - like formulation of possibilistic logic in which the language is naturally enriched by two connectives which represent negation (eg) and a new type of conjunction…
Differentiable logics are a family of quantitative logics originated in the machine learning literature. Because of their origin, differentiable logics often come equipped with analytic properties that guarantee that they are…
We define two $L$-functions associated to a common vector valued eigenform $f$ transforming with the ``finite'' Weil representation. The first one can be seen as a standard zeta function defined by the eigenvalues of $f$. The second one can…