Horčík and Terui [8] show that, if a substructural logic enjoys the disjunction property, then its tautology problem is PSPACE-hard. We prove that all substructural logics in the interval between intuitionistic logic and generalized Hájek basic logic have a PSPACE-hard tautology problem, which implies that uncountably many substructural logics lacking the disjunction property have a PSPACE-hard tautology problem
AbstractIn this paper we develop a connection between optimal propositional proof systems and struct...
It is the purpose of this note to show that the question of whether a given propositional formula is...
In this paper it is shown that PSPACE is equal to 4th level in the polynomial hierarchy. A lot of im...
Horčík and Terui [8] show that, if a substructural logic enjoys the disjunction property, then its t...
AbstractWe systematically identify a large class of substructural logics that satisfy the disjunctio...
Abstract. Assuming that the class Taut of tautologies of propositional logic has no almost optimal a...
Abstract. Assuming that the class TAUT of tautologies of propositional logic has no almost optimal a...
Finite model theory. Logical characterizations of polynomial space. Completeness via logical reducti...
AbstractThis paper considers the computational complexity of the disjunction and existential propert...
This paper considers the computational complexity of the disjunction and existential properties of i...
Abstract. If the class Taut of tautologies of propositional logic has no almost optimal algorithm, t...
AbstractWe prove that, for infinitely many disjunctive normal form propositional calculus tautologie...
We prove lower bounds of the form exp (n " d ) ; " d ? 0; on the length of proofs of an ...
The original publication is available at www.springerlink.com. The decision problem for provability ...
$\dot{\mathrm{W}}\mathrm{e} $ will introduce the notion of the glueing of algebras for substructural...
AbstractIn this paper we develop a connection between optimal propositional proof systems and struct...
It is the purpose of this note to show that the question of whether a given propositional formula is...
In this paper it is shown that PSPACE is equal to 4th level in the polynomial hierarchy. A lot of im...
Horčík and Terui [8] show that, if a substructural logic enjoys the disjunction property, then its t...
AbstractWe systematically identify a large class of substructural logics that satisfy the disjunctio...
Abstract. Assuming that the class Taut of tautologies of propositional logic has no almost optimal a...
Abstract. Assuming that the class TAUT of tautologies of propositional logic has no almost optimal a...
Finite model theory. Logical characterizations of polynomial space. Completeness via logical reducti...
AbstractThis paper considers the computational complexity of the disjunction and existential propert...
This paper considers the computational complexity of the disjunction and existential properties of i...
Abstract. If the class Taut of tautologies of propositional logic has no almost optimal algorithm, t...
AbstractWe prove that, for infinitely many disjunctive normal form propositional calculus tautologie...
We prove lower bounds of the form exp (n " d ) ; " d ? 0; on the length of proofs of an ...
The original publication is available at www.springerlink.com. The decision problem for provability ...
$\dot{\mathrm{W}}\mathrm{e} $ will introduce the notion of the glueing of algebras for substructural...
AbstractIn this paper we develop a connection between optimal propositional proof systems and struct...
It is the purpose of this note to show that the question of whether a given propositional formula is...
In this paper it is shown that PSPACE is equal to 4th level in the polynomial hierarchy. A lot of im...
DOI
Add to ORKG