English
Related papers

Related papers: Interestingness a Unifying Paradigm Bipolar Functi…

200 papers

The paper has two main goals. The first is to take a new approach to rearrangements on certain classes of measurable real-valued functions on $\mathbb{R}^n$. Rearrangements are maps that are monotonic (up to sets of measure zero) and…

Metric Geometry · Mathematics 2022-02-15 Gabriele Bianchi , Richard J. Gardner , Paolo Gronchi , Markus Kiderlen

Uncertainty may be taken to characterize inferences, their conclusions, their premises or all three. Under some treatments of uncertainty, the inferences itself is never characterized by uncertainty. We explore both the significance of…

Artificial Intelligence · Computer Science 2013-02-18 Henry E. Kyburg

We develop a theory for describing composite objects in physics. These can be static objects, such as tables, or things that happen in spacetime (such as a region of spacetime with fields on it regarded as being composed of smaller such…

Quantum Physics · Physics 2013-03-20 Lucien Hardy

There exists a variety of physically interesting situations described by continuous maps that are nondifferentiable on some surface in phase space. Such systems exhibit novel types of bifurcations in which multiple coexisting attractors can…

chao-dyn · Physics 2009-10-31 Mitrajit Dutta , Helena E. Nusse , Edward Ott , James A. Yorke

Compositionality is a widely discussed property of natural languages, although its exact definition has been elusive. We focus on the proposal that compositionality can be assessed by measuring meaning-form correlation. We analyze…

Computation and Language · Computer Science 2020-12-08 Timothee Mickus , Timothée Bernard , Denis Paperno

As David Berlinski writes (1997), the existence and nature of mathematics is a more compelling and far deeper problem than any of the problems raised by mathematics itself. Here we analyze the essence of mathematics making the main emphasis…

History and Overview · Mathematics 2017-09-21 Mark Burgin

A common problem in various applications is the additive decomposition of the output of a function with respect to its input variables. Functions with binary arguments can be axiomatically decomposed by the famous Shapley value. For the…

Mathematical Finance · Quantitative Finance 2023-03-15 Marcus C Christiansen

Uniqueness quantification ($\exists !$) is a quantifier in first-order logic where one requires that exactly one element exists satisfying a given property. In this paper we investigate the strength of uniqueness quantification when it is…

Computational Complexity · Computer Science 2019-06-18 Victor Lagerkvist , Gustav Nordh

High-order phenomena play crucial roles in many systems of interest, but their analysis is often highly nontrivial. There is a rich literature providing a number of alternative information-theoretic quantities capturing high-order…

Information Theory · Computer Science 2024-10-15 Fernando E. Rosas , Aaron Gutknecht , Pedro A. M. Mediano , Michael Gastpar

The study of complex systems through the lens of category theory consistently proves to be a powerful approach. We propose that cognition deserves the same category-theoretic treatment. We show that by considering a highly-compact cognitive…

Neurons and Cognition · Quantitative Biology 2021-08-04 Sophie Alyx Taylor , Son Cao Tran , Dan V. Nicolau

Information is everywhere in nature which is very uncertain and unpredictable. But information, in itself, is a very ambiguous term. In this cursory write-up, we attempt to understand the formal meaning of information by quantifying…

Classical Physics · Physics 2024-09-20 Sagar Chakraborty

Stakeholders' expectations and technology constantly evolve during the lengthy development cycles of a large-scale computer based system. Consequently, the traditional approach of baselining requirements results in an unsatisfactory system…

Software Engineering · Computer Science 2016-11-18 Ramya Ravichandar , James D. Arthur , Robert P. Broadwater

The unity of mathematics has its power to compactify experiences in a form capable of being transferred and modified or adapted to new mathematical situations. Yet, we believe that the phrase "Unity of Mathematics" expresses a dream, an…

History and Overview · Mathematics 2013-12-10 Bernhelm Booss-Bavnbek , Philip J. Davis

We will study some important properties of Boolean functions based on newly introduced concepts called Special Decomposition of a Set and Special Covering of a Set. These concepts enable us to study important problems concerning Boolean…

Computational Complexity · Computer Science 2025-04-01 Stepan Margaryan

Translations between different nonmonotonic formalisms always have been an important topic in the field, in particular to understand the knowledge-representation capabilities those formalisms offer. We provide such an investigation in terms…

Artificial Intelligence · Computer Science 2014-01-17 Wolfgang Dvorak , Stefan Woltran

Web Service Composition deals with the (re)use of Web Services to provide complex functionality, inexistent in any single service. Over the state-of-the-art, we introduce a new type of modeling, based on ontologies and relations between…

Computation and Language · Computer Science 2019-09-11 Paul Diac , Liana Tucar , Radu Mereuta

The theory of partition congruences has been a fascinating and difficult subject for over a century now. In attempting to prove a given congruence family, multiple possible complications include the genus of the underlying modular curve,…

Number Theory · Mathematics 2022-11-22 Nicolas Allen Smoot

We introduce a notion of complexity of diagrams (and in particular of objects and morphisms) in an arbitrary category, as well as a notion of complexity of functors between categories equipped with complexity functions. We discuss several…

Category Theory · Mathematics 2020-07-01 Saugata Basu , M. Umut Isik

Recent years have witnessed a renewed interest in Boolean function in explaining binary classifiers in the field of explainable AI (XAI). The standard approach of Boolean function is propositional logic. We present a modal language of a…

Logic in Computer Science · Computer Science 2023-07-11 Xinghan Liu , Emiliano Lorini

We demonstrate in theory and experiment the strict equivalence between nonclassical polarization and the entanglement of indistinguishable photons, thereby unifying these two phenomena that appear dissimilar at first sight. This allows us…