An Herbrand theorem for prenex formulas of LJ

Notre Dame Journal of Formal Logic 17 (2):263-266 (1976)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

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

Similar books and articles

Algebraic aspects of deduction theorems.Janusz Czelakowski - 1985 - Studia Logica 44 (4):369 - 387.
Coinductive formulas and a many-sorted interpolation theorem.Ursula Gropp - 1988 - Journal of Symbolic Logic 53 (3):937-960.
On the no-counterexample interpretation.Ulrich Kohlenbach - 1999 - Journal of Symbolic Logic 64 (4):1491-1511.
Omitting types of prenex formulas.C. C. Chang - 1967 - Journal of Symbolic Logic 32 (1):61-74.
Reduction to first degree in quantificational S5.Michael J. Carroll - 1979 - Journal of Symbolic Logic 44 (2):207-214.
Interpretability over peano arithmetic.Claes Strannegård - 1999 - Journal of Symbolic Logic 64 (4):1407-1425.
The consistency of number theory via herbrand's theorem.T. M. Scanlon - 1973 - Journal of Symbolic Logic 38 (1):29-58.
Linear reasoning. A new form of the herbrand-Gentzen theorem.William Craig - 1957 - Journal of Symbolic Logic 22 (3):250-268.

Analytics

Added to PP
2010-08-24

Downloads
13 (#1,013,785)

6 months
2 (#1,240,909)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Epsilon theorems in intermediate logics.Matthias Baaz & Richard Zach - 2022 - Journal of Symbolic Logic 87 (2):682-720.

Add more citations

References found in this work

No references found.

Add more references