Sciweavers

40 search results - page 7 / 8
» apal 2008
Sort
View
APAL
2008
84views more  APAL 2008»
13 years 5 months ago
Resolution over linear equations and multilinear proofs
We develop and study the complexity of propositional proof systems of varying strength extending resolution by allowing it to operate with disjunctions of linear equations instead ...
Ran Raz, Iddo Tzameret
APAL
2008
80views more  APAL 2008»
13 years 5 months ago
System BV is NP-complete
System BV is an extension of multiplicative linear logic (MLL) with the rules mix, nullary mix, and a self-dual, non-commutative logical operator, called seq. While the rules mix ...
Ozan Kahramanogullari
APAL
2008
83views more  APAL 2008»
13 years 5 months ago
Easton's theorem and large cardinals
The continuum function F on regular cardinals is known to have great freedom; if , are regular cardinals, then F needs only obey the following two restrictions: (1) cf(F()) > ...
Sy D. Friedman, Radek Honzik
APAL
2008
102views more  APAL 2008»
13 years 5 months ago
Partial automorphism semigroups
Abstract. We study the relationship between algebraic structures and their inverse semigroups of partial automorphisms. We consider a variety of classes of natural structures inclu...
Jennifer Chubb, Valentina S. Harizanov, Andrei S. ...
APAL
2008
92views more  APAL 2008»
13 years 5 months ago
The complexity of random ordered structures
We show that for random bit strings, Up(n), with probability, p = 1 2 , the firstorder quantifier depth D(Up(n)) needed to distinguish non-isomorphic structures is (lg lg n), with...
Joel H. Spencer, Katherine St. John