default search action
The Journal of Symbolic Logic, Volume 62
Volume 62, Number 1, March 1997
- Philip Scowcroft:
More on Imaginaries in p-adic Fields. 1-13 - Lou van den Dries:
T-Convexity and Tame Extensions II. 14-34 - Jindrich Zapletal
:
Splitting Number at Uncountable Cardinals. 35-42 - Douglas Peterson:
Cardinal Functions on Ultraproducts of Boolean Algebras. 43-59 - Patrick Simonetta:
Une Correspondance entre Anneaux Partiels et Groupes. 60-78 - V. Yu. Shavrukov:
Undecidability in Diagonalizable Algebras. 79-116 - Douglas R. Burke, Yo Matsubara:
Ideals and Combinatorial Principles. 117-122 - Françoise Maurin:
The Theory of Integer Multiplication with Order Restricted to Primes Is Decidable. 123-130 - Frank Wolter
Completeness and Decidability of Tense Logics Closely Related to Logics Above K4. 131-158 - Olivier Chapuis
forall-Free Metabelian Groups. 159-174 - Matthew Foreman, Menachem Magidor:
A Very Weak Square Principle. 175-196 - Kyriakos Kontostathis:
The Combinatorics of the Splitting Theorem. 197-224 - Robin Hirsch
Step by Step - Building Representations in Algebraic Logic. 225-279 - Jindrich Zapletal
Small Forcings and Cohen Reals. 280-284 - Nianzheng Liu:
Analytic Cell Decomposition and the Closure of p-adic Semianalytic Sets. 285-303 - Anne Vedø:
Asymptotic Probabilities for Second-Order Existential Kahr-Moore-Wang Sentences. 304-319
Volume 62, Number 2, June 1997
- Greg Hjorth:
Some Applications of Coarse Inner Model Theory. 337-365 - Joan Bagaria
A Characterization of Martin's Axiom in Terms of Absoluteness. 366-372 - Joel David Hamkins
Canonical Seeds and Prikiry Trees. 373-396 - Steven D. Leonhardi:
Generalized Nonsplitting in the Recursively Enumerable Degrees. 397-437 - David Pincus:
The Dense Linear Ordering Principle. 438-456 - Jan Krajícek:
Interpolation Theorems, Lower Bounds for Proof Systems, and Independence Results for Bounded Arithmetic. 457-486 - Anand Pillay:
Remarks on Galois Cohomology and Definability. 487-492 - José Iovino:
Definability in Functional Analysis. 493-505 - Satoko Titani:
Completeness of Global Intuitionistic Set Theory. 506-528 - Philip Kremer:
On the Complexity of Propositional Quantification in Intuitionistic Logic. 529-544 - Georg Gottlob:
Relativized Logspace and Generalized Quantifiers over Finite Ordered Structures. 545-574 - Thomas Strahm:
Polynomial Time Operations in Explicit Mathematics. 575-594 - Kenneth Schilling, Bosko Zivaljevic:
Louveau's Theorem for the Descriptive Set Theory of Internal Sets. 595-607
- Moshe Y. Vardi:
Special Selection in Logic in Computer Science. 608 - James F. Lynch:
Infinitary Logics and Very Sparse Random Graphs. 609-623 - Ursula Martin
The Order Types of Termination Orderings on Monadic Terms, Strings and Multisets. 624-635 - Paliath Narendran, Frank Pfenning, Richard Statman:
On the Unification Problem for Cartesian Closed Categories. 636-647 - Mati Pentus
Product-Free Lambek Calculus and Context-Free Grammars. 648-660 - Alexei P. Stolboushkin, Damian Niwinski:
y = 2x vs. y = 3x. 661-672
Volume 62, Number 3, September 1997
- Thierry Coquand:
Minimal Invariant Spaces in Formal Topology. 689-698 - Jirí Adámek, Peter T. Johnstone, Johann A. Makowsky, Jirí Rosický:
Finitary Sketches. 699-707 - Maria Luisa Bonet, Toniann Pitassi, Ran Raz
Lower Bounds for Cutting Planes Proofs with Small Coefficients. 708-728 - Sabine Broda
Compact Bracket Abstraction in Combinatory Logic. 729-740 - Douglas R. Burke:
Precipitous Towers of Normal Filters. 741-754 - Vincent Danos, Jean-Baptiste Joinet
A New Deconstructive Logic: Linear Logic. 755-807 - Sy D. Friedman:
Coding without Fine Structure. 808-815 - Robin Hirsch
Complete Representations in Algebraic Logic. 816-847 - Shmuel Lifsches, Saharon Shelah
Peano Arithmetic Maybe Not Be Interpretable in the Monadic Theory of Linear Orders. 848-872 - S. J. Mcleish:
The Forth Part of the Back and Forth Map in Countable Homogeneous Structures. 873-890 - Jirí Rosický:
Accessible Categories, Saturation and Categoricity. 891-901 - Saharon Shelah
The Cofinality Spectrum of the Infinite Symmetric Group. 902-916 - Miklós Erdélyi-Szabó:
Decidability of Scott's Model as an Ordered Q-Vectorspace. 917-924 - Alan R. Woods:
Counting Finite Models. 925-949 - Michael Zakharyaschev
Canonical Formulas for K4, Part III: The Finite Model Property. 950-975 - Marion Scheepers
Rothberger's Property and Partition Relations. 976-980 - Pavel Pudlák:
Lower Bounds for Resolution and Cutting Plane Proofs and Monotone Computations. 981-998 - Juha Oikkonen:
Undefinability of kappa-Well-Orderings in Linfty kappa. 999-1020 - Erik Palmgren, Viggo Stoltenberg-Hansen:
A Logical Presentation of the Continuous Functionals. 1021-1034
Volume 62, Number 4, December 1997
- Philip Kremer:
Defining Relevant Implication in a Propositionally Quantified S4. 1057-1069 - Anand Pillay, Akito Tsuboi:
Amalgamations Preserving aleph0-Categoricity. 1070-1074 - Deirdre Haskell
A Version of o-Minimality for the p-adics. 1075-1092 - Jan E. Holly:
Prototypes for Definable Subsets of Algebraically Closed Value Fields. 1093-1141 - Gerhard Jäger:
Power Types in Explicit Mathematics. 1142-1146 - Dirk van Dalen:
How Connected Is the Intuitionistic Continuum? 1147-1150 - Martin Gilchrist, Saharon Shelah
The Consistency of ZFC + 2aleph0 > alephomega + F(aleph2) = F(alephomega). 1151-1160 - Noa Goldring:
The Entire NS Ideal on Pgammaµ Can Be Precipitous. 1161-1172 - Ricardo Bianconi:
Nondefiniability Results for Expansions of the Field of Real Numbers by the Exponential Function and by the Restricted Sine Function. 1173-1178 - Heike Mildenberger:
Non-Constructive Galois-Tukey Connections. 1179-1186 - Sanjay Jain, Arun Sharma:
The Structure of Intrinsic Complexity of Learning. 1187-1201 - Yves Lafont:
The Finite Model Property for Various Fragments of Linear Logic. 1202-1208 - Andrea Asperti
A Sufficient Condition for Completability of Partial Combinatory Algebras. 1209-1214 - Rodney G. Downey, Steffen Lempp:
Contiguity and Distributivity in the Enumerable Turing Degrees. 1215-1240 - Renling Jin:
Type Two Cuts, Bad Cuts and Very Bad Cuts. 1241-1252 - Marion Scheepers
Variations on a Game of Gale (III): Remainder Strategies. 1253-1264 - John L. Bell:
Zorn's Lemma and Complete Boolean Algebras in Intuitionistic Type Theories. 1265-1279 - Alexis Bès:
Undecidable Extensions of Büchi Arithmetic and Cobham-Semënov Theorem. 1280-1296 - Andrzej Roslanowski, Saharon Shelah
Simple Forcing Notions and Forcing Axioms. 1297-1314 - Sara Negri, Silvio Valentini:
Tychonoff's Theorem in the Framework of Formal Topologies. 1315-1332 - Vladimir Kanovei
An Ulm-Type Classification Theorem for Equivalence Relations in Solovay Model. 1333-1351 - Eric Martin, Daniel N. Osherson:
Scientific Discovery Based on Belief Revision. 1352-1370 - Vann McGee:
The Complexity of the Modal Predicate Logic of "True in Every Transitive Model of ZF". 1371-1378 - Joan Bagaria
~Delta1n Sets of Reals. 1379-1428 - Carlo Toffalori:
Wildness Implies Undecidability for Lattices over Group Rings. 1429-1447 - Ieke Moerdijk, Erik Palmgren:
Minimal Models of Heyting Arithmetic. 1448-1460 - Michel Parigot:
Proofs of Strong Normalisation for Second Order Classical Natural Deduction. 1461-1479
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-15 00:06 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: