相关论文: $\varphi$-contractibility and $\varphi$-Connes ame…

In this paper, we determine the complexity of the satisfiability problem for various logics obtained by adding numerical quantifiers, and other constructions, to the traditional syllogistic. In addition, we demonstrate the incompleteness of…

In this paper we develop the idea of abstract homogeneity in the context of interval-valued (IV) functions endowed with admissible orders and investigate some of its properties.

We give some sufficient and necessary conditions on a forcing notion Q for preserving the forcing notion ([omega]^{aleph_0},supseteq^*) is proper. They cover many reasonable forcing notions.

In \cite{Ca2016} and \cite{Ca2018}, we introduced a notion of effective reducibility between set-theoretical $\Pi_{2}$-statements; in \cite{Ca2025}, this was extended to statements of arbitrary (potentially even infinite) quantifier…

Belnap-Dunn logic, also knows as the logic of First-Degree Entailment, is a logic that can serve as the underlying logic of theories that are inconsistent or incomplete. For various reasons, different expansions of Belnap-Dunn logic with…

We give a detailed proof of the properties of the usual Prikry type forcing notion for turning a measurable cardinal into $\aleph_\omega$.

We adapt the notion of quasi-Hermition group to the pairs $(G,H)$ of discrete group $G$ and its subgroup $H$. We show that a quasi-Hermitian pair is amenable in the sense of Eymard.

We give a definition of amenability at infinity for a locally compact, $\sigma$-compact and Hausdorff etale groupoid and we study in some case the exactness of the reduced $C^*$-algebra of a such groupoid.

We consider abstract-argumentation-theoretic coalition formability in this work. Taking a model from political alliance among political parties, we will contemplate profitability, and then formability, of a coalition. As is commonly…

We study first-order logic (FO) over the structure consisting of finite words over some alphabet $A$, together with the (non-contiguous) subword ordering. In terms of decidability of quantifier alternation fragments, this logic is…

Session contracts is a formalism enabling to investigate client/server interaction protocols and to interpret session types. We extend session contracts in order to represent outputs whose actual sending in an interaction depends on a third…

Numerous definitions for complexity have been proposed over the last half century, with little consensus achieved on how to use the term. A definition of complexity is supplied here that is closely related to the Kolmogorov Complexity and…

In this paper we extend the approach of M. Cavaleri to effective amenability to the class of computably enumerable groups, i.e. in particular we do not assume that groups are finitely generated. In the case of computable groups we also…

This is mainly an expository text on the Haagerup property for countable groupoids equipped with a quasi-invariant measure, aiming to complete an article of Jolissaint devoted to the study of this property for probability measure preserving…

Interpretability and explainability have gained more and more attention in the field of machine learning as they are crucial when it comes to high-stakes decisions and troubleshooting. Since both provide information about predictors and…

In this note we show that a semisimplicial set with the weak Kan condition admits a simplicial structure, provided any object allows an idempotent self-equivalence. Moreover, any two choices of simplicial structures give rise to equivalent…

We introduce the notion of Johnson pseudo-Connes amenability for dual Banach algebras. We study the relation between this new notion with the various notions of Connes amenability like Connes amenability, approximate Connes amenability and…

Abstract argumentation frameworks (AFs) are one of the most studied formalisms in AI. In this work, we introduce a certain subclass of AFs which we call compact. Given an extension-based semantics, the corresponding compact AFs are…

Over the past two decades the notion of a strong monad has found wide applicability in computing. Arising out of a need to interpret products in computational and semantic settings, different approaches to this concept have arisen. In this…

Notions of sesquiconstructible complexes and odd iterated stellar subdivisions are introduced, and some of their basic properties are verified. The Charney-Davis conjecture is then proven for odd iterated stellar subdivisions of…