PP-2001-01: Complexity of Intuitionistic Predicate Logic with One Variable

PP-2001-01: Marx, Maarten (2001) Complexity of Intuitionistic Predicate Logic with One Variable. [Report]

[img] Text (Full Text)
PP-2001-01.text.ps.gz

Download (63kB)
[img] Text (Abstract)
PP-2001-01.abstract.txt

Download (542B)

Abstract

The validity problem for intuitionistic predicate logic with one variable is complete for the class of co--nexptime problems. This result holds for both constant and for expanding domains. The upper bound follows because every refutable formula can be refuted in a Kripke model whose size is exponential in the length of the formula. The lower bound is obtained by an encoding of the square tiling problem. Keyword(s): Intuitionistic logic, complexity, nexptime

Item Type: Report
Report Nr: PP-2001-01
Series Name: Prepublication (PP) Series
Year: 2001
Date Deposited: 12 Oct 2016 14:36
Last Modified: 12 Oct 2016 14:36
URI: https://eprints.illc.uva.nl/id/eprint/43

Actions (login required)

View Item View Item