Related papers: Independence Logic and Abstract Independence Relat…

We investigate different aspects of independence here, in the context of theory revision, generalizing slightly work by Chopra, Parikh, and Rodrigues, and in the context of preferential reasoning.

We address the relative expressiveness of defeasible logics in the framework DL. Relative expressiveness is formulated as the ability to simulate the reasoning of one logic within another logic. We show that such simulations must be…

We undertake a local analysis of combinatorial independence as it connects to topological entropy within the framework of actions of sofic groups.

We generalise the Blok-J\'onsson account of structural consequence relations, later developed by Galatos, Tsinakis and other authors, in such a way as to naturally accommodate multiset consequence. While Blok and J\'onsson admit, in place…

Coalition Logic is an important logic in logical studies of strategic reasoning, whose models are concurrent game models. In this paper, first, we systematically discuss three assumptions of concurrent game models and argue that they are…

Two linearly uncorrelated binary variables must be also independent because non-linear dependence cannot manifest with only two possible states. This inherent linearity is the atom of dependency constituting any complex form of…

Boney and Grossberg [BG] proved that every nice AEC has an independence relation. We prove that this relation is unique: In any given AEC, there can exist at most one independence relation that satisfies existence, extension, uniqueness and…

We construct a complex entire function with arbitrary number of variables which has the following property: The infinite set consisting of all the values of all its partial derivatives of any orders at all algebraic points, including zero…

We define and study a metric independence notion in a homogeneous metric abstract elementary class with perturbations that is $d^p$-superstable (superstable wrt. the perturbation topology), weakly simple and has complete type spaces and we…

Abstraction logic is a new logic, serving as a foundation of mathematics. It combines features of both predicate logic and higher-order logic: abstraction logic can be viewed both as higher-order logic minus static types as well as…

The use of effective field theory offers a systematic way to improve calculations of nuclear reactions and the properties of atomic nuclei. Its successes have led to the widespread belief that the predictions of this approach are model…

An overview on various results concerning the Dirac-Fock model, the various variational characterization of its solutions and its nonrelativistic limit. A notion of ground state for this totally unbounded is also defined.

This paper obtains a completeness result for inequational reasoning with applicative terms without variables in a setting where the intended semantic models are the full structures, the full type hierarchies over preorders for the base…

This article presents a formal model demonstrating that genuine autonomy, the ability of a system to self-regulate and pursue objectives, fundamentally implies computational unpredictability from an external perspective. we establish…

Independent component analysis provides a principled framework for unsupervised representation learning, with solid theory on the identifiability of the latent code that generated the data, given only observations of mixtures thereof.…

Separation logic is a recent extension of Hoare logic for reasoning about programs with references to shared mutable data structures. In this paper, we provide a new interpretation of the logic for a programming language with higher types.…

We define a model of predicate logic in which every term and predicate, open or closed, has an absolute denotation independently of a valuation of the variables. For each variable a, the domain of the model contains an element [[a]] which…

We initiate the study of the complexity-theoretic properties of convex logics in team semantics. We focus on the extension of classical propositional logic with the nonemptiness atom NE, a logic known to be both convex and union closed. We…

This paper introduces the notions of independence and conditional independence in valuation-based systems (VBS). VBS is an axiomatic framework capable of representing many different uncertainty calculi. We define independence and…

In partial answer to a question posed by Arnie Miller (http://www.math.wisc.edu/~miller/res/problem.pdf) and X. Caicedo, we obtain sufficient conditions for an L_{omega_1,omega} theory to have an independent axiomatization. As a consequence…