English
Related papers

Related papers: RCF4: Inconsistent Quantification

200 papers

In this paper we establish a link between fuzzy and preferential semantics for description logics and Self-Organising Maps, which have been proposed as possible candidates to explain the psychological mechanisms underlying category…

Artificial Intelligence · Computer Science 2022-02-07 Laura Giordano , Valentina Gliozzi , Daniele Theseider Dupré

Previous comparisons of ordinary least squares with Newey-West standard errors (OLS-NW) and Prais-Winsten (PW) regression in multiple-group interrupted time series analysis have been limited to first-order autoregressive (AR[1]) errors…

Applications · Statistics 2026-05-26 Ariel Linden

We prove that there exists a nonprincipal ultrafilter $\mathcal U$ on $\mathbb N$ such that for every countable (or separable) structure $B$ in a countable language the quotient map from the reduced product associated with the Fr\'echet…

Logic · Mathematics 2021-04-20 Ilijas Farah

We address the decision problem for a fragment of real analysis involving differentiable functions with continuous first derivatives. The proposed theory, besides the operators of Tarski's theory of reals, includes predicates for…

Logic in Computer Science · Computer Science 2025-06-16 Domenico Cantone , Gianluca Cincotti

We show that restricting the elimination principle of the natural numbers type in Martin-L\"of Type Theory (MLTT) to a universe of types not containing $\Pi$-types ensures that all definable functions are primitive recursive. This extends…

Logic · Mathematics 2024-04-02 Ulrik Buchholtz , Johannes Schipp von Branitz

Concerning classical computational models able to express all the Primitive Recursive Functions (PRF), there are interesting results regarding limits on their algorithmic expressiveness or, equivalently, efficiency, namely the ability to…

Programming Languages · Computer Science 2024-03-01 Matteo Palazzo , Luca Roversi

We discuss conserved currents and operator product expansions (OPE's) in the context of a $O(N)$ invariant conformal field theory. Using OPE's we find explicit expressions for the first few terms in suitable short-distance limits for…

High Energy Physics - Theory · Physics 2014-11-18 Anastasios Petkou

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.…

Logic in Computer Science · Computer Science 2023-06-22 Arnon Avron , Liron Cohen

In order to compute the Schmidt decomposition of $A\in M_k\otimes M_m$, we must consider an associated self-adjoint map. Here, we show that if $A$ is positive under partial transposition (PPT) or symmetric with positive coefficients (SPC)…

Mathematical Physics · Physics 2016-11-15 Daniel Cariello

In this paper, we introduce a syntactic framework for analyzing and handling inconsistencies in propositional bases. Our approach focuses on examining the relationships between variable occurrences within conflicts. We propose two dual…

Artificial Intelligence · Computer Science 2024-12-18 Yakoub Salhi

We introduce a framework for pulling back Cartier modules and their associated invariants along regular $F$-finite morphisms. To achieve this, we construct a relative Cartier isomorphism and operator for an arbitrary regular $F$-finite map…

Algebraic Geometry · Mathematics 2026-04-27 Javier Carvajal-Rojas , Axel Stäbler

We show that when certain statements are provable in subsystems of constructive analysis using intuitionistic predicate calculus, related sequential statements are provable in weak classical subsystems. In particular, if a $\Pi^1_2$…

Logic · Mathematics 2012-01-25 Jeffry L. Hirst , Carl Mummert

Otto's Theorem characterises the bisimulation-invariant PTIME queries over graphs as exactly those that can be formulated in the polyadic mu-calculus, hinging on the Immerman-Vardi Theorem which characterises PTIME (over ordered structures)…

Logic in Computer Science · Computer Science 2022-09-22 Florian Bruse , David Kronenberger , Martin Lange

In a recent paper [Chaos 30, 073139 (2020)] we analyzed an extension of the Winfree model with nonlinear interactions. The nonlinear coupling function Q was mistakenly identified with the non-infinitesimal phase-response curve (PRC). Here,…

Adaptation and Self-Organizing Systems · Physics 2021-01-13 Diego Pazó , Rafael Gallego

This paper introduces an elliptic quasi-variational inequality (QVI) problem class with fractional diffusion of order $s \in (0,1)$, studies existence and uniqueness of solutions and develops a solution algorithm. As the fractional…

Optimization and Control · Mathematics 2017-12-20 Harbir Antil , Carlos N. Rautenberg

Martin-L\"of's Intuitionistic Theory of Types is becoming popular for formal reasoning about computer programs. To handle recursion schemes other than primitive recursion, a theory of well-founded relations is presented. Using primitive…

Logic in Computer Science · Computer Science 2008-02-03 Lawrence C. Paulson

This paper studies the limits of recursive classifications in proof theory and program extraction, using the refined $A$-translation as a central example. The refined $A$-translation, due to Berger, Buchholz, and Schwichtenberg, is based on…

Logic · Mathematics 2026-05-25 Franziskus Wiesnet

The quasi-variational inequalities play a significant role in analyzing a wide range of real-world problems. However, these problems are more complicated to solve than variational inequalities as the constraint set is based on the current…

Optimization and Control · Mathematics 2024-07-29 Asrifa Sultana , Shivani Valecha

One major open conjecture in the area of critical random graphs, formulated by statistical physicists, and supported by a large amount of numerical evidence over the last decade [23, 24, 28, 63] is as follows: for a wide array of random…

Probability · Mathematics 2017-01-17 Shankar Bhamidi , Remco van der Hofstad , Sanchayan Sen

We derive a novel formula for the derivative of operator product expansion (OPE) coefficients with respect to a coupling constant. The formula only involves the OPE coefficients themselves, and no further input, and is in this sense…

Mathematical Physics · Physics 2015-06-18 J. Holland , S. Hollands