Sciweavers

3928 search results - page 75 / 786
» order 2006
Sort
View
ECCC
2006
41views more  ECCC 2006»
15 years 4 months ago
On a syntactic approximation to logics that capture complexity classes
We formulate a formal syntax of approximate formulas for the logic with counting quantifiers, SOLP, studied by us in [1], where we showed the following facts: (i) In the presence ...
Argimiro Arratia, Carlos E. Ortiz
QEST
2006
IEEE
15 years 10 months ago
Bound-Preserving Composition for Markov Reward Models
Stochastic orders can be applied to Markov reward models and used to aggregate models, while introducing a bounded error. Aggregation reduces the number of states in a model, miti...
David Daly, Peter Buchholz, William H. Sanders
DCC
2006
IEEE
16 years 3 months ago
Evaluation codes and plane valuations
Abstract. We apply tools coming from singularity theory, as Hamburger-Noether expansions, and from valuation theory, as generating sequences, to explicitly describe order functions...
C. Galindo, M. Sanchis
132
Voted
JSYML
2006
98views more  JSYML 2006»
15 years 4 months ago
On weak and strong interpolation in algebraic logics
We show that there is a restriction, or modification of the finite-variable fragments of First Order Logic in which a weak form of Craig's Interpolation Theorem holds but a s...
Saharon Shelah, Gábor Sági
127
Voted
JCT
2010
65views more  JCT 2010»
15 years 2 months ago
Multiple cross-intersecting families of signed sets
A k-signed r-set on [n] = {1, ..., n} is an ordered pair (A, f), where A is an rsubset of [n] and f is a function from A to [k]. Families A1, ..., Ap are said to be cross-intersec...
Peter Borg, Imre Leader