The ground-negative fragment of first-order logic is πp2-complete

Journal of Symbolic Logic 64 (3):984 - 990 (1999)
  Copy   BIBTEX

Abstract

We prove that for a natural class of first-order formulas the validity problem is Π p 2 -complete

Categories

Keywords

Reprint years

DOI

10.2307/2586615

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Propositions as [Types].Steve Awodey & Andrej Bauer - unknown
Fragments of language.Ian Pratt-Hartmann - 2004 - Journal of Logic, Language and Information 13 (2):207-223.
An operational logic of proofs with positive and negative information.Duccio Luchi & Franco Montagna - 1999 - Studia Logica 63 (1):7-25.
On the restraining power of guards.Erich Grädel - 1999 - Journal of Symbolic Logic 64 (4):1719-1742.
Undecidability and intuitionistic incompleteness.D. C. McCarty - 1996 - Journal of Philosophical Logic 25 (5):559 - 565.
Linguistic applications of first order intuitionistic linear logic.Richard Moot & Mario Piazza - 2001 - Journal of Logic, Language and Information 10 (2):211-232.
The undecidability of second order linear logic without exponentials.Yves Lafont - 1996 - Journal of Symbolic Logic 61 (2):541-548.
Topological completeness for higher-order logic.S. Awodey & C. Butz - 2000 - Journal of Symbolic Logic 65 (3):1168-1182.
An Event-Based Fragment of First-Order Logic over Intervals.Savas Konur - 2011 - Journal of Logic, Language and Information 20 (1):49-68.

Analytics

Added to PP
2009-01-28

Downloads
398 (#48,205)

6 months
14 (#170,561)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Add more references