|
|
Journals in DBLP
J. Symb. Log.
2003, volume: 68, number: 1
- Thomas Forster
ZF + 'Every set is the same size as a wellfounded set'. [Citation Graph (0, 0)][DBLP]
J. Symb. Log., 2003, v:68, n:1, pp:1-4 [Journal]
- Andreas Weiermann
An application of graphical enumeration to PA*. [Citation Graph (0, 0)][DBLP]
J. Symb. Log., 2003, v:68, n:1, pp:5-16 [Journal]
- Lev D. Beklemishev
On the induction schema for decidable predicates. [Citation Graph (0, 0)][DBLP]
J. Symb. Log., 2003, v:68, n:1, pp:17-34 [Journal]
- Roman Wencel
Definable sets in Boolean ordered o-minimal structures. II. [Citation Graph (0, 0)][DBLP]
J. Symb. Log., 2003, v:68, n:1, pp:35-51 [Journal]
- Shamil Ishmukhametov
On a problem of Cooper and Epstein. [Citation Graph (0, 0)][DBLP]
J. Symb. Log., 2003, v:68, n:1, pp:52-64 [Journal]
- Andreas Blass, Yuri Gurevich
Strong extension axioms and Shelah's zero-one law for choiceless polynomial time. [Citation Graph (0, 0)][DBLP]
J. Symb. Log., 2003, v:68, n:1, pp:65-131 [Journal]
- Katalin Bimbó
The Church-Rosser property in dual combinatory logic. [Citation Graph (0, 0)][DBLP]
J. Symb. Log., 2003, v:68, n:1, pp:132-152 [Journal]
- Raf Cluckers
Presburger sets and p-minimal fields. [Citation Graph (0, 0)][DBLP]
J. Symb. Log., 2003, v:68, n:1, pp:153-162 [Journal]
- Mamoru Kaneko, Nobu-Yuki Suzuki
Epistemic models of shallow depths and decision making in games: Horticulture. [Citation Graph (0, 0)][DBLP]
J. Symb. Log., 2003, v:68, n:1, pp:163-186 [Journal]
- Jacques Duparc
The Steel hierarchy of ordinal valued Borel mappings. [Citation Graph (0, 0)][DBLP]
J. Symb. Log., 2003, v:68, n:1, pp:187-234 [Journal]
- Pierre Matet, Janusz Pawlikowski
Q-pointness, P-pointness and feebleness of ideals. [Citation Graph (0, 0)][DBLP]
J. Symb. Log., 2003, v:68, n:1, pp:235-261 [Journal]
- Panu Raatikainen
Some strongly undecidable natural arithmetical problems, with an application to intuitionistic theories. [Citation Graph (0, 0)][DBLP]
J. Symb. Log., 2003, v:68, n:1, pp:262-266 [Journal]
- Steven Givant
Inequivalent representations of geometric relation algebras. [Citation Graph (0, 0)][DBLP]
J. Symb. Log., 2003, v:68, n:1, pp:267-310 [Journal]
- Martin Ziegler 0002
Separably closed fields with Hasse derivations. [Citation Graph (0, 0)][DBLP]
J. Symb. Log., 2003, v:68, n:1, pp:311-318 [Journal]
- Michael Benedikt, H. Jerome Keisler
Definability with a predicate for a semi-linear set. [Citation Graph (0, 0)][DBLP]
J. Symb. Log., 2003, v:68, n:1, pp:319-351 [Journal]
|
