Advertisement

The use of abstract language in elementary metamathematics: Some pedagogic examples

  • G. Kreisel
  • G. E. Mints
  • S. G. Simpson
Conference paper
Part of the Lecture Notes in Mathematics book series (LNM, volume 453)

Keywords

Atomic Formula Proof Theory Derivation Tree Logical Complexity Satisfaction Relation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [A]
    Ackermann, W., Die Widerspruchsfreiheit der allgemeinen Mengenlehre, Math. Ann. 114 (1937) 305–315.MathSciNetCrossRefGoogle Scholar
  2. [C]
    Carstengerdes, W., Mehrsortige logische Systeme mit unendlichlangen Formeln, Archiv Math. Logik Grundlagenforsch 14 (1971) 38–53 and 108–126.MATHCrossRefGoogle Scholar
  3. [CK]
    Chang, C.C. and Keisler, J.H., Continuous model theory, Princeton, 1966.Google Scholar
  4. [DAA]
    Dreben, B., Andrews, P., and Aandera, S., False lemmas in Herbrand, Bull. AMS 69 (1963) 699–706.MATHCrossRefGoogle Scholar
  5. [F]
    Feferman, S., Lectures on proof theory, Springer Lecture Notes 70 (1968) 1–108.MathSciNetGoogle Scholar
  6. [Fr]
    Friedman, H., Iterated inductive definitions and Σ21-AC, pp. 435–442 of: Intuitionism and Proof Theory (ed. Myhill et al.) North Holland Publ. Co., 1970.Google Scholar
  7. [G]
    Gentzen, G., The collected papers of Gerhard Gentzen, ed. M.E. Szabo, Amsterdam 1969; rev. J. of Philosophy 68 (1971) 238–265.CrossRefGoogle Scholar
  8. [Gi]
    Girard, J.-Y., Three-valued logic and cut-elimination: the actual meaning of Takeuti's conjecture, Fund. Math. (to appear).Google Scholar
  9. [J-S]
    Jockusch, C.G. and Soare, R.I., Π10-Classes and degrees of theories. Trans. A.M.S. 173 (1972) 33–56; rev. Ƶbl. 262 (1974) 19; no. 02041.MathSciNetMATHGoogle Scholar
  10. [KK]
    Kreisel, G. and Krivine, J.-L., Elements of mathematical logic, second revised printing, North Holland Publ. Co., 1971.Google Scholar
  11. [KL]
    Kreisel, G. and Levy, A., Reflection principles and their use for establishing the complexity of axiomatic systems, Zeitschrift math. Logik Grundlagen 14 (1968) 97–142.MathSciNetMATHCrossRefGoogle Scholar
  12. [LE]
    Lopez-Escobar, E.G.K., On an extremely restricted ω-rule, Fund. Math. (to appear).Google Scholar
  13. [Mi]
    Mints, G.E., On E-theorems, Zapiski 40 (1974) 110–118.MATHGoogle Scholar
  14. [ML]
    MartinLöf, P., Hauptsatz for the intuitionistic theory of iterated inductive definitions, pp. 179–216 of Proc. Second Scand. Logic Symposium (ed. Fenstad) North Holland Publ. Co., 1971.Google Scholar
  15. [Mo]
    Mostowski, A., On recursive models of formalized arithmetic, Bull. Acad. Pol. Sc., cl. III, 5 (1957) 705–710.MathSciNetMATHGoogle Scholar
  16. [OL]
    Kreisel, G., Ordinal logics and the characterization of informal concepts of proof, pp. 289–290 in Proc. ICM Edinburgh 1968.Google Scholar
  17. [P]
    Parsons, C., Transfinite induction in subsystems of number theory (abstract), JSL 38 (1973) 544.Google Scholar
  18. [Sch]
    Schütte, K., Syntactical and semantical properties of simple type theory, JSL 25 (1960) 305–326.MATHGoogle Scholar
  19. [Sch 1]
    _____, Beweistheorie, Berlin, 1960.Google Scholar
  20. [Sch 2]
    __, On simple type theory with extensionality, pp. 179–184 in: Logic, Methodology and Philosophy of Science III, North Holland Publ. Co., 1968.Google Scholar
  21. [Sco]
    Scott, D.S., Algebras of sets binumerable in complete extensions of arithmetic, pp. 117–121 of: Proc. Symp. Pure Math. 5, AMS, 1962.Google Scholar
  22. [Sh]
    Shoenfield, J.R., Mathematical logic, Addison-Wesley, 1967.Google Scholar
  23. [SPT]
    Kreisel, G., A survey of proof theory, JSL 33 (1968) 321–388.MathSciNetMATHGoogle Scholar
  24. [SPT II]
    __, A survey of proof theory II, pp. 109–170 of: Proc. Second Scand. Logic Symp. (ed. Fenstad), North Holland Publ. Co., 1971.Google Scholar
  25. [St]
    Statman, R., Structural Complexity of proofs, Dissertation, Stanford, 1974.Google Scholar
  26. [Ta 1]
    Takahashi, M., Simple type theory of Gentzen style with the inference of extensionality, Proc. Jap. Acad. 44 (1968) 43–45.MATHCrossRefGoogle Scholar
  27. [Ta 2]
    ____, Many valued logics of extended Gentzen style II, JSL 35 (1970) 493–528.Google Scholar
  28. [Tr]
    Troelstra, A.S., Note on the fan theorem, JSL (to appear).Google Scholar
  29. [U 1]
    Uesu, T., Zermelo's set theory and G*LC, Comment. Math. Univ. St. Pauli 16 (1967) 69–88.MathSciNetMATHGoogle Scholar
  30. [U 2]
    ____, Correction to ‘zermelo's set theory and G*LC', ibid. 19 (1970) 47–49.MathSciNetGoogle Scholar
  31. [V]
    Vaught, R.L., Sentences true in all constructive models, JSL 25 (1960) 39–53.MathSciNetMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin · Heidelberg 1975

Authors and Affiliations

  • G. Kreisel
  • G. E. Mints
  • S. G. Simpson

There are no affiliations available

Personalised recommendations