Sciweavers

APAL
2008
80views more  APAL 2008»
13 years 4 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
92views more  APAL 2008»
13 years 4 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
APAL
2008
87views more  APAL 2008»
13 years 4 months ago
Characterising nested database dependencies by fragments of propositional logic
We extend the earlier results on the equivalence between the Boolean and the multivalued dependencies in relational databases and fragments of the Boolean propositional logic. It ...
Sven Hartmann, Sebastian Link
APAL
2008
69views more  APAL 2008»
13 years 4 months ago
Lowness properties and approximations of the jump
We study and compare two combinatorial lowness notions: strong jump-traceability and well-approximability of the jump, by strengthening the notion of jump-traceability and super-l...
Santiago Figueira, André Nies, Frank Stepha...
APAL
2008
80views more  APAL 2008»
13 years 4 months ago
A quantified logic of evidence
A propositional logic of explicit proofs, LP, was introduced in [2], completing a project begun long ago by G
Melvin Fitting
APAL
2008
111views more  APAL 2008»
13 years 4 months ago
Cut elimination for a simple formulation of epsilon calculus
A simple cut elimination proof for arithmetic with epsilon symbol is used to establish termination of a modified epsilon substitution process. This opens a possibility of extensio...
Grigori Mints
APAL
2008
104views more  APAL 2008»
13 years 4 months ago
Infinite trace equivalence
We solve a longstanding problem by providing a denotational model for nondeterministic programs that identifies two programs iff they have the same range of possible behaviours. W...
Paul Blain Levy
APAL
2008
62views more  APAL 2008»
13 years 4 months ago
Superrosy dependent groups having finitely satisfiable generics
We develop a basic theory of rosy groups and we study groups of small U
Clifton Ealy, Krzysztof Krupinski, Anand Pillay
APAL
2008
61views more  APAL 2008»
13 years 4 months ago
Second-order type isomorphisms through game semantics
The characterization of second-order type isomorphisms is a purely syntactical problem that we propose to study under the enlightenment of game semantics. We study this question i...
Joachim De Lataillade
APAL
2008
81views more  APAL 2008»
13 years 4 months ago
A remark on equivalent Rosser sentences
An oversight in Guaspari and Solovay's "Rosser sentences" (1979, Ann. Math. Log., 16, 81) is pointed out and emended. It concerns the premisses of their proof that ...
Christopher von Bülow