Related papers: Dependent first order theories, continued
We presents an independence relation on sets, one can define dimension by it, assuming that we have an abstract elementary class with a forking notion that satisfies the axioms of a good frame minus stability.
A forcing extension may create new isomorphisms between two models of a first order theory. Certain model theoretic constraints on the theory and other constraints on the forcing can prevent this pathology. A countable first order theory is…
Dependency grammar is usually interpreted as equivalent to a strict form of X--bar theory that forbids the stacking of nodes of the same bar level (e.g., N' immediately dominating N' with the same head). But adequate accounts of…
Causality has been often confused with the notion of determinism. It is mandatory to separate the two notions in view of the debate about quantum foundations. Quantum theory provides an example of causal not-deterministic theory. Here we…
We give conditions on a finite set of series of rational numbers to ensure that they are algebraically independent. Specialising our results to polynomials of lower degree, we also obtain new results on irrationality and $mathbb{Q}$-linear…
Many forms of dependence manifest themselves over time, with behavior of variables in dynamical systems as a paradigmatic example. This paper studies temporal dependence in dynamical systems from a logical perspective, by enriching a…
Subobject independence as morphism co-possibility has recently been defined in [2] and studied in the context of algebraic quantum field theory. This notion of independence is handy when it comes to systems coming from physics, but when…
We to a large extent sort out when does a (first order complete theory) T have a superlimit model in a cardinal lambda . Also we deal with relation notions of being limit.
Causal Models are like Dependency Graphs and Belief Nets in that they provide a structure and a set of assumptions from which a joint distribution can, in principle, be computed. Unlike Dependency Graphs, Causal Models are models of…
A first-order theory is Noetherian with respect to the collection of formulae $\mathcal{F}$ if every definable set is a Boolean combination of instances of formulae in $\mathcal{F}$ and the topology whose subbasis of closed sets is the…
We present a combination of raising, explicit variable dependency representation, the liberalized delta-rule, and preservation of solutions for first-order deductive theorem proving. Our main motivation is to provide the foundation for our…
We present two linked theorems on passivity: the passive behavior theorem, parts 1 and 2. Part 1 provides necessary and sufficient conditions for a general linear system, described by a set of high order differential equations, to be…
Conceptual dependencies (CDs) are particular kinds of key dependencies (KDs) and inclusion dependencies (IDs) that precisely characterize relational schemata modeled according to the main features of the Entity-Relationship (ER) model. An…
Semiring semantics for first-order logic provides a way to trace how facts represented by a model are used to deduce satisfaction of a formula. Team semantics is a framework for studying logics of dependence and independence in diverse…
First order formulas in a relational signature can be considered as operations on the relations of an underlying set, giving rise to multisorted algebras we call first order algebras. We present universal axioms so that an algebra satisfies…
We propose and axiomatize preferences on a product state space in light of uncertainty regarding the dependency of different payoff-relevant factors. Dependence structures allow to decompose probabilities and allow to pin down behavior…
Measuring the statistical dependence between observed signals is a primary tool for scientific discovery. However, biological systems often exhibit complex non-linear interactions that currently cannot be captured without a priori knowledge…
To render a sequence testable, namely capable of identifying and detecting errors, it is necessary to apply a transformation that increases its length by introducing statistical dependence among symbols, as commonly exemplified by the…
Bayesian networks provide a powerful tool for reasoning about probabilistic causation, used in many areas of science. They are, however, intrinsically classical. In particular, Bayesian networks naturally yield the Bell inequalities.…
Team Semantics generalizes Tarski's Semantics for First Order Logic by allowing formulas to be satisfied or not satisfied by sets of assignments rather than by single assignments. Because of this, in Team Semantics it is possible to extend…