Lecture Notes in Logic (Project Euclid)

J. M. Larrazabal (Editor), D. Lascar (Editor), G. Mints (Editor). Logic Colloquium '96: Proceedings of the Colloquium held in San Sebastián, Spain, July 9-15, 1996 (1998)

Mon, 23 Feb 2009 13:34 EST

Contents:

Nicholas Asher. The Logical Foundations of Discourse Interpretation. 1--44.

Harry Buhrman, Leen Torenvliet. Complete Sets and Structure in Subrecursive Classes. 45--77.

David M. Evans, Darren G. D. Gray. Kernels and cohomology groups for some finite covers. 79--99.

Vladimir Kanovei. On "star" schemata of Kossak and Paris. 101--114.

Ulrich Kohlenbach. Arithmetizing proofs in analysis. 115--158.

Roman Kossak. Satisfaction classes and automorphisms of models of $\rm PA$. 159--169.

M. Pentus. Free monoid completeness of the Lambek calculus allowing empty premises. 171--209.

Ya'acov Peterzil, Anand Pillay, Sergei Starchenko. Simple groups definable in O-minimal structures. 211--218.

Mark Reynolds. Two-Dimensional Temporal Logic. 219--236.

James H. Schmerl. Rather Classless, Highly Saturated Models of Peano Arithmetic. 237--246.

Gaisi Takeuti. Incompleteness theorems and ${\rm S}\sb 2\sp i$ versus ${\rm S}\sb 2\sp {i+1}$. 247--261.

Johann A. Makowsky (Editor), Elena V. Ravve (Editor). Logic Colloquium '95: Proceedings of the Annual European Summer Meeting of the Association of Symbolic Logic, held in Haifa, Israel, August 9-18, 1995 (1998)

Mon, 23 Feb 2009 14:10 EST

Contents:

H. Becker. The Number of Path-Components of a Compact Subset of $R\sp n$. 1--16.

P. Cholak, R. Downey, R. Shore. Intervals without Critical Triples. 17--43.

S. B. Cooper. Beyond Gödel's Theorem: Turing Nonrigidity Revisited. 44--50.

A. Dawar. Types and Indescernibles in Finite Models. 51--65.

I. Herzog. Model Theory of Modules. 66--72.

W. Hodges, A. Nies. Noninterpretability of Infinite Linear Orders. 73--78.

I. Juhász, L. Soukup, Z. Szentmiklóssy. Combinatorial Principles from Adding Cohen Reals. 79--103.

J. Krajíček. Extensions of models of PV. 104--114.

J. F. Lynch. Convergence Laws for Random Graphs. 115--133.

P. Maddy. $V=L$ and Maximize. 134--152.

M. Makkai. Towards a Categorical Foundation of Mathematics. 153--190.

D. Marker. Strongly Minimal Sets and Geometry. 191--213.

S. Micali. Computationally-Sound Proofs. 214--268.

M. Pentus. Lambek Calculus and Formal Languages. 269--272.

Y. Peterzil. Zil'ber's Trichotomy and o-minimal Structures. 273--274.

M. Rathjen. The Higher Infinite in Proof Theory. 275--304.

S. Shelah. There May Be No Nowhere Dense Ultrafilter. 305--324.

A. P. Stolboushkin. Towards Recursive Model Theory. 325--338.

S. S. Wainer. Accessible Segments of the Fast Growing Hierarchy. 339--348.

Per Lindström. Aspects of Incompleteness (1997)

Mon, 23 Feb 2009 14:12 EST

Contents:

Chapter 0: Introduction. 1--4.

Chapter 1: Preliminaries. 5--22.

Chapter 2: Incompleteness. 23--41.

Chapter 3: Numerations of r.e. sets. 42--51.

Chapter 4: Axiomatizations. 52--61.

Chapter 5: Partial conservativity. 62--74.

Chapter 6: Interpretability. 75--93.

Chapter 7: Degrees of interpretabilty. 94--118.

Chapter 8: Generalizations. 119--124.

Martin Otto. Bounded Variable Logics and Counting: A Study in Finite Models (1997)

Mon, 23 Feb 2009 14:17 EST

Contents:

Chapter 0: Introduction. 1--14.

Chapter 1: Definitions and Preliminaries. 15--49.

Chapter 2: The Games and Their Analysis. 51--78.

Chapter 3: The Invariants. 79--95.

Chapter 4: Fixed-Point Logic with Counting. 97--114.

Chapter 6: Canonization Problems. 131--148.

Chapter 7: Canonization for Two Variables. 149--175.

John R. Steel. The Core Model Iterability Problem (1996)

Mon, 23 Feb 2009 14:22 EST

Contents:

Chapter 0: Introduction. 1--4.

Chapter 1: The construction of $K^c$. 5--9.

Chapter 2: Iterability. 10--24.

Chapter 3: Thick classes and universal weasels. 25--28.

Chapter 4: The hull and definability properties. 29--34.

Chapter 5: The construction of true $K$. 35--42.

Chapter 6: An inductive definition of $K$. 43--52.

Chapter 7: Some applications. 53--72.

Chapter 8: Embeddings of $K$. 73--88.

Chapter 9: A general iterability theorem. 89--108.

Josep Maria Font, Ramon Jansana. A General Algebraic Semantics for Sentential Logics (2009)

Mon, 23 Feb 2009 14:23 EST

Contents:

Introduction. 1--14.

Chapter 1: Generalities on Abstract Logics and Sentential Logics. 15--30.

Chapter 2: Abstract Logics as Models of Sentential Logics. 31--58.

Chapter 3: Applications to Protoalgebraic and Algebraizable Logics. 59--73.

Chapter 4: Abstract Logics as Models of Gentzen Systems. 75--103.

Chapter 5: Applications to Particular Sentential Logics. 105--129.

Petr Hájek (Editor). Gödel '96: Logical foundations of mathematics, computer science and physics---Kurt Gödel's legacy, Brno, Czech Republic, August 1996, proceedings (1996)

Mon, 23 Feb 2009 14:27 EST

Contents:

Solomon Feferman. Gödel's program for new axioms: why, where, how and what?. 3--22.

Matthias Baaz. Infinite-valued Gödel logics with $0$-$1$-projections and relativizations. 23--33.

G. F. R. Ellis. Contributions of K. Gödel to relativity and cosmology. 34--49.

Boris A. Kushner. Kurt Gödel and the constructive mathematics of A. A. Markov. 50--63.

Charles Parsons. Hao Wang as philosopher. 64--80.

Pavel Pudlák. A bottom-up approach to foundations of mathematics. 81--97.

Wilfried Sieg, John Byrnes. $K$-graph machines: generalizing Turing's machines and arguments. 98--119.

Gaisi Takeuti, Masahiro Yasumoto. Forcing on bounded arithmetic. 120--138.

Albert Visser. Uniform interpolation and layered bisimulation. 139--164.

C. Anthony Anderson, Michael Gettings. Gödel's ontological proof revisited. 167--172.

Tadashi Araragi. A uniform theorem proving tableau method for modal logic. 173--182.

Dorella Bellè, Franco Parlamento. Decidability of the $\exists^*\forall^*$-class in the membership theory NWL. 183--194.

Marcin Benke. A logical approach to complexity bounds for subtype inequalities. 195--204.

Benjamin Blankertz, Andreas Weiermann. How to characterize provably total functions by the Buchholz operator method. 205--213.

Giora Hon. Completeness has to be restricted: Gödel's interpretation of the parameter $t$. 214--223.

Jan Johannsen. A bounded arithmetic theory for constant depth threshold circuits. 224--234.

Lars Kristiansen. Information content and computational complexity of recursive sets. 235--246.

Robert K. Meyer. Kurt Gödel and the consistency of ${\rm R}^{##}$. 247--256.

Leonard Paulík. Best possible answer is computable for fuzzy SLD-resolution. 257--266.

Robert F. Stärk. The finite stages of inductive definitions. 267--290.

Michael Stöltzner. Gödel and the theory of everything. 291--306.

Andrzej M. Zarach. Replacement $\nrightarrow$ collection. 307--322.

D. Marker, M. Messmer, A. Pillay. Model Theory of Fields (1996)

Mon, 23 Feb 2009 16:08 EST

Contents:

David Marker. Chapter 1: Introduction to the Model Theory of Fields. 1--37.

David Marker. Chapter 2: Model Theory of Differential Fields. 38--113.

Anand Pillay. Chapter 3: Differential Algebraic Groups and the Number of Countable Differentially Closed Fields. 114--134.

Margit Messmer. Chapter 4: Some Model Theory of Separably Closed Fields. 135--152.

Arnold W. Miller. Descriptive Set Theory and Forcing: How to Prove Theorems about Borel Sets the Hard Way (1995)

Mon, 23 Feb 2009 16:09 EST

Contents:

Chapter 1: What are the reals, anyway?. 5--6.

Chapter 2: Borel Hierarchy. 7--10.

Chapter 3: Abstract Borel hierarchies. 11--12.

Chapter 4: Characteristic function of a sequence. 13--15.

Chapter 5: Martin's Axiom. 16--17.

Chapter 6: Generic $\emph{G}_{\delta}$. 18--20.

Chapter 7: $\alpha$-forcing. 21--25.

Chapter 8: Boolean algebras. 26--29.

Chapter 9: Borel order of a field of sets. 30--31.

Chapter 10: CH and orders of separable metric spaces. 32--33.

Chapter 11: Martin-Solovay Theorem. 34--37.

Chapter 12: Boolean algebra of order $\omega_1$. 38--41.

Chapter 13: Luzin sets. 42--45.

Chapter 14: Cohen real model. 46--56.

Chapter 15: The random real model. 57--63.

Chapter 16: Covering number of an ideal. 64--67.

Chapter 17: Analytic sets. 68--70.

Chapter 18: Constructible well-orderings. 71--71.

Chapter 19: Hereditarily countable sets. 72--73.

Chapter 20: Shoenfield Absoluteness. 74--75.

Chapter 21: Mansfield-Solovay Theorem. 76--77.

Chapter 22: Uniformity and Scales. 78--81.

Chapter 23: Martin's axiom and Constructibility. 82--83.

Chapter 24: $\Sigma^1_2$ well-orderings. 84--84.

Chapter 25: Large $\Pi^1_2$ sets. 85--87.

Chapter 26: Souslin-Luzin Separation Theorem. 88--89.

Chapter 27: Kleene Separation Theorem. 90--92.

Chapter 28: $\Pi^1_1$-Reduction. 93--94.

Chapter 29: $\Delta^1_1$-codes. 95--97.

Chapter 30: $\Pi^1_1$ equivalence relations. 98--102.

Chapter 31: Borel metric spaces and lines in the plane. 103--106.

Chapter 32: $\Sigma^1_1$ equivalence relations. 107--110.

Chapter 33: Louveau's Theorem. 111--116.

Chapter 34: Proof of Louveau's Theorem. 117--120.

William J. Mitchell, John R. Steel. Fine Structure and Iteration Trees (1994)

Mon, 23 Feb 2009 16:11 EST

Contents:

Chapter 0: Introduction. 1--4.

Chapter 1: Good Extender Sequences. 5--9.

Chapter 2: Fine Structure. 10--27.

Chapter 3: Squashed Mice. 28--33.

Chapter 4: Ultrapowers. 34--46.

Chapter 5: Iteration Trees. 47--57.

Chapter 6: Uniqueness of Wellfounded Branches. 58--68.

Chapter 7: The Comparison Process. 69--73.

Chapter 8: Solidity and Condensation. 74--88.

Chapter 9: Uniqueness of the Next Extender. 89--95.

Chapter 10: Closure under Initial Segment. 96--98.

Chapter 11: The Construction. 99--107.

Chapter 12: Iterability. 108--124.

J. Oikkonen (Editor), J. Väänänen (Editor). Logic Colloquium '90: ASL Summer Meeting in Helsinki (1993)

Mon, 23 Feb 2009 16:19 EST

Contents:

Wilfried Buchholz. A note on the ordinal analysis of KPM. 1--9.

Steven Buechler, Ludomir Newelski. On the geometry of $U$-rank $2$ types. 10--24.

S. Barry Cooper. Definability and global degree theory. 25--45.

Patrick Dehornoy. About the irreflexivity hypothesis for free left distributive magmas. 46--61.

Hans-Dieter Donder. On $\omega_1$-complete filters. 62--65.

D. M. Gabbay. Labelled deductive systems: a position paper. 66--68.

D. M. Gabbay, I. M. Hodkinson, M. A. Reynolds. Temporal expressive completeness in the presence of gaps. 89--121.

Jaakko Hintikka. New foundations for mathematical theories. 122--144.

Haim Judah. Absoluteness for projective sets. 145--154.

Richard Laver. A division algorithm for the free left distributive algebra. 155--162.

Grigori Mints. Gentzen-type systems and resolution rule. II. Predicate logic. 163--190.

Joan Rand Moschovakis. An intuitionistic theory of lawlike, choice and lawless sequences. 191--209.

Yiannis N. Moschovakis. Sense and denotation as algorithm and value. 210--249.

M. -H. Mourgues, J. -P. Ressayre. A transfinite version of Puiseux's theorem, with applications to real closed fields. 250--258.

T. G. Mustafin. On similarities of complete theories. 259--265.

Françoise Point. Decidability questions for theories of modules. 266--280.

Saharon Shelah. On ${\rm CH}+2^{\aleph_1}\to(\alpha)^2_2$ for $\alpha<\omega_2$. 281--289.

Alan P. Silver. On the structure of gamma degrees. 290--305.

J. R. Shoenfield. Recursion Theory (1993)

Mon, 23 Feb 2009 16:20 EST

Contents:

Chapter 1: Computability. 1--2.

Chapter 2: Functions and Relations. 2--3.

Chapter 3: The Basic Machine. 3--5.

Chapter 4: Macros. 5--8.

Chapter 5: Closure Properties. 8--11.

Chapter 6: Definitions of Recursive Functions. 11--16.

Chapter 7: Codes. 16--20.

Chapter 8: Indices. 20--26.

Chapter 9: Church's Thesis. 26--28.

Chapter 10: Word Problems. 28--32.

Chapter 11: Undecidable Theories. 32--39.

Chapter 12: Relative Recursion. 39--43.

Chapter 13: The Arithmetical Hierarchy. 43--48.

Chapter 14: Recursively Enumerable Relations. 48--53.

Chapter 15: Degrees. 53--59.

Chapter 16: Evaluation of Degrees. 59--62.

Chapter 17: Large RE Sets. 63--67.

Chapter 18: Functions of Reals. 67--71.

Chapter 19: The Analytical Hierarchy. 71--74.

Chapter 20: The Projective Hierarchy. 74--78.