The Contribution of Zygmunt Ratajczyk to the Foundations of Arithmetic

Notre Dame Journal of Formal Logic 36 (4):502-504 (1995)
  Copy   BIBTEX

Abstract

Zygmunt Ratajczyk was a deep and subtle mathematician who, with mastery, used sophisticated and technically complex methods, in particular combinatorial and proof-theoretic ones. Walking always along his own paths and being immune from actual trends and fashions he hesitated to publish his results, looking endlessly for their improvement

Categories

Keywords

Reprint years

DOI

10.1305/ndjfl/1040136911

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 103,836

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

Editor's Introduction.Peter Clote - 1995 - Notre Dame Journal of Formal Logic 36 (4):499-501.
Subsystems of true arithmetic and hierarchies of functions.Z. Ratajczyk - 1993 - Annals of Pure and Applied Logic 64 (2):95-152.
The Theory of $\kappa$ -like Models of Arithmetic.Richard Kaye - 1995 - Notre Dame Journal of Formal Logic 36 (4):547-559.
On Formalization of Model-Theoretic Proofs of Gödel's Theorems.Makoto Kikuchi & Kazuyuki Tanaka - 1994 - Notre Dame Journal of Formal Logic 35 (3):403-412.
A model theoretic proof of Feferman's preservation theorem.David Marker - 1984 - Notre Dame Journal of Formal Logic 25 (3):213-216.
Degrees of Relative Provability.Mingzhong Cai - 2012 - Notre Dame Journal of Formal Logic 53 (4):479-489.
Tableau methods of proof for modal logics.Melvin Fitting - 1972 - Notre Dame Journal of Formal Logic 13 (2):237-247.
Field on the Notion of Consistency.Ken Akiba - 1996 - Notre Dame Journal of Formal Logic 37 (4):625-630.
Combinatorial systems with axiom.C. E. Hughes - 1973 - Notre Dame Journal of Formal Logic 14:354.
Shavrukov's Theorem on the Subalgebras of Diagonalizable Algebras for Theories Containing IΔ0+exp.Domenico Zambella - 1994 - Notre Dame Journal of Formal Logic 35 (1):147-157.

Analytics

Added to PP
2010-08-24

Downloads
34 (#722,077)

6 months
11 (#303,202)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

Subsystems of true arithmetic and hierarchies of functions.Z. Ratajczyk - 1993 - Annals of Pure and Applied Logic 64 (2):95-152.
Satisfaction Classes and Combinatorial Sentences Independent FromPA.Z. Ratajczyk - 1982 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 28 (8-12):149-165.
Satisfaction Classes and Combinatorial Sentences Independent From PA.Z. Ratajczyk - 1982 - Mathematical Logic Quarterly 28 (8‐12):149-165.
Inductive Full Satisfaction Classes.Henryk Kotlarski & Zygmunt Ratajczyk - 1990 - Annals of Pure and Applied Logic 47 (1):199--223.

View all 6 references / Add more references