中文
相关论文

相关论文: Abstraction and Application in Adjunction

200 篇论文

We introduce a new logic that combines Adjoint Logic with Graded Necessity Modalities. This results in a very expressive system capable of controlling when and how structural rules are used. We give a sequent calculus, natural deduction,…

计算机科学中的逻辑 · 计算机科学 2020-06-17 Harley Eades , Dominic Orchard

Contracts are a well-established approach for describing and analyzing behavioral aspects of web service compositions. The theory of contracts comes equipped with a notion of compatibility between clients and servers that ensures that every…

编程语言 · 计算机科学 2011-01-26 Maria Grazia Buscemi , Hernán Melgratti

Convergence theory is an extension of general topology. In contrast with topology, it is closed under some important operations, like exponentiation. With all its advantages, convergence theory remains rather unknown. It is an aim of this…

一般拓扑 · 数学 2020-06-23 Szymon Dolecki

We investigate an extension of nominal many-sorted signatures in which abstraction has a form of instantiation, called generalised concretion, as elimination operator (similarly to lambda-calculi). Expressions are then classified using a…

计算机科学中的逻辑 · 计算机科学 2025-10-15 Maribel Fernández , Miguel Pagano , Nora Szasz , Álvaro Tasistro

At its core, abstraction is the process of generalizing from specific instances to broader concepts or models, with the primary objective of reducing complexity while preserving properties essential to the intended purpose. It is…

计算机科学中的逻辑 · 计算机科学 2026-01-06 Andrzej Szalas

This article tackles categorical coherence within a two-dimensional generalization of Lawvere's functorial semantics. 2-theories, a syntactical way of describing categories with structure, are presented. From the perspective here afforded,…

范畴论 · 数学 2007-05-23 Noson S. Yanofsky

We discuss adjunction formulas for fiber spaces and embeddings, extending the known results along the lines of the Adjunction Conjecture, independently proposed by Y. Kawamata and V.V. Shokurov. As an application, we simplify Koll\'ar's…

代数几何 · 数学 2007-05-23 Florin Ambro

In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.…

计算机科学中的逻辑 · 计算机科学 2023-06-22 Arnon Avron , Liron Cohen

The aim of the present paper is to show that the concept of intuitionistic logic based on a Heyting algebra can be generalized in such a way that it is formalized by means of a bounded poset. In this case it is not assumed that the poset is…

逻辑 · 数学 2023-08-23 Ivan Chajda , Helmut Länger

Categorical semantics of type theories are often characterized as structure-preserving functors. This is because in category theory both the syntax and the domain of interpretation are uniformly treated as structured categories, so that we…

编程语言 · 计算机科学 2024-02-14 Shin-ya Katsumata , Xavier Rival , Jérémy Dubut

An extension of Transformers is proposed that enables explicit relational reasoning through a novel module called the Abstractor. At the core of the Abstractor is a variant of attention called relational cross-attention. The approach is…

机器学习 · 统计学 2024-04-16 Awni Altabaa , Taylor Webb , Jonathan Cohen , John Lafferty

Both propositional dependence logic and inquisitive logic are expressively complete. As a consequence, every formula with intuitionistic disjunction or intuitionistic implication can be translated equivalently into a formula in the language…

逻辑 · 数学 2018-12-19 Fan Yang

We show that the main results of the expected utility and dual utility theories can be derived in a unified way from two fundamental mathematical ideas: the separation principle of convex analysis, and integral representations of continuous…

泛函分析 · 数学 2012-11-20 Darinka Dentcheva , Andrzej Ruszczynski

In this paper, we study aggregation rules with nontrivial symmetric classes of invariant sets (restricted domains), assuming that they, unlike others, have a logical nature. In the simplest case, we provide a complete classification of such…

理论经济学 · 经济学 2026-04-03 Nikolay L. Poliakov

Let $\mathcal{P}$ be a set of points in the plane, and $\mathcal{S}$ a strictly convex set of points. In this note, we show that if $\mathcal{P}$ contains many translates of $\mathcal{S}$, then these translates must come from a generalized…

组合数学 · 数学 2023-02-28 Gabriel Currier , Jozsef Solymosi , Ethan Patrick White

Instantiation overflow is the property of those second order types for which all instances of full comprehension can be deduced from instances of atomic comprehension. In other words, a type has instantiation overflow when one can type, by…

计算机科学中的逻辑 · 计算机科学 2018-03-28 Paolo Pistone

We present a generalization of the multiplier ideal version of inversion of adjunction, often known as the restriction theorem, to centers of arbitrary codimension. We approach inversion of adjunction from the subadjunction point of view.…

代数几何 · 数学 2011-04-27 Eugene Eisenstein

The aim of this paper is to present a very simple original, purely formal, proof of Quillen's adjunction theorem for derived functors, and of some more recent variations and generalizations of this theorem. This is obtained by proving an…

代数拓扑 · 数学 2007-05-23 Georges Maltsiniotis

Our work over the past years shows that not only the collection of (for instance) all topological spaces gives rise to a category, but also each topological space can be seen individually as a category by interpreting the convergence…

范畴论 · 数学 2008-04-03 Dirk Hofmann

In this paper, having introduced a convergence of a series on the root vectors in the Abel-Lidskii sense, we present a valuable application to the evolution equations. The main issue of the paper is an approach allowing us to principally…

泛函分析 · 数学 2022-12-21 Maksim V. Kukushkin