Notre Dame Journal of Formal Logic 51 (3):351-360 (2010)

Authors
Alexander Paseau
Oxford University
Abstract
Pure second-order logic is second-order logic without functional or first-order variables. In "Pure Second-Order Logic," Denyer shows that pure second-order logic is compact and that its notion of logical truth is decidable. However, his argument does not extend to pure second-order logic with second-order identity. We give a more general argument, based on elimination of quantifiers, which shows that any formula of pure second-order logic with second-order identity is equivalent to a member of a circumscribed class of formulas. As a corollary, pure second-order logic with second-order identity is compact, its notion of logical truth is decidable, and it satisfies a pure second-order analogue of model completeness. We end by mentioning an extension to n th-order pure logics
Keywords second-order logic   nth-order logic   elimination of quantifiers   compactness   decidability of validity   model completeness
Categories (categorize this paper)
DOI 10.1215/00294527-2010-021
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 64,261
Through your library

References found in this work BETA

Pure Second-Order Logic.Nicholas Denyer - 1992 - Notre Dame Journal of Formal Logic 33 (2):220-224.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Analytics

Added to PP index
2010-08-19

Total views
89 ( #122,533 of 2,455,847 )

Recent downloads (6 months)
2 ( #303,332 of 2,455,847 )

How can I increase my downloads?

Downloads

My notes