English
Related papers

Related papers: The Nuisance Principle in Infinite Settings

200 papers

Argumentation is a promising model for reasoning with uncertain knowledge. The key concept of acceptability enables to differentiate arguments and counterarguments: The certainty of a proposition can then be evaluated through the most…

Artificial Intelligence · Computer Science 2013-02-01 Leila Amgoud , Claudette Cayrol

Two statements by von Neumann and a thought-experiment by Peres prompts a discussion on the notions of one-shot distinguishability, orthogonality, semi-permeable diaphragm, and their thermodynamic implications. In the first part of the…

Quantum Physics · Physics 2007-05-23 P. G. L. Mana , A. Maansson , G. Bjoerk

We examine the unitarity issue in the recently proposed time-ordered perturbation theory on noncommutative (NC) spacetime. We show that unitarity is preserved as long as the interaction Lagrangian is explicitly Hermitian. We explain why it…

High Energy Physics - Theory · Physics 2008-11-26 Yi Liao , Klaus Sibold

This paper talks about difference between P and NP by using topological space that mean resolution principle. I pay attention to restrictions of antecedent and consequent in resolution, and show what kind of influence the restrictions have…

Computational Complexity · Computer Science 2012-10-16 Koji Kobayashi

This paper is a sequel to [1] and considers definability in differential-henselian monotone fields with c-map and angular component map. We prove an Equivalence Theorem among whose consequences are a relative quantifier reduction and an NIP…

Logic · Mathematics 2018-06-11 Tigran Hakobyan

This article proposes a reading of quantum metaphysical indeterminacy from the perspective of Parsons' Nuclear Meinongianism. In doing so, we identify a fundamental incompatibility between a key feature of Parsons' theory and standard…

Quantum Physics · Physics 2025-10-22 Raoni Arroyo , Renato Semaniuc Valvassori

Hybrid logic with binders is an expressive specification language. Its satisfiability problem is undecidable in general. If frames are restricted to N or general linear orders, then satisfiability is known to be decidable, but of…

Computational Complexity · Computer Science 2012-06-13 Stefan Göller , Arne Meier , Martin Mundhenk , Thomas Schneider , Michael Thomas , Felix Weiss

We define the adjacent fragment AF of first-order logic, obtained by restricting the sequences of variables occurring as arguments in atomic formulas. The adjacent fragment generalizes (after a routine renaming) two-variable logic as well…

Logic in Computer Science · Computer Science 2023-06-19 Bartosz Bednarczyk , Daumantas Kojelis , Ian Pratt-Hartmann

We study the two dual notions of prime avoidance and prime absorbance. We generalize the classical prime avoidance lemma to radical ideals. A number of new criteria are provided for an abstract ring to be C.P. (every set of primes satisfies…

Commutative Algebra · Mathematics 2020-06-23 Abolfazl Tarizadeh , Justin Chen

The Guarded Fragment (GF) is a well-established decidable fragment of first-order logic. We study an extension of GF with nested equivalence relations, namely a family of distinguished binary predicates $E_1, E_2, \dots$ interpreted as…

Logic in Computer Science · Computer Science 2026-05-15 Oskar Fiuk

Many recent writers in the philosophy of mathematics have put great weight on the relative categoricity of the traditional axiomatizations of our foundational theories of arithmetic and set theory (\cite{Parsons1990a}, \cite{Parsons2008}…

Logic · Mathematics 2015-09-02 Sean Walsh , Sean Ebels-Duggan

An apparent contradiction in the leading order correction to noncommutative (NC) gravity reported in the literature has been pointed out. We show by direct computation that actually there is no such controvarsy and all perturbative NC…

High Energy Physics - Theory · Physics 2009-11-11 Pradip Mukherjee , Anirban Saha

Supervised machine learning models often associate irrelevant nuisance factors with the prediction target, which hurts generalization. We propose a framework for training robust neural networks that induces invariance to nuisances through…

Machine Learning · Computer Science 2019-12-03 Ayush Jaiswal , Rob Brekelmans , Daniel Moyer , Greg Ver Steeg , Wael AbdAlmageed , Premkumar Natarajan

The paper aims at emphasizing that, even relaxed, the hypothesis of compositionality has to face many problems when used for interpreting natural language texts. Rather than fixing these problems within the compositional framework, we…

Computation and Language · Computer Science 2007-05-23 Françoise Gayral , Daniel Kayser , François Lévy

Quantum coherence, the physical property underlying fundamental phenomena such as multi-particle interference and entanglement, has emerged as a valuable resource upon which modern technologies are founded. In general, the most prominent…

Under Wigdersons' framework and by sorting out the technical points in the recent works of Tang (J. Fourier Anal. Appl. 31 (2025)) and Dias-Luef-Prata (J. Math. Pures Appl. (9) 198 (2025)), we prove an abstract uncertainty principle for…

Analysis of PDEs · Mathematics 2025-06-19 Tianxiao Huang , Ze Li , Jiani Liu

In this note we solve a general statistical inverse problem under absence of knowledge of both the noise level and the noise distribution via application of the (modified) heuristic discrepancy principle. Hereby the unbounded (non-Gaussian)…

Numerical Analysis · Mathematics 2023-01-12 Tim Jahn

There have been many attempts to solve the P versus NP problem. However, with a new proof method, P not equal NP can be proved. A time limit is set for an arbitrary Turing machine and an input word is rejected on a timeout. The time limit…

Computational Complexity · Computer Science 2022-01-12 Reiner Czerwinski

This paper reports a modified axiomatic foundation of the analytic hierarchy process (AHP), where the reciprocal property of paired comparisons is broken. The novel concept of reciprocal symmetry breaking is proposed to characterize the…

Information Theory · Computer Science 2021-08-05 Fang Liu , Wei-Guo Zhang

In an incoherent dictionary, most signals that admit a sparse representation admit a unique sparse representation. In other words, there is no way to express the signal without using strictly more atoms. This work demonstrates that sparse…

Information Theory · Computer Science 2016-11-18 Joel A. Tropp