Articles
The Complexity of Propositional Proofs
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 417-481
-
- Article
- Export citation
Describing Groups
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 305-339
-
- Article
- Export citation
Gödel and Set Theory
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 153-188
-
- Article
- Export citation
Set Theory and C*-Algebras
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 1-20
-
- Article
- Export citation
Incompleteness in a General Setting
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 21-30
-
- Article
- Export citation
In the Shadows of the Löwenheim-Skolem Theorem: Early Combinatorial Analyses of Mathematical Proofs
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 189-225
-
- Article
- Export citation
Relating First-Order Set Theories and Elementary Toposes
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 340-358
-
- Article
- Export citation
Descriptive set Theory of Families of Small Sets
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 482-537
-
- Article
- Export citation
Reviews
Shawn Hedman. A first course in logic: an introduction to model theory, proof theory, computability, and complexity. Oxford Texts in Logic 1. Oxford University Press, 2004, xx + 431 pp.
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 538-540
-
- Article
- Export citation
Articles
Inner Models and Ultrafilters In L(ℝ)
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 31-53
-
- Article
- Export citation
Reviews
Larry Wos and Gail W. Pieper. A fascinating country in the world of computing—your guide to automated reasoning. World Scientific, Singapore, New Jersey, London, Hong Kong, 1999, 608 pp.
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 359-361
-
- Article
- Export citation
Communications
Local Definitions in Degree Structures: The Turing Jump, Hyperdegrees and Beyond
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 226-239
-
- Article
- Export citation
Reviews
Richard L. Epstein. Classical mathematical logic. The semantic foundations of logic. With contributions by Lesław W. Szczerba. Princeton University Press, Princeton and Oxford, 2006, xxii + 522 pp.
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 540-541
-
- Article
- Export citation
Mark Burgin. Super-recursive algorithms. Monographs in Computer Science, Springer, New York, 2005, xiv + 304 pp.
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 240-241
-
- Article
- Export citation
John L. Bell. The continuous and the infinitesimal in mathematics and philosophy. Polimetrica, International Scientific Publisher, Monza-Milano, 2005, 349 pp.
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 361-363
-
- Article
- Export citation
Communications
Fragment of Nonstandard Analysis with a Finitary Consistency Proof
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 54-70
-
- Article
- Export citation
On the Equimorphism Types of Linear Orderings
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 71-99
-
- Article
- Export citation
Reviews
Graham Priest. Doubt truth to be a liar. Oxford University Press, 2006, xii + 226 pp.
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 541-544
-
- Article
- Export citation
Peter G. Hinman. Fundamentals of mathematical logic. A K Peters, Wellesley, Massachusetts, 2005, xvi + 878 pp.
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 363-365
-
- Article
- Export citation
Torkel Franzén. Gödel's theorem: an incomplete guide to its use and abuse. AK Peters, Ltd., Wellesley, Massachusetts, 2005, x + 172 pp.
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 241-243
-
- Article
- Export citation