default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Journal of Symbolic Logic, Volume 57
Volume 57, Number 1, March 1992
- Shih Ping Tung:
Arithmetic Definability by Formulas with Two Quantifiers. 1-11 - Paola D'Aquino:
Local Behaviour of the Chebyshev Theorem in Models of I Delta0. 12-27 - Thierry Coquand:
An Intuitionistic Proof of Tychonoff's Theorem. 28-32 - Andrew M. Pitts:
On an Interpretation of Second Order Quantification in First Order Intuitionistic Propositional Logic. 33-52 - William I. Gasarch, Mark G. Pleszkoch, Robert Solovay:
Learning vi Queries in [+, <]. 53-81 - Juha Oikkonen:
A Recursion Principle for Linear Orderings. 82-96 - Anand Pillay, Zeljko Sokolovic:
Superstable Differential Fields. 97-108 - David Marker, Ya'acov Peterzil, Anand Pillay:
Additive Reducts of Real Closed Fields. 109-117 - Libo Lo:
Functions and Functionals on Finite Systems. 118-130 - Albert Visser:
An Inside View of EXP; or, The Closed Fragment of the Provability Logic of I Delta0+Omega1 with a Propositional Constant for EXP. 131-165 - Dan Velleman:
On a Topological Construction of Juhasz and Shelah. 166-171 - Bosko Zivaljevic:
Lusin-Sierpinski Index for the Internal Sets. 172-178 - Douglas Albert, Robert Baldinger, John Rhodes:
Undecidability of the Identity Problem for Finite Semigroups. 179-192 - Ivo Herzog, Philipp Rothmaler:
Models with Regular Generic Types, Part IV. 193-199 - Victor Harnik, Michael Makkai:
Lambek's Categorical Proof Theory and Läuchli's Abstract Realizability. 200-230 - Martin Otto:
Automorphism Properties of Stationary Logic. 231-237 - Daniel Lascar:
Les Automorphismes d'un Ensemble Fortement Minimal. 238-251
Volume 57, Number 2, June 1992
- Vladimir A. Uspensky:
Kolmogorov and Mathematical Logic. 385-412 - Alexander S. Kechris, Alain Louveau:
Descriptive Set Theory and Harmonic Analysis. 413-441 - Lauri Hella
, Kerkko Luosto:
The Beth-Closure of L(Qalpha) Is Not Finitely Generated. 442-448 - Lee A. Rubel:
On the Ring of Differentially-Algebraic Entire Functions. 449-451 - Athanassios Tzouvaras:
On Expandability of Models of Peano Arithmetic to Models of the Alternative Set Theory. 452-460 - Julius B. Barbanel:
A Note on a Result of Kunen and Pelletier. 461-465 - Victor Harnik:
Provably Total Functions of Intuitionistic Bounded Arithmetic. 466-477 - Shaughan Lavine:
A Spector-Gandy Theorem for cPCd(A) Classes. 478-500 - Alistair H. Lachlan:
aleph0-Categorical Tree-Decomposable Structures. 501-514 - Roger Villemaire:
Theories of Modules Closed Under Direct Products. 515-521 - Renling Jin:
Cuts in Hyperfinite Time Lines. 522-527 - Renling Jin:
U-Lusin Sets in Hyperfinite Time Lines. 528-533 - Renling Jin:
U-Monad Topologies of Hyperfinite Time Lines. 534-539 - Janusz Pawlikowski:
Adding Dominating Reals with omegaomega Bounding Posets. 540-547 - Frank O. Wagner:
À propos d'Équations Génériques. 548-554 - Colin McLarty:
Failure of Cartesian Closedness in NF. 555-556 - Hajime Ishihara:
Continuity Properties in Constructive Mathematics. 557-565 - Maarten de Rijke:
The Modal Logic of Inequality. 566-584 - Zhang Qinglong:
The Density of the Meet-Inaccessible r. e. Degrees. 585-596 - Zofia Adamowicz:
A Sharp Version of the Bounded Matijasevich Conjecture and the End-Extension Problem. 597-616 - Carlos H. Montenegro E.:
Combinatorics on Large Cardinals. 617-643 - Ludomir Newelski:
A Model and Its Subset. 644-658 - Jean-Yves Girard, Dag Normann:
Embeddability of PTYKES. 659-676 - Martin Kummer:
A Proof of Beigel's Cardinality Conjecture. 677-681 - Valentina S. Harizanov, Martin Kummer, James C. Owings:
Frequency Computations and the Cardinality Theorem. 682-687 - Ricardo Bianconi:
On Sets forall-Definable from Pfaffian Sets. 688-697 - Thomas G. Kucera, Mike Prest:
Imaginary Modules. 698-723 - Thomas G. Kucera, Mike Prest:
Four Concepts from "Geometrical" Stability Theory in Modules. 724-740 - David Ballard, Karel Hrbacek:
Standard Foundations for Nonstandard Analysis. 741-748
Volume 57, Number 3, September 1992
- Gisela M. Méndez:
Filters on the Space of Partitions Qk(lambda). 769-778 - Ya'acov Peterzil:
A Structure Theorem for Semibounded Sets in the Reals. 779-794 - Roy Dyckhoff:
Contraction-Free Sequent Calculi for Intuitionistic Logic. 795-807 - Jean-Louis Duret:
Équivalence élémentaire et Isomorphisme des Corps de Courbe sur un Corps Algébriquement Clos. 808-823 - Harvey Friedman, Robert K. Meyer:
Whither Relevant Arithmetic? 824-831 - Balázs Biró:
Non-Finite-Axiomatizability Results in Algebraic Logic. 832-843 - Franco Montagna:
Polynomially and Superexponentially Shorter Proofs in Fragments of Logic. 844-863 - Klaus Ambos-Spies, André Nies, Richard A. Shore:
The Theory of the Recursively Enumerable Weak Truth-Table Degrees Is Undecidability. 864-874 - Menachem Kojman, Saharon Shelah:
Nonexistence of Universal Orders in Many Cardinals. 875-891 - Alex Feldman:
Recursion Theory in a Lower Semilattice. 892-911 - Vladimir V. Rybakov:
Rules of Inference with Parameters for Intuitionistic Logic. 912-923 - M. D. G. Swaen:
A Characterization of ML in Many-Sorted Arithmetic with Conditional Application. 924-953 - Michael Rathjen:
A Proof-Theoretic Characterization of the Primitive Recursive Set Functions. 954-969 - Yo Matsubara:
Saturated Ideals and the Singular Cardinal Hypothesis. 970-974 - Renling Jin:
The Isomorphism Property Versus the Special Model Axiom. 975-987 - Devdatt P. Dubhashi:
On Decidable Varieties of Heyting Algebras. 988-991 - H. D. Macpherson, Maurice Pouzet, Robert E. Woodrow:
Countable Structures of Given Age. 992-1010 - Renling Jin:
A Theorem on the Isomorphism Property. 1011-1017 - Ronald Fagin, Joseph Y. Halpern, Moshe Y. Vardi:
What Is an Inference Rule? 1018-1045 - Eberhard Herrmann:
1-Reducibility Inside an m-Degree with a Maximal Set. 1046-1056 - Stuart T. Smith:
Prime Numbers and Factorization in IE1 and Weaker Systems. 1057-1085 - Avner Landver:
Baire Numbers, Uncountable Cohen Sets and Perfect-Set Forcing. 1086-1107 - Gerhard Jäger, Barbara Primo:
About the Proof-Theoretic Ordinals of Weak Fixed Point Theories. 1108-1119 - Steffen Lempp, Manuel Lerman:
The Existential Theory of the Pomset of r.e. Degrees with a Predicate for Single Jump Reducibility. 1120-1130
Volume 57, Number 4, December 1992
- M. C. Stanley:
Forcing Disable. 1153-1175 - Gisèle Fischer Servi:
Nonmonotonic Consequence Based on Intuitionistic Logic. 1176-1197 - Ursula Gropp:
There Is No Sharp Transitivity on q6 when q Is a Type of Morely Rank 2. 1198-1212 - Roger D. Maddux:
Relation Algebras of Every Dimension. 1213-1229 - Xiaoping Wang:
The McKinsey Axiom Is Not Compact. 1230-1238 - Ulrich Kohlenbach:
Effective Bounds from Ineffective Proofs in Analysis: An Application of Functional Interpretation and Majorization. 1239-1273 - Michiel van Lambalgen:
Independence, Randomness and the Axiom of Choice. 1274-1304 - Misao Nagayama:
On Boolean Algebras and Integrally Closed Commutative Regular Rings. 1305-1318 - Dov M. Gabbay, Ruy J. G. B. de Queiroz:
Extending the Curry-Howard Interpretation to Linear, Relevant and Other Resource Logics. 1319-1365 - A. Pétry:
Stratified Languages. 1366-1376 - Michael Zakharyaschev:
Canonical Formulas for K4, Part I: Basic Results. 1377-1402 - Avner Landver:
Singular sigma-Dense Trees. 1403-1416 - Dirk van Dalen:
The Continuum and First-Order Intuitionistic Logic. 1417-1424 - Ewa Orlowska:
Relational Proof System for Relevant Logics. 1425-1440 - Paul Corazza:
Ramsey Sets, the Ramsey Ideal, and Other Classes over R. 1441-1468 - Alexandre V. Borovik, Ali Nesin:
On the Schur-Zassenhaus Theorem for Groups of Finite Morley Rank. 1469-1477
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 2024-11-11 21:17 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:
