Digital Library
Close Browse articles from a journal
     Journal description
       All volumes of the corresponding journal
         All issues of the corresponding volume
                                       All articles of the corresponding issues
 
                             76 results found
no title author magazine year volume issue page(s) type
1 A Characterization of the free n-generated MV-algebra Mundici, Daniele
2005
2 p. 239-247
article
2 A class of $${\Sigma _{3}^{0}}$$ modular lattices embeddable as principal filters in $${\mathcal{L}^{\ast }(V_{\infty })}$$ Dimitrov, Rumen
2008
2 p. 111-132
article
3 A Connection Between Cut Elimination and Normalization Borisavljević, Mirjana
2005
2 p. 113-148
article
4 A direct independence proof of Buchholz's Hydra Game on finite labeled trees Hamano, Masahiro
1998
2 p. 67-89
article
5 Adjoining cofinitary permutations (II) Zhang, Yi
2003
2 p. 153-163
article
6 A generalization of the Dual Ellentuck Theorem Halbeisen, Lorenz
2003
2 p. 103-128
article
7 A hierarchy of hereditarily finite sets Kirby, Laurence
2008
2 p. 143-157
article
8 A jump operator on honest subrecursive degrees Kristiansen, Lars
1998
2 p. 105-125
article
9 A logical and algebraic treatment of conditional probability Flaminio , Tommaso
2004
2 p. 245-262
article
10 Amalgamation properties and finite models in Ln-theories Baldwin, John
2002
2 p. 155-167
article
11 Analytic combinatory calculi and the elimination of transitivity Minari, Pierluigi
2004
2 p. 159-191
article
12 A new condensation principle Räsch, Thoralf
2004
2 p. 159-166
article
13 An intuitionistic proof of Kruskal’s theorem Veldman, Wim
2004
2 p. 215-264
article
14 An ordinal analysis for theories of self-referential truth Leigh, Graham Emil
2010
2 p. 213-247
article
15 A note on Spector's quantifier-free rule of extensionality Kohlenbach, Ulrich
2000
2 p. 89-92
article
16 A note on the theory of positive induction, $${{\rm ID}^*_1}$$ Afshari, Bahareh
2009
2 p. 275-281
article
17 A note on weak dividing Kim, Byunghan
2006
2 p. 51-60
article
18 A notion of rank in set theory without choice Mendick, G.S.
2003
2 p. 165-178
article
19 A solution to Curry and Hindley’s problem on combinatory strong reduction Minari, Pierluigi
2008
2 p. 159-184
article
20 A superatomic Boolean algebra with few automorphisms Rubin, Matatyahu
2000
2 p. 125-129
article
21 A topological completeness theorem Butz, Carsten
1999
2 p. 79-101
article
22 Coding lemmata in L Kafkoulis, George
2004
2 p. 193-213
article
23 Complexity of admissible rules Jeřábek, Emil
2007
2 p. 73-92
article
24 Computability in Europe 2008 Beckmann, Arnold
2009
2 p. 119-121
article
25 Computational complexity of logical theories of one successor and another unary function Michel, Pascal
2007
2 p. 123-148
article
26 Constructing local optima on a compact interval Bridges, Douglas S.
2007
2 p. 149-154
article
27 Counting proofs in propositional logic David, René
2009
2 p. 185-199
article
28 Does truth-table of linear norm reduce the one-query tautologies to a random oracle? Kumabe, Masahiro
2008
2 p. 159-180
article
29 Epsilon substitution method for theories of jump hierarchies Arai, Toshiyasu
2002
2 p. 123-153
article
30 Every incomplete computably enumerable truth-table degree is branching Fejer, Peter A.
2000
2 p. 113-123
article
31 Existentially closed fields with holomorphy rings Schmid, Joachim
1997
2 p. 127-135
article
32 Freiling's axioms of symmetry in a general setting and some applications Tzouvaras, Athanassios
2000
2 p. 131-145
article
33 Fuzzy Horn logic II Bělohlávek, Radim
2005
2 p. 149-177
article
34 Groupwise dense families Mildenberger, Heike
2000
2 p. 93-112
article
35 Harrington’s conservation theorem redone Ferreira, Fernando
2008
2 p. 91-100
article
36 $\hbox{\sf N}$-strictness in applicative theories Kahle, Reinhard
2000
2 p. 125-144
article
37 Indestructibility and measurable cardinals with few and many measures Apter, Arthur W.
2008
2 p. 101-110
article
38 Isolation in the CEA hierarchy LaForte, Geoffrey
2004
2 p. 227-244
article
39 Joining to high degrees via noncuppables Liu, Jiang
2009
2 p. 195-211
article
40 Kripke models for subtheories of CZF Iemhoff, Rosalie
2009
2 p. 147-167
article
41 Labelling classes by sets Marshall, M. Victoria
2004
2 p. 219-226
article
42 Large cardinals and projective sets Judah, Haim
1997
2 p. 137-155
article
43 Lifting elementary embeddings j: Vλ → Vλ Corazza, Paul
2007
2 p. 61-72
article
44 Lifting independence results in bounded arithmetic Chiari, Mario
1999
2 p. 123-138
article
45 Lowness for genericity Yu, Liang
2005
2 p. 233-238
article
46 Modularity of proof-nets Maieli, Roberto
2004
2 p. 167-193
article
47 Non-commutative Łukasiewicz propositional logic Leuştean, Ioana
2005
2 p. 191-213
article
48 Normal subgroups of nonstandard symmetric and alternating groups Allsup, John
2007
2 p. 107-121
article
49 On completeness of the quotient algebras ${\cal P}(\kappa)/I$ Kanai, Yasuo
2000
2 p. 75-87
article
50 On stability in finite models Hyttinen, Tapani
2000
2 p. 89-102
article
51 On the algebraic structure of linear, relevance, and fuzzy logics Paoli, Francesco
2002
2 p. 107-121
article
52 Parameterized partition relations on the real numbers Bagaria, Joan
2009
2 p. 201-226
article
53 Polytime, combinatory logic and positive safe induction Cantini, Andrea
2002
2 p. 169-189
article
54 Q-measures on Qκλ Wu, Guohua
2003
2 p. 201-204
article
55 Refined common knowledge logics or logics of common information Rybakov, V.V.
2003
2 p. 179-200
article
56 Residuated fuzzy logics with an involutive negation Esteva, Francesc
2000
2 p. 103-124
article
57 Semifree actions of free groups Hils, Martin
2007
2 p. 93-105
article
58 Set theory without choice: not everything on cofinality is possible Shelah, Saharon
1997
2 p. 81-125
article
59 Setting-up early computer programs: D. H. Lehmer’s ENIAC computation Bullynck, Maarten
2009
2 p. 123-146
article
60 Strong reducibility of partial numberings Spreen, Dieter
2004
2 p. 209-217
article
61 The basic theory of infinite time register machines Carl, Merlin
2010
2 p. 249-273
article
62 The decision problem for ${\vec Z}C(p^3)$-lattices with $p$ prime Toffalori, Carlo
1998
2 p. 127-142
article
63 The Karp complexity of unstable classes Laskowski, M.C.
2000
2 p. 69-88
article
64 The length of some diagonalization games Scheepers, Marion
1999
2 p. 103-122
article
65 The limitations of cupping in the local structure of the enumeration degrees Soskova, Mariya I.
2009
2 p. 169-193
article
66 The logic of equilibrium and abelian lattice ordered groups Galli, Adriana
2004
2 p. 141-158
article
67 The Medvedev lattice of computably closed sets Terwijn, Sebastiaan A.
2005
2 p. 179-190
article
68 The polarized Ramsey’s theorem Dzhafarov, Damir D.
2008
2 p. 141-157
article
69 There is no ordering on the classes in the generalized high/low hierarchies Montalbán, Antonio
2005
2 p. 215-231
article
70 The theory of ${\vec Z}C(2)^2$-lattices is decidable Baratella, Stefano
1998
2 p. 91-104
article
71 Ultrafilters, monotone functions and pseudocompactness Hrušák, M.
2004
2 p. 131-157
article
72 Universal indestructibility for degrees of supercompactness and strongly compact cardinals Apter, Arthur W.
2008
2 p. 133-142
article
73 Universes in metapredicative analysis Rüede, Christian
2003
2 p. 129-151
article
74 Vitali's Theorem and WWKL Brown, Douglas K.
2002
2 p. 191-206
article
75 Weak dividing, chain conditions, and simplicity Dolich, Alfred
2003
2 p. 265-283
article
76 Weak theories of linear algebra Thapen, Neil
2004
2 p. 195-208
article
                             76 results found
 
 Koninklijke Bibliotheek - National Library of the Netherlands