[Omnibus Review]

Journal of Symbolic Logic 56 (1):329-332 (1991)
  Copy   BIBTEX

Abstract

Reviewed Works:S. N. Artemov, B. M. Schein, Arithmetically Complete Modal Theories.S. N. Artemov, E. Mendelson, On Modal Logics Axiomatizing Provability.S.N. Artemov, E. Mendelson, Nonarithmeticity of Truth Prdicate Logics of Provability.V. A. Vardanyan, E. Mendelson, Arithmetic Complexity of Predicate Logics of Provability and Their.S. N. Artemov, E. Mendelson, Numerically Correct Provability Logics

Categories

Keywords

Reprint years

Links

PhilArchive



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

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

Analytics

Added to PP
2013-11-03

Downloads
12 (#996,020)

6 months
6 (#349,140)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Vann McGee
Massachusetts Institute of Technology

Citations of this work

Weak Rejection.Luca Incurvati & Julian J. Schlöder - 2017 - Australasian Journal of Philosophy 95 (4):741-760.
Tarskian and Kripkean truth.Volker Halbach - 1997 - Journal of Philosophical Logic 26 (1):69-80.
Some supervaluation-based consequence relations.Philip Kremer & Michael Kremer - 2003 - Journal of Philosophical Logic 32 (3):225-244.
Tarski hierarchies.Volker Halbach - 1995 - Erkenntnis 43 (3):339 - 367.
Tarski on “essentially richer” metalanguages.David DeVidi & Graham Solomon - 1999 - Journal of Philosophical Logic 28 (1):1-28.

View all 8 citations / Add more citations

References found in this work

No references found.

Add more references