Skip to main content

Simplicity and Incompleteness

This is a preview of subscription content, access via your institution.

REFERENCES

  • Chaitin, Gregory J.: 1974a, ‘Information-Theoretic Computational Complexity’, IEEE Transactions on Information Theory IT-20, 10–15.

    Article  Google Scholar 

  • Chaitin, Gregory J.: 1974b, ‘Information-Theoretic Limitations of Formal Systems’, Journal of the ACM 21, 403–424.

    Article  Google Scholar 

  • Craig, William and Robert L. Vaught: 1958, ‘Finite Axiomatizability Using Additional Predicates’, Journal of Symbolic Logic 23, 289–308.

    Article  Google Scholar 

  • Davis, Martin: 1978, ‘What is a Computation?’, in L. A. Stern (ed.), Mathematics Today, Springer-Verlag, Berlin, pp. 241–267.

    Google Scholar 

  • Feferman, Solomon: 1982, ‘Inductively Presented Systems and the Formalization of Metamathematics’, in van Dalen et al. (eds.), Logic Colloquium '80, North-Holland, Amsterdam, pp. 95–128.

    Google Scholar 

  • Feferman, Solomon: 1989, ‘Finitary Inductively Represented Logic’, in Ferro et al. (eds.), Logic Colloquium '88, North-Holland, Amsterdam, pp. 191–220.

    Google Scholar 

  • Feferman, Solomon: 1993, ‘Reflecting on Incompleteness’, Journal of Symbolic Logic 56, 1–49.

    Google Scholar 

  • Feferman, Solomon and Wilfried Sieg: 1981, ‘Iterated Inductive Definitions and Subsystems of Analysis’, in W. Buchholz, S. Feferman, W. Pohlers and W. Sieg: Iterated Inductive Definitions and Subsystems of Analysis: Recent Proof-Theoretical Studies, Lecture Notes in Mathematics 897, Springer-Verlag, Berlin, pp. 16–77.

    Google Scholar 

  • Feferman, Solomon and Robert M. Solovay: 1990, ‘Introductory Note to 1972a — Remark 2’, in Kurt Gödel: Collected Works, Volume II (ed. by S. Feferman et al.), Oxford University Press, Oxford, pp. 287–292.

    Google Scholar 

  • Friedman, Harvey: 1978, ‘Classically and Intuitionistically Provably Recursive Functions’, in Müller and Scott (eds.), Higher Set Theory, Lecture Notes in Mathematics 669, Springer-Verlag, Berlin, pp. 21–27.

    Google Scholar 

  • Gödel, Kurt: 1933, ‘Zur intuitionistischen Arithmetik und Zahlentheorie’, Ergebnisse eines mathematischen Kolloquiums, Heft 4, 34–38.

    Google Scholar 

  • Gödel, Kurt: 1972, ‘Some Remarks on the Undecidability Results — 2. Another Version of the First Undecidability Result’, in Kurt Gödel: Collected Works, Volume II (ed. by S. Feferman et al.), Oxford University Press, Oxford, 1990, pp. 305–306.

    Google Scholar 

  • Kleene, Stephen C.: 1952, ‘Finite Axiomatizability of Theories in the Predicate Calculus Using Additional Predicates’, Memoirs of the American Mathematical Society, no. 10 (Two papers on the predicate calculus), Providence, pp. 27–68.

    Google Scholar 

  • Kreisel, Georg: 1958, ‘Mathematical Significance of Consistency Proofs’, Journal of Symbolic Logic 23, 155–182.

    Article  Google Scholar 

  • van Lambalgen, Michiel: 1989, ‘Algorithmic Information Theory’, Journal of Symbolic Logic 54, 138–140.

    Article  Google Scholar 

  • Leivant, Daniel: 1985, ‘Syntactic Translations and Provably Recursive Functions’, Journal of Symbolic Logic 50, 682–688.

    Article  Google Scholar 

  • Raatikainen, Panu: 1998, ‘On Interpreting Chaitin's Incompleteness Theorem’, Journal of Philosophical Logic 27, To appear.

  • Troelstra, Anne S.: 1973, Metamathematical Investigations of Intuitionistic Arithmetic and Analysis, Springer-Verlag, Berlin.

    Google Scholar 

  • Troelstra, Anne S. and Dirk van Dalen: 1988, Constructivism in Mathematics: An Introduction (vols. I–II), North Holland, Amsterdam.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Raatikainen, P. Simplicity and Incompleteness. Synthese 116, 357–364 (1998). https://doi.org/10.1023/A:1005033725849

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1005033725849

Keywords

  • Turing Machine
  • Axiomatizable Theory
  • Incompleteness Theorem
  • Logical Validity
  • Basic Symbol