Satisfaction Classes and Combinatorial Sentences Independent From PA

Mathematical Logic Quarterly 28 (8‐12):149-165 (1982)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19820280804

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

Analytics

Added to PP
2013-11-04

Downloads
13 (#1,020,434)

6 months
4 (#790,778)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Subsystems of true arithmetic and hierarchies of functions.Z. Ratajczyk - 1993 - Annals of Pure and Applied Logic 64 (2):95-152.
Inductive Full Satisfaction Classes.Henryk Kotlarski & Zygmunt Ratajczyk - 1990 - Annals of Pure and Applied Logic 47 (1):199--223.
The Contribution of Zygmunt Ratajczyk to the Foundations of Arithmetic.Roman Murawski - 1995 - Notre Dame Journal of Formal Logic 36 (4):502-504.
Inductive full satisfaction classes.H. Kotlarski - 1990 - Annals of Pure and Applied Logic 47 (3):199.

Add more citations

References found in this work

The incompleteness theorems.Craig Smorynski - 1977 - In Jon Barwise (ed.), Handbook of mathematical logic. New York: North-Holland. pp. 821 -- 865.

Add more references