An arithmetical completeness theorem for pre-permutations

Notre Dame Journal of Formal Logic 34 (1):84-89 (1992)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

1993

DOI

10.1305/ndjfl/1093634565

Links

PhilArchive



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

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

Arithmetical completeness versus relative completeness.Michal Grabowski - 1988 - Studia Logica 47 (3):213 - 220.
Interpretability over peano arithmetic.Claes Strannegård - 1999 - Journal of Symbolic Logic 64 (4):1407-1425.
Fuzzy logic and arithmetical hierarchy, II.Petr Hájek - 1997 - Studia Logica 58 (1):129-141.
Generic generalized Rosser fixed points.Dick H. J. Jongh & Franco Montagna - 1987 - Studia Logica 46 (2):193 - 203.
Syntactical results on the arithmetical completeness of modal logic.Paolo Gentilini - 1993 - Studia Logica 52 (4):549 - 564.
Proof-theoretic modal PA-Completeness III: The syntactic proof.Paolo Gentilini - 1999 - Studia Logica 63 (3):301-310.
Provability logics for natural Turing progressions of arithmetical theories.L. D. Beklemishev - 1991 - Studia Logica 50 (1):107 - 128.
Arithmetical interpretations of dynamic logic.Petr Hájek - 1983 - Journal of Symbolic Logic 48 (3):704-713.
On the proof of Solovay's theorem.Dick Jongh, Marc Jumelet & Franco Montagna - 1991 - Studia Logica 50 (1):51 - 69.
On the meaning of Hilbert's consistency problem (paris, 1900).Enrico Moriconi - 2003 - Synthese 137 (1-2):129 - 139.
Deductive completeness.Kosta Došen - 1996 - Bulletin of Symbolic Logic 2 (3):243-283.
Proof-theoretic modal PA-Completeness II: The syntactic countermodel.Paolo Gentilini - 1999 - Studia Logica 63 (2):245-268.
An analytic completeness theorem for logics with probability quantifiers.Douglas N. Hoover - 1987 - Journal of Symbolic Logic 52 (3):802-816.
A theorem on permutations in models.Lars Svenonius - 1959 - Theoria 25 (3):173-178.
Finite Kripke models and predicate logics of provability.Sergei Artemov & Giorgie Dzhaparidze - 1990 - Journal of Symbolic Logic 55 (3):1090-1098.

Analytics

Added to PP
2010-08-24

Downloads
18 (#781,713)

6 months
8 (#283,518)

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

No references found.

Add more references