Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNotre Dame Journal of Formal Logic, Volume 48
Volume 48, Number 1, 2007
- Peter Cholak:
Introduction to the Special Issue on Vaught's Conjecture. 1-2 - Gerald E. Sacks:
Bounds on Weak Scattering. 5-31 - Su Gao
:
Complexity Ranks of Countable Models. 33-48 - Greg Hjorth:
A Note on Counterexamples to the Vaught Conjecture. 49-51 - R. W. Knight:
Categories of Topological Spaces and Scattered Theories. 53-77 - John T. Baldwin:
The Vaught Conjecture: Do Uncountable Models Count? 79-92 - David Marker:
The Borel Complexity of Isomorphism for Theories with Many Types. 93-97 - David Marker:
The Number of Countable Differentially Closed Fields. 99-113 - Ludomir Newelski:
Relative Vaught's Conjecture for Some Meager Groups. 115-132 - Michael C. Laskowski:
An Old Friend Revisited: Countable Models of ω-Stable Theories. 133-141 - Karen M. Lange, Robert I. Soare:
Computability of Homogeneous Models. 143-170
Volume 48, Number 2, 2007
- Charles M. Harris:
On the Symmetric Enumeration Degrees. 175-204 - Katsuhiko Sano, Kentaro Sato:
Semantical Characterizations for Irreflexive and Generalized Modal Languages. 205-228 - Eric J. Hall:
Permutation Models and SVC. 229-235 - Edwin D. Mares:
The Fact Semantics for Ramified Type Theory and the Axiom of Reducibility. 237-251 - Michael Rescorla:
Church's Thesis and the Conceptual Analysis of Computability. 253-280 - Alfred Dolich:
A Note on Weakly O-Minimal Structures and Definable Completeness. 281-292 - Stephen Binns:
Hyperimmunity in 2ℕ. 293-316
Volume 48, Number 3, 2007
- Denis R. Hirschfeldt, Russell G. Miller, Sergei Podzorov:
Order-Computable Sets. 317-347 - Martin Kummer, Marcus Schäfer:
Cuppability of Simple and Hypersimple Sets. 349-369 - Aleksander Ivanov, K. Majcher:
Ages of Expansions of ω-Categorical Structures. 371-380 - Joost J. Joosten:
Propositional Proof Systems and Fast Consistency Provers. 381-398 - Claude Sureson:
Rumely Domains with Atomic Constructible Boolean Algebra. An Effective Viewpoint. 399-423 - Alberto Marcone:
Interval Orders and Reverse Mathematics. 425-448
Volume 48, Number 4, 2007
- José Martínez-Fernández:
Maximal Three-Valued Clones with the Gupta-Belnap Fixed-Point Property. 449-472 - Riccardo Camerlo:
Finiteness Axioms on Fragments of Intuitionistic Set Theory. 473-488 - Daisuke Souma:
An Algebraic Approach to the Disjunction Property of Substructural Logics. 489-495 - Richard Kaye, Tin Lok Wong:
On Interpretations of Arithmetic and Set Theory. 497-510 - Michael Kaminski, Michael L. Tiomkin:
The Modal Logic of Cluster-Decomposable Kripke Interpretations. 511-520 - Alexander Hertel, Philipp Hertel, Charles Morgan:
A Sound and Complete Proof Theory for Propositional Logical Contingencies. 521-530 - Philip Scowcroft:
The Complexity of Bounded Quantifiers in Some Ordered Abelian Groups. 521-550
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-06-18 21:18 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:
