PP-2006-32: Henkin quantifiers: logic, games, and computation

PP-2006-32: Sevenster, Merlijn (2006) Henkin quantifiers: logic, games, and computation. [Report]

[img]
Preview
Text (Full Text)
PP-2006-32.text.pdf

Download (153kB) | Preview
[img] Text (Abstract)
PP-2006-32.abstract.txt

Download (711B)

Abstract

In this paper, we study the game-theoretic and computational repercussions of Henkins partially ordered quantifiers. After defining a gametheoretic semantics for these objects, we observe that tuning the parameter of absentmindedness gives rise to quantifier prefixes studied. In the interest of computation, we characterize the complexity class P_{||}^{NP} in terms of partially ordered quantifiers, by means of a proof different from Gottlob's. We conclude with some research questions at the interface of logic, game theory, and complexity theory.

Item Type: Report
Report Nr: PP-2006-32
Series Name: Prepublication (PP) Series
Year: 2006
Uncontrolled Keywords: Henkin quantifier; game-theoretic semantics; descriptive complexity
Date Deposited: 12 Oct 2016 14:36
Last Modified: 12 Oct 2016 14:36
URI: https://eprints.illc.uva.nl/id/eprint/207

Actions (login required)

View Item View Item