default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNotre Dame Journal of Formal Logic, Volume 51
Volume 51, Number 1, 2010
- Michael Detlefsen:
Introduction to the Fiftieth Anniversary Issues. 1-2 - Solomon Feferman:
Set-theoretical Invariance Criteria for Logicality. 3-20 - Hannes Leitgeb:
On the Ramsey Test without Triviality. 21-54 - Asher M. Kach, Oscar Levin
, Reed Solomon:
Embeddings of Computable Structures. 55-68 - Graham Priest:
Inclosures, Vagueness, and Self-Reference. 69-84 - Rodney G. Downey, Sergei S. Goncharov, Asher M. Kach, Julia F. Knight, Oleg V. Kudinov, Alexander G. Melnikov, Daniel Turetsky:
Decidability and Computability of Certain Torsion-Free Abelian Groups. 85-96 - Kit Fine:
Some Puzzles of Ground. 97-118 - John P. Burgess:
Axiomatizing the Logic of Comparative Probability. 119-126 - David Diamondstone, Damir D. Dzhafarov, Robert I. Soare:
Π01 Classes, Peano Arithmetic, Randomness, and Computable Domination. 127-159
Volume 51, Number 2, 2010
- Gian Aldo Antonelli:
Numerical Abstraction via the Frege Quantifier. 161-179 - George Leibman:
The Consistency Strength of MPCCC(R). 181-193 - George Barmpalias:
Relative Randomness and Cardinality. 195-205 - Sven Ove Hansson:
Past Probabilities. 207-223 - Jonathan Fleischmann:
Syntactic Preservation Theorems for Intuitionistic Predicate Logic. 225-245 - Simon Andrews:
Definable Open Sets As Finite Unions of Definable Open Cells. 247-251 - Bryan Pickel:
Syntax in Basic Laws paragraph paragraph 29-32. 253-277 - Rod Downey, Keng Meng Ng:
Effective Packing Dimension and Traceability. 279-290
Volume 51, Number 3, 2010
- Joel David Hamkins, Thomas A. Johnstone:
Indestructible Strong Unfoldability. 291-321 - Richard Dietz:
On Generalizing Kolmogorov. 323-335 - Kenshi Miyabe:
An Extension of van Lambalgen's Theorem to Infinitely Many Relative 1-Random Reals. 337-349 - Alexander Paseau:
Pure Second-Order Logic with Second-Order Identity. 351-360 - Gregory M. Johnson:
Abstract Elementary Classes with Löwenheim-Skolem Number Cofinal with ω. 361-371 - Ori Simchen:
Polyadic Quantification via Denoting Concepts. 373-381 - Cristina Coppola, Giangiacomo Gerla, Annamaria Miranda:
Point-free Foundation of Geometry and Multivalued Logic. 383-405
Volume 51, Number 4, 2010
- David Atkinson, Jeanne Peijnenburg:
Justification by Infinite Loops. 407-416 - Johanna N. Y. Franklin:
Subclasses of the Weakly Random Reals. 417-426 - Daniel W. Cunningham:
A Covering Lemma for HOD of K(ℝ). 427-442 - Mingzhong Cai:
A Hyperimmune Minimal Degree and an ANR 2-Minimal Degree. 443-455 - Morten Heine Sørensen, Pawel Urzyczyn:
A Syntactic Embedding of Predicate Logic into Second-Order Propositional Logic. 457-473 - Victoria Gitman, Joel David Hamkins:
A Natural Model of the Multiverse Axioms. 475-484 - Alex Citkin:
Metalogic of Intuitionistic Propositional Calculus. 485-502 - Hitoshi Omori, Toshiharu Waragai:
A Note on Majkic's Systems. 503-506
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 2026-07-14 00:32 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
