English
Related papers

Related papers: A DNC function that computes no effectively bi-imm…

200 papers

We show that for every integer $k \geq 2$, the Res($k$) propositional proof system does not have the weak feasible disjunction property. Next, we generalize a recent result of Atserias and M\"uller [FOCS, 2019] to Res($k$). We show that if…

Computational Complexity · Computer Science 2020-03-24 Michal Garlík

The total loss function associated with a set of cross-sectional predictions, that is, estimates or forecasts, summarizes the set's overall accuracy. Its arguments are the individual cross-sectional units' loss functions. Under general…

Methodology · Statistics 2025-07-22 Charles D. Coleman

A classification is a surjective mapping from a set of objects to a set of categories. A classification aggregation function aggregates every vector of classifications into a single one. We show that every citizen sovereign and independent…

Artificial Intelligence · Computer Science 2023-10-19 Olivier Cailloux , Matthieu Hervouin , Ali I. Ozkes , M. Remzi Sanver

Logical bilateralism challenges traditional concepts of logic by treating assertion and denial as independent yet opposed acts. While initially devised to justify classical logic, its constructive variants show that both acts admit…

Logic in Computer Science · Computer Science 2026-05-05 Victor Barroso-Nascimento , Maria Osório , Elaine Pimentel

Let m>2 be an integer. We show that ZF + "For every integer n, Every countable family of non-empty sets of cardinality at most n has an infinite partial choice function" is not strong enough to prove that every countable set of m-element…

Logic · Mathematics 2011-12-13 Eric J. Hall , Saharon Shelah

We give some connections between various functions defined on finitely presented groups (isoperimetric, isodiametric, Todd-Coxeter radius, filling length functions, etc.), and we study the relation between those functions and the…

Group Theory · Mathematics 2007-05-23 Jean-Camille Birget

Integrally convex functions constitute a fundamental function class in discrete convex analysis. This paper shows that an integer-valued integrally convex function admits an integral subgradient and that the integral biconjugate of an…

Combinatorics · Mathematics 2018-09-11 Kazuo Murota , Akihisa Tamura

In this note we show that no extension of bi-intuitionistic logic, except for classical logic, is structurally complete; indeed, none of them are passively structurally complete. A direct proof of active structural completeness is given for…

Logic · Mathematics 2025-08-11 Rodrigo Nicolau Almeida , Nick Bezhanishvili

The question of obtaining well-defined criteria for multiple criteria decision making problems is well-known. One of the approaches dealing with this question is the concept of nonessential objective function. A certain objective function…

Optimization and Control · Mathematics 2008-11-08 Agnieszka B. Malinowska , Delfim F. M. Torres

We show that certain determinantal functions of multiple matrices, when summed over the symmetries of the cube, decompose into functions of the original matrices. These are shown to be true in complete generality; that is, no properties of…

Combinatorics · Mathematics 2016-07-25 Adam W. Marcus

In this note we give answers to questions posed to us by J.Milnor and M.Shub, which shed further light on the structure of non-computable Julia sets.

Dynamical Systems · Mathematics 2007-05-23 Mark Braverman , Michael Yampolsky

The standard engineering approach to modelling of complex systems is highly compositional. In order to be able to understand (or to control) the behavior of a complex dynamical systems, it is often desirable, if not necessary, to view this…

Systems and Control · Computer Science 2013-07-01 Antoine Girard

Bent functions as optimal combinatorial objects are difficult to characterize and construct. In the literature, bent idempotents are a special class of bent functions and few constructions have been presented, which are restricted by the…

Information Theory · Computer Science 2015-08-25 Chunming Tang , Yanfeng Qi , Zhengchun Zhou , Cuiling Fan

Ali Enayat had asked whether two halves of Disjunctive Correctness (DC) for the compositional truth predicate are conservative over Peano Arithmetic. In this article, we show that the principle "every true disjunction has a true disjunct"…

Logic · Mathematics 2021-09-01 Cezary Cieśliński , Mateusz Łełyk , Bartosz Wcisło

A positive non-commutative (NC) measure is a positive linear functional on the free disk operator system which is generated by a $d$-tuple of non-commuting isometries. By introducing the hybrid forms, their Cauchy transforms, and techniques…

Operator Algebras · Mathematics 2024-02-16 Fouad Naderi

Let $\mathbb{N}$ be the set of all nonnegative integers. For $S\subseteq \mathbb{N}$ and $n\in \mathbb{N}$, let $R_S(n)$ denote the number of solutions of the equation $n=s+s'$, $s, s'\in S$, $s<s'$. In this paper, we determine the…

Number Theory · Mathematics 2023-12-29 Shi-Qiang Chen , Csaba Sándor , Quan-Hui Yang

The immune system is a complex biological system with a highly distributed, adaptive and self-organising nature. This paper presents an Artificial Immune System (AIS) that exploits some of these characteristics and is applied to the task of…

Neural and Evolutionary Computing · Computer Science 2010-07-05 Steve Cayzer , Uwe Aickelin

This paper concerns the long-standing question of representing (totally) anti-symmetric functions in high dimensions. We propose a new ansatz based on the composition of an odd function with a fixed set of anti-symmetric basis functions. We…

Classical Analysis and ODEs · Mathematics 2025-01-10 Ziang Chen , Jianfeng Lu

Let $N$ be a positive integer. We say a non-constant rational function $U(x)\in{\mathbb C}(x)$ is $N$-\emph{unital} if all the zeros and poles of both $U(x)$ and $1-U(x)$ are either 0 or $N$-th roots of unity. These functions are called…

Number Theory · Mathematics 2022-05-03 Jianqiang Zhao

This paper analyzes infinitary nondeterministic computability theory. The main result is D $\ne$ ND $\cap$ coND where D is the class of sets decidable by infinite time Turing machines and ND is the class of sets recognizable by a…

Logic · Mathematics 2023-12-27 Erin Carmody
‹ Prev 1 3 4 5 6 7 10 Next ›