- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
The Contribution of Zygmunt Ratajczyk to the Foundations of Arithmetic
Notre Dame Journal of Formal Logic 36 (4):502-504 (1995)
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 improvementAuthor's Profile
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
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.
A generalization of combinatorial operators.Anna Silverstein - 1978 - Notre Dame Journal of Formal Logic 19 (4):639-645.
Analytics
Added to PP
2010-08-24
Downloads
18 (#201,463)
6 months
3 (#1,723,834)
2010-08-24
Downloads
18 (#201,463)
6 months
3 (#1,723,834)
Historical graph of downloads
Author's Profile
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.
More on induction in the language with a satisfaction class.Henryk Kotlarski & Zygmunt Ratajczyk - 1990 - Mathematical Logic Quarterly 36 (5):441-454.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-68866f4b87-6mvtb uwo