中文
相关论文

相关论文: Negation and Involutive Adjunction

200 篇论文

The postulates of comprehension and extensionality in set theory are based on an inversion principle connecting set-theoretic abstraction and the property of having a member. An exactly analogous inversion principle connects functional…

范畴论 · 数学 2007-05-23 K. Dosen

Conceiving of premises as collected into sets or multisets, instead of sequences, may lead to triviality for classical and intuitionistic logic in general proof theory, where we investigate identity of deductions. Any two deductions with…

逻辑 · 数学 2016-06-10 Kosta Dosen

We look at non-classical negations and their corresponding adjustment connectives from a modal viewpoint, over complete distributive lattices, and apply a very general mechanism in order to offer adequate analytic proof systems to logics…

计算机科学中的逻辑 · 计算机科学 2016-06-24 Ori Lahav , João Marcos , Yoni Zohar

We develop a bicategorical setup in which one can speak about adjoint 1-morphisms even in the absence of genuine identity 1-morphisms. We also investigate which part of 2-representation theory of 2-categories extends to this new setup.

范畴论 · 数学 2020-03-11 Hankyung Ko , Volodymyr Mazorchuk , Xiaoting Zhang

We present the notion of "cyclic double multicategory", as a structure in which to organise multivariable adjunctions and mates. The classic example of a 2-variable adjunction is the hom/tensor/cotensor trio of functors; we generalise this…

范畴论 · 数学 2012-08-24 Eugenia Cheng , Nick Gurski , Emily Riehl

A dozen papers have considered the concept of negation of probability distributions (pd) introduced by Yager. Usually, such negations are generated point-by-point by functions defined on a set of probability values and called here negators.…

人工智能 · 计算机科学 2021-03-31 Ildar Batyrshin

Given a pair of adjoint functors between two arbitrary categories it induces mutually inverse equivalences between the full subcategories of the initial ones, consisting of objects for which the arrows of adjunction are isomorphisms. We…

范畴论 · 数学 2009-10-22 George Ciprian Modoi

In this paper we split every basic propositional connective into two versions, one is called extensional and the other one intensional. The extensional connectives are semantically characterized by standard truth conditions that are…

计算机科学中的逻辑 · 计算机科学 2022-04-15 Vít Punčochář , Berta Grimau

We generalize, by a progressive procedure, the notions of conjunction and disjunction of two conditional events to the case of $n$ conditional events. In our coherence-based approach, conjunctions and disjunctions are suitable conditional…

概率论 · 数学 2019-09-27 Angelo Gilio , Giuseppe Sanfilippo

Non-classical negations may fail to be contradictory-forming operators in more than one way, and they often fail also to respect fundamental meta-logical properties such as the replacement property. Such drawbacks are witnessed by intricate…

计算机科学中的逻辑 · 计算机科学 2017-07-26 Ori Lahav , João Marcos , Yoni Zohar

In this paper, the abc conjecture is negated under certain conditions

综合数学 · 数学 2025-03-19 JinHua Fei

Paraconsistency is commonly defined and/or characterized as the failure of a principle of explosion. The various standard forms of explosion involve one or more logical operators or connectives, among which the negation operator is the most…

逻辑 · 数学 2022-04-15 Sankha S. Basu , Sayantan Roy

Adjoint logic is a general approach to combining multiple logics with different structural properties, including linear, affine, strict, and (ordinary) intuitionistic logics, where each proposition has an intrinsic mode of truth. It has…

计算机科学中的逻辑 · 计算机科学 2024-02-05 Junyoung Jang , Sophia Roshal , Frank Pfenning , Brigitte Pientka

The basic notions of category theory, such as limit, adjunction, and orthogonality, all involve assertions of the existence and uniqueness of certain arrows. Weak notions arise when one drops the uniqueness requirement and asks only for…

范畴论 · 数学 2012-05-25 Stephen Lack , Jiri Rosicky

This paper presents a generalization of the disjunctive paraconsistent relational data model in which disjunctive positive and negative information can be represented explicitly and manipulated. There are situations where the closed world…

数据库 · 计算机科学 2007-05-23 Haibin Wang , Yuanchun He , Rajshekhar Sunderraman

Recursive relational specifications are commonly used to describe the computational structure of formal systems. Recent research in proof theory has identified two features that facilitate direct, logic-based reasoning about such…

计算机科学中的逻辑 · 计算机科学 2010-09-24 Andrew Gacek , Dale Miller , Gopalan Nadathur

We state Bennequin inequalities in the relative case, and show that the relative invariants are additive under relative connected sums. We show they exhibit similar limitations as their classical analogues. We study relatively Legendrian…

辛几何 · 数学 2009-09-25 Georgi D. Gospodinov

The Aristotelian syllogistic cannot account for the validity of many inferences involving relational facts. In this paper, we investigate the prospects for providing a relational syllogistic. We identify several fragments based on (a)…

计算机科学中的逻辑 · 计算机科学 2024-04-24 Ian Pratt-Hartmann , Lawrence S. Moss

It is shown that every two-variable adjunction in categories enriched in a commutative quantale serves as a base for constructing Isbell adjunctions between functor categories, and Kan adjunctions are precisely Isbell adjunctions…

范畴论 · 数学 2024-08-16 Lili Shen , Xiaoye Tang

Exploiting particular features of classical groups, simple constructions are given for the irreducible constituents of the tensor square of the adjoint modules and the leading terms in higher tensor powers. This provides an independent…

表示论 · 数学 2022-12-29 Keith Hannabuss
‹ 上一页 1 2 3 10 下一页 ›