中文
相关论文

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

200 篇论文

In this short notes we propose a new notion of contractibility for coloured $\omega$-operad defined in the article published in Cahiers de Topologie et de G{\'e}om{\'e}trie Diff{\'e}rentielle Cat{\'e}gorique (2011), volume 4. We propose…

范畴论 · 数学 2012-11-13 Camell Kachour

We establish a canonical correspondence between connected quandles and certain configurations in transitive groups, called quandle envelopes. This correspondence allows us to efficiently enumerate connected quandles of small orders, and…

群论 · 数学 2015-06-08 Alexander Hulpke , David Stanovský , Petr Vojtěchovský

Weighted gradual semantics provide an acceptability degree to each argument representing the strength of the argument, computed based on factors including background evidence for the argument, and taking into account interactions between…

人工智能 · 计算机科学 2024-08-21 Assaf Libman , Nir Oren , Bruno Yun

We study the concept of co-amenability for a compact quantum group. Several conditions are derived that are shown to be equivalent to it. Some consequences of co-amenability that we obtain are faithfulness of the Haar integral and automatic…

算子代数 · 数学 2009-10-31 Erik Bedos , Gerard J. Murphy , Lars Tuset

Graded modal logic is the formal language obtained from ordinary (propositional) modal logic by endowing its modal operators with cardinality constraints. Under the familiar possible-worlds semantics, these augmented modal operators receive…

计算机科学中的逻辑 · 计算机科学 2024-04-24 Yevgeny Kazakov , Ian Pratt-Hartmann

The explicit link between Promise Theory and Information Theory, while perhaps obvious, is laid out explicitly here. It's shown how causally related observations of promised behaviours relate to the probabilistic formulation of causal…

多智能体系统 · 计算机科学 2020-04-28 Mark Burgess

The predicate complementary to the well-known Godel's provability predicate is defined. From its recursiveness new consequences concerning the incompleteness argumentation are drawn and extended to new results of consistency, completeness…

综合数学 · 数学 2007-05-23 Paola Cattabriga

This paper establishes new common fixed point theorems for weakly compatible mappings in metric spaces, relaxing traditional requirements such as continuity, compatibility, and reciprocal continuity. We present a unified framework for three…

综合数学 · 数学 2025-07-02 Alemayehu Negash , Meaza Bogale

We address a deep study of the convexity notions that arise in the study of weak* lower semicontinuity of supremal functionals as well as those raised by the power-law approximation of such functionals. Our quest is motivated by the…

偏微分方程分析 · 数学 2023-09-20 Ana Margarida Ribeiro , Elvira Zappale

Building software-driven systems that are easily understood becomes a challenge, with their ever-increasing complexity and autonomy. Accordingly, recent research efforts strive to aid in designing explainable systems. Nevertheless, a common…

人工智能 · 计算机科学 2019-02-11 Dimitri Bohlender , Maximilian A. Köhl

We outline a definition of accessible and presentable objects in a 2-category $\mathcal K$ endowed with a "KZ context", that is to say a pair of lax-idempotent monads interacting in a prescribed way; this perspective suggests a unified…

范畴论 · 数学 2025-08-05 Ivan Di Liberti , Fosco Loregian

This paper argues that an interlingual representation must explicitly represent some parts of the meaning of a situation as possibilities (or preferences), not as necessary or definite components of meaning (or constraints). Possibilities…

计算与语言 · 计算机科学 2007-05-23 Philip Edmonds

Accounts of semantic phenomena often involve extending types of meanings and revising composition rules at the same time. The concept of monads allows many such accounts -- for intensionality, variable binding, quantification and focus --…

计算与语言 · 计算机科学 2007-05-23 Chung-chieh Shan

Consider a linear ordering equipped with a finite sequence of monadic predicates. If the ordering contains an interval of order type \omega or -\omega, and the monadic second-order theory of the combined structure is decidable, there exists…

计算机科学中的逻辑 · 计算机科学 2015-07-01 Alexis Bes , Alexander Rabinovich

We show how the AGM framework for belief change (expansion, revision, contraction) can be extended to deal with conditioning in the so-called Desirability-Indifference framework, based on abstract notions of accepting and rejecting options,…

人工智能 · 计算机科学 2025-04-22 Kathelijne Coussement , Gert de Cooman , Keano De Vos

Dung's abstract argumentation theory is a widely used formalism to model conflicting information and to draw conclusions in such situations. Hereby, the knowledge is represented by so-called argumentation frameworks (AFs) and the reasoning…

人工智能 · 计算机科学 2016-04-01 Ringo Baumann , Thomas Linsbichler , Stefan Woltran

In 1999, Benjamini, Lyons, Peres, and Schramm introduced a notion of weighted-amenability for transitive graphs that is equivalent to the amenability of its automorphism group. For unimodular graphs this notion coincides with classical…

概率论 · 数学 2025-09-16 Grigory Terlov , Ádám Timár

The concept of n-categories and related subject is considered. An n-category is described as an n-graph with a composition. A new definition of operad is presented. Some illustrative examples are given.

范畴论 · 数学 2007-05-23 Zbigniew Oziewicz , Wladyslaw Marcinek

We prove that many properties and invariants of definable groups in NIP theories, such as definable amenability, G/G^{00}, etc., are preserved when passing to the theory of the Shelah expansion by externally definable sets, M^{ext}, of a…

逻辑 · 数学 2017-05-17 Artem Chernikov , Anand Pillay , Pierre Simon

The compatibility "demonstrated" by Rovelli & al. between various "gauge conditions" both in Classical Electromagnetism and General Relativity can be better understood if one distinguishes "gauge conditions" of the solution type and "gauge…

经典物理 · 物理学 2007-06-13 Germain Rousseaux
‹ 上一页 1 8 9 10 下一页 ›