We use exact saturation to study the complexity of unstable theories, showing that a variant this notion called pseudo-elementary class (PC)-exact meaningfully reflects combinatorial dividing lines. PC-exact for stable and simple theories. Among other results, we show characterizes stability cardinals size at least continuum countable theory and, additionally, theories have singular satisfying ...

We study integrable realizations of conformal twisted boundary conditions for sl(2) unitary minimal models on a torus. These conformal field theories are realized as the continuum scaling limit of critical G = A,D,E lattice models with positive spectral parameter u > 0 and Coxeter number g. Integrable seams are constructed by fusing blocks of elementary local face weights. The usual A-type fusi...

It's not my default: The complexity of membership problems in restricted propositional default logics. In AAAI-90: Proceedings of the 8th national conference on artiicial intelligence, Figure 4: Interaction graph for the theory presented in example 4.6 when the constraint graph is a tree, satissability can be determined in linear time. In Ben-Eliyahu and Dechter, 1991a] we have demonstrated the...

BACKGROUND Group field theory is an emerging field at the boundary between Quantum Gravity, Statistical Mechanics and Quantum Field Theory and provides a path integral for the gluing of n-simplices. Colored group field theory has been introduced in order to improve the renormalizability of the theory and associates colors to the faces of the simplices. The theory of crystallizations is instead ...

This paper considers theories of bounded arithmetic which are predicative in the sense of Nelson, that is, theories which are interpretable in Robinson’s Q . We give a nearly exact characterization of functions which can be total in predicative bounded theories. As an upper bound, any such function has polynomial growth rate and its bit-graph is in nondeterministic exponential time and in co-no...

We use graphical models to explore the question of how people learn simple causal relationships from data. The two leading psychological theories can both be seen as estimating the parameters of a fixed graph. We argue that a complete account of causal induction should also consider how people learn the underlying causal graph structure, and we propose to model this inductive process as a Bayes...

Transformations of graphlike expressions are called correct if they preserve a given functional semantics of the expressions. Combining the algebraic theories of graph grammars (cf. [lo]) and programming language semantics (cf. [l]) it will be proved that the correctness of transformation rules carries over to the correctness of derivations via such rules. Applying this result to LISP we show t...

The graph theoretic problem of identifying the finite sets C of constraint graphs for which there is a countable universal C-free graph is closely related to the problem of determining for which sets C the model companion T ∗ C of the theory of C-free graphs is א0-categorical, and this leads back to combinatorics. Little is known about these theories from any other perspective, such as stabilit...

In recent breakthrough results, Saxton–Thomason and Balogh–Morris–Samotij have developed powerful theories of hypergraph containers. These theories have led to a large number of new results on transference, and on counting and characterising typical graphs in hereditary properties. In a different direction, Hatami–Janson–Szegedy proved results on the entropy of graph limits which enable us to c...

The fact that the properties of a molecule are tightly connected to its structural  characteristics  is one of the fundamental concepts in chemistry. In this connection,  graph theory has been successfully applied in developing some relationships between topological indices and some thermodynamic properties. So ,  a novel method for computing the new descriptors to construct a quantitative rela...