Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Journal of Symbolic Logic, Volume 41
Volume 41, Number 1, March 1976
- Chi Tat Chong:
An alpha-Finite Injury Method of the Unbounded Type. 1-17 - Michael Beeson:
The Unprovability in Intuitionistic Formal Systems of the Continuity of Effective Operations on the Reals. 18-24 - Julia F. Knight:
Omitting Types in Set Theory and Arithmetic. 25-32 - William Boos:
Infinitary Compactness without Strong Inaccessibility. 33-38 - Charles E. Hughes:
Two Variable Implicational Calculi of Prescribed Many-One Degrees of Unsolvability. 39-44 - Charles E. Hughes:
A Reduction Class Containing Formulas with one Monadic Predicate and one Binary Function Symbol. 45-49 - Ronald Fagin:
Probabilities on Finite Models. 50-58 - Victor Harnik:
Approximation Theorems and Model Theoretic Forcing. 59-72 - Zofia Adamowicz:
One More Aspect of Forcing and Omitting Types. 73-80 - Dov M. Gabbay:
Completeness Properties of Heyting's Predicate Calculus with Respect to RE Models. 81-94 - Volker Weispfenning:
Negative-Existentially Complete Structures and Definability in Free Extensions. 95-108 - Anders M. Nyberg:
Uniform Inductive Definability and Infinitary Languages. 109-120 - Krzysztof R. Apt:
Semantics of the Infinitistic Rules of Proof. 121-138 - John E. Hutchinson:
Elementary Extensions of Countable Models of Set Theory. 139-145 - Seth Catlin:
ED-Regressive Sets of Order n. 146-152 - Leo Harrington, David B. MacQueen:
Selection in Abstract Recursion Theory. 153-158 - Wim Veldman:
An Intuitionistic Completeness Theorem for Intuitionistic Predicate Logic. 159-166 - Leo Harrington, Thomas Jech:
On sigma1 Well-Orderings of the Universe. 167-170 - Victor Harnik, Michael Makkai:
Applications of Vaught Sentences and the Covering Theorem. 171-187 - Douglas A. Cenzer:
Monotone Inductive Definitions over the Continuum. 188-198 - Donald A. Alton:
Diversity of Speed-Ups and Embeddability in Computational Complexity. 199-214 - Leo Marcus:
The <-Order on Submodels. 215-221 - S. Kamal Abdali:
An Abstraction Algorithm for Combinatory Logic. 222-224 - Telis Menas:
A Combinatorial Property of p kappa lambda. 225-234 - Louise Hay:
Boolean Combinations of R.E. Open Sets. 235-238 - Krister Segerberg:
The Truth about Some Post Numbers. 239-244 - Bernd Koppelberg, Sabine Koppelberg:
A Boolean Ultrapower which is not an Ultrapower. 245-249 - Chi Tat Chong:
Minimal Upper Bounds for Ascending Sequences of alpha-Recursively Enumerable Degrees. 250-260 - G. H. Muller, Arnold Oberschelp, K. Potthoff:
European Meeting of the Association for Symbolic Logic, Kiel, Federal Republic of Germany, 1974. 261-278 - James C. Owings, Hilary Putnam, Gerald E. Sacks:
Meeting of the Association for Symbolic Logic Washington, D.C., 1975. 279-288
Volume 41, Number 2, June 1976
- Alistair H. Lachlan, R. Lebeuf:
Countable Initial Segments of the Degrees of Unsolvability. 289-300 - Johan van Benthem:
Modal Reduction Principles. 301-312 - Zofia Adamowicz:
On Finite Lattices of Degrees of Constructibility of Reals. 313-322 - William C. Powell:
A Completeness Theorem for Zermelo-Fraenkel Set Theory. 323-327 - Michael Beeson:
Derived Rules of Inference Related to the Continuity of Effective Operations. 328-336 - Scott K. Lehmann:
An Interpretation of "Finite" Modal First-Order Languages in Classical Second-Order Languages. 337-340 - Harry R. Lewis:
Krom Formulas with One Dyadic Predicate Letter. 341-362 - Harvey Friedman:
Uniformly Defined Descending Sequences of Degrees. 363-367 - John A. Paulos:
Noncharacterizability of the Syntax Set. 368-372 - Douglas R. Busch:
lambda-Scales, kappa-Souslin Sets and a New Definition of Analytic Sets. 373-378 - Harold Simmons:
Large and Small Existentially Closed Structures. 379-390 - J. C. E. Dekker:
Projective Planes of Infinite But Isolic Order. 391-404 - Manuel Lerman:
Congruence Relations, Filters, Ideals, and Definability in Lattices of alpha-Recursively Enumerable Sets. 405-418 - Manuel Lerman:
Types of Simple alpha-Recursively Enumerable Sets. 419-426 - F. Lowenthal:
Equivalence of Some Definitions of Recursion in a Higher Type Object. 427-435 - Johan van Benthem:
Modal Formulas are Either Elementary or not sigma triangle-Elementary. 436-438 - Larry W. Miller:
Normal Functions and Constructive Ordinal Notations. 439-459 - Yuri Gurevich:
The Decision Problem for Standard Classes. 460-464 - John Lake:
Relative Consistency of an Extension of Ackermann's Set Theory. 465-466 - Martin W. Bunder:
The Inconsistency of F * 21. 467-468 - Dwight R. Bean:
Effective Coloration. 469-480 - James E. Baumgartner, Leo Harrington, E. M. Kleinberg:
Adding a Closed Unbounded Set. 481-482 - Northrup Fowler III:
alpha-Decompositions of alpha-Spaces. 483-488 - John E. Hutchinson:
Order Types of Ordinals in Models of Set Theory. 489-502 - A. Bezboruah, John C. Shepherdson:
Godel's Second Incompleteness Theorem for Q. 503-512 - Robert I. Soare:
The Infinite Injury Priority Method. 513-530 - Jon Barwise, John S. Schlipf:
An Introduction to Recursively Saturated and Resplendent Models. 531-536 - Gregory L. Cherlin:
Model Theoretic Algebra. 537-545 - John T. Baldwin, Donald A. Martin, Robert I. Soare, William W. Tait:
Meeting of the Association for Symbolic Logic. 551-560
Volume 41, Number 3, September 1976
- Charles Rackoff:
On the Complexity of the Theories of Weak Direct Powers. 561-573 - Nicolas D. Goodman:
The Theory of the Godel Functionals. 574-582 - Julia F. Knight:
Hanf Numbers for Omitting Types Over Particular Theories. 583-588 - George F. McNulty:
Undecidable Properties of Finite Sets of Equations. 589-604 - Angus Macintyre:
On Definable Subsets of p-Adic Fields. 605-610 - Jeffrey B. Remmel:
Co-Hypersimple Structures. 611-625 - Robert P. Daley:
Noncomplex Sequences: Characterizations and Examples. 626-638 - Erik Ellentuck:
Categoricity Regained. 639-643 - Harrie C. M. de Swart:
Another Intuitionistic Completeness Proof. 644-662 - John Gregory:
Higher Souslin Trees and the Generalized Continuum Hypothesis. 663-671 - Robert E. Woodrow:
A Note on Countable Complete Theories Having Three Isomorphism Types of Countable Models. 672-680 - Anne Leggett, Richard A. Shore:
Types of Simple alpha-Recursively Enumerable Sets. 681-694 - Joseph R. Shoenfield:
Degrees of Classes of RE Sets. 695-696
Volume 41, Number 4, December 1976
- M. H. Lob:
Embedding First Order Predicate Logic in Fragments of Intuitionistic Logic. 705-718 - Johan Moldestad, Dag Normann:
Models for Recursion Theory. 719-729 - Kenneth Slonneger:
A Complete Infinitary Logic. 730-746 - Alonzo Church:
Comparison of Russell's Resolution of the Semantical Antinomies with that of Tarski. 747-760 - Stephen Cole Kleene:
The Work of Kurt Gödel. 761-778 - George Boolos:
On Deciding the Truth of Certain Statements Involving the Notion of Consistency. 779-781
a service of 
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-04-22 20:02 CEST 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:
