default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNotre Dame Journal of Formal Logic, Volume 53
Volume 53, Number 1, 2012
- James H. Schmerl:
Elementary Cuts in Saturated Models of Peano Arithmetic. 1-13 - David Atkinson, Jeanne Peijnenburg
:
Fractal Patterns in Reasoning. 15-26 - Nathaniel Miller:
On the Inconsistency of Mumma's Eu. 27-52 - Henry Towsner:
A Simple Proof and Some Difficult Examples for Hindman's Theorem. 53-65 - Hassan Sfouli:
On the Elementary Theory of Restricted Real and Imaginary Parts of Holomorphic Functions. 67-77 - Oleksandr Petrenko, I. V. Protasov:
Thin Ultrafilters. 79-88 - Mark Ressler:
Thoroughly Relativistic Perspectives. 89-112 - Thomas Macaulay Ferguson:
Notes on the Model Theory of DeMorgan Logics. 113-132
Volume 53, Number 2, 2012
- Thomas F. Icard III, Joost J. Joosten:
Provability and Interpretability Logics with Restricted Realizations. 133-154 - Gunter Fuchs, Philipp Lücke:
Iteratively Changing the Heights of Automorphism Towers. 155-174 - Michael A. Tychonievich:
The Set of Restricted Complex Exponents for Expansions of the Reals. 175-186 - Gian Aldo Antonelli:
A Note on Induction, Abstraction, and Dedekind-Finiteness. 187-192 - Isaac Goldbring:
Definable Operators on Hilbert Spaces. 193-201 - Yoshihiro Horihata:
Weak Theories of Concatenation and Arithmetic. 203-222 - José M. Méndez, Gemma Robles:
A General Characterization of the Variable-Sharing Property by Means of Logical Matrices. 223-244 - Alexander Kreuzer:
Primitive Recursion and the Chain Antichain Principle. 245-265
Volume 53, Number 3, 2012
- Roman Kossak, James H. Schmerl:
On Cofinal Submodels and Elementary Interstices. 267-287 - Stefan Hetzl:
The Computational Content of Arithmetical Proofs. 289-296 - Simon Thomas Hewitt:
The Logic of Finite Order. 297-318 - Guram Bezhanishvili, Joel Lucero-Bryan:
More on d-Logics of Subspaces of the Rational Numbers. 319-345 - Jeremy Avigad:
Uncomputably Noisy Ergodic Limits. 347-350 - Diego Rojas-Rebolledo:
Bounds on the Strength of Ordinal Definable Determinacy in Small Admissible Sets. 351-371 - Jared Corduan, François G. Dorais:
On the Indecomposability of ωn. 373-395 - Sean Cox:
PFA and Ideals on ω2 Whose Associated Forcings Are Proper. 397-412 - Fredrik Engström, Richard Kaye:
Transplendent Models: Expansions Omitting a Type. 413-428
Volume 53, Number 4, 2012
- Gilles Dowek, Olivier Hermant:
A Simple Proof that Super-Consistency Implies Cut Elimination. 439-456 - Giovanni Boniolo, Silvio Valentini:
Objects: A Study in Kantian Formal Epistemology. 457-478 - Mingzhong Cai:
Degrees of Relative Provability. 479-489 - Katalin Bimbó, J. Michael Dunn:
New Consecution Calculi for Rt->. 491-509 - Silvia Barbina, Domenico Zambella:
Generic Expansions of Countable Models. 511-523 - Rodrigo A. Freire:
On Existence in Set Theory. 525-547 - Rohan French:
Denumerably Many Post-Complete Normal Modal Logics with Propositional Constants. 549-556 - Alexandre V. Borovik, Renling Jin, Mikhail G. Katz:
An Integer Construction of Infinitesimals: Toward a Theory of Eudoxus Hyperreals. 557-570 - M. Randall Holmes:
The Usual Model Construction for NFU Preserves Information. 571-580 - Lloyd Humberstone:
Minimally Congruential Contexts: Observations and Questions on Embedding E in K. 581-598 - Ehud Hrushovski, Anand Pillay, Pierre Simon:
A Note on Generically Stable Measures and fsg Groups. 599-605
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-05-18 00:08 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:
