中文
相关论文

相关论文: Predicate Transformers, (co)Monads and Resolutions

200 篇论文

Let X be a countably infinite set of real numbers and let Y_x, x \in X, be an independent family of stationary random subsets of the real numbers, e.g. homogeneous Poisson point processes. We give criteria for the a.s. existence of various…

概率论 · 数学 2011-05-17 Martin P. W. Zerner

A logic satisfies the interpolation property provided that whenever a formula {\Delta} is a consequence of another formula {\Gamma}, then this is witnessed by a formula {\Theta} which only refers to the language common to {\Gamma} and…

逻辑 · 数学 2019-02-13 Matthias Baaz , Mai Gehrke , Sam van Gool

We start a systematic investigation of the size of Craig interpolants, uniform interpolants, and strongest implicates for (quasi-)normal modal logics. Our main upper bound states that for tabular modal logics, the computation of strongest…

计算机科学中的逻辑 · 计算机科学 2026-05-15 Balder ten Cate , Louwe Kuijer , Frank Wolter

In this paper we investigate the interplay between isolated suborders and closures. Isolated suborders are a special kind of suborders and can be used to diminish the number of elements of an ordered set by means of a quotient construction.…

离散数学 · 计算机科学 2024-08-07 Roland Glück

The concept of_refinement_ in type theory is a way of reconciling the "intrinsic" and the "extrinsic" meanings of types. We begin with a rigorous analysis of this concept, settling on the simple conclusion that the type-theoretic notion of…

计算机科学中的逻辑 · 计算机科学 2013-10-02 Paul-André Melliès , Noam Zeilberger

Resolvents of set-valued operators play a central role in various branches of mathematics and in particular in the design and the analysis of splitting algorithms for solving monotone inclusions. We propose a generalization of this notion,…

最优化与控制 · 数学 2020-06-24 Minh N. Bùi , Patrick L. Combettes

We prove, and mechanize in Rocq, an abstract obstruction theorem for primitive closure predicates, defined as $C : \mathsf{Form} \to \mathsf{Prop}$ over the closed implication-falsity fragment $A,B ::= \bot \mid A \to B$. Two structurally…

逻辑 · 数学 2026-05-20 Milan Rosko

In a quaternion order of class number one, an element can be factored in multiple ways depending on the order of the factorization of its reduced norm. The fact that multiplication is not commutative causes an element to induce a…

环与代数 · 数学 2018-11-02 Sara Chari

The Choquet integral w.r.t. a capacity can be seen in the finite case as a parsimonious linear interpolator between vertices of $[0,1]^n$. We take this basic fact as a starting point to define the Choquet integral in a very general way,…

离散数学 · 计算机科学 2015-05-13 Michel Grabisch , Christophe Labreuche

The paper is devoted to construction of some closed inductive sequence of models of the generalized second-order Dedekind theory of real numbers with exponentially increasing powers. These models are not isomorphic whereas all models of the…

逻辑 · 数学 2019-07-08 Valeriy K. Zakharov , Timofey V. Rodionov

In this work in progress, we discuss independence and interpolation and related topics for classical, modal, and non-monotonic logics.

逻辑 · 数学 2010-08-30 Dov Gabbay , Karl Schlechta

The category of all monads over many-sorted sets (and over other "set-like" categories) is proved to have coequalizers and strong cointersections. And a general diagram has a colimit whenever all the monads involved preserve monomorphisms…

计算机科学中的逻辑 · 计算机科学 2014-09-15 Jiří Adámek

This work, shows how propositional resolution can be generalized to obtain a resolution proof system for constrained pseudo-propositional logic (CPPL), which is an extension resulted from inserting the natural numbers with few constraints…

逻辑 · 数学 2023-06-13 Ahmad-Saher Azizi-Sultan

We review a few results concerning interpolation of monotone functions on infinite lattices, emphasizing the role of set-theoretic considerations. We also discuss a few open problems.

环与代数 · 数学 2007-05-23 Martin Goldstern

Monadic decomposibility --- the ability to determine whether a formula in a given logical theory can be decomposed into a boolean combination of monadic formulas --- is a powerful tool for devising a decision procedure for a given logical…

形式语言与自动机理论 · 计算机科学 2019-05-09 Pablo Barcelo , Chih-Duo Hong , Xuan-Bach Le , Anthony W. Lin , Reino Niskanen

We combine the language of monoids with the language of preorders so as to refine some fundamental aspects of the classical theory of factorization and prove an abstract factorization theorem with a variety of applications. In particular,…

环与代数 · 数学 2022-04-15 Salvatore Tringali

This note points out a lemma on closures of monotonic increasing functions and shows how it is applicable to decomposition and modularity for semantics defined as the least fixedpoint of some monotonic function. In particular it applies to…

计算机科学中的逻辑 · 计算机科学 2020-08-04 Michael J. Maher

We prove a generalisation to any characteristic of a result of Macdonald that describes strict polynomial functors in characteristic zero in terms of representations of the groupoid of finite sets and bijections. Our result will give an…

表示论 · 数学 2007-05-23 Torsten Ekedahl , Pelle Salomonsson

In this paper, applied strictly monotonic increasing scaled maps, a kind of well-conditioned linear barycentric rational interpolations are proposed to approximate functions of singularities at the origin, such as $x^\alpha$ for $\alpha \in…

数值分析 · 数学 2021-01-21 Desong Kong , Shuhuang Xiang

This work aims to accelerate the convergence of proximal gradient methods used to solve regularized linear inverse problems. This is achieved by designing a polynomial-based preconditioner that targets the eigenvalue spectrum of the normal…