English
Related papers

Related papers: On variable non-dependence of first-order formulas

200 papers

In this thesis (modal) dependence logic is investigated. It was introduced in 2007 by Jouko V\"a\"aan\"anen as an extension of first-order (resp. modal) logic by the dependence operator =(). For first-order (resp. propositional) variables…

Logic in Computer Science · Computer Science 2012-06-21 Peter Lohmann

A first-order theory is equational if every definable set is a Boolean combination of instances of equations, that is, of formulae such that the family of finite intersections of instances has the descending chain condition. Equationality…

Logic · Mathematics 2020-09-21 Amador Martin-Pizarro , Martin Ziegler

We introduce a variation on Barthe et al.'s higher-order logic in which formulas are interpreted as predicates over open rather than closed objects. This way, concepts which have an intrinsically functional nature, like continuity,…

Logic in Computer Science · Computer Science 2022-11-22 Ugo Dal Lago , Francesco Gavazzo , Alexis Ghyselen

So far, one-factor copulas induce conditional independence with respect to a latent factor. In this paper, we extend one-factor copulas to conditionally dependent models. This is achieved through new representations which allow to build new…

Methodology · Statistics 2016-12-12 Nathan Uyttendaele , Gildas Mazo

Call a semantics for a language with variables absolute when variables map to fixed entities in the denotation. That is, a semantics is absolute when the denotation of a variable a is a copy of itself in the denotation. We give a trio of…

Logic in Computer Science · Computer Science 2026-04-20 Murdoch J. Gabbay

Conditional independence is a crucial concept supporting adequate modelling and efficient reasoning in probabilistics. In knowledge representation, the idea of conditional independence has also been introduced for specific formalisms, such…

Artificial Intelligence · Computer Science 2024-12-19 Jesse Heyninck

Monadic decomposability is a notion of variable independence, which asks whether a given formula in a first-order theory is expressible as a Boolean combination of monadic predicates in the theory. Recently, Veanes et al. showed the…

Logic in Computer Science · Computer Science 2020-04-28 Matthew Hague , Anthony Widjaja Lin , Philipp Rümmer , Zhilin Wu

We address the problem of complementing higher-order patterns without repetitions of existential variables. Differently from the first-order case, the complement of a pattern cannot, in general, be described by a pattern, or even by a…

Logic in Computer Science · Computer Science 2008-10-22 Alberto Momigliano , Frank Pfenning

We investigate operator-valued monotone independence, a noncommutative version of independence for conditional expectation. First we introduce operator-valued monotone cumulants to clarify the whole theory and show the moment-cumulant…

Operator Algebras · Mathematics 2014-09-09 Takahiro Hasebe , Hayato Saigo

Understanding and quantifying causal relationships between variables is essential for reasoning about the physical world. In this work, we develop a resource-theoretic framework to do so. Here, we focus on the simplest nontrivial setting --…

We show that the decidability of the first-order theory of the language that combines Boolean algebras of sets of uninterpreted elements with Presburger arithmetic operations. We thereby disprove a recent conjecture that this theory is…

Logic in Computer Science · Computer Science 2007-05-23 Viktor Kuncak , Martin Rinard

Certain causal models involving unmeasured variables induce no independence constraints among the observed variables but imply, nevertheless, inequality contraints on the observed distribution. This paper derives a general formula for such…

Artificial Intelligence · Computer Science 2013-02-21 Judea Pearl

By using the theory of first-order differential subordination for functions with fixed initial coefficient, several well-known results for subclasses of univalent functions are improved by restricting the functions to have fixed second…

Complex Variables · Mathematics 2012-08-02 Sumit Nagpal , V. Ravichandran

Finsler's lemma is a classic mathematical result with applications in control and optimization. When the lemma is applied to parameter-dependent LMIs, as such those that arise from problems of robust stability, the extra variables…

Optimization and Control · Mathematics 2017-11-15 João Y. Ishihara , Hugo T. M. Kussaba , Renato A. Borges

This paper aims to incorporate the notion of quantifier-free formulas modulo a first-order theory and the stratification of formulas by quantifier alternation depth modulo a first-order theory into the algebraic treatment of classical…

Logic · Mathematics 2025-03-13 Marco Abbadini , Francesca Guffanti

In this paper, we revisit the notion of partial copula, originally introduced to test conditional independence, highlighting its capability to represent the dependence between two random variables after removing their dependence with a…

Methodology · Statistics 2026-05-26 Vinícius Litvinoff Justus , Felipe Fontana Vieira

The so-called "free will axiom" is an essential ingredient in many discussions concerning hidden variables in quantum mechanics. In this paper we argue that "free will" can be defined in different ways. The definition usually employed is…

Quantum Physics · Physics 2007-05-23 Gerard 't Hooft

This paper examines the foundational concept of random variables in probability theory and statistical inference, demonstrating that their mathematical definition requires no reference to randomization or hypothetical repeated sampling. We…

Other Statistics · Statistics 2025-02-11 Paul W. Vos

We extend inner fluctuations to spectral triples that do not fulfill the first-order condition. This involves the addition of a quadratic term to the usual linear terms. We find a semi-group of inner fluctuations, which only depends on the…

Mathematical Physics · Physics 2013-12-02 Ali H. Chamseddine , Alain Connes , Walter D. van Suijlekom

The purpose of this paper is to give an easy to understand with step-by-step explanation to allow interested people to fully appreciate the power of natural deduction for first-order logic. Natural deduction as a proof system can be used to…

Logic in Computer Science · Computer Science 2021-08-16 Alrubyli , Yazeed
‹ Prev 1 3 4 5 6 7 10 Next ›