Metamathematics of First-Order Arithmetic

Petr Hájek; Pavel Pudlák

doi:10.1017/9781316717271

Ackermann, W.: Zur Widerspruchsfreiheit der Zahlentheorie, Math. Ann. Vol. 117, 1940 pp. 162–194

Aczel, P.: Two notes on the Paris independence result. In: Model Theory and Arithmetic(Lect. Notes Math. 890), Springer-Verlag, 1981 pp. 21–31

Adamowicz, Z.: Open inductions and the true theory of rationals, Preprint 289, Polish Acad. Sci., 1984

Adamowicz, Z.: Axiomatization of the forcing relation with an application to PA, Fund.Math. Vol. 120, 1984 pp. 167–186

Adamowicz, Z.: Algebraic approach to ∃1-induction. In: Proceedings of the third Easterconference on model theory (Gross Koris, 1985), Humboldt Univ. Berlin, 1985 pp. 5–15

Adamowicz, Z.: Open induction (abstract), Journ. Symb. Log. Vol. 50, 1985 pp. 260

Adamowicz, Z.: Some results on open and diophantine induction. In: Logic Colloquium'84, North Holland, 1986 pp. 1–20

Adamowicz, Z.: Open induction and true theory of rationals, Journ. Symb. Log. Vol. 52,1987 pp. 793–801

Adamowicz, Z.: End-extending models of I ∆ 0+ exp + BΣ1 , preprint 431, Inst. Math.Polish Acad. Sci., 1988, p. 38

Adamowicz, Z.: A recursion theoretic characterization of instances of BΣn provable inПn +1 (N) ,Fund. Math. Vol. 129, 1988 pp. 231–236

Adamowicz, Z.: Parameter free induction, the Matiyasevič Theorem and BΣ 1. In: Logic Colloquium '86, North Holland, 1988 pp. 1–8

Adamowicz, Z., Bigorajska, T.: Functions provably total in IΣ 1 , Fund. Math., Vol. 132, 1989, pp. 189–194

Adamowicz, Z., Kossak, R.: Note on an intermediate induction scheme. In: Seminarberichte 71, Proceedings of the Fourth Easter Conference on Model Theory, Gross-Köris, 1986 pp. 1–5

Adamowicz, Z., Kossak, R.: A note on BΣn and an intermediate induction schema, Zeitschr. Math. Log. Grundl. Math. Vol. 34, 1988 pp. 261–264

Adamowicz, Z., Morales-Luna, G.: A recursive model for arithmetic with weak induction, Journ. Symb. Log. Vol. 50, 1985 pp. 49–54

Addison, J. W.: Separation principles in hierarchies of classical and effective descriptiveset theory, Fund. Math. Vol. 46, 1958 pp. 123–135

Adler, A.: Extensions of non-standard models of number theory, Zeitschr. Math. Log.Grundl. Math. Vol. 15, 1969 pp. 289–290

Aho, A. V., Hopcropt, J. E., Ullman, J. I.: The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974

Ajtai, M.: Σ 1 1-formulae on finite structures, Annals Pure Appl. Logic, Vol. 24, 1983 pp.1–48

Ajtai, M.: The complexity of the pigeonhole principle, 29–th Symp. on Foundations of Comp. Sci., 1988 pp. 346–355

Ajtai, M.: Parity and the pigeonhole principle. In: Feasible Mathematics, Buss, Scott eds.,Birkhäuser, 1990 pp. 1–24

Artemov, S. N.: Arifmetičeski polnye modal'nye teorii. (Arithmetically complete modaltheories) In: Semiotics and information science, No. 14, Akad. Nauk SSSR, Vsesojuz.Ins. Nauč. i Tehn. Inf., 1980 pp. 115–133 (translation in Amer. Math. Soc. Transl. (2)Vol. 135, 1987 pp. 39–54)

Artemov, S. N.: Priloženia modal'noj logiki v teorii dokazatelstv. (Applications of modallogic in proof theory) In: Nekl. logiki i ich prilozenia, Moskva, Akad. Nauk SSSR, 1982

Artemov, S. N.: On modal representations of extensions of Peano arithmetic, C. R. Math.Acad. Sci, Soc. Roy. Canada Vol. 6, 1984 pp. 129–132

Artemov, S. N.: Nearifmetičnost’ istinostnyh predikatnyh logik dokazatelnosti. (Nonarithmeticity of truth predicate logics of provability.) Doklady Akad. Nauk SSSR Vol.284, 1985 pp. 270–271 (translation in Soviet. Math. Dokl. Vol. 32, 1985 pp. 403–405)

Artemov, S. N.: O modal'nyh logikah axiomatizujuščih dokazatelnost’. (Modal logicsaxiomatizing provability.), Izv. Akad. Nauk SSSR, Ser. Math. Vol. 49, 1985 pp. 1123–1154

Baaz, M., Pudlák, P.: Kreisel's conjecture for L∃ 1. In: Arithmetic, Proof Theory and Computational Complexity, eds. Clote, P. and Krajíček, J., Oxford Univ. Press 1992,pp. 30–60

Baker, T. P., Gill, J., Solovay, R.: Relativizations of the P=NP question, SIAM Journ.Comput., Vol. 4, 1975 pp. 431–442

Balcázar, J. Z., Díaz, J., Gabarró, J.: Structural Complexity I, Springer-Verlag 1988, Eatcs 11, 191 p.

Balcázar, J. Z., Díaz, J., Gabarró, J.: Structural Complexity II, Springer-Verlag 1990, Eatcs 22, 283 p.

Barnes, D. W., Monro, G. P.: A simple model for a weak system of arithmetic, Bull.Austral. Math. Soc. Vol. 11, 1974 pp. 321–323

Barwise, J., Schlipf, J. S.: On recursively saturated models of arithmetic. In: Model Theory and Algebra; A Memorial Tribute to Abraham Robinson, Springer-Verlag, 1975 pp. 42–55

Bell, J. L., Machover, M.: A course in mathematical logic. North Holland Publ. Comp. 1977, p. 599

Bellisima, F.: On the modal logic corresponding to diagonalizable algebra theory, Boll.Un. Math. Ital. B(5) Vol. 15, 1978 pp. 915–930

Beltyukov, A. P.: Decidability of the universal theory of natural numbers with additionand divisibility. In: Zap. naucn. sem. Leningr. otdel. Mat. in-ta V. A. Steklova 60, 1976 pp. 15–27

Beltyukov, A. P.: A computer description and a hierarchy of initial Grzegorczyk classes,(Russian), Zap. Nauc. Sem. LOMI Vol. 88, 1979 pp. 30–46, (Translation in Journ. Soviet Math. Vol. 20, 1982)

Bencivenga, E.: Finitary consistency of a free arithmetic, Notre Dame Journ. Formal Log. Vol.25, 1984 pp. 224–226

Benda, M.: On strong axiom of induction in set theory and arithmetic. In: Mathematical Logic in Latin America, Amsterdam, North-Holland, 1980, pp. 43–56

Benda, M.: On Harrington's partition relation, Journ. Comb. Theory, Ser. A Vol. 28, 1980 pp. 338–350

Bendová, K., Hájek, P.: A logical analysis of the truth-reaction paradox, Comm. Math.Univ. Carol. Vol. 23, 1982 pp. 667–688

Bennet, Ch.: On some orderings of extensions of arithmetic. Doctoral dissertation, University of Goteborg (Sweden)-Department of Phil, 1986 pp. 100 pages

Bennet, Ch.: Lindenbaum algebras and partial conservativity, Proc. Amer. Math. Soc.Vol. 97, 1986 pp. 323–327

Bennett, J. H.: Ph. D. disertation, Princeton Univ. 1962

Berarducci, A.: The interpretability logic of PA, Journ. Symb. Log., Vol. 55, pp. 1059–1089

Berarducci, A., Intrigila, B.: Combinatorial principles in elementary number theory,1990 (preprint)

Bergstra, J. A., Tucker, J. V.: Hoare's logic and Peano's arithmetic, Theoret. Comput.Sci. Vol. 22, 1983 pp. 265–284

Berline, C: Idéaux des anneaux de Peano (d'après Cherlin). In: Model Theory and Arithmetic, (Lect. Notes Math. 890), Springer-Verlag, 1982 p. 32

Berline, C, McAloon, K., Ressayre, J. P. (Eds): Model theory and arithmetic.Comptes rendus d'une action thématique programmée du C. N. R. S. sur la theoriedes modèles et Parithmetique. In: (Lect. Notes Math. 890), Springer-Verlag, 1981, p.306

Bernard, I C: The fixed point theorem for diagonalizable algebras, Studia Logica Vol. 34, 1975 pp. 239–251

Bernardi, C: On the equational class of diagonalizable algebras, Studia Logica Vol. 34, 1975 pp. 322–331

Bernardi, C: The uniqueness of the fixed-point in every diagonalizable algebra (Thealgebraization of the theories which express Theor VIII.), Studia Logica Vol. 35, 1976 pp. 336–343

Bernardi, C: On the relation provable equivalence and on partitions in effectively inseparable sets, Studia Logica Vol. 40, 1981 pp. 29–37

Bernardi, C: A shorter proof of a recent result by R. Di Paola, Notre Dame Journ. Formal Log. Vol. 25, 1984 pp. 390–393

Bernardi, C, D'Aquino, P.: Topological duality for diagonalizable algebras, Notre Dame Journ. Formal Log. Vol. 29, 1988 pp. 345–364

Bernardi, C, Montagna, F.: Equivalence relations induced by extensional formulae:classification by means of a new fixed point property, Fund. Math. Vol. 124, 1984 pp. 221–233

Bernays, P.: Über das Induktionsschema in der rekursiven Zahlentheorie. In: Kontrolliertes Denken. Untersuchungen zum Logikkalkül und zur Logik der Einzelwissenschaften. Festschrift für Wilhelm Britzelmayr, Verlag Karl, Alber, Herder, Freiburg, 1951 pp. 10–17

Bernays, P.: The original Gentzen consistency proof for number theory. In: Intuitionismand Proof Theory, North Holland: Amsterdam, 1970 pp. 409–417

Bezboruah, A., Shepherdson, J.: Gödels second incompleteness theorem for Q, Journ.Symb. Log. Vol. 41, 1976 pp. 503–512

Blass, A.: The intersection of nonstandard models of arithmetic, Journ. Symb. Log. Vol.37, 1972 pp. 103–106

Blass, A.: On certain types and models for arithmetic, Journ. Symb. Log. Vol. 39, 1974 pp. 151–162

Blass, A.: End extensions, conservative extensions, and the Rudin-Frolik ordering, Trans.Amer. Math. Soc, 1977 No.225 pp. 325–340

Blass, A.: Amalgamation of nonstandard models of arithmetic, Journ. Symb. Log. Vol.42, 1977 pp. 372–386

Blass, A. R.: Conservative extensions of models of arithmetic, Arch. Math. Log. Vol. 20,1980 pp. 85–94

Börger, E.: Computability, Complexity, Logic, North-Holland P. C. 1989, xx + 592 pp.

Boolos, G.: A note on Beth's theorem, Bull. Acad. Polon. Sci. Vol. 21, 1973 pp. 1–2

Boolos, G.: On Kalmar's consistency proof and a generalization of the notion of omega-consistency, Arch. Math. Log. Vol. 17, 1975 pp. 3–7

Boolos, G.: On deciding the truth of certain statements involving the notion of consistency, Journ. Symb. Log. Vol. 41, 1976 pp. 779–781

Boolos, G.: On deciding the provability of certain fixed point stataments, Journ. Symb.Log. Vol. 42, 1977 pp. 191–193

Boolos, G.: Reflection principles and iterated consistency assertions, Journ. Symb. Log.Vol. 44, 1979 pp. 33–35

Boolos, G.: The unprovability of consistency. An essay in modal logic, Cambridge Univ Press: Cambridge GB, 1979, p. 184

Boolos, G.: Provability in arithmetic and a schema of Grzegorczyk, Fund. Math. Vol. 106, 1980 pp. 41–45

Boolos, G.: ω-consistency and the diamond, Studia Logica Vol. 39, 1980 pp. 237–243

Boolos, G.: Provability, truth and modal logic, Journ. Phil. Logic Vol. 9, 1980 pp. 1–7

Boolos, G.: On systems of modal logic with provability interpretations, Theoria (Lund) Vol. 46, 1980 pp. 7–18

Boolos, G.: Extremally undecidable sentences, Journ. Symb. Log. Vol. 47, 1982 p. 191

Boolos, G.: On the nonexistence of certain normal forms in the logic of provability, Journ.Symb. Log. Vol. 47, 1982 pp. 638–640

Boolos, G.: The logic of provability, Amer. Math. Mon. Vol. 91, 1984 pp. 470–480

Boolos, G.: 1-consistency and the diamond, Notre Dame Journ. Formal Log. Vol. 26, 1985 pp. 341–347

Boolos, G., Jeffrey, R.: Computability and Logic, 2-nd edition, Cambridge Univ. Press, 1980, p. 262

Boolos, G., Mcgee, V.: The degree of the set of sentences of predicate provability logicthat are true under every interpretation, Journ. Symb. Log. Vol. 52, 1987 pp. 165–171

Boughattas, S.: L'arithmétique ouverte et ses modèles non-standards, These de 3e cycle,Université Paris VII, Paris, 1987

Boughattas, S.: L'induction pour les formules ouvertes n'est pas finiment axiomatisable, Comptes Rendusde l'Académie des Sciences de Paris, Vol. 308 Série I, 1989 pp. 297–300

Brandt, U.: Index sets in the arithmetical hierarchy, Annals Pure Appl. Logic Vol. 37, 1988 pp. 101–110

Britton, J. L.: Integer solutions of systems of quadratic equations. In: Math. Proc.Cambridge Phil. Soc. Vol. 86, 1979 pp. 385–389

Brown, D. K., Simpson, S. G.: Which set existence axioms are needed to prove theseparable Hahn-Banach theorem?, Annals Pure Appl. Logic Vol. 31, 1986 pp. 123–144

Buchholz, W.: An independence results for П1 1 -CA + BI, Annals Pure Appl. Logic Vol.33, 1987 pp. 131–155

Buchholz, W., Feferman, S., Pohlers, W., Sieg, W.: Iterated Inductive Definitions and Subsystems of Analysis: Recent Proof-Theoretical Studies. (Lect. Notes Math. 897), Springer-Verlag, 1981, p. 383

Buchholz, W., Pohlers, W.: Provable well orderings of formal theories for transfinitelyiterated inductive definitions, Journ. Symb. Log. Vol. 43, 1978 pp. 118–125

Buchholz, W., Wainer, S.: Provably computable functions and the fast growing hierarchy. In: Logic and Combinatorics, Amer. Math. Soc: Arcata, 1987 pp. 179–198

Buss, S. R.: The polynomial hierarchy and fragments of bounded arithmetic. In: 17–th Annual ACM Symposium on Theory of Computing, 1985 pp. 285–290

Buss, S. R.: Bounded arithmetic (revised version of Ph. D. thesis), Bibliopolis, 1986

Buss, S. R.: The polynomial hierarchy and intuitionistic bounded arithmetic. In: Structurein Complexity Theory (Lect. Notes Comp. Sci. 223), Springer-Verlag, 1986 pp. 77–103

Buss, S. R.: Polynomial size proofs of the propositional pigeonhole principle, Journ. Symb.Log. Vol. 52, 1987 pp. 916–927

Buss, S. R.: A conservation result concerning bounded theories and the collection axiom, Proc. Amer. Math. Soc. Vol. 100, 1987 pp. 109–116

Buss, S. R.: The Boolean formula value problem is in ALOGTIME. In: 19–th Annual ACM Symp. on Theory of Computing, 1987 pp. 123–131

Buss, S. R.: Axiomatizations and conservation results for fragments of bounded arithmetic, In: Logic and Computation, Contemporary Mathematics 106, Amer. Math. Soc, 1990 pp. 57–84

Buss, S. R.: A note on bootstrapping Intuitionistic Bounded Arithmetic, proc Proof Theory Conference, Leeds, England, 1990, to appear BUSS S. R.: The undecidability of κ-provability, Annals of Pure and Appl. Logic 53, 1991 pp. 75–102

Buss, S. R.: A conservation result concerning bounded theories and the collection axiom, Proc. Amer. Math. Soc. Vol. 100, 1987, pp. 916–927

Buss, S. R.: Propositional consistency proofs, Annals of Pure and Appl. Logic 52, 1991 pp. 3–29

Buss, S. R.: On model theory for intuitionistic bounded arithmetic with applications toindepende results. In: Feasible Mathematics, Buss, Scott eds., Birkhäuser, 1990, pp.27–48

Buss, S. R.: The witness function method and provably recursive fragments of Peanoarithmetic In: Logic Methodology and Philosophy of Science '91, to appear

Buss, S. R. et al.: Weak formal systems and connections to computational complexity,Student written lecture notes for a course at UC Berkeley, 1988

Buss, S. R.J., Krajíček, J., Takeuti, G.: Provably total functions in bounded arithmetic theoriesR i 3, U i 2. and V i 2. In: Arithmetic, Proof Theory and Computational Complexity, eds. Clote, P. and Krajíček, J., Oxford Univ. Press 1992, pp. 116–161

Cantini, A.: Majorizing provably recursive functions in fragments of PA, Arch. Math. Log. Vol. 25, 1985 pp. 21–31

Cantor, A.: Minimal proper elementary extensions of N with respect to definable relations Dissertation, Univ. S. Carolina, 1972

Carlson, T. J., Simpson, S. G.: A dual form of Ramsey's theorem, preprint, Penns. Univ, 1983

Carnap, R.: Logische Syntax der Sprache, Springer-Verlag, 1934

Carstens, H. G.: The theorem of Matijasevič is provable in Peano's arithmetic by finitely many axioms, Logique & Anal., N. S. Vol. 20, 1977 pp. 116–121

Carstens, H. G.: Über die Kompliziertheit numerischer Modelle, Dissertation, Münister, 1972

Carstens, H. G.: Reducing hyperarithmetic sequences, Fund. Math. Vol. 89, 1975 pp. 5–11

Carstens, H. G.: ∆0 2-Mengen, Arch. Math. Log. Vol. 18, 1976 pp. 55–65

Caviness, B. F.: On canonical forms and simplification, Journ. ACM Vol. 17, 1970 pp. 385–396

Cegielski, P.: La théorie élémentaire de la multiplication, C. R. Acad. Sci. Paris Ser. A-B Vol. 290, 1980 pp. A935–A938

Cegielski, P.: Théorie élémentaire de la multiplication des entiers naturels. In: Model Theory and Arithmetic, (Lect. Notes Math. 890), Springer-Verlag, 1981 pp. 44–89

Cegielski, P.: La théorie élémentaire de la divisibilité est finiment axiomatisable, C. R. Acad. Sci. Paris Ser. I Math. Vol. 299, 1984 pp. 367–369

Cegielski, P., McAloon, K., Wilmers, G.: Modeles recursivement satures de Paddition et de la multiplication des entiers naturels. In: Logic Colloquium '80 (Studies in Logic and the Foundations of Mathematics 108), North-Holland, 1982 pp. 57–68

Celluci, C: Proprietadi uniformitae 1–coerenza dell'aritmetica del primoordine, Matematiche Vol. 32, 1977 pp. 35–49

Cenzer, D., Clote, P., Smith, R. L., Soare, R. I., Wainer, S. S.: Members of countable П0 1 classes, Annals Pure Appl. Logic Vol. 31, 1986 pp. 145–163

Chaitin, G. J.: Göde's theorem and information, Int. Journ. Theor. Phys. Vol. 21, 1982 pp. 941–954

Chatzidakis, Z.: La représentation en termes de faisceaux des modèles de la théorie élémentaire de la multiplication des entiers naturels. In: Model theory and arithmetic (Paris, 1979–1980) (Lect. Notes Math. 890), Springer-Verlag, 1981 pp. 90–110

Church, A.: An independence question in recursive arithmetic. In: Colloque sur les Fondements des Mathématiques, les Machines Mathématiques, et leurs Applications (Collection de Logique Mathématique), Akad. Kiado: Budapest, 1965 pp. 21–26

Cichon, E. A.: A short proof of two recently discovered independence results using recursion theoretic methods, Proc. Amer. Math. Soc. Vol. 87, 1983 pp. 704–706

Cichon, E. A., Wainer, S. S.: Slow growing and Grzegorczyk hierarchies, Journ. Symb. Log. Vol. 48, 1983 p. 399

Cinman, L. L.: On the complete induction axiom, Doklady Akad. Nauk SSSR, 1967 No.173 pp. 273–274

Cinman, L. L.: The role of the principle of induction in a formal arithmetical system, Mat. Sb. (NS), 1968 No.77 pp. 71–104

Cleave, J. P.: A hierarchy of primitive recursive functions. (Russian translation in Problemy matematičeskoj logiki, Mir 1970, 94–113), Zeitschr. Math. Log. Grundl. Math. Vol. 9, 1963 pp. 331–345

Cleave, J. P., Roseh, E.: ℰn-Arithmetic. In: Sets, Models a Recursion Theory, North-Holland, 1967 pp. 297–308

Clote, P.: A recursion theoretic analysis of certain generalizations of Ramsey's theoremand of the Gale-Stewart theorem, Dissertation, Duke Univ, 1979 Clote P.: Weak partition relations, finite games, and independence results in Peanoarithmetic. In: Model Theory of Algebra and Arithmetic (Lect. Notes Math. 834),Springer-Verlag, 1980 pp. 92–107

Clote, P.: Anti-basis theorems and their relation to independence results in Peano arithmetic. In: Model theory and arithmetic, (Lect. Notes Math. 890), Springer-Verlag, 1981 pp. 115–133

Clote, P.: A note on decidable model theory. In: Model Theory and Arithmetic, (Lect.Notes Math. 890), Springer-Verlag, 1981 pp. 134–142

Clote, P.: Applications of the low basis theorem in arithmetic. In: Recursion-theory week(Oberwolfach, 1984), (Lect. Notes Math. 1141), Springer-Verlag, 1985 pp. 65–88

Clote, P.: Partition relations in arithmetic. In: Proc. 6th Latin American Symp. on Math.Logic, Caracas, (Lect. Notes Math. 1130), Springer-Verlag, 1985 pp. 32–68

Clote, P.: Ultrafilters on definable sets of arithmetic. In: Logic Colloquium '84 (Studiesin Logic and the Foundations of Mathematics 120), North-Holland, 1986 pp. 37–58

Clote, P.: A note on the Mac Dowell-Specker theorem, Fund. Math. Vol. 127, 1987 pp.163–170

Clote, P.: ALOGTIME and a conjecture of S. A. Cook. In: Logic in Computer Science,IEEE 1990, to appear in Annals of Mathematics and Artificial Intelligence

Clote, P.: On polynomial size Frege proofs of certain combinatorial principles. In: Arithmetic, Proof Theory and Computational Complexity, eds. Clote, P. and Krajíček, J., Oxford Univ. Press 1992, pp. 162–184

Clote, P.: Bounded arithmetic and computational complexity. In:Structure in Complexity Theory 1990, IEEE, to appear

Clote, P., Hajek, P., Paris, J.: On some formalized conservation results in arithmetic, Arch. Math. Log. 30, 1990, pp. 201–218

Clote, P., McAloon, K.: TWO further combinatorial theorems equivalent to the 1-consistency of Peano arithmetic, Journ. Symb. Log. Vol. 48, 1983 pp. 1090–1104

Clote, P., Takeuti, G.: Exponential time and bounded arithmetic (extended abstract).In: Structure in Complexity Theory (Lect. Notes Comp. Sci. 223), Springer-Verlag, 1986 pp.125–143

Clote, P., Takeuti, G.: Bounded arithmetic for NC, ALOGTIME, L and NL, Annals of Pure and Appl. Logic 56, 1992 pp. 73–117

Cook, S. A.: The complexity of theorem proving procedures, 3-rd Symp. on Theory of Computing, 1971 pp. 151–158

Cook, S. A.: Feasibly constructive proofs and the propositonal calculus. In: Proc. 7–th A.C. M. STOC, 1975 pp. 73–89

Cook, S. A., Reckhow R. A.: The relative efficiency of propositional proof systems,Journ. Symb. Log. Vol. 44, 1979 pp. 36–50

Cook, S. A., Urquhart, A.: Functional interpretations of feasibly constructive arithmetic. In: Proc. ACM Symp. on Theory of Computing, 1989, pp. 107–112

Craig, W.: Bases for first order theories and subtheories, Journ. Symb. Log. vol. 25, 1960,pp. 97–142

Csirmaz, L.: On definability in Peano arithmetic, Bull. Acad. Polon. Sci. Vol. 8, 1979 pp. 148–153

Csirmaz, L., Paris, J. B.: A property of 2-sorted Peano models and program verification, Zeitschr. Math. Log. Grundl. Math. Vol. 30, 1984 pp. 325–334

Čubarjan, A. A.: The lengths of derivations of formulae in extensions of formal arithmetic, Izv. Akad. Nauk. Armjan. SSSR Ser. Mat. 9, 1974 pp. 409–429

Čuda, K.: An elimination of the predicate “to be a standard member” in nonstandardmodels of arithmetic, Comm. Math. Univ. Carol. Vol. 23, 1982 pp. 785–803

Čudnovsky, G. V.: Diophantine predicates, Uspekhi Matem. Nauk. Vol. 25, 1970 No.4 pp. 185–186

Daguenet, M.: Un modele non standard de l'arithmétique, Comptes Rendus, 1972 No.274 pp. 685–688

Van Dalen, D., Gordon, C. E.: Independence problems in subsystems of intuitionisticarithmetic, Indag. Math. Vol. 33, 1971 pp. 448–456

Van Dalen, D., Mulder, H., Krabbe, E. C. W., Visser, A.: Finite Kripke models of HAare locally PA, Notre Dame Journ. Formal Log. Vol. 27, 1986 pp. 528–532

Davis, M. D.: Arithmetical problems and recursively enumerable predicates, Journ. Symb.Log. Vol. 18, 1953 pp. 33–41

Davis, M. D.: One equation to rule them all, Trans. N. Y. Acad. Sci. Vol. 30, 1960 pp. 766–775

Davis, M. D.: Application of recursive function theory to number theory. In: Recursive Function Theory, Amer. Math. Soc, Providence, 1962, pp. 135–138

Davis, M. D.: Extensions and corollaries of recent work on Hilberts tenth problem, III.Journ. Math. Vol. 7, 1963 pp. 246–250

Davis, M. D.: Introduction to Gödel's paper: On formally udecidable propositions of the Principia Mathematica and related systems I. In: The Undecidable. Basic papers on Undecidable Propositions, Unsolvable problems and Computable functions, Raven Press, New York, 1965 pp. 4

Davis, M. D.: Diophantine equations and recursively enumerable sets. In: Automata Theory, New York, Academic Press, 1966, pp. 146–152

Davis, M. D.: An explicit Diophantine definition of the exponencial function, Commun.Pure and Applied Math. Vol. 24, 1971 pp. 137–145

Davis, M. D.: On the number of solutions of Diphantine equations. In: Proc. Amer. Math.Soc. Vol. 33, 1972 pp. 552–554

Davis, M. D.: Hilbert tenth problem is unsolvable, Amer. Math. Mon. Vol. 80, 1973 pp.233–269

Davis, M. D.: Speed-up theorems and Diophantine equations. In: Courant Computer Science Symposium 7: Computational Complexity, New York, Algorithmics Press, 1973

Davis, M. D.: What is a computation? In: Mathematics Today, Heidelberg, Springer-Verlag, 1978

Davis, M. D. (ED): The undecidable. Basic papers on undecidable propositions, unsolvableproblems and computable functions, Raven Press, New York, 1965, 440 p.

Davis, M. D., Matiyasevič, I., Robinson, J.: Hilbert's tenth problem. Diophantine equations: positive aspects of a negative solution. In: Mathematical Developmants Arising From Hilbert's Problems, Amer. Math. Soc. Proc. Symp. Pured Math. 28, 1976, pp.223–378

Davis, M. D., Putnam, H.: eduction of Hilbert's tenth problem, Journ. Symb. Log. Vol.23, 1958 pp. 183–187

Davis, M. D., Putnam, H.: Diophantine sets over polynomial rings, III. Journ. Math. Vol.7, 1963 pp. 251–256

Davis, M. D., Putnam, H., Robinson, J.: The decision problem for exponential Diophantine equations, Ann. Math. Vol. 74, 1961 pp. 425–436

Dawes, A. M., Florence, J. B.: Independent Gödel sentences and independent sets, Journ. Symb. Log. Vol. 40, 1975 pp. 159–166

Dawes, A. M.: First order hierarchies in general models and in models of Peano arithmetic,Dissertation, Toronto, 1972

Dawes, A. M.: End extensions which are models of a given theory, Zeitschr. Math. Log.Grundl. Math. Vol. 23, 1977 pp. 463–467

Dawson, J.: The Gödel incompleteness theorem from a length-of-proof perspective, Amer.Math. Mon. Vol. 86, 1979 pp. 740–748

Dedekind, R.: Was sind und was sollen die, Zahlen, Braunschweig, F. Vieweg und, Sohn,1939, 58 pp.

Denef, J.: Hilbert's tenth problem for quadratic rings, Proc. Amer. Math. Soc. Vol. 48, 1975 pp. 214–220

Denef, J.: Diophantine sets over Z(T). In: Proc. Amer. Math. Soc. Vol. 69, 1978 pp.148–150

Denef, J.: The Diophantine problem for polynomial rings and fields of rational functions, Trans. Amer. Math. Soc, 1978 No.242 pp. 391–399

Denef, J.: The Diophantine problem for polynomial rings of positive characteristic. In:Logic Colloquium '78, Amsterdam, North-Holland, 1979, pp. 131–145

Denef, J.: Diophantine sets over algebraic number rings II, Trans. Amer. Math. Soc, 1980 No.257 pp. 227–236

Denef, J., Lipshitz, L.: Diophantine sets over some rings of algebraic integers, Journ.London Math. Soc. Vol. (2) 18, 1978 pp. 385–391

Denis, R.: The arithmetics as theories of two orders. In: Orders: descriptions and roles(L'Arbresle, 1982), North-Holland, 1984 pp. 287–311

Denisov, S. D.: Models of noncontradictory formulas and the Ershov hierarchy, Algebra i Logika Vol. 11, 1972 pp. 648–655

Derevyankina, E. A.: Some questions on the completeness of arithmetic, Sibirski Mat.Zh. Vol. 15, 1974 pp. 299–317

Diaconescu, R., Kirby, L. A. S.: Models of arithmetic and categories with finitenessconditions, Annals Pure Appl. Logic Vol. 35, 1987 pp. 123–148

Dickman, M.: Types remarquables et extensions de modèles dans l'arithmétique de Peano I, Astérisque Vol. 73, 1980 pp. 59–117

Dimitracopoulos, C: Matiyasevič theorem and fragments of arithmetic, Dissertation Manchester, 1980

Dimitracopoulos, C: A generalization of a theorem of H. Friedman, Zeitschr. Math. Log.Grundl. Math. Vol. 31, 1985 pp. 221–225

Dimitracopoulos, C, Graifman, H.: Fragments of Peano's arithmetic and the MRDP theorem. In: Logic and Algorithmic An International Symposium Held in Honour of Ernst Specker, Enseign Math. Univ Genève: Genève, 1982 pp. 187–206

Dimitracopoulos, C, Paris, J. B.: Truth definitions for ∆ 0formulae. In: Logic and Algorithmic. An International Symposium Held in Honour of Ernst Specker, Monogr.Enseign. Math. Univ Geneve, 1982 pp. 317–329

Dimitracopoulos, C, Paris, J. B.: A note on the undefinability of cuts, Journ. Symb.Log. Vol. 48, 1983 pp. 564–569

Dimitracopoulos, C, Paris, J. B.: The pigeon hole principle and fragments of arithmetic, Zeitschr. Math. Log. Grundl. Math. Vol. 32, 1986 pp. 73–80

Dimitracopoulos, C, Paris, J. B.: The pigeonhole principle and fragments of arithmetic.(abstract), Journ. Symb. Log. Vol. 51, 1986 pp. 485

Dimitracopoulos, C, Paris, J. B.: A note on a theorem of H. Friedman, Zeitschr. Math.Log. Grundl. Math. Vol. 34, 1988 pp. 13–17

Dowd, M.: Propositional representation of arithmetic proofs (dissertation), Univ. of Toronto, 1979

Dowd, M.: Model theoretic aspects of PNP (preprint), 1985

Van Den, Dries L.: Some model theory and number theory for models of weak systemsof arithmetic. In: Model Theory of Algebra and Arithmetic (Lect. Notes Math. 834),Springer-Verlag, 1980 pp. 346–362

Ehrenfeucht, A.: Polynomial functions with exponentiation are well ordered, Algebra Universalis Vol. 3, 1973 pp. 261–262)

Ehrenfeucht, A.: Discernible elements in models for Peano arithmetic, Journ. Symb.Log. Vol. 38, 1973 pp. 291–292

Ehrenfeucht, A., Feferman, S.: Represent ability of recursively enumerable sets in formaltheories, Arch. Math. Log. Vol. 5, 1959 pp. 37–41

Ehrenfeucht, A., Jensen, D. C: Some problems in elementary arithmetics, Fund. Math.Vol. 92, 1976 pp. 223–245

Ehrenfeucht, A., Kreisel, G.: Strong models for arithmetic, Bull. Acad. Polon. Sci. Vol.14, 1966 pp. 107–110

Ehrenfeucht, A., Mycielski, J.: Abbreviating proofs by adding new axioms, Bull. Amer.Math. Soc. Vol. 77, 1971 pp. 366–367

Ellentuck, E.: A model of arithmetic, Bull. Acad. Polon. Sci. Vol. 22, 1974 pp. 353–355

Enderton, H. B.: On provable recursive functions, Notre Dame Journ. Formal Log. Vol.9, 1968 pp. 86–88

Erdos, P., Mills, G.: Some bounds for the Ramsey-Paris-Harrington numbers, Journ.Combin. Theory Ser. A Vol. 30, 1981 pp. 53–70

Esenine-Volpine, A. S.: Le programme ultra-intuitionniste des fondements des mathematiques. In: Infinitistic Methods, Proceedings of the Symposium on Foundations of Mathematics, PWN: Warsaw, 1961 pp. 201–223

Farkas, E. J.,Szabo, M. E.: On the programs-as-formulas interpretation of parallelprograms in Peano arithmetic, Annals Pure Appl. Logic Vol. 37, 1988 pp. 111–127

Feferman, S.: Formal consistency proofs and interpretabilily of theories. In: Summaries of Talks Presented at the Summer Institute for Symbolic Logic; 1957 Ithaca, Institute for Defense Analyses, Com. Res. Division, 1957 pp. 71–77

Feferman, S.: Arithmetization of metamathematics in a general setting, Fund. Math. Vol.49, 1960 pp. 35–92

Feferman, S.: Transfinite recursive progressions of axiomatic theories, Journ. Symb. Log.Vol. 27, 1962 pp. 259–316

Feferman, S.: Autonomous transfinite progressions and the extent of predicative mathematics. In: Proceedings of 3rd International Congress for Logic, Methodology and Philosophy of Science (Stud. Logic Found. Math.), North Holland: Amsterdam, 1968 pp. 121–135

Feferman, S.: Theories of finite type related to mathematical practice. In: Handbook of Mathematical Logic, Amsterdam, North-Holland, 1977, pp. 913–971

Feferman, S.: Inductively presented systems and the formalization of meta-mathematics.In: Logic Colloquium '80 (Stud. Logic Found. Math. 108), North Holland: Amsterdam,1982 pp. 95–128

Feferman, S.: Intensionality in mathematics, Journ. Philosophical Logic Vol. 14,1985 pp.41–56

Feferman, S., Kreisel, G., Orey, S.: 1–consistency and faithful interpretations, Arch.Math. Log. Vol. 6, 1962 pp. 52–63

Feferman, S., Spector, C: In completeness along paths in progressions of theories, Journ.Symb. Log. Vol. 27, 1962 pp. 383–390

Feferman, S., Kreisel, G., Orey, S.: 1–consistency and faithful interpretations, Arch. Math. Log. Vol. 6, 1962 No.6 pp. 52–63

Fenstad, J. E.: On the completeness of some transfinite recursive progressions of axiomatictheories, Journ. Symb. Log. Vol. 33, 1968 pp. 69–76

Fenstad, J. E.: Non-standard models for arithmetic and analysis. In: Proceedings of the15th Scandinavian Congress (Lect. Notes Math. 118), Springer-Verlag, 1970 pp. 30–47

Fischer, M. J., Rabin, M. O.: Super-exponential complexity of Presburger arithmetic. In:Complexity of computation, SIAM-Amer. Math. Soc. Proceeding 7, Providence, 1974, pp. 27–44

Fischer, P. C: Theory of provably recursive functions. Trans. Amer. Math. Soc. Vol. 117,1965 pp. 494–520

Flagg, R. C, Friedman, H. M.: Epistemic and intuitionisticformal systems, Annals Pure Appl. Logic Vol. 32, 1986 pp. 53–60

Flannagan, T. B.: A note on a proof of Shepherdson, Arch. Math. Log. Vol. 23, 1983 pp. 55–60

Friedman, H. M.: Iterated inductive definitions and Σ 1 2 -AC In: Intuitionism and proof theory, Amsterdam, North-Holland, 1970, pp. 435–442

Friedman, H. M.: Countable models of set theories. In: Cambridge Summer School in Mathematical Logic, (Lect. Notes Math. 337), Springer-Verlag, 1973, pp. 539–573

Friedman, H. M.: Provable equality in primitive recursive arithmetic with and withoutinduction, Pac. Journ. Math. Vol. 57, 1975 pp. 379–392

Friedman, H. M.: One hundred and two problems in mathematical logic, Journ. Symb.Log., Vol. 40, 1975, pp. 113–129

Friedman, H. M.: Set theoretic foundations for constructive analysis, Ann. Math. Vol.105, 1977 pp. 1–28

Friedman, H. M.: Classically and intuitionistically provably recursive functions. In: Higher Set Theory (Lect. Notes Math. 669), Springer-Verlag, 1978 pp. 21–27

Friedman, H. M.: Simpler combinatorial theorem independent of set theory, Preprint, Ohio State Univ., 1979, 6 p.

Friedman, H. M.: On the consistency, completeness, and correctness problems, Preprint, Ohio State Univ. 1979, 10 p.

Friedman, H. M.: A strong conservative extension of Peano arithmetic. In: The Kleene Symposium (Stud. Logic Found. Math. 101), North Holland: Amsterdam, 1980 pp.113–122

Friedman, H. M.: Translatability and relative consistency II. Preprint, Ohio State Univ. 1980, 6 p. (see [Smoryński 82, Nonstandard models])

Friedman, H. M., McAloon, K., Simpson, S.: A finite combinatorial principle which is equivalent to the 1-consistency of predicative analysis. In: Patras Logic Symp, 1982 pp.197–230

Friedman, H. M., Sheard, M.: An axiomatic approach to self-referential truth, Annals Pure Appl. Log. Vol. 33, 1987 pp. 1–21

Friedman, H. M., Sheard, M.: The disjunction and existence properties for axiomaticsystems of truth, Annals Pure Appl. Log. Vol. 40, 1988 pp. 1–10

Friedman, H. M., Simpson, S. G., Smith, R. L.: Countable algebra and set existenceaxioms, Ann. Pure Appl. Log. Vol. 25(2), 1983 pp. 141–182

Friedman, H. M., Simpson, S. G., Smith, R. L.: Addendum to “Countable algebra andset existence axioms”, Annals Pure Appl. Log. Vol. 28, 1985 pp. 319–320

Friedrichsdorf, U.: Einige Bemerkungen zur Peano Arithmetik, Zeitschr. Mat. Log.Grundl. Math. Vol. 22, 1976 pp. 431–436

Gaifman, H.: Uniform extension operators for models and their applications. In: Sets, Models and Recursion Theory, Amsterdam, North-Holland, 1967, pp. 122–155

Gaifman, H.: On local arithmetical functions, and their applications for constructingtypes of Peano's arithmetic. In: Mathematical Logic and Foundations of Set Theory, Amsterdam, North-Holland, 1970, pp. 105–121

Gaifman, H.: A note on models and submodels of arithmetic. In: Conference in Mathematical Logic, London ’70, Springer-Verlag, 1972 pp. 128–144

Gaifman, H.: Models and types of Peano's arithmetic, Arch. Math. Log. Vol. 9, 1976 pp.223–306

Gaifman, H., Dimitracopoulos, C: Fragments of Peano's arithmetic and the MRDP theorem. In: Logic and algorithmic (Zurich, 1980) (Monograph. Enseign. Math, 30), Geneve, Univ. Geneve, 1982 pp. 187–206

Gandy, R. O.: Note on a paper of Kemeny's, Math. Ann, 1958 No.136 pp. 466

Garey, M. R., Johnson, D. S.: Computers and Intractability: A Guide to the theory of NP-completeness, Freeman, San Francisco, 1979, 338 pp.

Gandy, R. O.: Limitations to mathematical knowledge. In: Logic Colloquium '80 (Studiesin Logic and the Foundations of Mathematics 108), North-Holland, 1982 pp. 129–146

Garro, I.: Independence proofs in arithmetic theories with very weak induction, Univ Math Inst: Bonn, 1973, 71 p.

Garro, I.: Nonstandard models for a fragment of the arithmetic and their decision problem, Zeitschr. Math. Log. Grundl. Math. Vol. 33, 1987 pp. 481–483

Geiser, J. R.: A formalization of Essenin-Volpin's proof theoretical studies by means ofnonstandard analysis, Journ. Symb. Log. Vol. 39, 1974 pp. 81–87

Gentzen, G.: Untersuchungen über das logische Schliessen I. Math. Zeitschr. 39, 1935 pp. 176–210 (Russian translation in Matematiceskaja teoria logiceskogo vyvoda, Nauka 1967, 9–76)

Gentzen, G.: Untersuchungen über das logische Schliessen II. Math. Zeitschr. Vol. 39,1935 pp. 405–443 (Russian translation in Matematiceskaja teoria logiceskogo vyvoda, Nauka 1967, 9–76)

Gentzen, G.: Die Widerspruchsfreiheit der reinen Zahlen theorie. Math. Ann. Vol. 112, 1936 pp. 493–565 (Russian translation in Matematiceskaja teoria logiceskogo vyvoda,Nauka 1967, 77–153)

Gentzen, G.: Neue Fassung des Widerspruchsfreiheitsbeweises für die reine Zahlentheorie. Forschungen zur Logik und zur Grundlegung der exakten Wissenschaften Vol. 4, 1938 pp. 19–44 (Russian translation in Matematiceskaja teoria logiceskogo vyvoda, Nauka 1967, 154–190)

Gentzen, G.: Zusammenfassung von mehreren vollständigen Induktionen zu einer einzigen, Arch. Math. Log. Vol. 2, 1954 pp. 1–3

Gentzen, G.: The collected papers of Gerhard Gentzen, North Holland: Amsterdam, 1969, 338 p.

Gentzen, G.: Der erste Widerspruchsfreiheitsbeweis für die klassiche Zahlentheorie, Arch.Math. Log. Vol. 16, 1974 pp. 97–118

Gentzen, G.: Über das Verhaltnis zwischen intuitionistischer und klassicher Arithmetik, Arch. Math. Log. Vol. 16, 1974 pp. 119–132

Germano, G.: Incompleteness theorem via weak definability of truth: a short proof, Notre Dame Journ. Formal Log. Vol. 14, 1973 pp. 377–380

Ginsburg, S., Spanier, E.: Semigroups, Presburger formulas and languages, Pac. Journ.Math. Vol. 16, 1966 pp. 285–296

Gödel, K.: Die Vollständigkeit der Axiome des logischen Funktionenkalküls, Monatsheftefür Math, und Phys. vol 37, 1930, pp. 349–360.

Gödel, K.: Einige metamathematische Resultate über Entscheidungsdefinitheit und Widerspruchsfreiheit. In: Math. Naturw. Klasse, Anzeiger, 67, Akad. Wiss. Wien, 1930 pp. 214–215

Gödel, K.: Remarks contributed to a “Diskussion zur Grundlegung der Mathematik”, Erkenntnis Vol. 2, 1931 pp. 147–148

Gödel, K.: Eine Interpretation des intuitionistischen Aussagenkalküls, Ergebnisse einesmath. Kolloquiums Vol. 4, 1931 pp. 39–40

Gödel, K.: Über formal unentscheidbare Satze der Principia Mathematica und verwandter Systeme I Monatshefte Math. Phys. Vol. 38, 1931 pp. 173–198

Gödel, K.: Über Vollständigkeit und Widerspruchsfreiheit, Ergebnisse eines Mathematischen Kolloquiums Vol. 3, 1932 pp. 12–13

Gödel, K.: Zu intuitionistischen Arithmetik und Zahlentheorie. In: Ergebnisse eines Math.Kolloquiums, 1933 pp. 34–38

Gödel, K.: On undecidable propositions of formal mathematical systems (mimeographedlecture notes by Kleene, S. C. and Rosser, J. B.). Princeton 1934 (reprinted in Davis1965 and Gödel 1986)

Gödel, K.: Über die Länge von Beweisen. In: Ergeb. eines math. Kolloq. Vol. 7, 1936 pp.23–24

Gödel, K.: The consistency of the axiom of choice and of the generalized continuum hypothesis. Proc Nat Acad Sci USA Vol. 24, 1938 pp. 556–557

Gödel, K.: Über eine bisher noch nicht benutzte Erweiterung des finiten Standpunktes, Dialectica Vol. 12, 1958 pp. 280–287

Gödel, K.: On undecidable propositions of formal mathematical systems. In: The Undecidable, N. Y, Raven Press, Hewlett, 1965, pp. 41–71

Gödel, K.: Collected works, vol. I (edited by Feferman, S. et al.). Oxford Univ. Press New York and Oxford, 1986, xvi + 474 pp.

Gödel, K.: Collected works, vol. II (edited by Feferman, S. et al.). Oxford Univ. Press New York and Oxford, 1990, xvi + 407 pp.

Gold, B.: Relatively diophantine correct models of arithmetic, Notre Dame Journ. Formal Log. Vol. 28, 1987 pp. 291–296

Goldblatt, R.: Arithmetic necessity, provability and intuitionistic logic, Theoria Vol. 44,1978 pp. 38–46

Goldfarb, W. D.: On the effective ω-rule, Zeitschr. Math. Log. Grundl. Math. Vol. 21,1975 pp. 409–412

Goldfarb, W. D.: Ordinal bounds for κ-consistency, Journ. Symb. Log. Vol. 39, 1978 pp.693–699

Goldfarb, W. D., Scanlon, T. M.: The u-consistency of number theory via Herbrand's theorem, Journ. Symb. Log. Vol. 39, 1974 pp. 678–692

Goldfrei, D. C, Macintyre, A., Simmons, H.: The forcingcompanions of number theories, Israel Journ. Math. Vol. 14, 1973 pp. 318–337

Goodman, N. D.: Flagg readability in arithmetic, Journ. Symb. Log. Vol. 51, 1986 pp.387–392

Goodstein, R. L.: On the restricted ordinal theorem, Journ. Symb. Log. Vol. 9, 1944 pp.33–41

Goodstein, R. L.: Transfinite ordinals in recursive number theory, Journ. Symb. Log. Vol.12, 1947 pp. 123–129

Goodstein, R. L.: Logic-free formalism of recursive arithmetic, Math. Scand. Vol. 2, 1954,pp. 247–261

Gordeev, L.: Proof-theoretical analysis: weak systems of functions and classes, Annals Pure Appl. Logic Vol. 38, 1988 pp. 1–121

Gorjačev, S. V.: On interpret ability of some extensions of arithmetic, Matemeticeskie Zametki Vol. 40, 1986 pp. 561–571

Grattan-Guiness, I.: In memorium Kurt Gödel: His 1931 correspondence with Zermeloon his incompletability theorem, Hist. Mathematica Vol. 6, 1979 pp. 294–304

Grilliot, T. J.: Disturbing arithmetic, Journ. Symb. Log. Vol. 50, 1985 pp. 375–379

Grzegorczyk, A.: Some classes of recursive functions. In: Rozprawy Matematiczne, IV, Warszawa, 1953 (Russian translation in Problemy matematiceskoj logiki, Mir 1970,9–49)

Grzegorczyk, A.: Some proofs of undecidability of arithmetic, Fund. Math. Vol. 43, 1956 pp. 166–177

Grzegorczyk, A.: An unfinitizability proof by means of restricted reduced power, Fund.Math. Vol. 73, 1971 pp. 37–49

Grzegorczyk, A.: Zarys arytmetyki teoretycznej. (Second edition), Panstwowe Wydawnictwo Naukowe, 1983, 315 p.

Grzegorczyk, A., Mostowski, A., Ryll-Nardzewski, C: The classical and the ω-complete arithmetic, Journ. Symb. Log. Vol. 23, 1958 pp. 188–206

Guaspari, D.: Partially conservative extensions of arithmetic, Transactions Amer. Math.Soc. Vol. 254, 1979 pp. 47–68

Guaspari, D.: Sentences implying their own provability, Journ. Symb. Log. Vol. 48, 1983 pp. 777–789

Guaspari, D., Solovay, R. M.: Rosser sentences, Ann. Math. Log. Vol. 16, 1979 pp. 81–99

Hájek, P.: Syntactic models of axiomatic theories, Bull. Acad. Polon. Sci. Vol. 13, 1965 pp. 273–278

Hájek, P.: Generalized interpret ability in terms of models, Čas. pĕst. mat. Vol. 91, 1966 pp. 352–357

Hájek, P.: On interpret ability in set theories, Comm. Math. Univ. Carol. Vol. 12, 1971 pp. 73–79

Hájek, P.: On interpret ability in set theories II, Comm. Math. Univ. Carol. Vol. 13, 1972 pp. 445–455

Hájek, P.: Experimental logics and Pi 0 3 theories, Journ. Symb. Log. Vol. 42, 1977 pp.515–522

Hájek, P.: Arithmetical complexity of some problems in computer science. In: Math.Foundations of Computer Science (Lect. Notes Comp. Sci. 53), Springer-Verlag, 1977 pp. 282–297

Hájek, P.: Arithmetical hierarchy and complexity of Computations, Theor. Comp. Sci. Vol. 8, 1979 pp. 227–237

Hájek, P.: On partially conservative extensions of arithmetic. In: Logic Colloquim 78, North-Holland Pub, 1979 pp. 225–234

Hájek, P.: Making dynamic logic first order. In: Mathematical foundations of Computer Science, (Lect. Notes Comp. Sci. 118), Springer-Verlag, 1981 pp. 287–295

Hájek, P.: On interpret ability in theories containing arithmetic II, Comm. Math. Univ.Carol. Vol. 22, 1981 pp. 617–688

Hájek, P.: Completion closed algebras and models of Peano arithmetic, Comm. Math. Univ. Carol. Vol. 22, 1981 pp. 585–594

Hájek, P.: Arithmetical interpretations of dynamic logic, Journ. Symb. Log. Vol. 48, 1983 pp. 704–713

Hájek, P.: On a new notion of partial conservativity. In: Computation and proof theory,Proc. Logic Colloq, Aachen 1983, Part II, (Lect. Notes Math. 1104), Springer-Verlag, 1984 pp. 217–232

Hájek, P.: Some coriservativeness results for non-standard dynamic logic. In: Demetrovics(ed.), Proc. Conf. on Algebra, Combinatorics and Logic in Comp. Sci, North-Holland, 1986 pp. 443–449

Hájek, P.: A simple dynamic logic, Theor. Comp. Sci. Vol. 46, 1986 pp. 239–259

Hájek, P.: Partial conservativity revisited, Comm. Math. Univ. Carol. Vol. 28, 1987 pp.679–690

Hájek, P.: Partial conservativity revisited, (abstract) Journ. Symb. Log. Vol. 52, 1987 pp.1066

Hájek, P.: Interpret ability and fragments of arithmetic. In: Arithmetic, Proof Theory and Computational Complexity, eds. Clote, P. and Krajíček, J., Oxford Univ. Press 1992, pp.185–196

Hájek, P., Hájková, M.: On interpretability in theories containing arithmetic, Fund.Math. Vol. 76, 1972 pp. 131–137

Hájek, P., Kučera, A.: On recursion theory in IΣ 1) Journ. Symb. Log. Vol. 54, 1989, pp.576–589

Hájek, P., Montagna, F.: ILM is the logic of П1 conservativity, Arch. Math. Log. Vol.30, 1990, pp. 113–123

Hajek, P., Montagna, F., Pudlák, P.: Abbreviating proofs using metamathematicalrules. In: Arithmetic, Proof Theory and Computational Complexity, eds. Clote, P. and Krajíček, J., Oxford Univ. Press 1992, pp. 197–221

Hájek, P., Paris, J. B.: Combinatorial principles concerning approximation of functions, Arch. Math. Log. Vol. 26, 1986 pp. 13–28

Hájek, P., Pudlák, P.: Two orderings of the class of all countable models of arithmetic. In: Model theory of algebra and arithmetic, (Lect. Notes Math. 843), Springer-Verlag, 1980 pp. 174–185

Hájková, M.: The lattice of binumerations of arithmetic, Comm. Math. Univ. Carol. Vol.12, 1971 pp. 81n,281n.

Handley, W. G.: Some machine characterizations of classes close to ∆N 0 , Ph. D. dissertation, Manchester University, Manchester, 1986 pp. iv+106 pp

Handley, W. G., Paris, J. B., Wilkie, A. J.: Characterizing some low arithmetic classes. In: Theory of algorithms (Pecs), Coll. Math. Soc. Janos Bolyai 44, 1984 pp. 353–364

Hardy, G. H., Wright, E. M.: An introduction to the theory of numbers, (3. ed.), Oxford Univ. Press, 1954

Harnik, V.: ω1-like recursively saturated models of Presburger's arithmetic, Journ. Symb.Log. Vol. 51, 1986 pp. 421–429

Harrington, L. A., Paris, J. B.: A mathematical incompleteness in Peano arithmetic. In: Handbook of Mathematical Logic (Stud Logic Found Math 90), North Holland: Amsterdam, 1977 pp. 1133–1142

Hart, J.: ℰ 0-arithmetic, Zeitschr. Math. Log. Grundl. Math. Vol. 15, 1969 pp. 237

Hartmanis, J., Hopcroft, J. E.: Independence results in computer science, SIGACTNews 8, 1976 No. 4 pp. 13–24

Hartmanis, J., Lewis, P. M., Stearns, R. E.: Hierarchies of memory limited computations, IEEE Conference Record on Switching Circuit Theory and Logical Design, Ann.Arbor, 1965 pp. 179–190

Hartmanis, J., Stearns, R. E. On the computational complexity of algorithms, Trans.Amer. Math. Soc., Vol. 117, 1965 pp. 285–306

Hauschild, K.: Über die Charakterisierbarkeit der Zahlenreihe in gewissen Nichtstandard-modellen der Arithmetik, Zeitschr. Math. Log. Grundl. Math. Vol. 9, 1963 pp. 113–116

Hauschild, K.: Nichtaxiomatisierbarkeit von Satzmengen durch Ausdriicke spezieller Gestalt, Fund. Math. Vol. 72, 1971 pp. 245–253

Van Heijenoort, J. (ED.): From Frege to Gödel, A Source Book in Mathematical Logic,1879–1931. Harvard Univ. Press 1967, 660 p.

Henkin, L.: A problem concerning provability, Journ. Symb. Log. Vol. 17, 1952 pp. 160

Henson, C. W., Kaufmann, M., Keisler, H. J.: The strength of nonstandard methodsin aritmetic, Journ. Symb. Log. Vol. 49, 1984 pp. 1039–1058

Herbrand, J.: Non-contradiction des axiomes arithmetiques, C. R. Acad Sci, Paris Vol.188, 1929 pp. 303–304

Herbrand, J.: Recherches sur la théorie de la démonstration (thesis, Paris), Prace Towarzystwa Naukowego Warszawskiego vol. III no. 33, 1930. (Chap. 5 see van Heienoort1967).

Herbrand, J.: Sur la non-contradiction de l'arithmétique, Journal für die Reine und Angewandte Mathematik Vol. 166, 1931 pp. 1–8

Hermes, H.: Ein mengentheoretisches Modell des Peanoschen Axiomensystem, Math Unterricht Vol. 13/3, 1967 pp. 5–31

Hilbert, D., Ackermann, W.: Grundziige der theoretischen Logik. Springer-Verlag, 1928,120 pp.

Hilbert, D., Bernays, P.: Grundlagen der Mathematik I, Springer-Verlag, 1934, 471 p.

Hilbert, D., Bernays, P.: Grundlagen der Mathematik II, Springer-Verlag, 1939, 561 p.

Hirose, K., Iida, S.: A proof of negative answer to Hilbert's 10th problem, Proc. Japan Acad. Vol. 49, 1973 pp. 10–12

Hirschfeld, J.: Existentially complete and generic structures in arithmetic. In: Dissertation, Yale, 1972

Hirschfeld, J.: Models of arithmetic and the semiring of recursive functions. In: Victoria Symposium on Non-Standard analysis (Lect. Notes Math. 369), Springer-Verlag, 1974 pp. 99–105

Hirschfeld, J.: Models of arithmetic and recursive functions, Israel J. Math. Vol. 20, 1975 pp. 111–126

Hirschfeld, J.: Finite forcing and generic filters in arithmetic. In: Model Theory and Algebra, A Memorial Tribute to Abraham Robinson, Springer-Verlag, 1975, pp. 172–199

Hirschfeld, J., Wheeler, W. H.: Forcing, arithmetic, division rings. In: (Lect. Notes Math. 454), Springer-Verlag, 1975, 266 p.

Hodges, W.: Interpreting number theory in nilpotent groups, Arch. Math. Log. Vol. 20,1980 pp. 103–111

Hodges, W.: Truth in a structure. In: Proc. of the Aristotelian Society (New series) vol.86, 1985/86, 135–151

Hopcroft, J. E., Paul, W., Valiant, L.: On time versus space and related problems, 16–th Symp. on Foundations of Comp. Sci., 1975 pp. 57–64

Höring, W.: Absolut unentscheidbare Sätze der Mathematik. In: Logik und Logikkalkül,Alber: Freiburg, 1962 pp. 189–194

Höward, P. E.: A proof of the theorem of Tennenbaum, Zeitschr. Math. Log. Grundl.Math. Vol. 18, 1972 pp. 111–112

Huber-Dyson, V., Jones, J. P., Sheperdson, J. C: Some diophantine forms of Gödel'stheorem, Arch. Math. Log. Vol. 22, 1982 pp. 51–60

Ignjatovic, A.: An ordering of the set of sentences of Peano arithmetic, Publ. Inst. Math,Nouv. Ser. Vol. 38 (52), 1985 pp. 13–15

Immerman, N.: Nondeterministic space is closed under complement. In: Proc. 3–rd Annual Conf. Structure in Complexity Theory, IEEE, 1988 pp. 112–115

Isaacson, D.: Arithmetical truth and hidden higher-order concepts. In: Logic Colloquium'85, Amsterdam: North-Holland, 1987 pp. 147–169

Jensen, D.: On local proof restrictions for strong theories, Diss. Math. Vol. 108, 1973 pp. 1–47

Jensen, D. Ehrenfeucht, A.: Some problem in elementary arithmetics, Fund. Math. Vol.92, 1976 pp. 223–245

Jensen, R. B.: Unbhängigkeitsbeweise in Teilsystemen der elementaren Zahlentheorie, Math. Ann. Vol. 173, 1967 pp. 102–126

Jeroslow, R. G.: Non-effectiveness in S. Orey's compactness theorem, Zeitschr. Math.Log. Grundl. Math. Vol. 17, 1971 pp. 285–289

Jeroslow, R. G.: Consistency statements in formal theories, Fund. Math. Vol. 72, 1971 pp. 17–40

Jeroslow, R. G.: Redundancies in the Hilbert-Bernays derivability conditions for Gödel'ssecond incompleteness theorem, Journ. Symb. Log. Vol. 38, 1973 pp. 359–367

Jeroslow, R. G.: Experimental logics and ∆0 0-theories, Journ. Phil. Log. Vol. 4, 1975 pp.253–267

Jervel, H. R.: Gentzen games. Z Math Logik Vol. 31, pp. 431–439

Jervel, H. R.: Large finite sets, Z Math Logik Vol. 31, pp. 545–549

Jockusch, C. G.: Ramsey's theorem and recursion theory, Journ. Symb. Log. Vol. 37,1972 pp. 268–280

Jockusch, C. G.: П0 1classes and boolean combinations of recursively enumerable sets,Journ. Symb. Log. Vol. 39, 1974 pp. 95–96

Jockusch, C. G., Soare, R. I.: П0 1-classes and degrees of theories, Trans. Amer. Math.Soc. Vol. 173, 1972 pp. 33–56

Jockusch, C. G., Soare, R. I.: Degrees of members of П0 1 classes, Pac. Journ. Math. Vol.40, 1972 pp. 605–616

Jones, J. P.: Formula for the n-th prime number, Can. Math. Bull. Vol. 18, 1975 pp.433–434

Jones, J. P.: Diophantine representation of the Fibonacci numbers, Fib. Quart. Vol. 13,1975 pp. 82–88

Jones, J. P.: Diophantine representation of the Lucas numbers, Fib. Quart. Vol. 14, 1976 pp. 134

Jones, J. P.: Three universal representation of recursively enumerable sets, Journ. Symb.Log. Vol. 43, 1978 pp. 335–351

Jones, J. P.: Diophantine representation of Mersenne and Fermat primes, Acta Arithmetica Vol. 35, 1979 pp. 209–221

Jones, J. P.: Udecidable Diophantine equations, Bull. Amer. Math. Soc. (NS) Vol. 3, 1980 pp. 859–862

Jones, J. P.: Universal diophantine equation, Journ. Symb. Log. Vol. 47, 1982 pp. 549–571

Jones, J. P., Levitz, H., Wilkie, A. J.: Classification of quantifier prefixes over exponential diophantine equations, Zeitschr. Math. Log. Grundl. Math. Vol. 32, 1986 pp.399–406

Jones, J. P., Matiyasevičyu., V.: Register machine proof of the theorem on exponentialdiophantine representation of enumerable sets, Journ. Symb. Log. Vol. 49, 1984 pp. 48–59

Jones, J. P., Sato, D., Wada, H., Wiens, D.: Diophantine representation of the set ofprime numbers, Amer. Math. Monthly Vol. 83, 1976 pp. 449–464

Jones, J. P., Shepherdson, J. C: Variants of Robinson's essentially undecidable theory R, Arch. Math. Log. Vol. 23, 1983 pp. 61–64

De Jongh, D.: A simplification of a completeness proof of Guaspari and Solovay, Studialogica Vol. 46, 1987 pp. 187–192

De Jongh, D.: Provability logics for relative interpretability (preprint for the Heytingconference Varna), 1988, 19 p.

De Jongh, D., Montagna, F.: Provable fixed points, Zeitschr. Math. Log. Grundl. Math. Vol. 34, 1988 pp. 229–250

De Jongh, D., Montagna, F.: Much shorter proofs, Report 87–13, Dept. Math. Univ.Amsterdam, 1987, 21 p.

De Jongh, D., Montagna, F.: Generic generalized Rosser fixed points, Studia logica Vol.46, 1987 pp. 193–203

De Jongh, D., Montagna, F.: Rosser orderings and free variables (preprint for Heytingconference Varna), 1988, 10 p.

De Jongh, D., Montagna, F.: Provable fixed points, Zeitschr. Math. Log. Grundl. Math. Vol. 34, 1988 pp. 229–250

Joseph, D., Young, P.: Independence results in computer science, Journ. Comp. Syst. Vol. 23, 1981 pp. 205–222

Joseph, D., Young, P.: A survey of some recent results on computational complexity inweak theories of arithmetic. In: Mathematical foundations of computer science (Lect.Notes. Comp. Sci 118), Springer-Verlag, 1981 pp. 46–60

Jumelet, M.: On Solovay's completeness theorem (thesis), Amsterdam, 1988, 28 p.

Kalsbeek, M. B.: An Orey sentence for predicative arithmetic (master's thesis), Amsterdam 1988

Kamo, S.: Nonstandard natural number systems and nonstandard models, Journ. Symb.Log. Vol. 46, 1981 pp. 365–376

Kanamori, A., Mcaloon, K.: On Gödel incompleteness and finite combinatorics, Ann.Pure Appl. Logic Vol. 33, 1987 pp. 23–41

Kanovic, M. I.: An estimate of complexity of arithmetic incompleteness, Doklady Akad. Nauk SSSR Vol. 238, 1978 pp. 1283–1286

Kanovic, M. I.: Nezavisimost invariantnych predlozenij, Doklady Akad. Nauk SSSR, 1984 No. 276 pp. 27–31

Karp, R. M.: Reducibility among combinatorial problems, in Complexity of Computer Computations, Miller, and Thatcher, eds., Plenum Press, New York 1972 pp. 85–103

Karp, R. M., Lipton, R. J.: Some connections between nonuniform and uniform complexity classes. In: Proc. 12–th Annual ACM Symp. on Theory of Computing, 1980, pp.302–309

Kaufmann, M.: A rather classless model, Proc. Amer. Math. Soc. Vol. 62, 1977 pp. 330–333

Kaufmann, M.: On existence Σn -end extensions. In: Logic Year 1979–80. The Universityof Connecticut (Lect. Notes Math. 859), Springer-Verlag, 1981 pp. 92–103

Kaufmann, M.: On expandability of models of arithmetic and set theory to models ofweak second-order theories, Fund. Math. Vol. 122, 1984 pp. 57–60

Kaufmann, M., Schmerl, J. H.: Saturation and simple extensions of models of Peano-arithmetic, Annals Pure Appl. Logic Vol. 27, 1984 pp. 109–136

Kaufmann, M., Schmerl, J. H.: Remarks on weak notions of saturation in models of Peano arithmetic, Journ. Symb. Log. Vol. 52, 1987 pp. 129–148

Kaye, R.: Characterizing some low complexity classes using weak theories of arithmetic,Transfer Report, Manchester University, 1985

Kaye, R.: Parameter free induction. In: Proc. of the 5th Easter conf. on model theory(Humboldt univ. Berlin), 1987

Kaye, R.: Diophantine and parameter-free induction (thesis), Manchester University, 1987

Kaye, R.: Axiomatizations and quantifier complexity. In: Proc. of the 6th Easter conf. onmodel theory (Humboldt Univ. Berlin), 1988, pp. 65–84

Kaye, R.: On functions provably E 1in open induction, 1985 (manuscript)

Kaye, R.: Parameter-free universal induction, Zeitschr. f. Math. Logik 35, 1989, pp. 443–456

Kaye, R.: Diophantine induction, Annals of Pure and Appl. Logic 46, 1990, pp. 1–40

Kaye, R.: Models of Peano arithmetic, Oxford Logic Guides, Oxford Univ. Press 1991,292 pp.

Kaye, R.: Model-theoretic properties characterizing Peano arithmetic, Journ. Symb. Logic 56, 1991, pp. 949–963

Kaye, R.: On cofinal extensions of models of fragments of arithmetic, Notre Dame J. of Formal Logic 32, 1991, pp. 399–408

Kaye, R.: Open induction, Tennenbaum phenomena, and complexity theory. In: Arithmetic, Proof Theory and Computational Complexity, eds. Clote, P. and Krajíček, J., Oxford Univ. Press 1992, pp. 222–237

Kaye, R.: Using Herbrand-type theorems to separate, strong fragments of arithmetic. In:Arithmetic, Proof Theory and Computational Complexity, eds. Clote, P. and Krajíček, J., Oxford Univ. Press 1992, pp. 238–246

Kaye, R., Kossak, R., Kotlarski, H.: Automorphisms of recursively saturated models ofarithmetic, Annals of Pure and Appl. Logic 55, 1991, pp. 67–99

Kaye, R., Paris, J. B., Dimitracopoulos C: On parameter free induction schemas, Journ. of Symb. Logic 53, 1988, pp. 1082–1097

Keller, J. P., Richard, D.: Remarques sur les structures additives des modèles del'arithmétique, Comptes Rendus, Sér. A Vol. 287, 1978 pp. 101–104

Kemeny, J. G.: Undecidable problems of elementary number theory, Math. Ann. Vol. 135,1958 pp. 160–169

Kent, C. F.: The relation of A to prov ‘A’ in the Lindenbaum sentence algebra, Journ.Symb. Log. Vol. 38, 1973 pp. 295–298

Kent, C. F.: “Disorder” in lattices of binumerations, Comm. Math. Univ. Carol. Vol. 15,1974 pp. 221–244

Kent, C. F.: Independence versus logical independence in the countable case. In: Logic Colloquium 73, North Holland: Amsterdam, 1975, pp. 399–408

Ketonen, J., Solovay, R. M.: Rapidly growing Ramsey functions, Ann. Math. Vol. 113,1981 pp. 267–314

Kino, A.: On provably recursive functions and ordinal recursive functions, Journ. Math.Soc. Japan Vol. 20, 1968 pp. 456–476

Kirby, L. A. S.: Initial segments of models of arithmetic. In: Dissertation, Manchester,1977

Kirby, L. A.S. : La méthode des indicatrices et le theorème d'incomplétude. In: Models of arithmetic (Sem, Univ. Paris VII, Paris, 1977) (French), Soc. Math. France, Paris,1980 pp. 5–18

Kirby, L. A.S. : Flipping properties in arithmetic, Journ. Symb. Log. Vol. 47, 1982 pp.416–422

Kirby, L. A.S. : Ultrafilters and types on models of arithmetic, Annals Pure Appl. Logic Vol. 27, 1984 pp. 215–252

Kirby, L. A.S., Mc Aloon, K., Murawski, R.: Indicators, recursive saturation andexpandability, Fund. Math. Vol. 114, 1981 pp. 127–139

Kirby, L. A.S., Paris, J. B.: Initial segments of models of Peano's axioms. In: Set Theory and Hierarchy Theory V. Proceedings of the 3rd Conference on Set Theory and Hierarchy Theory, Springer-Verlag, 1977 pp. 211–226

Kirby, L. A.S., Paris, J. B.: Σn collection schemas in arithmetic. In: Logic Colloquium 77 (Stud Logic Found Math 96), North Holland: Amsterdam, 1978 pp. 199–209

Kirby, L. A.S., Paris, J. B.: Accessible independence results for Peano arithmetic, Bull. London Math. Soc. Vol. 14, 1982 pp. 285–293

Kiss, P.: Diophantine representation of generalized Fibonacci numbers, Elemente der Math. Vol. 34, 1979 pp. 129–132

Kleene, S.: Recursive functions and predicates, Trans. Amer. Math. Soc. Vol. 53, 1943 pp. 41–73

Kleene, S. C: A symmetric form of Gödel's numbers, Indag. Math. Vol. 12, 1950 pp. 244–246

Kleene, S. C: Finite axiomatizability of theories in the predicate calculus using additional predicate symbols. Memoirs of the Amer. Math. Soc, 1951 pp. 27–66 (Russian translation in Matematiceskaja teoria logiceskogo vyvoda, Nauka 1967, 237–284)

Kleene, S. C: On the forms of predicates in the theory of constructive ordinals I, Amer. Journ. of Math. Vol. 66, 1944, pp. 41–58

Kleene, S. C: Introduction to metamathematics, North Holland, Amsterdam, 1952, 550 p.

Kleene, S. C: On the forms of predicates on the theory of constructive ordinals II, Amer.Journ. of Math, vol 77, 1955, pp. 405–428

Kleene, S. C: Mathematical logic, Wiley & Sons: New York, 1967, 398 p.

Klingen, N.: Zur Idealstruktur in Nichtstandardmodellen von Dedekindringen, Journ.Reine Angew. Math Vol. 274/275, 1975 pp. 38–60

Knight, J. F.: Complete types and the natural numbers, Journ. Symb. Log. Vol. 38, 1973 pp. 413–415

Knight, J. F.: Types omitted in uncountable models of arithmetic, Journ. Symb. Log.Vol. 40, 1975 pp. 317–320

Knight, J. F.: Omitting types in set theory and arithmetic, Journ. Symb. Log. Vol. 41,1976 pp. 25–32

Knight, J. F.: Hanf numbers for omitting types over particular theories, Journ. Symb.Log. Vol. 41, 1976 pp. 583–588

Knight, J. F.: Models of arithmetic and closed ideals, Journ. Symb. Log. Vol. 47, 1982 pp. 833

Knight, J. F: Additive structure in uncountable models for a fixed completion of P, Journ.Symb. Log. Vol. 48, 1983 pp. 623–628

Knight, J. F.: Effective construction of models. In: Logic Colloquium '84 (Studies in Logicand the Foundations of Mathematics 120), North-Holland, 1986 pp. 105–119

Knight, J. F., Lachlan, A. H., Soare, R. I.: Two theorems on degrees of models of truearithmetic, Journ. Symb. Log. Vol. 49, 1984 pp. 425–436

Knight, J. F., Nadel, M.: Expansions of models and Turing degrees, Journ. Symb. Log.Vol. 47, 1982 pp. 587

Kochen, S., Kripke, S. A.: Nonstandard models of Peano arithmetic, Enseign. Math., Ser 2 Vol. 28, 1982 pp. 211–231

König, D.: Über eine Schlußweise aus dem Endlichen ins Unendliche, Acta litterarum acscientiarum Regiae Universitatis Hungaricae Francisco-Josephinae, Sectio scientiarummathematicarum Vol. 3, 1927, pp. 121–130

Koppel, M.: Some decidable Diophantine problems: positive solution to a problem of Davis, Matiyasevič and Robinson, Proc. Amer. Math. Soc. Vol. 77, 1979 pp. 319–323

Kossak, R.: An application of definable types of Peano's arithmetic, Bull. Acad. Polon.Sci. Vol. 28, 1980 pp. 213–217

Kossak, R.: A certain class of models of Peano arithmetic, Journ. Symb. Log. Vol. 48,1983 pp. 311–320

Kossak, R.: L∞,ω 1-elementary equivalence of ω 1-like models of PA, Fund. Math. Vol. 123,1984 pp. 123–131

Kossak, R.: A note on satisfaction classes, Notre Dame Journ. Formal Log. Vol. 26, 1985 pp. 1–8

Kossak, R.: Recursively saturated ω 1-like models of arithmetic, Notre Dame Journ. Formal Log. Vol. 26, 1985 pp. 413–422

Kossak, R.: Remarks on free sets, Bull. Pol. Acad. Sci. Vol. 34, 1986 pp. 117–122

Kossak, R.: Models with the ωproperty, Journ. Symb. Log. Vol. 54, 1989 pp. 177–189

Kossak, R., Kotlarski, H.: Results on automorphisms of recursively saturated models of PA, Fund. Math. Vol. 129, 1988 pp. 1–7

Kossak, R., Paris, J. B.: Subsets of models of arithmetic. In: Open Days in Model Th. & Set Th.; 1981 Jadwisin, 1981 pp. 159–174

Kossovsky, N. K.: Diophantine representation of the sequence of solutions to the Pellequation, Zap. naučn. sem. Leningr. otdel. Mat. in-ta V. A. Steklova Vol. 20, 1971 pp.28–35

Kotlarski, H.: On Skolem ultrapowers and their non-standard variant, Zeitschr. Math.Log. Grundl. Math. Vol. 26, 1980 pp. 227–236

Kotlarski, H.: On elementary cuts in models of arithmetic, Bull. Acad. Polon. Sci. Vol.29, 1981 pp. 419–423

Kotlarski, H.: On confinal extensions of models of arithmetic, Journ. Symb. Log. Vol.48, 1983 pp. 253–262

Kotlarski, H.: On elementary cuts in models of arithmetic, Fund. Math. Vol. 115, 1983 pp. 27–31

Kotlarski, H.: On elementary cuts in recursively saturated models of Peano arithmetic, Fund. Math. Vol. 120, 1984 pp. 205–222

Kotlarski, H.: Some remarks on initial segments in models of Peano arithmetic, Journ.Symb. Log. Vol. 49, 1984 pp. 955–960

Kotlarski, H.: Bounded induction and satisfaction classes. In: Proceedings of the 3rd Easter Conference on Model Theory, Humboldt-Univ. Berlin: Berlin, 1985 pp. 143–167

Kotlarski, H.: The recursively saturated part of models of Peano arithmetic, Zeitschr.Math. Log. Grundl. Math. Vol. 32, 1986 pp. 365–370

Kotlarski, H.: Bounded induction and satisfaction classes, Zeitschr. Math. Log. Grundl.Math. Vol. 32, 1986 pp. 531–544

Kotlarski, H.: On the end extension problem for ∆ 0 –PA(S), Zeitschr. f. Math. Logik 35,1989, pp. 391–397

Kotlarski, H., Krajewski, S., Lachlan, A. H.: Construction of satisfaction classes fornonstandard models, Canad Math Bull Vol. 24, 1981 pp. 283–293

Kotlarski, H., Ratajczyk, Z.: A weak extension of bounded induction in the languagewith a satisfaction class, Journ. Symb. Log. Vol. 52, 1987 pp. 1070

Kotlarski, H., Ratajczyk, Z.: Inductive full satisfaction classes, Annals Pure Appl. Logic Vol. 47, 1990, pp. 199–223

Krajewski, S.: Predicative expansions of axiomatic theories, Zeitschr. Math. Log. Grundl.Math. Vol. 20, 1974 pp. 435–452

Krajewski, S.: Mutually inconsistent satisfaction classes, Bull. Acad. Polon. Sci. Vol. 22,1974 pp. 983–987

Krajewski, S.: A remark on automorphisms and nonstandard properties, Bull. Acad.Polon. Sci. Vol. 22, 1974 pp. 989–991

Krajewski, S.: Non-standard satisfaction classes. In: Set Theory and Hierarchy Theory.A Memorial Tribute to Andrzej Mostowski. Proceedings of the 2nd Conference on Set Theory and Hierarchy Theory (Lect. Notes. Math 537), Springer-Verlag, 1976 pp. 121–144

Krajewski, S.: A note on expansion of models of set theories. In: Set Theory and Hierarchy Theory. Proceedings of the 1st Colloquium in Set Theory and Hierarchy Theory,Politechnical University Wroclaw, 1977 pp. 63–67

Krajíček, J.: Generalizations of proofs. In: Proc. 8–th Easter Conference on Model Theory,Wendisch-Rietz, 1987 pp. 82–99

Krajíček, J.: A note on proofs of falsehood, Arch. Math. Log. Vol. 26, 1987 pp. 169–176

Krajíček, J.: Speed-up for propositional Prege systems via generalizations of proofs, Comm. Math. Univ. Carol, Vol. 30, 1989, pp. 137–140

Krajíček, J.: On the number of steps in proofs, Ann. Pure Appl. Logic, Vol. 41, 1989, pp.153–178

Krajíček, J.: A theorem on uniform provability of schemes. In: Proc. 6–th Easter Conf.on Model Theory, Wendisch-Rietz, 1988 pp. 85–92

Krajíček, J.: Exponentiation and second order bounded arithmetic, Ann. Pure Appl.Logic, Vol. 48, 1990, pp. 261–276

Krajíček, J.: No counter-example interpretation and interactive computation. In: Logicfrom Computer Science, ed. Moschovakis, Y. N., Springer-Verlag 1992, pp. 287–293

Krajíček, J.: Fragments of Bounded Arithmetic and bounded query classes, Transactions AMS, to appear

Krajíček, J., Pudlák, P.: The number of proof lines and the size of proofs in first orderlogic, Arch. Math. Log. Vol. 27, 1988 pp. 69–84

Krajíčef, J., Pudlák, P.: On the structure of initial segments of models of arithmetic, Arch. Math. Log. Vol. 28, 1989 pp. 91–98

Krajíček, J., Pudlák, P.: Propositional provability and models of weak arithmetic. In:Proc. Computer Science Logic '89, (Lect. Notes Comp. Sci. 440), Springer-Verlag, 1990,pp. 193–210

Krajíček, J., Pudlák, P.: Propositional proof systems, the consistency of first ordertheories and the complexity of computations, Journ. Symb. Log Vol. 54, 1989 pp. 1063–1079

Krajíček, J., Pudlák, P.: Quantified propositional calculi and fragments of boundedarithmetic, Zeitschr. Math. Log. Grundl. Math Vol. 36, 1989 pp. 29–46

Krajíček, J., Pudlák, P., Takeuti, G.: Bounded Arithmetic and the Polynomial Hierarchy, Annals of Pure and Appl. Logic 52, pp. 143–154

Krajíček, J.,Takeuti, G.: On induction-free provability, Annals of Mathematics and Artificial Intelligence, (to appear)

Krajíček, J.,Takeuti, G.: On bounded Σ 1 1polynomial induction. In: Feasible Mathematics, Buss, Scott eds., Birkhäuser 1990, pp. 259–280

Kreisel, G.: A survey of proof theory II. In: Proceedings of the Second Scandinavian Logic Symposium, North Holland: Amsterdam pp. 109–170

Kreisel, G.: Informal rigour and completeness proofs. In: Proceedings of the International Colloquium in the Philosophy of Science Vol. 1, North-Holland: Amsterdam, 1967, pp.138–186

Kreisel, G.: Note on arithmetic models for consistent formulae of the predicate calculus I, Fund. Math. Vol. 37, 1950 pp. 265–285

Kreisel, G.: On the interpretation of non-finitist proofs I, Journ. Symb. Logic Vol. 16,1951 pp. 241–267

Kreisel, G.: On the concepts of completeness and interpretation of formal systems, Fund.Math. Vol. 39, 1952 pp. 103–127

Kreisel, G.: Some concepts concerning formal systems of number theory, Zeitschr. Math.Log. Grundl. Math. Vol. 57, 1952 pp. 1–12

Kreisel, G.: On the interpretation of non-finitist proofs II. Interpretation of numbertheory. Applications, Journ. Symb. Log. Vol. 17, 1952 pp. 43–58

Kreisel, G.: The diagonal method in formalized arithmetic, Brit. Journ. Phil. Sci. Vol. 3,1953 pp. 364–373

Kreisel, G.: On a problem of Henkin's, Indag. Math. Vol. 15, 1953 pp. 405–406

Kreisel, G.: Note on arithmetic models for consistent formulae of the predicate calculus II. In: Actes du lleme Congres International de Philosophic, North Holland: Amsterdam Vol. 14, 1953 pp. 39–49

Kreisel, G.: A variant to Hilbert's theory of the foundations of arithmetic,Br. J. Phil.Sci. Vol. 4, 1953 pp. 107–129

Kreisel, G.: Remark on complete interpretations by models, Arch. Math. Log. Vol. 2,1954 pp. 4–9

Kreisel, G.: Models, translations and interpretations. In: Mathematical Interpretationof Formal Systems; 1954 Amsterdam (Stud Logic Found Math 10), North Holland,Amsterdam, 1955 pp. 26–50

Kreisel, G.: Gödel's interpretation of Heyting's arithmetic. In: Summaries of Talks Presented at the Summer Institute for Symbolic Logic, Institute for Defense Analyses,Comm. Res. Division, 1957 pp. 125–133

Kreisel, G.: On weak completeness of intuitionistic predicate logic, Journ. Symb. Log.Vol. 27, 1962 pp. 139–158

Kreisel, G.: Foundations of intuitionistic logic. In: Logic, Methodology and Philosophy of Science, Stanford, 1962, pp. 198–210

Kreisel, G.: Mathematical logic. In: Lect. Modern Math., III, Wiley, New York, 1965, pp.95–195

Kreisel, G.: A survey on proof theory, Journ. Symb. Log. Vol. 33, 1968 pp. 321–388

Kreisel, G.: Axiomatizations of nonstandard analysis that are conservative extensionsof formal systems for classical standard analysis. In: Applications of Model Theory to Algebra, Analysis and Probability, Holt, Rinehart and Winston, 1969 pp. 93–106

Kreisel, G.: Which number theoretic problems can be solved in recursive progressions onП 1 1-paths through O?, Journ. Symb. Log. Vol. 37, 1972 pp. 311–334

Kreisel, G.: Observations on a recent generalization of completeness theorems due to Schiitte. In: Proof Theory Symposion, Kiel 1974 (Lect. Notes Math. 500), Springer-Verlag, 1975 pp. 164–181

Kreisel, G.: What have we learnt from Hilbert's second problem? In: Mathematical Developments Arising From Hilbert's Problems, Amer. Math. Soc: Providence, 1976, pp. 93–130

Kreisel, G.: Wie die Beweistheorie zu ihren Ordinalzahlen kam und kommt, Jber. d. Dt.Math.-Verein. Vol. 78, 1977 pp. 177–223

Kreisel, G.: Finiteness theorems in arithmetic: an application of Herbrand's theorem forΣ 2formulas. In: Proceedings of the Herbrand Symposium. Logic Colloquium '81 (Stud Logic Found Math 107), North Holland: Amsterdam, 1982 pp. 39–55

Kreisel, G., Levy, A.: Reflections principles and their use for establishing the complexityof axiomatic systems, Zeitschr. Math. Log. Grundl. Math. Vol. 14, 1968 pp. 97–142

Kreisel, G., Minc, G. E. Simpson, S. G.: The use of abstract languages in elementarymathematics: some pedagogic examples. In: Logic Colloquium, Springer-Verlag, 1975 pp. 38–131

Kreisel, G., Shoenfield, J. R., Wang, H.: Number theoretic concepts and recursivewell-orderings, Arch. Math. Log. Vol. 5, 1959 pp. 42–64

Kreisel, G., Takeuti, G.: Formally self-referential propositions in cut-free classical analysis and related systems. Diss. Math. Vol. 118, 1974 pp. 1–50

Kreisel, G., Wang, H.: Some applications of formalized consistency proofs, Fund. Math.Vol. 42 (dod. 45), 1955 pp. 101 n. (334)

Kriauciukas, V.: A Diophantine representation of perfect numbers, Zap. naučn. sem.Leningr. otdel. Mat. in-ta V. A. Steklova Vol. 88, 1979 pp. 78–89

Kripke, S. A.: “Flexible” predicates of formal number theory, Proc. Amer. Math. Soc. Vol. 13, 1962 pp. 647–650

Kripke, S. A., Pour-El, M. B.: Deduction preserving recursive isomorphisms of theories, Fund. Math. Vol. 61, 1967 pp. 141–147

Kucera, A.: Measure, П 0 1-classes and complete extensions of PA. In: Recursion Theory Week (Lect. Notes Math. 1141), Springer-Verlag, 1985 pp. 245–259

Kučera, A.: Alternative, priority-free constructions of some r. e. degrees and other resultson degrees, Journ. Symb. Log. Vol. 52, 1987 pp. 1071

Kurata, R.: The reflection principle, transfinite induction, and the Paris-Harrington principle. In: Boolean-Algebra-Valued Analysis and Nonstandard Analysis, Kyoto Univ Res Inst Math Sci: Kyoto, 1981 pp. 1–14

Kurata, R.: Paris-Harrington theory and reflection principles, Saitama Math. J. Vol. 2,1984 pp. 33–45

Kurata, R.: A simple proof for a statement which is equivalent to Harrington's principle.(abstract), Journ. Symb. Log. Vol. 50, 1985 pp. 268

Kurata, R.: Paris-Harrington theory and principles, (abstract), Journ. Symb. Log. Vol.51, 1986 pp. 489

Kurata, R.: Paris-Harrington principles, reflection principles and transfinite induction upto ℰ0 , Annals Pure Appl. Logic Vol. 31, 1986 pp. 237–256

Lachlan, A. H.: Full satisfaction classes and recursive saturation, Canad. Math. Bull. Vol.24, 1981 pp. 295–297

Ladner, R. E.: On the structure of polynomial time reducibility, Journ. of ACM Vol. 22,1975 pp. 155–171

Lascar, D.: Une indicatrice de type “Ramsey” pour l'arithmétique de Peano et la formulede Paris-Harrington. In: Models of arithmetic (Sem, Univ. Paris VII, Paris, 1977), Soc.Math. Prance, Paris, 1980 pp. 19–30

Van Leeuwen, J. (ED.): Handbook of Theoretical Computer Science, Vol. A – Algorithmsand Complexity, North-Holland, 1990

Leivant, D.: On the proof theory of the modal logic for arithmetic provability, Journ.Symb. Log. Vol. 46, 1981 pp. 531–538

Lesan, H.: Models of arithmetic. Dissertation, Manchester, 1978

Levitz, H.: An ordered set of arithmetic functions representing the least epsilon-number,Zeitschr. Math. Log. Grundl. Math. Vol. 21, 1975 pp. 115–120

Levitz, H.: An initial segment of the set of polynomial functions with exponentiation, Alg.Universalis Vol. 7, 1977 pp. 133–136

Levitz, H.: An ordinal bound for the set of polynomials with exponentiation,Alg. Universalis Vol. 8, 1978 pp. 233–243

Lindström, P.: Some results on relative interpret ability, Phil, communications, red series, No. 7, Univ. of Goteborg, 1978

Lindström, P.: Some results on interpretability. In: Proc. 5th Scand. Symp. (Jensen et al,ed.), Aalborg, 1979 pp. 329–361

Lindström, P.: Notes on partially conservative sentences and interpretability, Phil, communications, red series, No. 13, Univ. of Goteborg, 1980

Lindström, P.: More on partially conservative sentences and interpretability, Proc. Amer.Math. Soc. Vol. 91, 1984 pp. 436–443

Lindström, P.: On certain lattices of degrees of interpretability, Notre Dame Journ. Formal Log. Vol. 25, 1984 pp. 127–140

Lindström, P.: On faithful interpretability. In: Computation and proof theory, Proc. Logic Colloq, Aachen 1983, Part II, (Lect. Notes Math. 1104), Springer-Verlag, 1984 pp. 279–288

Lindström, P.: On partially conservative sentences and interpretability, Proc. Amer.Math. Soc. Vol. 91, 1984 pp. 436–444

Lindström, P.: Notes on formulas with prescribed properties in arithmetical theories, Philosophical Communications, red series No. 25, Univ. of Goteborg, 1984

Lindström, P.: Provability and interpretability in theories containing arithmetic. In: Attidegli incontri di logica matematica, Vol. 2, Siena / Italia 1983/84, 1985 pp. 431–451

Lindström, P.: Partially generic formulas in arithmetic, Notre Dame Journ. Formal Log. Vol. 29, 1988 pp. 185–192

Lipshitz, L.: Undecidable existential problems for addition and divisibility in algebraicnumber rings II, Proc. Amer. Math. Soc. Vol. 64, 1977 pp. 122–128

Lipshitz, L.: Undecidable existential problems for addition and divisibility in algebraicnumber rings, Trans. Amer. Math. Soc. Vol. 241, 1978 pp. 121–128

Lipshitz, L.: The Diophantine problem for addition and divisibility, Trans. Amer. Math.Soc. Vol. 235, 1978 pp. 271–284

Lipshitz, L.: Diophantine correct models of arithmetic. Proc. Amer. Math. Soc. Vol. 73, 1979 pp. 107–108

Lipshitz, L., Nadel, M. E.: The additive structure of models of arithmetic, Proc. Amer.Math. Soc. Vol. 68, 1978 pp. 331–336

Lipton, R. J.: On consistency of P=NP and fragments of arithmetic. In: Fundamentals of Computation Theory - FCT'79, Akademie Verlag: Berlin, 1979 pp. 269–278

Loeb, M. H.: Solution of a problem by Leon Henkin. In: Proceedings of the International Congres of Mathematicians 1954, North Holland, Amsterdam Vol. 2, 1954 pp. 405–406

Loeb, M. H.: Solution of a problem of Leon Henkin, Journ. Symb. Log. Vol. 20, 1955 pp.115–118

Loeb, M. H., Wainer, S. S.: Hierarchies of number-theoretic functions I, II, Arch. Math.Log. Vol. 13, 1970, pp. 39–51, 97–113 (a correction on Vol. 14, 1971, 198–199

Loebl, M.: Hercules and Hydra, a game on rooted finite trees, Comm. Math. Univ. Carol. Vol. 26, 1985 pp. 259–267

Lopez-Escobar, E. G. K.: König's lemma, the ω-rule and primitive recursive arithmetic, Arch. Math. Log. Vol. 25, 1985 pp. 67–74

Loś, J.: On the extending of models I, Fund. Math. Vol. 42, 1955, 38–54

MacDowell, R., Specker, E.: Modelle der Arithmetik. In: Infinitistic Methods. Proceedings of the Symposium on Foundations of Mathematics, PWN: Warsaw, 1961 pp.257–263

Macintyre, A.: Ramsey quantifiers in arithmetic. In: Model theory of algebra and arithmetic (Proc. Conf, Karpacz, 1979) (Lect. Notes Math. 834), Springery-Verlag, 1980 pp.186–210

Macintyre, A.: Nonstandard number theory. In: Proceedings of the International Congress of Mathematicians, Academia Scientiarum Fennica: Helsinki Vol. 1, 1980 pp.253–262

Macintyre, A.: The laws of exponentiation. In: Model theory and arithmetic (Paris,1979–1980) (Lect. Notes Math. 890), Springer-Verlag, 1981 pp. 185–197

Macintyre, A.: A theorem of Rabin in a general setting. Bull. Soc. Math. Belg., Ser B Vol. 33, 1981 pp. 53–63

Macintyre, A.: Residue fields of models of P. In: Proceedings of the 6th International Congres for Logic, Methodology and Philosophy of Science (Stud Logic Found Math104), North Holland: Amsterdam, 1982 pp. 193–206

Macintyre, A.: The strength of weak systems. In: Schriftenreihe der Wittgenstein-Gesellschaft, 13 Logic, Philosophy of Science and Epistemology, Wien, 1987 pp. 43–59

Macintyre, A., Marker, D.: Degrees of recursively saturated models, Trans. Amer. Math.Soc. Vol. 282, 1984 pp. 539–554

Macintyre, A., Marker, D.: Primes and their residue rings in models of open induction, Annals of Pure and Appl. Log. Vol. 43, 1989, pp. 57–77

Macintyre, A., Simmons, H.: Gödel's diagonalization technique and related properties oftheories. In: Colloquium Mathematicum, Academie Polonaise des Sciences,Inst Math:Warsaw Vol. 28, 1973 pp. 165–180, 329

Macintyre, A., Simmons, H.: Algebraic properties of number theories, Israel Journ. Math. Vol. 22, 1975 pp. 7–27

Magari, R.: Meaning and truth in the Peano arithmetic, Atti dela Accademia Nazionaledei Lincei. Rendiconti. Classe di Science Fisiche, Matematiche e Naturali. Serie VIII Vol. 54, 1973 pp. 902–903

Magari, R.: Significate e verita nell’ aritmetice peaniane, Annali di Mat. pure ed applicate Vol. 103, 1974 pp. 343–368

Magari, R.: Sur certe teorie non enumerabili, Annali di Mat. pure ed applicate Vol. 103,1974 pp. 119–152

Magari, R.: The diagonalizable algebras (The algebraization of the theories which express Theor. II), Boll Unione Mat Ital (IV Ser.) Vol. 12, 1975 pp. 117–125

Magari, R.: Representation and duality theory for diagonalizable algebras (The algebraization of theories which express Theor; IV.), Studia Logica Vol. 34, 1975 pp. 305–313

Magari, R.: Problemi aperti sulle algebre diagonali, Rend. Sem. Mat. Fis. Milano Vol. 44,1975 pp. 75–90

Magari, R.: Metodi algebrici in teoria della dimostrazione, Boll. Un. Math. Ital. Vol. 12, 1975 pp. 252–261

Magari, R.: On the autological character of diagonalizable algebras, Studia Logica Vol.35, 1976 pp. 327–333

Magari, R.: Modal diagonalizable algebras, Boll. Un. Math. Ital. B Vol. 15, 1978 pp.303–320

Malyaukene, L. K.: A constructive proof of the replaceability of the induction axiom in the free variable multiplicative arithmetic, Litovsk. Mat. Sb. Vol. 23, 1983 pp. 78–93

Malyaukene, L. K.: On the question of the relation between some weak inductions, Mat.Logika Primen. Vol. 3, 1983 pp. 34–37

Manders, K. L.: Computional complexity of decision problems in elementary numbertheory. In: Model Theory of Algebra and Arithmetic (Lect. Notes Math. 834), Springer- Verlag, 1980 pp. 211–227

Manders, K. L., Adleman, L.: NP-complete decision problems for binary quadratics, Journ. Comp. Sys. Sci. Vol. 15, 1978 pp. 168–184

Manevitz, L. M.: Internal end-extensions of Peano arithmetic and a problem of Gaifman, Journ. London Math. Soc, Ser 2 Vol. 13, 1976 pp. 80–82

Manevitz, L. M., Stavi, J.: ∆ 0 2operators and alternating sentences in arithmetic, Journ.Symb. Log. Vol. 45, 1980 pp. 144–154

Mar'tjanov, V. I.: Universal extended theories of integers, Algebra i Logika Vol. 16, 1977 pp. 588–602

Margenstern, M.: Le theorème de Matiyassevitch et result at sconnexes. In: Model Theoryand Arithmetic Comptes Rendus d'une Action Thématique Programmée du C. N. R.S. sur la Théorie des Mod’ eles et l'Arithmétique, Paris, Prance, 1979/80 (Lect. Notes Math. 890), Springer-Verlag, 1981 pp. 198–241

Marker, D.: Degrees of models of true arithmetic. In: Proceedings of the Herbrand Symposium Logic. Colloquium '81 (Stud Logic Found Math 107), North Holland: Amsterdam, 1982 pp. 233–242

Matiyasevič, Yu.: Arithmetic representations of powers. Zap. naučn. sem. Leningr. otdel.Mat. in-ta V. A. Steklova Vol. 8, 1968 pp. 159–165

Matiyasevič, Yu.: TWO reductions of Hilbert's tenth problem, Zap. naučn. sem. Leningr.otdel. Mat. in-ta V. A. Steklova Vol. 8, 1968 pp. 144–158

Matiyasevič, Yu.: The connection between Hilbert's tenth problem and systems of equations between words and lengths, Zap. naučn. sem. Leningr. otdel. Mat. in-ta V. A.Steklova Vol. 8, 1968 pp. 132–144

Matiyasevič, Yu.: The Diophantineness of enumerable sets, Doklady Akad. Nauk SSSR Vol. 191, 1970 pp. 279–282

Matiyasevič, Yu.: Diophantine representation of enumerable predicates, Izv. AN SSSR Vol. 35, 1971 pp. 3–30

Matiyasevič, Yu.: Diophantine representation of the set of prime numbers, Doklady Akad.Nauk SSSR Vol. 196, 1971 pp. 770–773

Matiyasevič, Yu.: Diophantine representation of recursively enumerable predicates. In: Actes du Congrès International des Mathématiciens 1970, Gauthier Villars: Paris, 1971, pp. 235–238

Matiyasevič, Yu.: Diophantine representation of recursively enumerable predicates. In: Proceedings of the Second Scandinavian Logic Symposium, North-Holland: Amsterdam, 1971, pp. 171–177

Matiyasevič, Yu.: Arithmetical representations of enumerable sets with a small number of quantifiers, Zap. naučn. sem. Leningr. otdel. Mat. in-ta V. A. Steklova Vol. 32, 1972 pp. 77–84

Matiyasevič, Yu.: Diophantine sets, Uspekhi Matem. Nauk. Vol. 27, 1972 pp. 185–222

Matiyasevič, Yu.: On recursive unsolvability of Hilbert's tenth problem. In: Logic, Methodology and Philosophy of Science IV, North-Holland: Amsterdam, 1973, pp. 89–110

Matiyasevič, Yu.: The existence of non-effectivizable bounds in the theory of exponential Diophantine equations, Zap. naučn. sem. Leningr. otdel. Mat. in-ta V. A. Steklova Vol.40, 1974 pp. 77–93

Matiyasevič, Yu.: A new proof of the theorem on exponential Diophantine representationof recursively enumerable predicates, Zap. naučn. sem. Leningr. otdel. Mat. in-ta V. A.Steklova Vol. 60, 1976 pp. 75–92

Matiyasevič, Yu.: Primes are non-negative values of a polynomial in 10 variables, Zap.naučn. sem. Leningr. otdel. Mat. in-ta V. A. Steklova Vol. 68, 1977 pp. 62–82

Matiyasevič, Yu.: Algorithmic undecidability of exponential Diophantine equations inthree unknowns. In: Studies in the Theory of Algorithms and Mathematical Logic, Moscow, 1979 pp. 69–78, 133

Matiyasevič, Yu., Robinson, J.: Two universal three-quantifier representations of enumerable sets. In: Theory of Algorithms and Mathematical Logic, Comp. Center ANSSSR: Moscow, 1974, pp. 112–123, 216

Matiyasevič, Yu., Robinson, J.: Reduction of an arbitrary Diophantine equation to onein 13 unknows, Acta Arithmetica Vol. 27, 1975 pp. 521–553

McAloon, K.: Aplications alternees de theorèmes d'incompletude et des theorèmes decompletude, C. R. Acad. Sci, Paris (Ser A-B) Vol. 280, 1975 pp. A849–A852

McAloon, K.: Formules de Rosser pour ZF, C. R. Acad. Sci. Vol. 281,1975 pp. A669–A672

McAloon, K.: Consistency statements and number theories. In: Colloq. int. de logique,CNSR, Paris, 1977 pp. 199–207

McAloon, K.: Completeness theorems,incompleteness theorems and models of arithmetic, Trans. Amer. Math. Soc. Vol. 239, 1978 pp. 253–277

McAloon, K.: Diagonal methods and strong cuts in models of arithmetic. In: Logiccolloquium 77, Proc, Wrolaw 1977, Stud. Logic Found. Math. Vol. 96, 1978 pp. 171–181

McAloon, K.: Formes combinatoires du theorème d'incompletude (d'apres J. Paris etd'autres). In: Seminaire Bourbaki vol. 1977/1978 Exposes 507–524, Springer-Verlag, 1979, pp. 263–276

McAloon, K.: Progressions transfinies de theories axiomatiques, formes combinatoiresdu theorème d'incompletude et fonctions recursives a croissance rapide. In: Models ofarithmetic (Sem, Univ. Paris VII, Paris, 1977), Soc. Math. France, Paris, 1980 pp. 41–58

McAloon, K.: Les rapports entre la méthode des indicatrices et la méthode de Gödel pourobtenir des resultats d'indépendence. In: Models of arithmetic (Sem. Univ. Paris VII,Paris, 1977), Soc. Math. France, Paris, 1980 pp. 31–39

McAloon, K.: On the complexity of models of arithmetic. Journ. Symb. Log. Vol. 47,1982 pp. 403–415

McAloon, K.: Paris-Harrington incompleteness and progressions of theories. In: Recursiontheory (Ithaca, N. Y, 1982), Amer. Math. Soc, Providence, RI, 1985 pp. 447–460

McAloon, K.: Models of arithmetic and complexity theory. In: Studies in Complexity Theory, Wiley, 1986 pp. 119–221

McAloon, K. (ED): Modèles de l'arithmétique, Soc Math France: Paris, 1980, 155 p.

McAloon, K., Ressayre, J. P.: Les methodes de Kirby-Paris et la theorie des ensembles. In: Model Theory and Arithmetic. Comptes Rendus d'une Action Thématique Programmée du CNRS sur la théorie des Modèles et l'Arithmétique. (Lect. Notes Math.890), Springer-Verlag, 1981 pp. 154–184

Mendelson, E.: On non-standard models for number theory. In: Essays on the Foundationsof Mathematics: Dedicated to A. A. Fraenkel on His 70th Anniversary, Magnes Pr:Jerusalem, 1961 pp. 259–268

Mendelson, E.: Introduction to mathematical logic. D. van Nostrand Comp. Inc., Princeton 1964, 300 pp.

Meschkowski, H.: Problemgeschichte der Mathematik I—III Bibl. Inst. Mannheim, 1981

Meyer, A. R.: Weak monadic second order theory of successor is not elementary-recursive. In: Logic Colloquium, Symposium on Logic Held at Boston, 1972–73 (Lect. Notes Math.453), Springer-Verlag, 1973 pp. 132–154

Michel, P.: Borne supérieure de la complexity de N muni de la relation et divisibilité. In: Model Theory and Arithmetic (Lect. Notes Math. 890), Springer-Verlag 1981 pp. 242

Mijajlović, Z.: Submodels and definable points in models of Peano arithmetics, Notre Dame Journ. Formal Log. Vol. 24, 1983 pp. 417–425

Miller, C. F.: Some connections between Hilbert's 10th problem and the theory of groups. In: Word Problems, North-Holland: Amsterdam, 1973

Mills, G.: Extensions of models of Peano arithmetic. Dissertation, Berkeley, 1977

Mills, G.: A model of Peano arithmetic with no elementary end extension, Journ. Symb.Log. Vol. 43, 1978 pp. 563–567

Mills, G.: Substructure lattices of models of arithmetic, Ann. Math. Logic Vol. 16, 1979 pp. 145–180

Mills, G.: A tree analysis of unprovable combinatorial statements. In: Model theory of algebra and arithmetic (Proc. Conf, Karpacz, 1979) (Lect. Notes Math. 834), Springer-Verlag, 1980 pp. 248–311

Mills, G., Paris, J. B.: Closure properties of countable nonstandard integers, Fund. Math. Vol. 103, 1979 pp. 205–215

Mills, G., Paris, J. B.: Regularity in models of arithmetic, Journ. Symb. Log. Vol. 49,1984 pp. 272–280

Minc, G. E.: Priloženie teoremy Herbranda. In: Matematiceskaja teoria logičeskogovyvoda, Nauka: Moscow, 1967 pp. 311–350

Minc, G. E.: Exact estimate of the provability of transfinite induction in initial parts ofarithmetic, Zap. naučn. sem. Leningr. otdel. Mat. in-ta V. A. Steklova Vol. 20, 1971 pp. 134–144

Minc, G. E.: Quantifier-free and one-quantifier systems, Zap. naučn. sem. Leningr. otdel.Mat. in-ta V. A. Steklova Vol. 20, 1971 pp. 115–133

Minc, G. E.: Finite investigations of infinite derivations, Zap. naučn. sem. Leningr. otdel.Mat. in-ta V. A. Steklova Vol. 49, 1975 pp. 67–122

Minc, G. E.: What can be done in PRA, Zap. naučn. sem. Leningr. otdel. Mat. in-ta V.A. Steklova Vol. 60, 1976 pp. 93–102

Misercque, D.: Sur le treillis des ∀1-formules fermées de l'arithmétique de Peano, Compte Rendus, Serie A Vol. 290, 1980 pp. 571–573

Misercque, D.: Solutions de deux problèmes posés par H. Simmons. In: Proceedings ofthe Model Theory Meeting (Univ. Brussels, Brussels/Univ. Mons, Mons, 1980), Bull.Soc. Math. Belg. Ser. B Vol. 33, 1981 pp. 65–72

Misercque, D.: Answer to a problem of D. Guaspari. In: Proceedings of the International Conference “Open Days in Model Theory and Set Theory”(Jadwisin), 1981 pp. 181–184

Misercque, D.: The nonhomogenity of the E-tree – answer to a problem raised by D.Jensen and A. Ehrenfeucht,Proc. Amer. Math. Soc. Vol. 84, 1982 pp. 573–575

Miyatake, T.: On the length of proofs in formal systems, Tsukuba Journ. Math. Vol. 4, 1980 pp. 115–125

Miyatake, T.: On the length of proofs in a formal system of recursive arithmetic. In: Logic Symposia Hakone 1979, 1980 (Lect. Notes Math. 891), Springer-Verlag, 1981 pp.81–108

Mlček, J.: A representation of models of Peano arithmetic, Comm. Math. Univ. Carol. Vol. 14, 1973 pp. 553–558

Mlček, J.: Twin prime problem in an arithmetic without induction, Comm. Math. Univ.Carol. Vol. 17, 1976 pp. 543–555

Mlček, J.: End-extensions of countable structures and the induction schema, Comm.Math. Univ. Carol. Vol. 19, 1978 pp. 291–308

Mlček, J.: A note on confinal extensions and segments, Comm. Math. Univ. Carol. Vol.19, 1978 pp. 727–742

Montagna, F.: For every n, the n-freely generated algebra is not functionally free in theequational class of diagonalizable algebras (the algebraization of theories which express Theor. V), Studia Logica Vol. 34, 1975 pp. 315–319

Montagna, F.: On the algebraization of Feferman's predicate, Studia Logica Vol. 37, 1978 pp. 221–236

Montagna, F.: On the formulas of Peano arithmetic which are provably closed undermodus ponens, Boll Unione Mat Ital Vol. 16, 1979 pp. 196–211

Montagna, F.: On the diagonalizable algebra of Peano arithmetic, Boll. Un. Math. Ital. Vol. 16–B, 1979 pp. 795–812

Montagna, F.: On the diagonalizable algebra of Peano arithmetic, Bolletino U. M. I. Vol.16–B, 1979 pp. 795–812

Montagna, F.: Interpretations of the first-order theory of diagonalizable algebras in Peanoarithmetic, Studia Logica Vol. 39, 1980 pp. 347–354

Montagna, F.: The predicate modal logic of provability. Notre Dame Journ. Formal Log. Vol. 25, 1984 pp. 179–192

Montagna, F.: A completeness result for fixed-point algebras, Zeitschr. Math. Log.Grundl. Math. Vol. 30, 1984 pp. 525–532

Montagna, F.: Provability in finite subtheories of PA and relative interpretability: a modalinvestigation, Journ. Symb. Log. Vol. 52, 1987 pp. 494–511

Montagna, F.: Iterated extensional Rosser's points and hyperhyperdiagonalizable algebras, Zeitschr. Math. Log. Grundl. Math. Vol. 33, 1987 pp. 293–303

Montagna, F., Sommaruge, G.: Rosser and Mostowski sentences, Arch. Math. Log. Vol. 27, 1988 pp. 115–133

Montagna, F., Sorbi, A.: Universal recursion theoretic properties of r. e. preorderedstructures, Journ. Symb. Log. Vol. 50, 1985 pp. 397–406

Montagna, R.: Non-finite axiomatizability. In: Summaries of Talks Presented at thesummer Institute for Symbolic Logic, Institute for Defense Analyses, Comm. Res. Division, 1957 pp. 256–259

Montague, R.: TWO theorems on relative interpretability. In: Summer Institut of Symbolic Logic, Cornell Univ, 1957 pp. 263–264

Montague, R.: Semantical closure and non-finite axiomatizability I. In: Infinitistic Methods, Pergamon Press: London, 1961 pp. 45–69

Montague, R.: Theories incomparable with respect to relative interpret ability, Journ.Symb. Log. Vol. 27, 1962 pp. 195–211

Montague, R.: Syntactical treatments of modality, with corollaries on reflexion principlesand finite axiomatizability. Acta Philos Fenn Vol. 16, 1963 pp. 153–167

Montague, R.: Interpretability in terms of models, Indagationes Mathematicae Vol. 27, 1965 pp. 467–476

Montague, R., Tarski, A.: Independent recursive axiomatizability. In: Summer Institutof Symbolic Logic, Cornell Univ, 1957 pp. 270

Morgenstern, C: On generalized quantifiers in arithmetic, Journ. Symb. Log. Vol. 47,1982 pp. 187–190

Mortensen, C: Inconsistent nonstandard arithmetic, Journ. Symb. Log. Vol. 52, 1987 pp.512–518

Mortensen, C: Inconsistent number systems, Notre Dame Journ. Formal Log. Vol. 29, 1988 pp. 45–60

Mostowski, A.: Bemerkungen zum Begriff der inhaltlichen Widerspruchsfreiheit, Journ.Symb. Log. Vol. 4, 1939 pp. 113–114

Mostowski, A.: On definable sets of positive integers, Fund. Math. Vol. 34, 1947 pp.81–112

Mostowski, A.: An undecidable arithmetical statement, Fund. Math. Vol. 36, 1949 pp.143–164

Mostowski, A.: On models of axiomatic systems, Fund. Math. Vol. 39, 1952 pp. 133–158

Mostowski, A.: Sentences undeciablein formalized arithmetic. An exposition of the theoryof Kurt Gödel, North Holland: Amsterdam, 1952, 117 p.

Mostowski, A.: On direct products of theories, Journ. Symb. Log. Vol. 17, 1952 pp. 1–31

Mostowski, A.: On a system of axioms which has no recursively enumerable model, Fund.Math. Vol. 40, 1953 pp. 56–61

Mostowski, A.: On recursive models of formalised arithmetic, Bull. Acad. Polon. Sci. Vol.5, 1957 pp. 705–710

Mostowski, A.: On various degrees of constructivism. In: Heyting (ed.), Constructivismin mathematics, North-Holland Publ. Comp. 1959, pp. 178–194

Mostowski, A.: A generalization of the incompleteness theorem, Fund. Math. Vol. 49,1961 pp. 205–232

Mostowski, A.: Represent ability of sets in formal systems. In: Recursive Function Theory,Amer. Math. Soc: Providence, 1962 pp. 29–48

Mostowski, A., Robinson, R. M., Tarski, A.: Undecidability and essential undecidabilityin arithmetic. In: Undecidable Theories (Stud Logic Found Math), North Holland: Amsterdam, 1953 pp. 39–74

Muller, G. H.: Über die unendliche Induktion. In: Infinitistic Methods. Proceedings of the Symposium on Foundations of Mathematics, PWN: Warsaw, Pergamon Pr: Oxford, 1961 pp. 75–95

Müller, G. H.: Nicht-Standardmodelle der Zahlentheorie. Zeitschr. Math. Log. Grundl. Math. Vol. 77, 1961 pp. 414–438

Müller, G. H. (ed.): Ω-bibliography of mathematical logic, vols I-VI, Springer-Verlag, 1987

Mundici, D.: Natural limitations of decision procedures for arithmetic with boundedquantifiers, Arch. Math. Log. Vol. 23, 1983 pp. 37–54

Murawski, R.: Expandability of models for elementary arithmetic, Komunikaty i Rozprawy Inst: Poznan, 1976, 26 p.

Murawski, R.: On expandability of models of Peano arithmetic. I, II, Studia Logica Vol.35, 1976 pp. 409–431

Murawski, R.: On expandability of models of Peano arithmetic. III, Studia Logica Vol.36, 1977 pp. 181–188

Murawski, R.: Indicator, satisfaction classes and expandability, Komunikaty i Rozprawy Inst: Poznan, 1978, 17 p.

Murawski, R.: Indicators and the structure of expansions, Komunikaty i Rozprawy Inst: Poznan, 1979, 18 p.

Murawski, R.: Some remarks on the structure of expansions, Zeitschr. Math. Log. Grundl.Math. Vol. 26, 1980 pp. 537–546

Murawski, R.: Incompleteness of ΣO n definable theories via indicators, Funct. Approx.Comment. Math. Vol. 11, 1981 pp. 57–63

Murawski, R.: A note on inner interpretations of models of Peano arithmetic, Rep. Math.Logic Vol. 13, 1981 pp. 53–57

Murawski, R.: Some more remarks on expandability of initial segments. In: Proceedingsof the International Conference “Open Days in Model Theory and Set Theory”, 1981 pp. 221–230

Murawski, R.: A simple remark on satisfaction classes, indiscernibles and recursive saturation, Fct Approximate, Comment Math, Poznan Vol. 11, 1981 pp. 149–151

Murawski, R.: A contribution to nonstandard teratology. In: Models and sets, Proc. Logic Colloq, Aachen 1983, Part I, (Lect. Notes Math. 1103), Springer-Verlag, 1984 pp. 379–388

Murawski, R.: Expandibiliiy of models of arithmetic. In: Prege conference, Proc. Int. Conf, Schwerin/Ger. 1984, Math. Res. 20, 1984 pp. 87–93

Murawski, R.: Trace expansions of initial segments, Zeitschr. Math. Log. Grundl. Math. Vol. 30, 1984 pp. 471–476

Murawski, R.: Giuseppe Peano-pioneer and promoter of symbolic logic. In: Komunikatyi Rozprawy, Univ im. A. Mickiewicza, Inst. Matematyki, 1985 pp. 21

Murawski, R.: On expansions of substructures, (abstract), Journ. Symb. Log. Vol. 51,1986 pp. 493

Murawski, R.: Some more remarks on expandability of initial segments, Zeitschr. Math.Log. Grundl. Math. Vol. 32, 1986 pp. 445–450

Murawski, R.: Pointwise definable substructures of models of Peano arithmetic, Notre Dame Journ. Formal Log. Vol. 29, 1988 pp. 295–308

Murawski, R.: Definable sets and expansions of models of Peano arithmetic, Arch. Math.Log. Vol. 27, 1988 pp. 21–33

Mycielski, J.: The definition of arithmetic operations in the Ackermann model, Algebrai Logika Vol. 3/5–6, 1964 pp. 64–65

Mycielski, J.: A lattice of interpretability types of theories, Journ. Symb. Log. Vol. 42,1977 pp. 297–305

Mycielski, J.: Locally finite theories, Journ. Symb. Log. Vol. 51, 1986 pp. 59–62

Mycielski, J.: Finitistic consistency proofs, Univ. of Colorado, preprint, 1982

Mycielski, J.: The meaning of pure mathematics, Journ. Phil. Log., Vol. 18, 1989, pp.315–320

Mycielski, J., Pudlák, P., Stern, A. S.: A lattice of chapters of mathematics, Memoirs Amer. Math. Soc. Vol. 84, 1990, 70 pp.

Myhill, J. R.: A system which can define its own truth. Fund. Math. Vol. 37, 1950 pp.190–192

Myhill, J. R.: An absolutely independent set of Σ 0 1sentences, Zeitschr. Math. Log.Grundl. Math. Vol. 18, 1972 pp. 107–109

Nadel, M. E.: On a problem of Mac Doweil and Specker, Journ. Symb. Log. Vol. 45, 1980 pp. 612–622

Nadel, M. E.: The completeness of Peano multiplication. Israel Journ. Math. Vol. 39, 1981 pp. 225–233

Negri, M.: An application of recursive saturation, Boll. Un. Mat. Ital. A (6) Vol. 3, 1984 pp. 449–451

Negri, M.: On the non finite axiomatizability of P. In: Atti degli incontri di logica matematica, Vol. 2, Siena / Italia 1983/84, 1985 pp. 621–626

Nelson, E.: Predicative arithmetic. Mathematical Notes, Princeton Univ. Press, 1986,189 p.

Nelson, G. C: A further restricted w-rule, Colloq. Math. Vol. 23, 1971 pp. 1–3

Nepomnjaščij, V. A.: Rudimentary predicates and Turing calculations, Dokl. Akad. Nauk SSSR, Tom 195, 1970; Soviet Math. Dokl. Vol. 11, No. 6, 1970 pp. 1462–1465

O'Donnell, M.: A programming language theorem which is independent of Peano arithmetic. In: A. C. M. Symp, 1979 pp. 176–188

Okada, M.: A simple relationship between Buchholz's new system of ordinal notationsand Takeuti's system of ordinal diagrams, Journ. Symb. Log. Vol. 52, 1987 pp. 577–581

Ono, H.: Reflection principles in fragments of Peano arithmetic, Zeitschr. Math. Log.Grundl. Math. Vol. 33, 1987 pp. 317–333

Ono, H., Kadota, N.: Provably recursive functions in fragments of Peano arithmetic.(abstract), Journ. Symb. Log. Vol. 51, 1986 pp. 494

Orevkov, V. P.: Lower bounds to derivations in arithmetic via complexity of the termsinvolved in derivations, Russian, Doklady Akad. Nauk SSSR, Vol. 294, 1987, pp. 784–787

Orevkov, V. P.: Reconstruction of a proof by its analysis, Russian, Doklady Akad. Nauk SSSR Vol. 293, 1987 pp. 313–316

Orey, S.: On ω-consistency and related properties, Journ. Symb. Log. Vol. 21, 1956 pp.246–252

Orey, S.: Relative interpretations, Journ. Symb. Log. Vol. 24, 1959 pp. 281–282

Qrey, S.: Relative interpretations, Zeitschr. Math. Log. Grundl. Math. Vol. 7, 1961 pp.146–153

Pabion, J. F.: L'axiomatisation de la syntaxe et le second theorème de Gödel, Publ. Dep.Math. Lyon Vol. 11, 1974 pp. 27–87

Pabion, J. F.: Saturation en arithmétique et en analyse, Bull. Soc. Math. Belg. Ser B Vol.33, 1981 pp. 73–82

Pabion, J. F.: Saturated models of Peano arithmetic, Journ. Symb. Log. Vol. 47, 1982 pp.625–637

Pabion, J. F., Richard, D.: Synonymy and re-interpretation for some sublanguages of Peano arithmetic. In: Proceedings of the International Conference “Open Days in Model Theory and Set Theory”, 1981 pp. 231–236

Palúch, S.: The lattices of numerations of theories containing Peano's arithmetic, Comm.Math. Univ. Carol. Vol. 14, 1973 pp. 339–359

Paola Di, R. A.: On sets represented by the same formula in distinct consistent axiomatizable Rosser theories, Pac. Journ. Math. Vol. 18, 1966 pp. 455–456

Paola Di, R. A.: Pseudo-complements and ordinal logics based on consistency statements,Journ. Symb. Log. Vol. 31, 1966 pp. 359–364

Paola Di, R. A.: Some properties of pseudo-complements of recursively enumerable sets, Trans. Amer. Math. Soc. Vol. 121, 1966 pp. 296–308

Paola Di, R. A.: Some theorems on extensions of arithmetic, Journ. Symb. Log. Vol. 32,1967 pp. 180–189

Paola Di, R. A.: A note on diminishing the undecidable region of a recursively enumerableset, Duke Math. Journ. Vol. 35, 1968 pp. 399–406

Paola Di, R. A.: A theorem on shortening the length of proof in formal systems of arithmetic, Journ. Symb. Log. Vol. 40, 1975 pp. 398–400

Paola Di, R. A.: A uniformly, extremely nonextensional formula of arithmetic with manyundecidable fixed points in many theories, Proc. Amer. Math. Soc. Vol. 92, 1984 pp.291–297

Pappinghaus, P.: A version of the Σ 1principle for CFA provable in PRA, Arch. Math. Log. Vol. 20, 1980 pp. 27–40

Parikh, R.: Existence and feasibility in arithmetic, Journ. Symb. Log. Vol. 36, 1971 pp.494–508

Parikh, R.: Some results on the length of proofs, Trans. Amer. Math. Soc. Vol. 177, 1973 pp. 29–36

Paris, J. B.: On models of arithmetic. In: Conference on Mathematical Logic – London'70 (Lect. Notes Math. 255), Springer-Verlag, 1972 pp. 251–280

Paris, J. B.: Models of arithmetic and the 1–3–1 lattice, Fund. Math. Vol. 95, 1977 pp. 195–199

Paris, J. B.: Note on an induction axiom, Journ. Symb. Log. Vol. 43, 1978 pp. 113–117

Paris, J. B.: Some independence results for Peano arithmetic, Journ. Symb. Log. Vol. 43,1978 pp. 725–731

Paris, J. B.: A hierarchy of cuts in models of arithmetic. In: Model theory of algebra andarithmetic, (Lect. Notes Math. 834), Springer-Verlag, 1980 pp. 312–337

Paris, J. B.: Some conservation results for fragments of arithmetic. In: Model theory ofalgebra and arithmetic, (Lect. Notes Math. 890), Springer-Verlag, 1981 pp. 251–262

Paris, J. B.: O struktuře modelu omezenéE 1indukce (On the structure of models of bounded E 1-induction), Časopis pĕst. mat. Vol. 109, 1984 pp. 372–379

Paris, J. B., Dimitracopoulos, C: Truth definitions for ∆ 0formulae. In: Logic and algorithmic, L'enseignement Mathematique No 30, Geneve, 1982 pp. 318–329

Paris, J. B., Dimitracopoulos, C: A note on the undefinability of cuts, Journ. Symb. Log. Vol. 48, 1983 pp. 564–569

Paris, J. B., Harrington, L.: A mathematical incompleteness in Peano arithmetic, Handbook of Mathematical Logic, North-Holland P. C, 1977 pp. 1133–1142

Paris, J. B., Kirby, L. A. S.: Σn -collection schema in arithmetic. In: Logic Colloquium(Studies in Logic and the Foundations of Mathematic 96), North-Holland P. C, pp. 199–209

Paris, J. B., Mills, G.: Closure properties of countable non-standard integers, Fund.Math. Vol. 103, 1979 pp. 205–215

Paris, J. B., Wilkie, A. J.: ∆0 sets and induction. In: Proceedings of the Jadwisin Logic Conference, Poland, Leeds University Press, 1981 pp. 237–248

Paris, J. B., Wilkie, A. J.: Models of arithmetic and the rudimentary sets, Bull Soc Math Belg, Ser B Vol. 33, 1981 pp. 157–169

Paris, J. B., Wilkie, A. J.: Some results on bounded induction. In: Proceedings of the 2nd Easter Conference on Model Theory, Humboldt-Univ. Berlin: Berlin, 1984 pp. 223–228

Paris, J. B., Wilkie, A. J.: Counting problems in bounded arithmetic. In: Methods inmathematical logic, Proc. 6th Latin Amer. Symp, Caracas / Venez. 1983, (Lect. Notes Math. 1130), Springer-Verlag, 1985 pp. 317–340

Paris, J. B., Wilkie, A. J.: Counting ∆0 sets, Fund. Math. Vol. 127, 1987 pp. 67–76

Paris, J. B., Wilkie, A. J.:∆0 approximations to the counting functionals, preprint

Paris, J. B., Wilkie, A. J.: On the existence of end extensions of models of boundedinduction. In: Logic, Methodology and Philosophy of Science VIII, 1983, North-Holland,to appear

Paris, J. B., Wilkie, A. J., Woods, A. R.: Provability of the ∆0 -PHP and the existenceof infinitely many primes, Journ. Symb. Log. Vol. 53, 1988 pp. 1235–1244

Parlamento, F.: Binumerability in a sequence of theories, Rend. Sem. Mat. Univ. Padova Vol. 65, 1981 pp. 9–12

Parlamento, F.: PRA provability of Schmer Ps fine structure theorem, Rend. Sem. Mat.,Torino Vol. 42, 1984 pp. 87–106

Parsons, C: On number-theoretic choice schema and its relation to induction. In: Intuitionism and Proof Theory, North Holland: Amsterdam, 1970 pp. 459–473

Parsons, C: On n-quantifier induction, Journ. Symb. Log. Vol. 37, 1972 pp. 466–482

Peano, G.: Arithmetices principia nuovo methodo exposita (The principles of arithmetic,presented by a new method), Bocca & Clausen, 1889, 20 p.

Peano, G.: Formulario matematico, Torino, 1908, 463 pp.

Penzin, Y. G.: The problem of twin primes in formal arithmetic, Mat. Zametki Vol. 26, 1979 pp. 505–511

Penzin, Y. G.: Twins problem in formal arithmetic, Math. Notes Vol. 26, 1980 pp. 743–746

Phillips, R. G.: On the structure of non-standard models of arithmetic, Proc. Amer.Math. Soc. Vol. 27, 1971 pp. 359–363

Phillips, R. G.: Addition in nonstandard models of arithmetic, Journ. Symb. Log. Vol.37, 1972 pp. 483–486

Phillips, R. G.: Omitting types in arithmetic and conservative extensions. In: Victoria Symposium on Non-Standard Analysis (Lect. Notes Math. 369), Springer-Verlag, 1974 pp. 195–202

Phillips, R. G.: A minimal extension that is not conservative, Mich. Math. Journ. Vol.21, 1974 pp. 27–32

Pillay, A.: Partition properties and definable types in Peano arithmetic. In: Model theoryand arithmetic (Paris, 1979–1980) (Lect. Notes Math. 890), Springer-Verlag, 1981 pp.263–269

Pillay, A.: Models of Peano arithmetic (a survey of basic results). In: Model Theory and Aritmetic. Comptes Rendus d'une Action Thematique Programmee du CNRS sur la Theorie des Modeles et l'Arithmetique (Lect. Notes Math. 890), Springer-Verlag, 1981 pp. 1–12

Pillay, A.: Cuts in models of arithmetic. In: Model theory and Arithmetic. Comptes Rendus d'une Action Thematique Programmee du CNRS sur la Theorie des Modeleset TArithmetique (Lect. Notes Math. 890), Springer-Verlag, 1981 pp. 13–20

Plisko, V. E.: The nonarithmeticity of the class of realizable predicate formulas, Math.USSR Vol. Izv. 11, 1977 pp. 453–471

Pohlers, W.: An upper bound for provability of transfinite induction in systems withn-times iterated inductive definitions. In: Proof Theory Symposion, Kiel 1974 (Lect.Notes. Math. 500), Springer-Verlag, 1975 pp. 271–289

Pohlers, W.: Ordinal notations based on a hierarchy of inaccessible cardinals, Annals Pure Appl. Logic Vol. 33, 1987 pp. 157–180

Pohlers, W.: Proof Theory. An Introduction. Springer-Verlag 1989, Lect. Notes Math.1407, 213 p.

Poizat, B.: Cours de théorie des modèles, Nur al-Manteq, wal-Marifah, Villenobanne, 1985 pp. 142–207

Potthoff, K.: Untersuchungen über Nichtstandardmodelle. In: Dissertation, Hannover, 1967

Potthoff, K.: Über Nichtstandardmodelle der Arithmetik und der rationalen Zahlen, Zeitschr. Math. Log. Grundl. Math. Vol. 15, 1969 pp. 223–236

Potthoff, K.: Ideale in Nichtstandardmodellen der ganzen Zahlen, Zeitschr. Math. Log.Grundl. Math. Vol. 16, 1970 pp. 321–326

Potthoff, K.: Über Enderweiterungen von Nichtstandardmodellen der Arithmetik undanderer Strukturen. In: Diss, Habil. etc, 1972

Potthoff, K.: Ordnungseigenschaften von Nichtstandardmodellen. In: Theory of Sets and Topology. In Honour of Felix Hausdorff (1868–1942), Dt. Verlag Wiss.: Berlin, 1972 pp.403–426

Potthoff, K.: A simple tree lemma and its application to a counterexample of Phillips, Arch. Math. Log. Vol. 18, 1976 pp. 67–71

Potthoff, K.: Orderings of type of countable arithmetic, Zeitschr. Math. Log. Grundl.Math. Vol. 24, 1978 pp. 97–108

Prawitz, D.: Ideas and results in proof theory. In: Proceedings of the Second Scandinavian Logic Symposium, North Holland: Amsterdam pp. 235–307

Prawitz, D.: The philosophical position of proof theory. In: Contemporary Philosophy in Scandinavia, The Johns Hopkins Press, 1972 pp. 123–134

Presburger, M.: Über die Vollstandigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt. In: Sprawozdaniez 1 Kongresu Matematykow Krajow Slowianskich, Ksiaznica Atlas: Warsaw 1930 pp.92–101, 395

Pudlák, P.: A definition of exponentiation by a bounded arithmetical formula, Comm.Math. Univ. Carol. Vol. 24, 1983 No. 4 pp. 667–671

Pudlák, P.: Some prime elements in the lattice of interpret ability types, Trans. Amer.Math. Soc. Vol. 280, 1983 No. 1 pp. 255–275

Pudlák, P.: Cuts, consistency statements and interpretations, Journ. Symb. Logic Vol.50, 1985 pp. 423–441

Pudlák, P.: On the length of proofs of finitistic consistency statements in first ordertheories. In: Logic Colloquium 84, North Holland P. C, 1986 pp. 165–196

Pudlák, P.: Improved bounds to the length of proofs of finitistic consistency statements, Contemporary mathematics Vol. 65, 1987 pp. 309–331

Pudlák, P.: A note on bounded arithmetic, Pundamenta Mathematicae 136, 1990 pp.85–89

Pudlák, P.: Another combinatorial principle independent of Peano's axioms, (unpublished text)

Pudlák, P.: Some relations between subsystems of arithmetic and the complexity of computations. In: Logic from Computer Science, ed. Moschovakis, Y. N., Springer-Verlag 1992, pp. 499–519

Pudlák, P.: Ramsey's theorem in bounded arithmetic. In: Computer Science Logic, eds. Börger et al., Springer Lecture Notes in Comp. Sci. 553, 1992, pp. 308–317

Pudlák, P. Sochor, A.: Models of the Alternative Set Theory, Journ. Sym. Log. Vol. 49, 1984 No. 2 pp. 570–585

Puritz, C. W.: Ultrafilters and standard functions in non-standard arithmetic, Proc London Math Soc, Ser 3 Vol. 22, 1971 pp. 705–733

Putnam, H.: An unsolvable problem in number theory, Journ. Symb. Log. Vol. 25, 1960 pp. 220–232

Putnam, H.: Trial and error predicates and the solution to a problem of Mostowski, Journ. Symb. Log. Vol. 30, 1965 pp. 49–57

Putnam, H., Smullyan, R.: Exact separation of recursively enumerable sets within theories, Proc. Amer. Math. Soc. Vol. 11, 1960 pp. 574–577

Quinsey, J.: Some problems in logic. Dissertation, Oxford, 1980

Quinsey, J.: Sets of Σk -conservative sentences are П 2-complete, Journ. Symb. Log. Vol. 46, 1981 pp. 442

Rabin, M. O.: Non-standard models and independence of the induction axiom. In: Essays on the Foundations of Mathematics: Dedicated to A. A. Freankel on his 70th anniversary, North Holland, Amsterdam, 1961 pp. 287–299

Rabin, M. O.: Diophantine equations and non-standard models of arithmetic. In: Proceedings of the 1st International Congress for Logic, Methodology and Philosophy of Science, Stanford Univ Pr: Stanford, 1962 pp. 151–158 (Russian translation in Matematiceskaja logika i ee primenenia, Mir 1965, 176–184)

Rackoff, C: On the complexity of theories of weak direct powers, Journ. Symb. Log. Vol. 41, 1976 pp. 561–573

Raisonnier, J.: Ensembles mesurables et consistance de ZF, C. R. Acad. Sci. Paris Ser. I Math. Vol. 297, 1983 pp. 217–219

Ratajczyk, Z.: Satisfaction classes and combinatorial sentences independent from PA, Zeitschr. Math. Log. Grundl. Math. Vol. 28, 1982 pp. 149–165

Ratajczyk, Z.: A combinatorial analysis of functions provably recursive in IΣn, Fund. Math, vol 130, 1988, 191–213

Ratajczyk, Z.: Functions provably total in IΣn, Fund. Math. Vol. 132, 1989, pp. 81–95

Razborov, A. A.: An equivalence between second order bounded domain bounded arithmetic and first order bounded arithmetic. In: Arithmetic, Proof Theory and Computational Complexity, eds. Clote, P. and Krajíček, J., Oxford Univ. Press 1992, pp. 247–277

Remmel, J. B.: Graph colorings and recursively bounded П0 1-classes, Annals Pure Appl. Logic Vol. 32, 1986 pp. 185–193

Ressayre, J. P.: Types remarquables et extensions de modèles dans l'arithmétique de Peano II (Avec un appendice de M. A. Dickmann), Astérisque Vol. 73, 1980 pp. 119–155

Ressayre, J. P.: Modèles isomorphes à leurs propres segments initiaux en théorie des ensembles, C. R. Acad. Sci, Paris, Ser 1 Vol. 296, 1983 pp. 569–572

Ressayre, J. P.: Non standard universes with strong embeddings, and their finite approximations. In: Logic and Combinatorics, Proceedings of the Amer. Math. Soc. -IMS-SIAM Joint Summer Research Conference, Amer. Math. Soc: Providence, 1987 pp. 333–358

Ressayre, J. P.: Integer parts of real closed exponential fields (extended abstract). In: Arithmetic, Proof Theory and Computational Complexity, eds. Clote, P. and Krajíček, J., Oxford Univ. Press 1992, pp. 278–288

Ressayre, J. P., Wilkie, A. J.: Modéles non-standard en arithmétique et théorie desensembles, Publ. Math. Univ. Paris VII, 1986, 147 p.

Richard, D.: On external properties of nonstandard models of arithmetic, Publ. Dep.Math. Vol. 14, 1977 pp. 57–75

Richard, D.: Saturation des modèles de Peano, C. R. Acad. Sci. Paris Sér. A-B Vol. 290,1980 pp. A351–A353

Richard, D.: De la structure additive a la saturation des modèles de Peano et à uneclassification des sous-langages de l'arithmétique. In: Model theory and arithmetic(Paris, 1979–1980) (Lect. Notes Math. 890), Springer-Verlag, 1981 pp. 270–296

Richard, D.: Les relations arithmétiques sur les entiers primaires sont definissables aupremier ordre par successeur et comprimarite, C. R. Acad. Sci, Paris, Ser. I Vol. 299, 1984 pp. 795–798

Richard, D.: The arithmetics as theories of two orders. In: Orders: description and roles, Proc. Conf. Ordered sets appl, l'Arbresle / France 1982, Ann. Discrete Math. 23, 1984 pp. 287–311

Richardson, D.: Some undecidable problems involving elementary functions of a realvariable, Journ. Symb. Log. Vol. 33, 1968 pp. 514–520

Richardson, D.: Solution of the identity problem for integral exponential functions, Zeitschr. Math. Log. Grundl. Math. Vol. 15, 1969 pp. 333–340

Richardson, D.: Sets of theorems with short proofs, Journ. Symb. Log. Vol. 39, 1974 pp.235–242

Rieger, L.: Sur le problème des nombres naturels. In: Infinitistic Methods. Proceedingsof the Symposium on Foundations of Mathematics, Pergamon Press: Oxford, 1961 pp.225–233

Riis, S.: Making infinite structures finite in models of second order bounded arithmetic. In: Arithmetic, Proof Theory and Computational Complexity, eds. Clote, P. and Krajíček, J., Oxford Univ. Press 1992, pp. 289–319

Ritchie, R. W., Young, P. R.: Strong represent ability of partial functions in arithmetictheories, Information Sci. Vol. 1, 1968 pp. 189–204

Ritter, W. E.: Represent ability of partial recursive functions in formal theories, Proc.Amer. Math. Soc. Vol. 18, 1967 pp. 647–651

Robbin, J. W.: Subrecursive hierarchies. Ph. D. thesis, Princeton 1965.

Robinson, A.: Model theory and non-standard arithmetic. In: Infinitistic Methods. Proceedings of the Symposium on Foundations of Mathematics, PWN: Warsaw, 1961 pp.265–302

Robinson, A.: On languages which are based on nonstandard arithmetic, Nagoya Math.Journ. Vol. 22, 1963 pp. 83–117

Robinson, A.: Infinite forcing in model theory. In: Proceedings of the Second Scandinavian Logic Symposium, North-Holland: Amsterdam, 1971, pp. 317–340

Robinson, A.: Nonstandard arithmetic and generic arithmetic. In: Proceedings of the 4th International Congress for Logic, Methodology and Philosophy of Science (Stud Logic Found Math 74), North Holland, Amsterdam, 1973 pp. 137–154

Robinson, A.: Standard and nonstandard number systems, Nieuw Arch Wisk, Ser 3 Vol.21, 1973 pp. 115–133

Robinson, J.: Definability and decision problems in arithmetic, Journ. Symb. Log. Vol.14, 1949 pp. 98–114

Robinson, J.: Existential definability in arithmetic, Trans Amer. Math. Soc. Vol. 72, 1952 pp. 437–449

Robinson, J.: The undecidability of exponential Diophantine equations. Notices of the Amer. Math. Soc. Vol. 7, 1960 pp. 75

Robinson, J.: The undecidability of exponential Diophantine equations. In: Logic, Methodology and Philosophy of Science, Proceedings of the 1960 International Congress, Stanford University Press, 1962 pp. 12–13 (Russian translation in Matematičeskaja logika i ee primenenia, Mir 1965, 7–8)

Robinson, J.: Diophantine decision problems. In: Studies in Number Theory, MAA, Englewood Cliffs, 1969, pp. 76–116

Robinson, J.: Unsolvable Diophantine problems, Proc. Amer. Math. Soc. Vol. 22, 1969 pp. 534–538

Robinson, J.: Hilbert's tenth problem. In: Institute on Number Theory, Amer. Math. Soc:Providence, 1971, pp. 191–194

Robinson, J.: Axioms for number theoretic functions. In: Izbrannyje Voprosy Algebry i Logiki: Sbornik Posvyašč. pamyati A. I. Mal'tseva, Nauka: Novosibirsk, 1973 pp. 253–263

Robinson, J.: Solving Diophantine equations. In: Logic, Methodology and Philosophy of Science IV, North-Holland: Amsterdam, 1973, pp. 63–67

Robinson, R. M.: Arithmetical definitions in the ring of integers, Proc. Amer. Math. Soc. Vol. 2, 1951 pp. 279–284

Robinson, R. M.: An essentially undecidable axiom system. In: Int Congr Math (11,6); 1950 Cambridge MA, proceedings of the International Congress of Mathematicians, Amer. Math. Soc, 1952 pp. 729–730

Robinson, R. M.: Arithmetical representation of recursively enumerable sets, Journ. Symb.Log, Vol. 21, 1956 pp. 162–187

Robinson, R. M.: Restricted set-theoretical definitions in arithmetic In: Summaries of Talks Presented at the Summer Institute for Symbolic Logic, Institute for Defense Analyses, Comm. Res. Division, 1957 pp. 139–140

Robinson, R. M.: Some representations of Diophantine sets, Journ. Symb. Log. Vol. 37,1972 pp. 572–578

Rogers, H. Jr.: Theory of recursive functions and effective computability, McGraw-Hill,1967, 482 pp.

Rose, H. E.: Subrecursive hierarchies. PhD thesis, Princeton 1965.

Rose, H. E.: Subrecursion, Functions and Hierarchies, Clarendon Press, Oxford, 1984

Rosser, J. B.: Extensions of some theorems of Gödel and Church, Journ. Symb. Log. Vol.1, 1936 pp. 87–91

Rosser, J. B.: An informal exposition of proofs of Gödel and Church's theorem, Journ.Symb. Log. Vol. 4, 1939 pp. 53–60

Ryll-Nardzewski, C: The role of the axiom of induction in elementary arithmetic, Fund.Math. Vol. 39, 1952 pp. 239–263

Sambin, G.: Un'estensione del teorema di Loeb, Rend Sem. Mat. Univ. Padova Vol. 52, 1974 pp. 193–199

Sambin, G.: An effective fixed-point theorem in intuitionistic diagonalizable algebras (Thealgebraization of the algebras which expres Theor. IX.), Studia Logica Vol. 35, 1976 pp. 345–361

Sambin, G.: Fixed points through the finite model property, Studia Logica Vol. 37, 1978 pp. 287–289

Sambin, G., Valentini, S.: A modal calculus for a fragment of arithmetic, Studia Logica Vol. 39, 1980 pp. 245–256

Sambin, G., Valentini, S.: The modal logic of provability. The sequential approach, Journ.Philos. Log. Vol. 11, 1982 pp. 311–342

Savage, J. E.: The Complexity of Computing, Wiley, London, 1976, 391 pp.

Savitch, W. J.: Relationship between nondeterministic and deterministic tape complexities, Journ. Comput. and System Sci., Vol. 4, 1970 pp. 177–192

Šavrukov, V. Yu.: The logic of relative interpret ability over Peano arithmetic (preprint), 1988

Scanlon, T. M.: The consistency of number theory via Herbrand's theorem, Journ. Symb.Log. Vol. 38, 1973 pp. 29–58

Scarpelini, B.: Zwei unentscheidbare Probleme der Analysis, Zeitschr. Math. Log. Grundl. Math. Vol. 9, 1963 pp. 265–289

Schmerl, J. H.: Peano models with many generic classes. Pac. Journ. Math. Vol. 46, 1973 pp. 523–536

Schmerl, J. H.: Extending models of arithmetic, Ann. Math. Logic Vol. 14, 1978 pp.89–109

Schmerl, J. H.: Recursively saturated, rather classless models of Peano arithmetic. In:Logic Year 1979–80. The University of Connecticut (Lect. Notes Math. 859), Springer-Verlag, 1981 pp. 268–282

Schmerl, J. H.: Models of Peano arithmetic and a question of Sikorski on ordered fields, Israel Journ. Math. Vol. 50, 1985 pp. 145–159

Schmerl, J. H.: Substructure lattices of models of Peano arithmetic, (abstract), Journ.Symb. Log. Vol. 51, 1986 p. 496

Schmerl, J. H.: Substructure lattices of models of Peano arithmetic. In: Logic Colloquium'84 (Studies in Logic and the Foundations of Mathematics 120), North-Holland, 1986 pp. 225–243

Schmerl, J. H., Simpson, S. G.: On the role of Ramsey quantifiers in first order arithmetic, Journ. Symb. Log. Vol. 47 1982 pp. 423–435

Schmerl, U. R.: Eine von Reflexionsformeln erzeugte Feinstruktur iiber Erweiterungender primitiv rekursiven Arithmetik. Dissertation, Heidelberg, 1978

Schmerl, U. R.: A fine structure generated by reflection formulas over primitive recursivearithmetic. In: Logic Colloquium '78 (Stud Logic Found Math 97), North Holland:Amsterdam, 1979 pp. 335–350

Schmerl, U. R.: Iterated reflection principles and the ω;-rule, Journ. Symb. Log. Vol. 47,1982 pp. 721–733

Schmerl, U. R.: Diophantine equations in a fragment of number theory. In: Computationand proof theory (Lect. Notes Math. 1104), Springer-Verlag, 1984 pp. 389–398

Schmerl, U. R.: Diophantine equations in a fragment of number theory, (abstract), Journ.Symb. Log. Vol. 50, 1985 pp. 275

Schmerl, U. R.: Diophantine equations in fragments of arithmetic, Annals Pure Appl.Logic Vol. 38, 1988 pp. 135–170

Schmidt, D.: Associative ordinal functions, well partial orderings and a problem of Skolem, Zeitschr. Math. Log. Grundl. Math. Vol. 24, 1978 pp. 297–302

Schütte, K.: Beweistheoretische Erfassung der unendlichen Induktion in der Zahlentheorie, Math. Ann. Vol. 122, 1951 pp. 369–389

Schütte, K.: Beweistheorie. Springer-Verlag, 1960, 355 pp.

Schütte, K., Simpson, S. G.: Ein in der reinen Zahlentheorie unbeweisbarer Satz überendliche Folgen von natürlichen Zahlen, Arch. Math. Log. Vol. 25, 1985 pp. 75–89

Schwartz, D. G.: A free-variable theory of primitive recursive arithmetic, Zeitschr. Math.Log. Grundl. Math. Vol. 33 1987 pp. 147–157

Schwichtenberg, H.: Eine Klassifikation der £o-rekursiven Funktionen, Arch. Math. Log. Vol. 13, 1970, pp. 204–236

Schwichtenberg, H.: Proof theory: some applications of cut-elimination. In: Handbookof Mathematical Logic, Barwise, ed. North-Holland: Amsterdam, 1977, pp. 867–896

Schwichtenberg, H., Wainer, S. S.: Infinite terms and recursion in higher types. In:Proof Theory Symposion, Kiel 1974 (Lect. Notes Math. 500), Springer-Verlag, 1975 pp.341–364

Scott, D. S.: On constructing models for arithmetic. In: Infinitistic Methods. Proceedingsof the Symposium on Foundations of Mathematics, PWN: Warsaw, 1961 pp. 235–255

Scott, D. S.: Algebras of sets binumerable in complete extensions of arithmetic. In:Recursive Function Theory, Amer. Math. Soc: Providence, 1962 pp. 117–121

Semenov, A. L.: On certain extensions of the arithmetic of addition of naturals numbers, Izv. Akad. Nauk SSSR, Ser. Mat. Vol. 43, 1979 pp. 1175–1195, 9

Semenov, A. L.: On the definability of arithmetic in its fragments, Doklady Akad. Nauk SSSR Vol. 263, 1982 pp. 44–47

Semenov, A. L.: Logical theories of one-place functions on the set of natural numbers, Izv. Akad. Nauk SSSR, Ser. Mat. Vol. 47, 1983 pp. 623–658

Serement, Z.: On automorphisms of resplendent models of arithmetic, Zeitschr. Math.Log. Grundl. Math. Vol. 30, 1984 pp. 349–352

Shelah, S.: End extensions and numbers of countable models, Journ. Symb. Log. Vol. 43,1978 pp. 550–562

Shelah, S.: Models with second order properties II. trees with no undefined branches,AML Vol. 14, 1978 pp. 73–87

Shelah, S.: On logical sentences in PA. In: Proceedings of the Logic Colloquium '82;Firenze, North Holland, Amsterdam, 1984 pp. 145–160

Shepherdson, J. C: Representability of recursively enumerable sets in formal theories, Arch. Math. Log. Vol. 5, 1960 pp. 119–127

Shepherdson, J. C: A non-standard model for a free variable fragment of number theory, Bull. Acad. Polon. Sci. Vol. 12, 1964 pp. 79–86

Shepherdson, J. C: Non-standard models for fragments of number theory. In: The Theoryof Models (Stud. Logic Found. Math.), North Holland, Amsterdam, 1965 pp. 342–358

Shepherdson, J. C: The rule of induction in the free variable arithmetic based on + and*, Ann. Fac. Sci. Clermont Vol. 35, 1967 pp. 25–31

Shepherdson, J. C: Weak and strong induction, Amer. Math. Monthly Vol. 76, 1969 pp.989–1004

Shoenfield, J. R.: A relative consistency proof, Journ. Symb. Log. Vol. 19, 1954 pp. 21

Shoenfield, J. R.: Open sentences and the induction axiom, Journ. Symb. Log. Vol. 23,1958 pp. 7–12

Shoenfield, J. R.: On a restricted ω-rule, Bull. Acad. Polon. Sci. Vol. 7,1959 pp. 405–407

Shoenfield, J. R.: Degrees of models, Journ. Symb. Log. Vol. 25, 1960 pp. 233–237

Shoenfield, J. R.: Undecidable and creative theories, Fund. Math. Vol. 49, 1961 pp.171–179

Shoenfield, J. R.: Mathematical Logic, Addison-Wesley, 1967, 344 pp.

Shostak, R. E.: On the SUP-INF method for proving Presburger Formulas, Journ. A. C.M. Vol. 24, 1977 pp. 529–543

Sieq, W.: Fragments of arithmetic, Annals Pure Appl. Logic Vol. 28, 1985 pp. 33–71

Sieg, W.: A note on König's lemma, (abstract), Journ. Symb. Log. Vol. 50, 1985 pp. 276

Sierpinski, W.: 250 problems of elementary number theory, Warsawa, 1970

Silver, J.: Harrington's version of the Paris's result, (manuscript)

Simmons, H.: Topological aspects of suitable theories, Proc. Edinburgh Math. Soc. Vol.19, 1974 pp. 383–391

Simmons, H.: Each regular number structure is biregular, Israel Journ. Math Vol. 23, 1976 pp. 347–352

Simmons, H.: Existentially closed models of basic number theory. In: Logic Colloquium'76, North-Holland: Amsterdam 1977, pp. 325–369

Simmons, H.: The lattice of universal sentences modulo Peano arithmetic, Rapp. Sem.Math. Pure, Univ. Catol. Lou vain, 1980 28 p.

Simpson, S. G.: Forcing and models of arithmetic, Proc Amer. Math. Soc. Vol. 43, 1974 pp. 193–194

Simpson, S. G.: Σ1 1 and П1 1transfiniteinduction. In: Logic Colloquium '80, North Holland,1982 pp. 239–253

Simpson, S. G.: Set theoretic aspects of ATR 0 . In: Logic Colloquium '80, North Holland, 1982 pp. 255–271

Simpson, S. G.: Which set existence axioms are needed to prove Cauchy-Peano theoremfor ordinary differential equations?, Journ. Symb. Log. Vol. 49, 1984 pp. 783–802

Simpson, S. G.: Nichtbeweisbarkeit von gewissen kombinatorischen Eigenschaften endlicher Bäume, Arch. Math. Log. Vol. 25, 1985 pp. 45–65

Simpson, S. G.: Unprovable theorems and fast-growing functions. In: Logic and Combinatorics, Proceedings of the Amer. Math. Soc. – SIAM Joint Summer Research Conference, Amer. Math. Soc.: Providence, 1987 pp. 359–394

Simpson, S. G.: Reverse mathematics, Dept. of Math. Research Rep., 1982, Penn State Univ.

Simpson, S. G.: Subsystems of second order arithmetic, book in preparation, Chapters II-IX distributed as Dept. of Math. Research Rep., 1986–90, Penn State Univ.

Simpson, S. G., Smith, R. L.: Factorization of polynomials and Σ0 1 induction, Annals Pure Appl. logic Vol. 31, 1986 pp. 289–306

Skolem, T.: Logisch-kombinatorische Untersuchungen über die Erfüllbarkeit oder Beweis-barkeit mathematischer Sätze nebst einem Theorem über dichte Mengen, Skrifter utgitav videnskasselskapet i Kristiana vol. I no. 4, 1920, pp. 1–36

Skolem, T. A.: Begründung der elementaren Arithmetik durch die rekurrierende Denkweise ohne Anwendung scheinbarer Veranderlichen mit unendlichem Ausdehnungsbereich, Videnskaps Selskapet i Kristiana. Skrifter Utgit. 1 Matematisk-Naturvidens-kapelig Klasse Vol. 6, 1923 pp. 1–38

Skolem, T. A.: Über einige Satzfunktionen in der Arithmetik, Skrifter Vitenskap-sakademiet i Oslo, I Vol. 7, 1930 pp. 1–28

Skolem, T. A.: Über die Unmoglichkeit einer Charakterisierung der Zahlenreihe mittelseines endlichen Axiomensystems, Norsk Matematisk Forenings Skrifter Vol. 10, 1933 pp. 73–82

Skolem, T. A.: Über die Nichcharakterisierbarkeit der Zahlenreihe mittels endlich oderabzahlbar unenedlich vielen Aussagen mit ausschliesslich Zahlvariablen, Fund. Math. Vol. 23, 1934 pp. 150–161

Skolem, T. A.: Über die Zurückführbarkeit einiger durch Rekursionen definierter Relationen auf “‘arithmetische’”, Acta Litt. scient. Szeged Vol. 8, 1937 pp. 73–88

Skolem, T. A.: Peano's axioms and models of arithmetic. In: Mathematical Interpretationsof Formal Systems (Stud Logic Found Math 10), North Holland, Amsterdam, 1955 pp.1–14

Skolem, T. A.: A version of the proof of equivalence between complete induction anduniqueness of primitive recursion, Kongelige Norske Videnskabers Selskabs. Forhandlinger. Vol. 29, 1956 pp. 10–15

Skolem, T. A.: An ordered set of arithmetic functions representing the least epsilon-number, Kongelige Norske Videnskabers Selskabs. Forhandlinger. Vol. 29, 1956 pp. 54–59

Skolem, T.: Selected works in logic (ed. by J. E. Fenstad), Universitetsforlaget Oslo 1970,732 pp.

Slater, D.: Non-standard languages and their applications. Dissertation, Rutgers, 1972

Smith, R., Simpson, S. G.: Factorization of polynomials and Σ0 1 induction, (abstract),Journ. Symb. Log. Vol. 51, 1986 pp. 497

Smith, S. T.: Nonstandard syntax and semantics and full satisfaction classes for modelsof arithmetic, (abstract), Journ. Symb. Log. Vol. 51, 1986 pp. 497

Smith, S. T.: Nonstandard characterizations of recursive saturation and resplendency, Journ. Symb. Log. Vol. 52 1987 pp. 842–863

Smoryński, C. A.: Applications of Kripke models. In: Metamathematical Investigation of Intuitionistic Arithmetic and Analysis, Springer-Verlag, 1973 pp. 324–391

Smoryński, C. A.: Investigations of ituitionistic formal systems by means of Kripkemodels. Dissertation, Chicago Circle, 1973

Smoryński, C. A.: The incompleteness theorems. In: Handbook of Math Logic (Stud Logic Found Math 90), North Holland: Amsterdam, 1977 pp. 821–865

Smoryński, C. A.: ω-consistency and reflection. In: Colloque International de Logique(Colloq Int CNRS), CNRS Inst. B. Pascal: Paris, 1977 pp. 167–181

Smoryński, C. A.: A note on the number of zeros of polynomials and exponential polynomials, Journ. Symb. Log. Vol. 42, 1977 pp. 99–106

Smoryński, C. A.: Beth's theorem and self-referential sentences. In: Logic Colloquium 77(Stud Logic Found Math 96), North Holland: Amsterdam, 1978 pp. 253–261

Smoryński, C. A.: Avoiding self-referential statements.Proceedings of the Amer. Math.Soc. Vol. 70, 1978 pp. 181–184

Smoryński, C. A.: Calculating self-referential statements. I: Explicit calculations, Studia Logica Vol. 38, 1979 pp. 17–36

Smoryński, C. A.: Some rapidly growing functions, Math. Intell. Vol. 2, 1979 pp. 149–154

Smoryński, C. A.: Calculating self-referential statements, Fund. Math. Vol. 109, 1980 pp.189–210

Smoryński, C. A.: Recursively saturated non-standard models of arithmetic, Journ. Symb.Log. Vol. 46, 1981 pp. 259–286

Smoryński, C. A.: Calculating self-referential sentences: Guaspari sentences of the firstkind, Journ. Symb. Log. Vol. 46, 1981 pp. 329–344

Smoryński, C. A.: Fifty years of self-reference, Notre Dame Journ. Formal Log. Vol. 22,1981 pp. 357–374

Smoryński, C. A.: Cofinal extensions of nonstandard models of arithmetic, Notre Dame Journ. Formal Log Vol. 22, 1981 pp. 133–144

Smoryński, C. A.: Elementary extensions of recursively saturated models of arithmetic, Notre Dame Journ. Formal Log. Vol. 22, 1981 pp. 193–203

Smoryński, C. A.: Fixed point algebras, Bull. Amer. Math. Soc. Vol. 6, 1982 pp. 317–356

Smoryński, C. A.: Nonstandard models and constructivity. In: The L. E. J. Brouwer Centenary Symposium (Noordwijkerhout, 1981), North-Holland, Amsterdam-New York, 1982 pp. 459–464

Smoryński, C. A.: A note on initial segment constructions in recursively saturated modelsof arithmetic, Notre Dame Journ. Formal Logic Vol. 23, 1982 pp. 393–408

Smoryński, C. A.: The varieties of arboreal experience. Math. Intell. Vol. 4, 1982 pp.182–189

Smoryński, C. A.: The finite inseparability of the first-order theory of diagonalizable algebras, Studia Logica Vol. 41, 1982 pp. 347–349

Smoryński, C. A.: Commutativity and self reference, Notre Dame Journ. Formal Log. Vol.23, 1982 pp. 443–452

Smoryński, C. A.: Back-and-forth inside a recursively saturated model of arithmetic. In: Logic Colloquium '80 (Stud. Logic Found. Math. 108), North Holland: Amsterdam,1982 pp. 273–278

Smoryński, C. A.: Recursively saturated models of arithmetic, Addendum, Journ. Symb.Log. Vol. 47, 1982 pp. 493

Smoryński, C. A.: Modal logic and self-reference. In: Handbook of Philosophical Logic(vol. 2), Reidel: Dordrecht, 1984 pp. 441–496

Smoryński, C. A.: Lectures on nonstandard models of arithmetic. In: Proceedings of the Logic Colloquium '82 (Stud. Logic Found. Math. 112), North Holland: Amsterdam,1984 pp. 1–70

Smoryński, C. A.: Self-reference and Modal logic, Springer-Verlag, 1985, 333 pp.

Smoryński, C. A.: Nonstandard models and related developments. In: Harvey Friedman's Research on the Foundations of Mathematics, North Holland: Amsterdam, 1985 pp.179–229

Smoryński, C. A.: Quantified modal logic and self-reference, Notre Dame Journ. Formal Log. Vol. 28, 1987 pp. 356–370

Smoryński, C. A.: Logical number theory I – an introduction, Springer-Verlag 1991

Smoryński, C. A.: An assymptotic formula for a logico-combinatorial problem, preprint

Smoryński, C. A., Stavi, J.: Cofinal extension preserves recursive saturation. In: Model Theory of Algebra and Arithmetic (Lect. Notes Math. 834), Springer-Verlag, 1980 pp.338–345

Smullyan, R. M.: Languages in which self reference is possible, Journ. Symb. Log. Vol.22, 1957 pp. 55–67

Smullyan, R. M.: Theory of Formal Systems, Annals of Math. Stud. No. 47, Princeton Univ. Press, 1961, 142 pp.

Smullyan, R. M.: Modality and self-reference. In: Intensional Mathematics (Stud. Logic Found. Math. 113), North Holland: Amsterdam, 1985 pp. 191–211

Smullyan, R. M.: Some principles related to Loeb's theorem. In: Intesional Mathematics(Stud. Logic Found. Math. 113), North Holland: Amsterdam, 1985 pp. 213–230

Smullyan, R. M.: Fixed points and self-reference, Int Journ. Math. & Math. Sci Vol. 7,1984 pp. 283–289

Soare, R. I.: Recursively enumerable sets and degrees. Springer-Verlag 1987.

Solomon, M. K.: The Gödel speed-up phenomenon. Dissertation, Stevens Inst. of Tech, 1975

Solomon, M. K.: Some results on measure independent Gödel speed-ups, Journ. Symb.Log. Vol. 43, 1978 pp. 667–672

Solovay, R. M.: Probability interpretations of modal logic, Israel Journ. Math. Vol. 25, 1976 pp. 287–304

Solovay, R. M.: Explicit Henkin sentences, Journ. Symb. Log. Vol. 50, 1985 pp. 91–93

Solovay, R. M.: Infinite fixed-point algebras. In: Recursion Theory. Proceedings of the A.M. S. – A. S. L. Summer Institute, Amer. Math. Soc: Providence, 1985 pp. 473–486

Solovay, R. M.: Injecting inconsistencies into models of PA, Annals of Pure and Appl.Log. Vol. 44, 1989, pp. 101–132

Sommer, R.: Ordinal arithmetic in ∆ 0- In: Arithmetic, Proof Theory and Computational Complexity, eds. Clote, P. and Krajíček, J., Oxford Univ. Press 1992, pp. 320–363

Soprunov, S. F.: Strong nonstandard models of arithmetic, Doklady Akad. Nauk SSSR Vol. 223, 1975 pp. 576–577

Soprunov, S. F.: Initial segments of nonstandard arithmetics, Doklady Akad. Nauk SSSR Vol. 223, 1975 pp. 576–577

Soprunov, S. F.: Denumerable non-standard models of arithmetic. In: Issledovaniya po Teorii Množestv i Neklassičeskim Logikam. Sbornik Trudov, Nauka: Moskva, 1976 pp.157–173

Soprunov, S. F.: Lattices of non-standard arithmetics. In: Issledovaniya po Neklassičeskim Logikam i Teorii Množestv, Nauka: Moskva, 1979 pp. 146–173

Sornikov, Ya. A.: On quantifier-free ℰ0-recursive arithmetic, Vestnik Mosk. Univ. Matematika Vol. 32, 1977 pp. 19–25

Specker, E.: Eine Verschärfung des Unvollständigkeitssatzes der Zahlentheorie, Bull.Acad. Polon. Sci. Vol. 5, 1957 pp. 1041–1045

Spencer, J.: Large numbers and unprovable theorems, Amer. Math. Monthly Vol. 90,1983 pp. 669–675

Stein, M.: Interpretations of Heyting's arithmetic - an analysis by means of a languagewith set symbols, Ann. Math. Logic Vol. 19, 1980 pp. 1–31

Stepanov, V. I.: Self-referential propositions for standard and Rosser provability predicates, Usp. Mat. Nauk Vol. 36 1981 pp. 227–228

Stepanov, V. I.: Second-order arithmetic and the consistency of first-order theories, Usp.Mat. Nauk Vol. 37, 1982 pp. 179–180

Stihi, T.: Forcing and Peano arithmetic. Dissertation, 1976

Stihi, T.: Induction and complete sequences of conditions in the sense of Cohen, Rev.Roum. Math. Pures et Appl. Vol. 23, 1978 pp. 129–133

Stockmeyer, L.: The polynomial time hierarchy, Theor. Computer Science Vol. 3, 1976 pp.1–22

Sundholm, B. G.: The ω-rule; a survey, Bachelor's thesis, Oxford, 1978

Švejdar, V.: Degrees of interpret ability, Comm. Math. Univ. Carol. Vol. 19, 1978 pp.789–813

Švejdar, V.: A sentence that is difficult to interpret, Comm. Math. Univ. Carol. Vol. 22,1981 pp. 661–666

Švejdar, V.: Modal analysis of generalized Rosser sentences, Journ. Symb. Log. Vol. 48, 1983 pp. 986–999

Szelepczényi, R.: The method of forcing for nondeterministic automata, Bull. European Assoc. for Theor. Comp. Sci., Vol. 33, 1987 pp. 96–100

Szmielew, W., Tarski, A.: Mutual interpretability of some essentially undecidable theories. In: Int Congr Math. (II,6); 1950 Cambridge MA,USA [1952] Proceedings of the International Congress of Mathematicians, Amer. Math. Soc. 1952 pp. 734

Tait, W. W.: The substitution method, Journ. Symb. Log. Vol. 30, 1965 pp. 175–192

Tait, W. W.: Functional defined by transfinite recursion, Journ. Symb. Log. Vol. 30,1965 pp. 155–174

Takahashi, M.: A foundation of finite mathematics, Publ. Res. Inst. Math. Sci. Kyoto Univ. Vol. 12, 1977 pp. 577–708

Takahashi, M.: An abstract form of Gode Fs theorem on cosistency and Lob's, Sci. Reports Tokyo Kyoiku Daigaku, Sec. A Vol. 13, 1977 pp. 81–85

Takeuti, G.: Proof theory, North-Holland P. C, 1975, 372 pp. (second edition 1980)

Takeuti, G.: Consistency proofs and ordinals. In: Proof Theory Symposion, Kiel 1974 (Lect. Notes Math. 500), Springer-Verlag, 1975 pp. 365–369

Takeuti, G.: Work of Paul Bernays and Kurt Gödel. In: Logic, Methodology and Phil, of Science VI, North-Holland P. C. 1982 pp. 77–85

Takeuti, G.: Some relations among systems for bounded arithmetic, Ann. Pure Appl. Logic Vol. 39, 1988 pp. 75–104

Takeuti, G.: Bounded arithmetic and truth definition, Annals Pure Appl. Log. Vol. 39, 1988 pp. 75–104

Takeuti, G.: Si 3 and V i 2 (BD) , Arch. Math. Log. Vol. 29, 1990 pp. 149–169

Takeuti, G.: Some relations among systems of bounded arithmetic. In: Heyting: Mathematical Logic, Petkov, P. ed., Plenum Press, 1990, pp. 139–154

Takeuti, G.: Sharply bounded arithmetic and the function a-*l. In: Workshop in Logic and Computation, Amer. Math. Soc. Contemporary Math. 106, 1990, pp. 281–288

Takeuti, G.: A second order version of S2 and U 1 2 , Journal of Symb. Logic 56, 1991, pp. 1038–1063

Takeuti, G.: RSUV Isomorphism. In: Arithmetic, Proof Theory and Computational Complexity, eds. Clote, P. and Krajíček, J., Oxford Univ. Press 1992, pp. 364–386

Tarski, A.: Pojęcie prawdy w jezykach nauk dedukcyjnych, Prace Tow. Naukowego Warszawskiego vol. III, no. 34, 1933, 116 pp.

Tarski, A.: Der Wahrheitsbegriff in den formalisierten Sprachen, Studia Phil. Vol. 1, 1936 pp. 261–405

Tarski, A.: Logic, semantics, metamathematics: Papers from 1923 to 1938 (translated by J. H. Woodger). Clarenton Press, Oxford 1956, 471 pp.

Tarski, A. Mostowski A. Robinson, R. M.: Undecidable theories, North Holland: Amsterdam 1953, 98 pp.

Tennenbaum, S.: Non-archimedean models for arithmetic. In: Notices Amer. Math. Soc, 1959 pp. 270

Toda, S.: On the computational power of PP and ⊕PP, 30-th Symp. on Foundations of Comp. Sci., 1989 pp. 514–519

Trahtenbrot, B. A.: The impossibility of an algorithm for decision problem for finite domains, Doklady Akad. Nauk SSSR Vol. 70, 1950 pp. 569–572

Trahtenbrot, B. A.: On recursive separability, Doklady Akad. Nauk SSSR Vol. 88, 1953 pp. 953–956

Tsuboi, A.: On M-recursively saturated models of arithmetic, Tsukuba Journ. Math. Vol. 6, 1982 pp. 305–318

Turing, A. M.: Systems of logic based on ordinals, Proc. London Math. Soc. (2) Vol. 45, 1939 pp. 161–228

Tverskoy, A. A.: A sequence of combinatorial judgments which are independent of Peano Arithmetic, Moscow University Math. Bull. Vol. 35, 1980 pp. 6–13

Tverskoy, A. A.: Investigation of recursiveness and arithmeticity of signature functionsin nonstandard models of arithmetic, Dokl. Acad. Nauk USSR Vol. 262, 1982, pp.1325–1328

Von Der Twer, T.: Some remarks on the mathematical incompleteness of Peano's arithmetic found by Paris and Harrington. In: Set theory and model theory (Bonn, 1979) (Lect. Notes Math. 872), Springer-Verlag, 1981 pp. 157–174

Von Der Twer, T.: On the strength of several versions of Dirichlet's (“pigeon-hole”-)principle in the sense of first-order logic, Arch. Math. Log. Vol. 21, 1981 pp. 69–76

Ursini, A.: A sequence of theories for arithmetic whose union is complete, Rend. Semin.Mat. Univ. Padova Vol. 57, 1977 pp. 75–92

Uspenskij, V. A.: The Gödel theorem and the theory of algorithms, Usp Mat Nauk Vol.8/4(56), 1953 pp. 176–178

Uspenskij, V. A.: Theorem of Gödel and theory of algorithms, Doklady Akad. Nauk SSSR Vol. 91, 1953 pp. 737–740

Vaananen, J.: A new incompletness in arithmetic, Arkhimedes Vol. 31, 1979 pp. 30–37

Valentini, S. Solitro, U.: The modal logic of consistency assertions of Peano arithmetic, Zeitschr. Math. Log. Grundl. Math. Vol. 29, 1983 pp. 25–32

Vardanyan, V. A.: Arifmetičeskaya složnost predikatnych logik dokazuemosti i ich fragment ov, Doklady Akademii Nauk SSSR Vol. 288, 1986 pp. 11–14

Vaught, R. L.: Sentences true in all constructive models, Journ. Symb. Log. Vol. 25, 1960 pp. 39–53

Vaught, R. L.: On a theorem of Cobham concerning undecidable theories. In: Logic, Methodology and Philosophy of Science, Stanford, 1962, pp. 14–25

Vaught, R.: On axiomatizability by a schema, Journ. Symb. Log. Vol. 32,1967, pp. 473–479

Verbrugge, L. C: Does Solovay's completeness theorem extend to bounded arithmetic?(Master's thesis), Amsterdam, 1988

Verbrugge, R.: Feasible Interpretability. In: Arithmetic, Proof Theory and Computational Complexity, eds. Clote, P. and Krajíček, J., Oxford Univ. Press 1992, pp. 389–400

Visser, A.: Numerations, lambda-calculus & arithmetic. In: To H. B. Curry: essays oncombinatory logic, lambda calculus and formalism, Academic Press, London, 1980 pp.259–284

Visser, A.: On the completeness principle: a study of provability in Heyting's arithmeticand extensions, Ann. Math. Logic Vol. 22, 1982 pp. 263–295

Visser, A.: The provability logics of recursively enumerable theories extending Peanoarithmetic at arbitrary theories extending Peano arithmetic, Journ. Philos. Logic, Vol.13, 1984 pp. 97–113

Visser, A.: Evaluation, provably deductive equivalence in Heyting's arithmetic of substitution instances of propositional formulas, Logic group preprint series No 4 Univ. Utrecht, 1985, 58 p.

Visser, A.: Preliminary notes on interpretability logic, Logic group preprint series Univ.Utrecht, 1988, 37 p.

Visser, A.: Peano's smart children: A provability logical study of systems with builtinconsistency, Notre Dame Journ. Formal Logic 30, 1989, pp. 161–196

Visser, A.: Interpretability logic. In: Mathematicae Logic, Petkov, ed., Plenum Press, 1990, pp. 175–208

Visser, A.: An inside view of EXP, Journ. of Symbolic Logic 57, 1992, pp. 131–165

Vopĕnka, P.: A new proof of the Gödel's result on non-provability of consistency, Bull.Acad. Polon. Sci. Vol. 14, 1966 pp. 111–116

Wagner, K., Wechsung, G.: Computational Complexity, VEB Deutcher Verlag der Wissenschaft, Berlin, 1986, 551 pp.

Wainer, S.: A classification of ordinal recursive functions, Arch. Math. Log. Vol. 13, 1970, pp. 136–153

Wainer, S.: Ordinal recursion and a refinement of the extended Grzegorczyk hierarchy, Journ. Symb. Log. Vol. 37, 1972, 281–292

Wang, H.: The non-finitizability of impredicative principles, Proc. Nat. Acad. Sci. USA Vol. 36, 1950 pp. 479–484

Wang, H.: Remarks on the comparsion of axiom systems, Proc. Nat. Acad. Sci. USA Vol.36, 1950 pp. 448–453

Wang, H.: Arithmetic translantion of axiom systems, Trans Amer. Math. Soc Vol. 71, 1951 pp. 283–293

Wang, H.: Arithmetic models for formal systems, Methodos Vol. 3, 1951 pp. 217–232

Wang, H.: Truth definitions and consistency proofs, Trans Amer. Math. Soc Vol. 73, 1952 pp. 243–275

Wang, H.: Undecidable sentences generated by semantic paradoxes, Journ. Symb. Log.Vol. 20, 1955 pp. 31–43

Wang, H.: The axiomatization of arithmetic, Journ. Symb. Log. Vol. 22, 1957 pp. 145–158

Wang, H.: The arithmetization of methamathematics. In: Wang H.: Survey of Mathematical Logic, North Holland: Amsterdam, 1963 pp. 334–361

Wang, P. S.: The undecidability of the existence of zeros of real elementary functions, Journ. A. C. M. Vol. 21, 1974 pp. 586–589

Wegener, I.: The Complexity of Boolean Functions, Wiley/Teubner, New York and Stuttgart, 1987, 457 pp.

Wilkie, A. J.: On models of arithmetic – answer to two problems raised by H. Gaifman, Journ. Symb. Log. Vol. 40, 1975 pp. 41–47

Wilkie, A. J.: On the theories of end extensions of models of arithmetic. In: Set theory and Hierarchy theory V. Proceedings of the 3rd Conference on Set Theory and Hierarchytheory (Lect. Notes Math. 619), Springer-Verlag, 1977 pp. 305–310

Wilkie, A. J.: On models of arithmetic having non-modular substructure lattices, Fund.Math. Vol. 95, 1977 pp. 223–237

Wilkie, A. J.: Some results and problems on weak systems of arithmetic. In: Logiccolloquium 77, Proc, Wroclaw 1977, Stud. Logic Found. Math. Vol. 96, 1978 pp. 285–296

Wilkie, A. J.: Applications of complexity theory to EQ -definability problems in arithmetic. In: Model Theory of Algebra and Arithmetic (Lect. Notes Math. 834), Springer-Verlag, 1980 pp. 363–369

Wilkie, A. J.: On discretely ordered rings in which every definable ideal is principal. In: Model Theory and Arithmetic Comptes Rendus d'une Action Thématique Programméedu C. N. R. S. sur la Théorie des Modèles et l'Arithmétique, Paris, FVance, 1979/80(Lect. Notes Math. 890), Springer-Verlag, 1981 pp. 297–303

Wilkie, A. J.: On core structures for Peano arithmetic. In: Logic colloquium '80, Stud.Logic Found. Math. 108, 1982 pp. 311–314

Wilkie, A. J.: On discretely ordered rings in which every definable ideal is principal. In: Model theory and arithmetic (Lect. Notes Math. 890), Springer-Verlag, 1985 pp.197–303

Wilkie, A. J.: A model-theoretic proof of Buss's characterization of the polynomial timecomputable functions, manuscript, 1985

Wilkie, A. J.: On sentences interpret able in systems of arithmetic. In: Logic Colloquium'84 (Studies in Logic and the Foundations of Mathematics 120), North-Holland, 1986 pp. 329–342

Wilkie, A. J.: On schemes axiomatizing arithmetic. In: Proceedings ICM, Berkeley, 1986 pp. 331–337

Wilkie, A. J., Paris, J. B.: Some results on bounded induction. In: Proceedings of thesecond Easter conference on model theory (Wittenberg, 1984), Humboldt Univ. Berlin, 1984 pp. 223–228

Wilkie, A. J., Paris, J. B.: On the scheme of induction for bounded arithmetic formulas, Annals Pure Appl. Logic Vol. 35, 1987 pp. 261–302

Wilmers, G.: Minimally saturated models. In: Model Theory of Algebra and Arithmetic(Lect. Notes Math. 834), Springer-Verlag, 1980 pp. 370–380

Wilmers, G.: Bounded existential induction, Journ. Symb. Log. Vol. 50, 1985 pp. 72–90

Woods, A.: Some problems in logic and number theory and their connections. Dissertation, Manchester, 1981

Woods, A.: Bounded arithmetic formulas and Turing machines of constant alternation. In: Logic Colloquium '84 (Studies in Logic and the Foundations of Mathematics 120), North-Holland, 1986 pp. 355–377

Wrathall, C: Rudimentary predicates and relative computation, SIAM Journ. Comput., Vol. 7, 1978 pp. 194–209

Yasugi, M.: Gentzen reduction revisited, Publ. RIMS Kyoto Univ. Vol. 16, 1980 pp. 1–33

Young, P.: Gödel theorems, exponential difficulty and undecidability of arithmetic theories: an exposition. In: Recursion Theory. Proceedings of the A. M. S. – A. S. L. Summer Institute (Proc. Symp. Pure Math. 42), Amer. Math. Soc: Providence, 1985 pp. 503–522

Yukami, T.: A theorem on the formalized arithmetic with function symbols ′ and +, Tsukuba Journ. Math. Vol. 1, 1977 pp. 195–211

Yukami, T.: A note on formalized arithmetic with function symbols ′ and +, Tsukuba Journ. Math. Vol. 2, 1978 pp. 69–73

Zahn, G.: On the additive structure of non-standard models of arithmetic. Dissertation,Univ. S. Carolina, 1971

Žák, S.: A Turing machine hierarchy, Theor. Computer Science Vol. 26, 1983 pp. 327–333

Zbierski, P.: Indicators and incompleteness of Peano arithmetic, Acta Cient. Venezolana Vol. 31, 1980 pp. 487–495

Zbierski, P.: Nonstandard interpretations of higher order theories, Fund. Math. Vol. 112,1981 pp. 175–186

Metamathematics of First-Order Arithmetic

This Book has been cited by the following publications. This list is generated based on data provided by Crossref.

Book description

Reviews

Refine List

Actions for selected content:

Contents

Frontmatter
pp i-iv

Dedication
pp v-vi

Preface to the Series Perspectives in Mathematical Logic
pp vii-viii

Authors' Preface
pp ix-x

Contents
pp xi-xiv

Introduction
pp 1-4

Preliminaries
pp 5-24

PART A
pp 25-26

Chapter I - Arithmetic as Number Theory, Set Theory and Logic
pp 27-110

Chapter II - Fragments and Combinatorics
pp 111-144

PART B
pp 145-146

Chapter III - Self-Reference
pp 147-212

Chapter IV - Models of Fragments of Arithmetic
pp 213-264

PART C
pp 265-266

Chapter V - Bounded Arithmetic
pp 267-396

Bibliographical Remarks and Further Reading
pp 397-408

Bibliography
pp 409-454

Index of Terms
pp 455-458

Index of Symbols
pp 459-460

Metrics

Altmetric attention score

Full text views

Book summary page views

Accessibility standard: Unknown

Why this information is here

Accessibility Information

Metamathematics of First-Order Arithmetic

Book description

Reviews

Refine List

Actions for selected content:

Save Search

Contents

Metrics

Altmetric attention score

Full text views

Book summary page views

Accessibility standard: Unknown

Why this information is here

Accessibility Information