An Extention of the Decidable Class of Equations Considered by Goodstein and Lee

Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 24 (25-30):399-404 (1978)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Add categories

Keywords

Reprint years

DOI

10.1002/malq.19780242503

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,758

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

An Extention of the Decidable Class of Equations Considered by Goodstein and Lee.Nadejda Georgieva - 1978 - Mathematical Logic Quarterly 24 (25‐30):399-404.
Review: R. L. Goodstein, R. D. Lee, A Decidable Class of Equations in Recursive Arithmetic. [REVIEW]V. Vuckovic - 1968 - Journal of Symbolic Logic 33 (4):618-619.
A Decidable Class of Equations in Recursive Arithmetic.R. L. Goodstein & R. D. Lee - 1966 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 12 (1):235-239.
The data type variety of stack algebras.J. A. Bergstra & J. V. Tucker - 1995 - Annals of Pure and Applied Logic 73 (1):11-36.
Periodicity Based Decidable Classes in a First Order Timed Logic.Danièle Beauquier & Anatol Slissenko - 2006 - Annals of Pure and Applied Logic 139 (1):43-73.
You Have to Be Two to Start: Rational Thoughts About Love.E. Von Glasersfeld - 2006 - Constructivist Foundations 2 (1):1-5.
Environmental Values in the USA Today.Clive L. Spash - 2006 - Environmental Values 15 (3):269-271.
A Decidable Fragment of Recursive Arithmetic.R. L. Goodstein - 1963 - Mathematical Logic Quarterly 9 (12‐15):199-201.
Satisfiability of formulae with one ∀ is decidable in exponential time.Erich Grädel - 1990 - Archive for Mathematical Logic 29 (4):265-276.
A Decidable Fragment of Recursive Arithmetic.R. L. Goodstein - 1963 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 9 (12-15):199-201.
Review: R. L. Goodstein, A Decidable Fragment of Recursive Arithmetic. [REVIEW]V. Vuckovic - 1968 - Journal of Symbolic Logic 33 (4):618-618.
A metric approach to a class of doubly nonlinear evolution equations and applications.Riccarda Rossi, Alexander Mielke & Giuseppe Savaré - 2008 - Annali della Scuola Normale Superiore di Pisa- Classe di Scienze 7 (1):97-169.
The structure of the models of decidable monadic theories of graphs.D. Seese - 1991 - Annals of Pure and Applied Logic 53 (2):169-195.
Higher regularity for nonlinear oblique derivative problems in Lipschitz domains.Gary M. Lieberman - 2002 - Annali della Scuola Normale Superiore di Pisa- Classe di Scienze 1 (1):111-151.
Undecidable and decidable restrictions of Hilbert's Tenth Problem: images of polynomials vs. images of exponential functions.Mihai Prunescu - 2006 - Mathematical Logic Quarterly 52 (1):14-19.

Analytics

Added to PP
2016-02-04

Downloads
29 (#565,438)

6 months
3 (#1,034,177)

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

Some Classes of Recursive Functions.Andrzej Grzegorczyk - 1955 - Journal of Symbolic Logic 20 (1):71-72.

Add more references