default search action
The Journal of Symbolic Logic, Volume 48
Volume 48, Number 1, March 1983
- Harrie C. M. de Swart:
A Gentzen- or Beth-Type System, a Practical Decision Procedure and a Constructive Completeness Proof for the Counterfactual Logics VC and VCS. 1-20 - Henry A. Kierstead, Jeffrey B. Remmel:
Indiscernibles and Decidable Models. 21-32 - Menachem Magidor, Saharon Shelah
, Jonathan Stavi:
On the Standard Part of Nonstandard Models of Set Theory. 33-38 - G. P. Monro:
On Generic Extensions Without the Axiom of Choice. 39-52 - George C. Nelson:
Logic of Reduced Power Structures. 53-59 - Bruno Poizat:
Post-Scriptum À "Théories Instables". 60-62 - Solomon Feferman, Gerhard Jäger:
Choice Principles, the Bar Rule and Autonomously Iterated Comprehension Schemes in Analysis. 63-70 - William G. Fleissner:
Sone of George and V = L. 71-77 - A. J. Dodd:
Core Models. 78-90 - Stevo Todorcevic
Real Functions on the Family of All Well-Ordered Subsets of a Partially Ordered Set. 91-96 - Jean Porte:
Antitheses in Systems of Relevant Implication. 97-99 - Iraj Kalantari, Anne Leggett:
Maximality in Effective Topology. 100-112 - Penelope Maddy:
Proper Classes. 113-139 - Chantal Berline, Gregory L. Cherlin:
QE Rings in Characteristic pn. 140-162 - Anand Pillay:
A Note on Finitely Generated Models. 163-166 - Eugene W. Madison:
The Existence of Countable Totally Nonconstructive Extensions of the Countable Atomless Boolean Algebra. 167-170 - Terrence Millar:
Omitting Types, Type Spectrums, and Decidability. 171-181 - Daniel Leivant:
The Optimality of Induction as an Axiomatization of Arithmetic. 182-184 - Chi Tat Chong:
Hyperhypersimple Supersets in Admissible Recursion Theory. 185-192 - Yuri Gurevich:
Decision Problem for Separated Distributive Lattices. 193-196 - Elisabeth Bouscaren, Daniel Lascar:
Countable Models of Nonmultidimensional 0-Stable Theories. 197-205
Volume 48, Number 2, June 1983
- Patrick Dehornoy:
An Application of Ultrapowers to Changing Cofinality. 225-235 - Thomas E. Forster:
Further Consistency and Independence Results in NF Obtained by the Permutation Method. 236-238 - Bruno Poizat:
Paires de Structures Stables. 239-249 - William S. Heck:
Large Families of Incomparable A-Isols. 250-252 - Henryk Kotlarski:
On Cofinal Extensions of Models of Arithmetic. 253-262 - Matt Kaufmann:
Set Theory With a Filter Quantifier. 263-287 - Piergiorgio Odifreddi:
Forcing and Reducibilities. 288-310 - Roman Kossak:
A Certain Class of Models of Peano Arithmetic. 311-320 - Robert E. Woodrow, Julia F. Knight:
A Complete Theory with Arbitrarily Large Minimality Ranks. 321-328 - William P. Hanf, Dale Myers:
Boolean Sentence Algebras: Isomorphism Constructions. 329-338 - Bruno Poizat:
Groupes Stables, Avec Types Generiques Reguliers. 339-355 - Stephen G. Simpson
High and Low Kleene Degrees of Coanalytic Sets. 356-368 - Dev Kumar Roy:
R.E. Presented Linear Orders. 369-376 - Elisabeth Bouscaren:
Countable Models of Multidimensional 0-Stable Theories. 377-383 - Ermanno Bencivenga:
Compactness of a Supervaluational Language. 384-386 - Yuri Gurevich, Menachem Magidor, Saharon Shelah
The Monadic Theory of omega12. 387-398 - E. A. Cichon, Stanley S. Wainer:
The Slow-Growing and the Grzecorczyk Hierarchies. 399-408 - Ned I. Rosen:
A Characterization of 2-Square Ultrafilters. 409-414 - George Bealer:
Completeness in the Theory of Properties, Relations, and Propositions. 415-426 - Kevin J. Compton:
Some Useful Preservation Theorems. 427-440 - Harold T. Hodes:
More About Uniform Upper Bounds on Ideals of Turing Degrees. 441-457 - John P. Hartley:
The Countably Based Functionals. 458-474 - Kenneth Kunen, Donald H. Pelletier:
On a Combinatorial Property of Menas Related to the Partition Property for Measures on Supercompact Cardinals. 475-481 - Jon Barwise, Robert L. Vaught, Yiannis N. Moschovakis:
Meeting of the Association for Symbolic Logic: San Francisco, 1981. 505-513 - Jon Barwise, Robert I. Soare, Terrence Millar:
Meeting of the Association for Symbolic Logic: Milwaukee, 1981. 514-518 - Wilfred G. Malcolm, M. J. Cresswell:
Meeting of the Association for Symbolic Logic: Wellington, New Zealand, 1981. 519-526
Volume 48, Number 3, September 1983
- Claudio Bernardi, Andrea Sorbi:
Classifying Positive Equivalence Relations. 529-538 - Libo Lo:
On the Number of Countable Homogeneous Models. 539-541 - Matatyahu Rubin, Saharon Shelah
On the Expressibility Hierarchy of Magidor-Malitz Quantifiers. 542-557 - L. V. Shabunin:
On the Interpretation of Combinators with Weak Reduction. 558-563 - Jeff B. Paris, Costas Dimitracopoulos:
A Note on the Undefinability of Cuts. 564-569 - Philipp Rothmaler:
Some Model Theory of Modules. I. On Total Transcendence of Modules. 570-574 - Arnold W. Miller:
Mapping a Set of Reals Onto the Reals. 575-584 - Lefteris M. Kirousis:
A Selection Theorem. 585-594 - E. G. K. López-Escobar:
A Second Paper "On the Interpolation Theorem for the Logic of Constant Domains". 595-599 - William J. Mitchell:
Sets Constructed from Sequences of Measures: Revisited. 600-609 - Iraj Kalantari, Jeffrey B. Remmel:
Degrees of Recursively Enumerable Topological Spaces. 610-622 - Julia F. Knight:
Additive Structure in Uncountable Models for a Fixed Completion of P. 623-628 - Sy D. Friedman:
Some Recent Developments in Higher Recursion Theory. 629-642 - Uri Abraham, Saharon Shelah
Forcing Closed Unbounded Sets. 643-657 - Uri Abraham:
On Forcing Without the Continuum Hypothesis. 658-661 - Robert E. Byerly:
Definability of R. E. Sets in a Class of Recursion Theoretic Structures. 662-669 - Robin J. Grayson:
Forcing in Intuitionistic Systems Without Power-Set. 670-682 - Holger Eisenmenger:
Some Local Definability Results on Countable Topological Structures. 683-692 - Eberhard Herrmann:
Orbits of Hyperhypersimple Sets and the Lattice of Sigma03 Sets. 693-699 - Libo Lo:
The tau-Theory for Free Groups Is Undecidable. 700-703 - Petr Hájek:
Arithmetical Interpretations of Dynamic Logic. 704-713 - Matthew Foreman:
Games Played on Boolean Algebras. 714-723 - Piergiorgio Odifreddi:
Forcing and Reducibilities. II. Forcing in Fragments of Analysis. 724-743 - Hirokazu Nishimura:
Hauptsatz for Higher-Order Modal Logic. 744-751 - Erik Ellentuck:
Incompatible Extensions of Combinatorial Functions. 752-755 - Heinrich Rolletschek:
Closure Properties of Almost-Finiteness Classes in Recursive Function Theory. 756-763 - Stuart A. Kurtz:
Notions of Weak Genericity. 764-770 - Martin W. Bunder:
A Weak Absolute Consistency Proof for Some Systems of Illative Combinatory Logic. 771-776 - David Guaspari:
Sentences Implying Their Own Provability. 777-789 - Steven Homer:
Intermediate beta-R.E. Degrees and the Half-Jump. 790-796 - Fred Richman:
Church's Thesis Without Tears. 797-803 - W. F. Gross:
The Inverse of a Regressive Object. 804-815 - Yuri Gurevich, Saharon Shelah
Interpreting Second-Order Logic in the Monadic Theory of Order. 816-828 - Jeanleah Mohrherr:
Kleene Index Sets and Functional m-Degrees. 829-840 - John L. Bell:
On the Strength of the Sikorski Extension Theorem for Boolean Algebras. 841-846 - Marcel Masseron:
Rungs and Trees. 847-863 - Ayda I. Arruda, Xavier Caicedo, Rolando Chuaqui, Newton C. A. da Costa:
Meeting of the Association for Symbolic Logic: Bogota, Colombia, 1981. 884-892 - Chi Tat Chong:
Meeting of the Association for Symbolic Logic: Singapore 1981. 893-897 - Simon Kochen, Hugues Leblanc, Charles D. Parsons:
Annual Meeting of the Association for Symbolic Logic: Philadelphia 1981. 898-910
Volume 48, Number 4, December 1983
- William J. Collins, Paul Young:
Discontinuities of Provably Correct Operators on the Provably Recursive Real Numbers. 913-920 - Michael Stob:
Wtt-Degrees and T-Degrees of R.E. Sets. 921-930 - Henk Barendregt, Mario Coppo, Mariangiola Dezani-Ciancaglini
A Filter Lambda Model and the Completeness of Type Assignment. 931-940 - Willem J. Blok, P. Kohler:
Algebraic Semantics for Quasi-Classical Modal Logics. 941-964 - Dag Normann:
Characterizing the Continuous Functionals. 965-969 - Philipp Rothmaler:
Some Model Theory of Modules. II. On Stability and Categoricity of Flat Modules. 970-985 - Vítezslav Svejdar
Modal Analysis of Generalized Rosser Sentences. 986-999 - Michael Sheard:
Indecomposable Ultrafilters Over Small Large Cardinals. 1000-1007 - John Kenneth Truss:
The Noncommutativity of Random and Generic Extensions. 1008-1012 - Piergiorgio Odifreddi:
Forcing and Reducibilities. III. Forcing in Fragments of Set Theory. 1013-1034 - Ilias G. Kastanas:
On the Ramsey Property for Sets of Reals. 1035-1045 - Dan Velleman:
On a Generalization of Jensen's, and Strategic Closure of Partial Orders. 1046-1052 - Matt Kaufmann:
Blunt and Topless End Extensions of Models of Set Theory. 1053-1073 - Julia F. Knight:
Degrees of Types and Independent Sequences. 1074-1081 - Kurt Wolfsdorf:
A Baire-Type Theorem for Cardinals. 1082-1089 - Peter Clote, Kenneth McAloon:
Two Further Combinatorial Theorems Equivalent to the 1-Consistency of Peano Arithmetic. 1090-1104 - Yuri Gurevich, Saharon Shelah
Rabin's Uniformization Problem. 1105-1119 - Yuri Gurevich, Saharon Shelah
Random Models and the Godel Case of the Decision Problem. 1120-1124 - Moshe Jarden, William H. Wheeler:
Model-Complete Theories of e-Free AX Fields. 1125-1129 - William H. Wheeler:
Model-Complete Theories of Formally Real Fields and Formally p-Adic Fields. 1130-1139 - Teo Grunberg
A Tableau System of Proof for Predicate-Functor Logic with Identity. 1140-1144 - George C. Nelson:
Addendum to "Logic of Reduced Power Structures". 1145 - Jerome I. Malitz:
Downward Transfer of Satisfiability for Sentences of L 1, 1. 1146-1150 - Bruno Poizat:
Une Theorie de Galois Imaginaire. 1151-1170 - J. Richard Büchi:
State-Strategies for Games in F G. 1171-1198 - Jacques Stern:
The Herbrand Symposium: (Marseilles July 16-July 24 1981). 1210-1232 - H. Jerome Keisler:
Meeting of the Association for Symbolic Logic: Madison 1982. 1233-1239
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-12-22 18:48 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: