Sciweavers

10997 search results - page 14 / 2200
» On the Structure of Complete Sets
Sort
View
IGPL
2010
120views more  IGPL 2010»
13 years 6 months ago
A complete axiom set for Hansson's deontic logic DSDL2
The main contribution of this paper is a (strong) completeness result for an axiomatization of Hansson [13]’s deontic system DSDL2, whose semantics involves a non-necessarily tr...
Xavier Parent
FS
2006
105views more  FS 2006»
13 years 7 months ago
Financial equilibria in the semimartingale setting: Complete markets and markets with withdrawal constraints
We prove existence of stochastic financial equilibria on filtered spaces more general than the ones generated by finite-dimensional Brownian motions. These equilibria span complete...
Gordan Zitkovic
IPL
2006
83views more  IPL 2006»
13 years 7 months ago
The Pair Completion algorithm for the Homogeneous Set Sandwich Problem
A homogeneous set is a non-trivial module of a graph, i.e. a nonempty, non-unitary, proper vertex subset such that all its elements present the same outer neighborhood. Given two ...
Claudson F. Bornstein, Celina M. Herrera de Figuei...
CSR
2009
Springer
13 years 11 months ago
Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes
In this paper we investigate the following two questions: Q1: Do there exist optimal proof systems for a given language L? Q2: Do there exist complete problems for a given promise ...
Olaf Beyersdorff, Zenon Sadowski
CORR
1999
Springer
65views Education» more  CORR 1999»
13 years 7 months ago
Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets
It is known that for any class C closed under union and intersection, the Boolean closure of C, the Boolean hierarchy over C, and the symmetric difference hierarchy over C all are ...
Lane A. Hemaspaandra, Jörg Rothe