Sommaire du Fascicule no. 3

Tiering as a recursion technique

Simmons, Harold

Text on Project Euclid
PDF
Alt PDF
p. 321-350

Project Euclid
Mathematical existence

Maddy, Penelope

Text on Project Euclid
PDF
Alt PDF
p. 351-376

Project Euclid
Turing computations on ordinals

Koepke, Peter

Text on Project Euclid
PDF
Alt PDF
p. 377-397

Project Euclid
The role of true finiteness in the admissible recursively enumerable degrees

Greenberg, Noam

Text on Project Euclid
PDF
Alt PDF
p. 398-410

Project Euclid
Partition theorems and computability theory

Mileti, Joseph R.

Text on Project Euclid
PDF
Alt PDF
p. 411-427

Project Euclid
Undecidability of first-order intuitionistic and modal logics with two variables

Kontchakov, Roman ; Kurucz, Agi ; Zakharyaschev, Michael

Text on Project Euclid
PDF
Alt PDF
p. 428-438

Project Euclid
Reviews, Bull. Symbolic Logic 11, iss. 3 (2005)

Text on Project Euclid
PDF
Alt PDF
p. 439-453

Project Euclid
2004—05 Winter Meeting of the Association for Symbolic Logic, Atlanta Marriott Marquis, Atlanta, Georgia, January 7—8, 2005

Text on Project Euclid
PDF
Alt PDF
p. 454-460

Project Euclid
Notices, Bull. Symbolic Logic 11, iss. 3 (2005)

Text on Project Euclid
PDF
Alt PDF
p. 461-464

Project Euclid