We discuss various conjectures and problems around the issue of when and whether stable formulas are responsible for forking in simple theories. We prove that if the simple theory T has strong stable forking then any complete type is a nonforking extension of a complete type which is axiomatized by instances of stable formulas. We also give another treatment of the first author's result which identifies canonical bases in supersimple theories.
The associativity of -dimensional copulas in the sense of Post is studied. These copulas are shown to be just -ary extensions of associative 2-dimensional copulas with special constraints, thus they solve an open problem of R. Mesiar posed during the International Conference FSTA 2010 in Liptovský Ján, Slovakia.
A tie-point of compact space is analogous to a cut-point: the complement of the point falls apart into two relatively clopen non-compact subsets. We review some of the many consistency results that have depended on the construction of tie-points of . One especially important application, due to Veličković, was to the existence of nontrivial involutions on . A tie-point of has been called symmetric if it is the unique fixed point of an involution. We define the notion of an almost clopen set...
Let r ∈ [0,1]. A set A ⊆ ω is said to be coarsely computable at density r if there is a computable function f such that {n | f(n) = A(n)} has lower density at least r. Our main results are that A is coarsely computable at density 1/2 if A is computably traceable or truth-table reducible to a 1-random set. In the other direction, we show that if a degree a is hyperimmune or PA, then there is an a-computable set which is not coarsely computable at any positive density.
A first order structure with universe M is atomic compact if every system of atomic formulas with parameters in M is satisfiable in provided each of its finite subsystems is. We consider atomic compactness for the class of reflexive (symmetric) graphs. In particular, we investigate the extent to which “sparse” graphs (i.e. graphs with “few” vertices of “high” degree) are compact with respect to systems of atomic formulas with “few” unknowns, on the one hand, and are pure restrictions of their...
We show some families of lattice effect algebras (a common generalization of orthomodular lattices and MV-effect algebras) each element E of which has atomic center C(E) or the subset S(E) of all sharp elements, resp. the center of compatibility B(E) or every block M of E. The atomicity of E or its sub-lattice effect algebras C(E), S(E), B(E) and blocks M of E is very useful equipment for the investigations of its algebraic and topological properties, the existence or smearing of states on E, questions...
This note is about functions ƒ : Aω → Bω whose graph is recognized by a Büchi finite automaton on the product alphabet A x B. These functions are Baire class 2 in the Baire hierarchy of Borel functions and it is decidable whether such function are continuous or not. In 1920 W. Sierpinski showed that a function is Baire class 1 if and only if both the overgraph and the undergraph of f are Fσ. We show that such characterization is also true for functions on infinite words if we replace the real...
New compact representations of infinite graphs are investigated. Finite automata are used to represent labelled hyper-graphs which can be also multi-graphs. Our approach consists of a general framework where vertices are represented by a regular prefix-free language and edges are represented by a regular language and a function over tuples. We consider three different functions over tuples: given a tuple the first function returns its first difference, the second one returns its suffix and the last...
New compact representations of infinite graphs are investigated. Finite automata are used to represent labelled hyper-graphs which can be also multi-graphs. Our approach consists of a general framework where vertices are represented by a regular prefix-free language and edges are represented by a regular language and a function over tuples. We consider three different functions over tuples: given a tuple the first function returns its first difference, the second one returns its suffix and...
It is very important to get the complete and timely information of urban road traffic incidents and then to make a reasonable strategy for police dispatching. By improving the efficiency of sending police, the loss of traffic incidents and the pressure of traffic police will be reduced greatly. An assistant decision model of police dispatching based on the information of automatic traffic incident detection is proposed in this paper. Firstly, an automatic traffic incident detection algorithm is...