Related papers: Validity of contextual formulas (extended version)
We prove the following version of the first incompleteness theorem that simultaneously strengthens Mostowski's theorem and Vaught's theorem: For any c.e. family $\{ T_i \}_{i \in \omega}$ of consistent extensions of Tarski, Mostowski and…
Previous results on proving confluence for Constraint Handling Rules are extended in two ways in order to allow a larger and more realistic class of CHR programs to be considered confluent. Firstly, we introduce the relaxed notion of…
We propose a novel foundational framework for why-not explanations, that is, explanations for why a tuple is missing from a query result. Our why-not explanations leverage concepts from an ontology to provide high-level and meaningful…
We discuss and compare complexity measures for the modal $\mu$-calculus, focusing on size and alternation depth. As a yardstick we take Wilke's alternating tree automata, which we shall call parity formulas in the text. Building on work by…
The present dissertation introduces the research project on HOLMS (\textbf{HOL} Light Library for \textbf{M}odal \textbf{S}ystems), a growing modular framework for modal reasoning within the HOL Light proof assistant. To provide an…
We study an extension of $\mtl$ in pointwise time with rational expression guarded modality $\reg_I(\re)$ where $\re$ is a rational expression over subformulae. We study the decidability and expressiveness of this extension ($\mtl$+$\varphi…
We study coupled logical bisimulation (CLB) to reason about contextual equivalence in the lambda-calculus. CLB originates in a work by Dal Lago, Sangiorgi and Alberti, as a tool to reason about a lambda-calculus with probabilistic…
Abstract separation logics are a family of extensions of Hoare logic for reasoning about programs that manipulate resources such as memory locations. These logics are "abstract" because they are independent of any particular concrete…
We expand the classic result that $\mathsf{AC}_{\mathsf{WO}}$ is equivalent to the statement "For all $X$, $\aleph(X)=\aleph^*(X)$" by proving the equivalence of many more related statements. Then, we introduce the Hartogs-Lindenbaum…
Generalized contextuality is a possible indicator of non-classical behaviour in quantum information theory. In finite-dimensional systems, this is justified by the fact that noncontextual theories can be embedded into some simplex, i.e.…
This paper presents an ongoing work that is part of a more wide-ranging project whose final scope is to define a method to validate LTL formulas w.r.t. a program written in the timed concurrent constraint language tccp, which is a logic…
The paper is focused on temporal logics for the description of the behaviour of real-time pushdown reactive systems. The paper is motivated to bridge tractable logics specialized for expressing separately dense-time real-time properties and…
Consequence-based reasoning can be used to construct proofs that explain entailments of description logic (DL) ontologies. In the literature, one can find multiple consequence-based calculi for reasoning in the $\mathcal{EL}$ family of DLs,…
We study provability predicates $\mathrm{Pr}_T(x)$ satisfying the following condition $\mathbf{E}$ from a modal logical perspective: $\mathbf{E}:$ if $ T \vdash \varphi \leftrightarrow \psi$, then $T \vdash \mathrm{Pr}_T(\ulcorner \varphi…
In lines 8-11 of \cite[pp. 2977]{Lu} we wrote: "For integer $m\ge 3$, if $M$ is $C^m$-smooth and $C^{m-1}$-smooth $L:\R\times TM\to\R$ satisfies the assumptions (L1)-(L3), then the functional ${\cal L}_\tau$ is $C^2$-smooth, bounded below,…
In 1974, M. Shub stated Topological Entropy Conjecture, that is, the inequality $\log\rho\leq ent(f)$ is valid or not, where $f$ is a continuous self-map on a compact manifold $M$, $ent(f)$ is the topological entropy of $f$ and $\rho$ is…
Interactive behaviors are ubiquitous in modern cryptography, but are also present in $\lambda$-calculi, in the form of higher-order constructions. Traditionally, however, typed $\lambda$-calculi simply do not fit well into cryptography,…
Quantum mechanics provides a statistical description about nature, and thus would be incomplete if its statistical predictions could not be accounted for some realistic models with hidden variables. There are, however, two powerful theorems…
We prove the Stability Property for the call-by-value $\lambda$-calculus (CbV in the following). This result states necessary conditions under which the contexts of the CbV $\lambda$-calculus commute with intersections of approximants. This…
A fundamental issue in the $\lambda$-calculus is to find appropriate notions for meaningfulness. It is well-known that in the call-by-name $\lambda$-calculus (CbN) the meaningful terms can be identified with the solvable ones, and that this…