Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/jsyml/jsyml41.bht:"
download as .bib file
@article{DBLP:journals/jsyml/Abdali76,
author = {S. Kamal Abdali},
title = {An Abstraction Algorithm for Combinatory Logic},
journal = {J. Symb. Log.},
volume = {41},
number = {1},
pages = {222--224},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051914},
doi = {10.1017/S0022481200051914},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Abdali76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Adamowicz76,
author = {Zofia Adamowicz},
title = {One More Aspect of Forcing and Omitting Types},
journal = {J. Symb. Log.},
volume = {41},
number = {1},
pages = {73--80},
year = {1976},
url = {https://doi.org/10.1017/S002248120005177X},
doi = {10.1017/S002248120005177X},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Adamowicz76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Adamowicz76a,
author = {Zofia Adamowicz},
title = {On Finite Lattices of Degrees of Constructibility of Reals},
journal = {J. Symb. Log.},
volume = {41},
number = {2},
pages = {313--322},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051367},
doi = {10.1017/S0022481200051367},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Adamowicz76a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Alton76,
author = {Donald A. Alton},
title = {Diversity of Speed-Ups and Embeddability in Computational Complexity},
journal = {J. Symb. Log.},
volume = {41},
number = {1},
pages = {199--214},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051896},
doi = {10.1017/S0022481200051896},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Alton76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Apt76,
author = {Krzysztof R. Apt},
title = {Semantics of the Infinitistic Rules of Proof},
journal = {J. Symb. Log.},
volume = {41},
number = {1},
pages = {121--138},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051811},
doi = {10.1017/S0022481200051811},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Apt76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/BaldwinMST76,
author = {John T. Baldwin and
Donald A. Martin and
Robert I. Soare and
William W. Tait},
title = {Meeting of the Association for Symbolic Logic},
journal = {J. Symb. Log.},
volume = {41},
number = {2},
pages = {551--560},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051665},
doi = {10.1017/S0022481200051665},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/BaldwinMST76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/BarwiseS76,
author = {Jon Barwise and
John S. Schlipf},
title = {An Introduction to Recursively Saturated and Resplendent Models},
journal = {J. Symb. Log.},
volume = {41},
number = {2},
pages = {531--536},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051604},
doi = {10.1017/S0022481200051604},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/BarwiseS76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/BaumgartnerHK76,
author = {James E. Baumgartner and
Leo Harrington and
E. M. Kleinberg},
title = {Adding a Closed Unbounded Set},
journal = {J. Symb. Log.},
volume = {41},
number = {2},
pages = {481--482},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051550},
doi = {10.1017/S0022481200051550},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/BaumgartnerHK76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Bean76,
author = {Dwight R. Bean},
title = {Effective Coloration},
journal = {J. Symb. Log.},
volume = {41},
number = {2},
pages = {469--480},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051549},
doi = {10.1017/S0022481200051549},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Bean76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Beeson76,
author = {Michael Beeson},
title = {The Unprovability in Intuitionistic Formal Systems of the Continuity
of Effective Operations on the Reals},
journal = {J. Symb. Log.},
volume = {41},
number = {1},
pages = {18--24},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051707},
doi = {10.1017/S0022481200051707},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Beeson76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Beeson76a,
author = {Michael Beeson},
title = {Derived Rules of Inference Related to the Continuity of Effective
Operations},
journal = {J. Symb. Log.},
volume = {41},
number = {2},
pages = {328--336},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051380},
doi = {10.1017/S0022481200051380},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Beeson76a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Benthem76,
author = {Johan van Benthem},
title = {Modal Reduction Principles},
journal = {J. Symb. Log.},
volume = {41},
number = {2},
pages = {301--312},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051355},
doi = {10.1017/S0022481200051355},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Benthem76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Benthem76a,
author = {Johan van Benthem},
title = {Modal Formulas are Either Elementary or not sigma triangle-Elementary},
journal = {J. Symb. Log.},
volume = {41},
number = {2},
pages = {436--438},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051495},
doi = {10.1017/S0022481200051495},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Benthem76a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/BezboruahS76,
author = {A. Bezboruah and
John C. Shepherdson},
title = {Godel's Second Incompleteness Theorem for {Q}},
journal = {J. Symb. Log.},
volume = {41},
number = {2},
pages = {503--512},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051586},
doi = {10.1017/S0022481200051586},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/BezboruahS76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Boolos76,
author = {George Boolos},
title = {On Deciding the Truth of Certain Statements Involving the Notion of
Consistency},
journal = {J. Symb. Log.},
volume = {41},
number = {4},
pages = {779--781},
year = {1976},
url = {https://doi.org/10.2307/2272395},
doi = {10.2307/2272395},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Boolos76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Boos76,
author = {William Boos},
title = {Infinitary Compactness without Strong Inaccessibility},
journal = {J. Symb. Log.},
volume = {41},
number = {1},
pages = {33--38},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051720},
doi = {10.1017/S0022481200051720},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Boos76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Bunder76,
author = {Martin W. Bunder},
title = {The Inconsistency of {F} \({}^{\mbox{*}}\) \({}_{\mbox{21}}\)},
journal = {J. Symb. Log.},
volume = {41},
number = {2},
pages = {467--468},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051537},
doi = {10.1017/S0022481200051537},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Bunder76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Busch76,
author = {Douglas R. Busch},
title = {lambda-Scales, kappa-Souslin Sets and a New Definition of Analytic
Sets},
journal = {J. Symb. Log.},
volume = {41},
number = {2},
pages = {373--378},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051434},
doi = {10.1017/S0022481200051434},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Busch76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Catlin76,
author = {Seth Catlin},
title = {ED-Regressive Sets of Order n},
journal = {J. Symb. Log.},
volume = {41},
number = {1},
pages = {146--152},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051835},
doi = {10.1017/S0022481200051835},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Catlin76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Cenzer76,
author = {Douglas A. Cenzer},
title = {Monotone Inductive Definitions over the Continuum},
journal = {J. Symb. Log.},
volume = {41},
number = {1},
pages = {188--198},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051884},
doi = {10.1017/S0022481200051884},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Cenzer76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Cherlin76,
author = {Gregory L. Cherlin},
title = {Model Theoretic Algebra},
journal = {J. Symb. Log.},
volume = {41},
number = {2},
pages = {537--545},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051616},
doi = {10.1017/S0022481200051616},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Cherlin76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Chong76,
author = {Chi Tat Chong},
title = {An alpha-Finite Injury Method of the Unbounded Type},
journal = {J. Symb. Log.},
volume = {41},
number = {1},
pages = {1--17},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051690},
doi = {10.1017/S0022481200051690},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Chong76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Chong76a,
author = {Chi Tat Chong},
title = {Minimal Upper Bounds for Ascending Sequences of alpha-Recursively
Enumerable Degrees},
journal = {J. Symb. Log.},
volume = {41},
number = {1},
pages = {250--260},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051963},
doi = {10.1017/S0022481200051963},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Chong76a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Church76,
author = {Alonzo Church},
title = {Comparison of Russell's Resolution of the Semantical Antinomies with
that of Tarski},
journal = {J. Symb. Log.},
volume = {41},
number = {4},
pages = {747--760},
year = {1976},
url = {https://doi.org/10.2307/2272393},
doi = {10.2307/2272393},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Church76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Daley76,
author = {Robert P. Daley},
title = {Noncomplex Sequences: Characterizations and Examples},
journal = {J. Symb. Log.},
volume = {41},
number = {3},
pages = {626--638},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051197},
doi = {10.1017/S0022481200051197},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Daley76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Dekker76,
author = {J. C. E. Dekker},
title = {Projective Planes of Infinite But Isolic Order},
journal = {J. Symb. Log.},
volume = {41},
number = {2},
pages = {391--404},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051458},
doi = {10.1017/S0022481200051458},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Dekker76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Ellentuck76,
author = {Erik Ellentuck},
title = {Categoricity Regained},
journal = {J. Symb. Log.},
volume = {41},
number = {3},
pages = {639--643},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051203},
doi = {10.1017/S0022481200051203},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Ellentuck76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Fagin76,
author = {Ronald Fagin},
title = {Probabilities on Finite Models},
journal = {J. Symb. Log.},
volume = {41},
number = {1},
pages = {50--58},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051756},
doi = {10.1017/S0022481200051756},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jsyml/Fagin76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Fowler76,
author = {Northrup Fowler III},
title = {alpha-Decompositions of alpha-Spaces},
journal = {J. Symb. Log.},
volume = {41},
number = {2},
pages = {483--488},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051562},
doi = {10.1017/S0022481200051562},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Fowler76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Friedman76,
author = {Harvey Friedman},
title = {Uniformly Defined Descending Sequences of Degrees},
journal = {J. Symb. Log.},
volume = {41},
number = {2},
pages = {363--367},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051410},
doi = {10.1017/S0022481200051410},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Friedman76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Gabbay76,
author = {Dov M. Gabbay},
title = {Completeness Properties of Heyting's Predicate Calculus with Respect
to {RE} Models},
journal = {J. Symb. Log.},
volume = {41},
number = {1},
pages = {81--94},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051781},
doi = {10.1017/S0022481200051781},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Gabbay76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Goodman76,
author = {Nicolas D. Goodman},
title = {The Theory of the Godel Functionals},
journal = {J. Symb. Log.},
volume = {41},
number = {3},
pages = {574--582},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051148},
doi = {10.1017/S0022481200051148},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Goodman76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Gregory76,
author = {John Gregory},
title = {Higher Souslin Trees and the Generalized Continuum Hypothesis},
journal = {J. Symb. Log.},
volume = {41},
number = {3},
pages = {663--671},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051227},
doi = {10.1017/S0022481200051227},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Gregory76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Gurevich76,
author = {Yuri Gurevich},
title = {The Decision Problem for Standard Classes},
journal = {J. Symb. Log.},
volume = {41},
number = {2},
pages = {460--464},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051513},
doi = {10.1017/S0022481200051513},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Gurevich76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Harnik76,
author = {Victor Harnik},
title = {Approximation Theorems and Model Theoretic Forcing},
journal = {J. Symb. Log.},
volume = {41},
number = {1},
pages = {59--72},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051768},
doi = {10.1017/S0022481200051768},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Harnik76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/HarnikM76,
author = {Victor Harnik and
Michael Makkai},
title = {Applications of Vaught Sentences and the Covering Theorem},
journal = {J. Symb. Log.},
volume = {41},
number = {1},
pages = {171--187},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051872},
doi = {10.1017/S0022481200051872},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/HarnikM76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/HarringtonJ76,
author = {Leo Harrington and
Thomas Jech},
title = {On sigma\({}_{\mbox{1}}\) Well-Orderings of the Universe},
journal = {J. Symb. Log.},
volume = {41},
number = {1},
pages = {167--170},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051860},
doi = {10.1017/S0022481200051860},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/HarringtonJ76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/HarringtonM76,
author = {Leo Harrington and
David B. MacQueen},
title = {Selection in Abstract Recursion Theory},
journal = {J. Symb. Log.},
volume = {41},
number = {1},
pages = {153--158},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051847},
doi = {10.1017/S0022481200051847},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/HarringtonM76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Hay76,
author = {Louise Hay},
title = {Boolean Combinations of {R.E.} Open Sets},
journal = {J. Symb. Log.},
volume = {41},
number = {1},
pages = {235--238},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051938},
doi = {10.1017/S0022481200051938},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Hay76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Hughes76,
author = {Charles E. Hughes},
title = {Two Variable Implicational Calculi of Prescribed Many-One Degrees
of Unsolvability},
journal = {J. Symb. Log.},
volume = {41},
number = {1},
pages = {39--44},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051732},
doi = {10.1017/S0022481200051732},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Hughes76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Hughes76a,
author = {Charles E. Hughes},
title = {A Reduction Class Containing Formulas with one Monadic Predicate and
one Binary Function Symbol},
journal = {J. Symb. Log.},
volume = {41},
number = {1},
pages = {45--49},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051744},
doi = {10.1017/S0022481200051744},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Hughes76a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Hutchinson76,
author = {John E. Hutchinson},
title = {Elementary Extensions of Countable Models of Set Theory},
journal = {J. Symb. Log.},
volume = {41},
number = {1},
pages = {139--145},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051823},
doi = {10.1017/S0022481200051823},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Hutchinson76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Hutchinson76a,
author = {John E. Hutchinson},
title = {Order Types of Ordinals in Models of Set Theory},
journal = {J. Symb. Log.},
volume = {41},
number = {2},
pages = {489--502},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051574},
doi = {10.1017/S0022481200051574},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Hutchinson76a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Kleene76,
author = {Stephen Cole Kleene},
title = {The Work of Kurt G{\"{o}}del},
journal = {J. Symb. Log.},
volume = {41},
number = {4},
pages = {761--778},
year = {1976},
url = {https://doi.org/10.2307/2272394},
doi = {10.2307/2272394},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Kleene76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Knight76,
author = {Julia F. Knight},
title = {Omitting Types in Set Theory and Arithmetic},
journal = {J. Symb. Log.},
volume = {41},
number = {1},
pages = {25--32},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051719},
doi = {10.1017/S0022481200051719},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Knight76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Knight76a,
author = {Julia F. Knight},
title = {Hanf Numbers for Omitting Types Over Particular Theories},
journal = {J. Symb. Log.},
volume = {41},
number = {3},
pages = {583--588},
year = {1976},
url = {https://doi.org/10.1017/S002248120005115X},
doi = {10.1017/S002248120005115X},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Knight76a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/KoppelbergK76,
author = {Bernd Koppelberg and
Sabine Koppelberg},
title = {A Boolean Ultrapower which is not an Ultrapower},
journal = {J. Symb. Log.},
volume = {41},
number = {1},
pages = {245--249},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051951},
doi = {10.1017/S0022481200051951},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/KoppelbergK76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/LachlanL76,
author = {Alistair H. Lachlan and
R. Lebeuf},
title = {Countable Initial Segments of the Degrees of Unsolvability},
journal = {J. Symb. Log.},
volume = {41},
number = {2},
pages = {289--300},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051343},
doi = {10.1017/S0022481200051343},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/LachlanL76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Lake76,
author = {John Lake},
title = {Relative Consistency of an Extension of Ackermann's Set Theory},
journal = {J. Symb. Log.},
volume = {41},
number = {2},
pages = {465--466},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051525},
doi = {10.1017/S0022481200051525},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Lake76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/LeggettS76,
author = {Anne Leggett and
Richard A. Shore},
title = {Types of Simple alpha-Recursively Enumerable Sets},
journal = {J. Symb. Log.},
volume = {41},
number = {3},
pages = {681--694},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051240},
doi = {10.1017/S0022481200051240},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/LeggettS76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Lehmann76,
author = {Scott K. Lehmann},
title = {An Interpretation of "Finite" Modal First-Order Languages in Classical
Second-Order Languages},
journal = {J. Symb. Log.},
volume = {41},
number = {2},
pages = {337--340},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051392},
doi = {10.1017/S0022481200051392},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Lehmann76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Lerman76,
author = {Manuel Lerman},
title = {Congruence Relations, Filters, Ideals, and Definability in Lattices
of alpha-Recursively Enumerable Sets},
journal = {J. Symb. Log.},
volume = {41},
number = {2},
pages = {405--418},
year = {1976},
url = {https://doi.org/10.1017/S002248120005146X},
doi = {10.1017/S002248120005146X},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Lerman76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Lerman76a,
author = {Manuel Lerman},
title = {Types of Simple alpha-Recursively Enumerable Sets},
journal = {J. Symb. Log.},
volume = {41},
number = {2},
pages = {419--426},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051471},
doi = {10.1017/S0022481200051471},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Lerman76a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Lewis76,
author = {Harry R. Lewis},
title = {Krom Formulas with One Dyadic Predicate Letter},
journal = {J. Symb. Log.},
volume = {41},
number = {2},
pages = {341--362},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051409},
doi = {10.1017/S0022481200051409},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Lewis76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Lob76,
author = {M. H. Lob},
title = {Embedding First Order Predicate Logic in Fragments of Intuitionistic
Logic},
journal = {J. Symb. Log.},
volume = {41},
number = {4},
pages = {705--718},
year = {1976},
url = {https://doi.org/10.2307/2272390},
doi = {10.2307/2272390},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Lob76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Lowenthal76,
author = {F. Lowenthal},
title = {Equivalence of Some Definitions of Recursion in a Higher Type Object},
journal = {J. Symb. Log.},
volume = {41},
number = {2},
pages = {427--435},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051483},
doi = {10.1017/S0022481200051483},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Lowenthal76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/MacIntyre76,
author = {Angus Macintyre},
title = {On Definable Subsets of p-Adic Fields},
journal = {J. Symb. Log.},
volume = {41},
number = {3},
pages = {605--610},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051173},
doi = {10.1017/S0022481200051173},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/MacIntyre76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Marcus76,
author = {Leo Marcus},
title = {The {\textless}-Order on Submodels},
journal = {J. Symb. Log.},
volume = {41},
number = {1},
pages = {215--221},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051902},
doi = {10.1017/S0022481200051902},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Marcus76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/McNulty76,
author = {George F. McNulty},
title = {Undecidable Properties of Finite Sets of Equations},
journal = {J. Symb. Log.},
volume = {41},
number = {3},
pages = {589--604},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051161},
doi = {10.1017/S0022481200051161},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/McNulty76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Menas76,
author = {Telis Menas},
title = {A Combinatorial Property of p \({}_{\mbox{kappa}}\) lambda},
journal = {J. Symb. Log.},
volume = {41},
number = {1},
pages = {225--234},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051926},
doi = {10.1017/S0022481200051926},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Menas76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Miller76,
author = {Larry W. Miller},
title = {Normal Functions and Constructive Ordinal Notations},
journal = {J. Symb. Log.},
volume = {41},
number = {2},
pages = {439--459},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051501},
doi = {10.1017/S0022481200051501},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Miller76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/MoldestadN76,
author = {Johan Moldestad and
Dag Normann},
title = {Models for Recursion Theory},
journal = {J. Symb. Log.},
volume = {41},
number = {4},
pages = {719--729},
year = {1976},
url = {https://doi.org/10.2307/2272391},
doi = {10.2307/2272391},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/MoldestadN76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/MullerOP76,
author = {G. H. Muller and
Arnold Oberschelp and
K. Potthoff},
title = {European Meeting of the Association for Symbolic Logic, Kiel, Federal
Republic of Germany, 1974},
journal = {J. Symb. Log.},
volume = {41},
number = {1},
pages = {261--278},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051975},
doi = {10.1017/S0022481200051975},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/MullerOP76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Nyberg76,
author = {Anders M. Nyberg},
title = {Uniform Inductive Definability and Infinitary Languages},
journal = {J. Symb. Log.},
volume = {41},
number = {1},
pages = {109--120},
year = {1976},
url = {https://doi.org/10.1017/S002248120005180X},
doi = {10.1017/S002248120005180X},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Nyberg76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/OwingsPS76,
author = {James C. Owings and
Hilary Putnam and
Gerald E. Sacks},
title = {Meeting of the Association for Symbolic Logic Washington, D.C., 1975},
journal = {J. Symb. Log.},
volume = {41},
number = {1},
pages = {279--288},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051987},
doi = {10.1017/S0022481200051987},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/OwingsPS76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Paulos76,
author = {John A. Paulos},
title = {Noncharacterizability of the Syntax Set},
journal = {J. Symb. Log.},
volume = {41},
number = {2},
pages = {368--372},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051422},
doi = {10.1017/S0022481200051422},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Paulos76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Powell76,
author = {William C. Powell},
title = {A Completeness Theorem for Zermelo-Fraenkel Set Theory},
journal = {J. Symb. Log.},
volume = {41},
number = {2},
pages = {323--327},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051379},
doi = {10.1017/S0022481200051379},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Powell76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Rackoff76,
author = {Charles Rackoff},
title = {On the Complexity of the Theories of Weak Direct Powers},
journal = {J. Symb. Log.},
volume = {41},
number = {3},
pages = {561--573},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051136},
doi = {10.1017/S0022481200051136},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Rackoff76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Remmel76,
author = {Jeffrey B. Remmel},
title = {Co-Hypersimple Structures},
journal = {J. Symb. Log.},
volume = {41},
number = {3},
pages = {611--625},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051185},
doi = {10.1017/S0022481200051185},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Remmel76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Segerberg76,
author = {Krister Segerberg},
title = {The Truth about Some Post Numbers},
journal = {J. Symb. Log.},
volume = {41},
number = {1},
pages = {239--244},
year = {1976},
url = {https://doi.org/10.1017/S002248120005194X},
doi = {10.1017/S002248120005194X},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Segerberg76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Shoenfield76,
author = {Joseph R. Shoenfield},
title = {Degrees of Classes of {RE} Sets},
journal = {J. Symb. Log.},
volume = {41},
number = {3},
pages = {695--696},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051252},
doi = {10.1017/S0022481200051252},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Shoenfield76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Simmons76,
author = {Harold Simmons},
title = {Large and Small Existentially Closed Structures},
journal = {J. Symb. Log.},
volume = {41},
number = {2},
pages = {379--390},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051446},
doi = {10.1017/S0022481200051446},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Simmons76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Slonneger76,
author = {Kenneth Slonneger},
title = {A Complete Infinitary Logic},
journal = {J. Symb. Log.},
volume = {41},
number = {4},
pages = {730--746},
year = {1976},
url = {https://doi.org/10.2307/2272392},
doi = {10.2307/2272392},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Slonneger76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Soare76,
author = {Robert I. Soare},
title = {The Infinite Injury Priority Method},
journal = {J. Symb. Log.},
volume = {41},
number = {2},
pages = {513--530},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051598},
doi = {10.1017/S0022481200051598},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Soare76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Swart76,
author = {Harrie C. M. de Swart},
title = {Another Intuitionistic Completeness Proof},
journal = {J. Symb. Log.},
volume = {41},
number = {3},
pages = {644--662},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051215},
doi = {10.1017/S0022481200051215},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Swart76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Veldman76,
author = {Wim Veldman},
title = {An Intuitionistic Completeness Theorem for Intuitionistic Predicate
Logic},
journal = {J. Symb. Log.},
volume = {41},
number = {1},
pages = {159--166},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051859},
doi = {10.1017/S0022481200051859},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Veldman76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Weispfenning76,
author = {Volker Weispfenning},
title = {Negative-Existentially Complete Structures and Definability in Free
Extensions},
journal = {J. Symb. Log.},
volume = {41},
number = {1},
pages = {95--108},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051793},
doi = {10.1017/S0022481200051793},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Weispfenning76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Woodrow76,
author = {Robert E. Woodrow},
title = {A Note on Countable Complete Theories Having Three Isomorphism Types
of Countable Models},
journal = {J. Symb. Log.},
volume = {41},
number = {3},
pages = {672--680},
year = {1976},
url = {https://doi.org/10.1017/S0022481200051239},
doi = {10.1017/S0022481200051239},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Woodrow76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
retrieved on 2024-04-25 10:13 CEST from data curated 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:
