A strong version of herbrand's theorem for introvert sentences

Journal of Symbolic Logic 63 (2):555-569 (1998)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2586849

Links

PhilArchive



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

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

The ω-consistency of number theory via herbrand's theorem.W. D. Goldfarb & T. M. Scanlon - 1974 - Journal of Symbolic Logic 39 (4):678-692.
Back to basics: Revisiting the incompleteness theorems.Peter Smith - unknown
Godel's theorem: A proof from the book?Peter Smith - unknown
First-order multi-modal deduction.Matthew Stone - unknown
A proofless proof of the Barwise compactness theorem.Mark Howard - 1988 - Journal of Symbolic Logic 53 (2):597-602.
The consistency of number theory via herbrand's theorem.T. M. Scanlon - 1973 - Journal of Symbolic Logic 38 (1):29-58.
Saturated models of universal theories.Jeremy Avigad - 2002 - Annals of Pure and Applied Logic 118 (3):219-234.
Herbrand's Theorem for a Modal Logic.Melvin Fitting - unknown

Analytics

Added to PP
2009-01-28

Downloads
51 (#308,357)

6 months
18 (#137,627)

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

Solvable Cases of the Decision Problem.[author unknown] - 1956 - Philosophy 31 (116):92-93.

Add more references