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
 
                             95 results found
no title author magazine year volume issue page(s) type
1 A combinatorial result related to the consistency of New Foundations Tzouvaras, Athanassios
2011
5 p. 373-383
11 p.
article
2 A feasible theory of truth over combinatory algebra Eberhard, Sebastian
2014
5 p. 1009-1033
25 p.
article
3 Alternating minima and maxima, Nash equilibria and Bounded Arithmetic Pudlák, Pavel
2012
5 p. 604-614
11 p.
article
4 A microscopic approach to Souslin-tree construction, Part II Brodsky, Ari Meir

5 p.
article
5 An Efimov space with character less than s Dow, Alan

5 p.
article
6 A new look at interpretability and saturation Malliaris, M.
2019
5 p. 642-671
article
7 Automata on ordinals and automaticity of linear orders Schlicht, Philipp
2013
5 p. 523-527
5 p.
article
8 Automorphisms of models of set theory and extensions of NFU McKenzie, Zachiri
2015
5 p. 601-638
38 p.
article
9 Axiomatizing AECs and applications Leung, Samson

5 p.
article
10 Bar recursion over finite partial functions Oliva, Paulo
2017
5 p. 887-921
35 p.
article
11 B-frame duality Massas, Guillaume

5 p.
article
12 Characterizing large cardinals in terms of layered posets Cox, Sean
2017
5 p. 1112-1131
20 p.
article
13 Characterizing model-theoretic dividing lines via collapse of generalized indiscernibles Guingona, Vincent
2017
5 p. 1091-1111
21 p.
article
14 Completeness for μ-calculi: A coalgebraic approach Enqvist, Sebastian
2019
5 p. 578-641
article
15 Complexity in the interdefinability of timelike, lightlike and spacelike relatedness of Minkowski spacetime Andréka, Hajnal

5 p.
article
16 Computability in Europe 2009 Ambos-Spies, Klaus
2012
5 p. 483-484
2 p.
article
17 Computability in Europe 2011 Buss, Sam
2013
5 p. 509-510
2 p.
article
18 Computability of the ergodic decomposition Hoyrup, Mathieu
2013
5 p. 542-549
8 p.
article
19 Computable de Finetti measures Freer, Cameron E.
2012
5 p. 530-546
17 p.
article
20 Computably categorical Boolean algebras enriched by ideals and atoms Alaev, P.E.
2012
5 p. 485-499
15 p.
article
21 Conditional computability of real functions with respect to a class of operators Georgiev, Ivan
2013
5 p. 550-565
16 p.
article
22 Constructive Ackermann's interpretation Jeon, Hanul

5 p.
article
23 Contents 2010
5 p. iv-
1 p.
article
24 Contents 2012
5 p. iv-
1 p.
article
25 Contents 2013
5 p. iv-
1 p.
article
26 Convergent sequences in topological groups Hrušák, Michael

5 p.
article
27 Corrigendum to “Advice classes of parameterized tractability” [Ann. Pure Appl. Logic 84 (1) (1997) 119–138] Cai, Liming
2018
5 p. 463-465
article
28 Corson reflections Farah, Ilijas

5 p.
article
29 CZF does not have the existence property Swan, Andrew W.
2014
5 p. 1115-1147
33 p.
article
30 Decidability questions for a ring of Laurent polynomials Sirokofskich, Alla
2012
5 p. 615-619
5 p.
article
31 Definable MAD families and forcing axioms Fischer, Vera

5 p.
article
32 Density of the cototal enumeration degrees Miller, Joseph S.
2018
5 p. 450-462
article
33 Editorial Board 2016
5 p. IFC-
1 p.
article
34 Editorial Board 2018
5 p. ii
article
35 Editorial Board 2015
5 p. IFC-
1 p.
article
36 Editorial Board 2019
5 p. ii
article
37 Editorial Board
5 p.
article
38 Editorial Board
5 p.
article
39 Editorial Board
5 p.
article
40 Editorial Board
5 p.
article
41 Editorial Board
5 p.
article
42 Empty intervals in the enumeration degrees Kent, Thomas F.
2012
5 p. 567-574
8 p.
article
43 Equilibrium semantics of languages of imperfect information Sevenster, Merlijn
2010
5 p. 618-631
14 p.
article
44 Forcing lightface definable well-orders without the GCH Asperó, David
2015
5 p. 553-582
30 p.
article
45 Foreword Ghica, Dan R.
2010
5 p. 617-
1 p.
article
46 From axioms to synthetic inference rules via focusing Marin, Sonia

5 p.
article
47 Galois stratification and ACFA Tomašić, Ivan
2015
5 p. 639-663
25 p.
article
48 Germinal theories in Łukasiewicz logic Cabrer, Leonardo Manuel
2017
5 p. 1132-1151
20 p.
article
49 Highness, locally noncappability and nonboundings Stephan, Frank
2013
5 p. 511-522
12 p.
article
50 Honest elementary degrees and degrees of relative provability without the cupping property Shafer, Paul
2017
5 p. 1017-1031
15 p.
article
51 Indestructibility of ideals and MAD families Chodounský, David

5 p.
article
52 Inside the Muchnik degrees I: Discontinuity, learnability and constructivism Higuchi, K.
2014
5 p. 1058-1114
57 p.
article
53 Integration in algebraically closed valued fields Yin, Yimu
2011
5 p. 384-408
25 p.
article
54 Introduction Tall, Franklin D.

5 p.
article
55 Intuitionistic nonstandard bounded modified realisability and functional interpretation Dinis, Bruno
2018
5 p. 392-412
article
56 Martin-Löf randomness and Galton–Watson processes Diamondstone, David
2012
5 p. 519-529
11 p.
article
57 Maximal pairs of c.e. reals in the computably Lipschitz degrees Fan, Yun
2011
5 p. 357-366
10 p.
article
58 Mitchell's theorem revisited Gilton, Thomas
2017
5 p. 922-1016
95 p.
article
59 New spectra of strongly minimal theories in finite languages Andrews, Uri
2011
5 p. 367-372
6 p.
article
60 Non-finitely axiomatisable modal product logics with infinite canonical axiomatisations Hampson, Christopher

5 p.
article
61 Nonstandard proof methods in toposes Siqueira, José

5 p.
article
62 On Guaspari's problem about partially conservative sentences Kurahashi, Taishi

5 p.
article
63 On modal logics arising from scattered locally compact Hausdorff spaces Bezhanishvili, Guram
2019
5 p. 558-577
article
64 On pp-elimination and stability in a continuous setting Chavarria, Nicolas

5 p.
article
65 On the existence of skinny stationary subsets Matsubara, Yo
2019
5 p. 539-557
article
66 On the Kolmogorov complexity of continuous real functions Farjudian, Amin
2013
5 p. 566-576
11 p.
article
67 Pincherle's theorem in reverse mathematics and computability theory Normann, Dag

5 p.
article
68 Proof and refutation in MALL as a game Delande, Olivier
2010
5 p. 654-672
19 p.
article
69 Randomness and lowness notions via open covers Bienvenu, Laurent
2012
5 p. 506-518
13 p.
article
70 Reflection algebras and conservation results for theories of iterated truth Beklemishev, Lev D.

5 p.
article
71 Resource modalities in tensor logic Melliès, Paul-André
2010
5 p. 632-653
22 p.
article
72 Reverse-engineering Reverse Mathematics Sanders, Sam
2013
5 p. 528-541
14 p.
article
73 Selective covering properties of product spaces Miller, Arnold W.
2014
5 p. 1034-1057
24 p.
article
74 Separating families and order dimension of Turing degrees Kumar, Ashutosh

5 p.
article
75 Short extenders forcings – doing without preparations Gitik, Moti

5 p.
article
76 Simple structures axiomatized by almost sure theories Ahlman, Ove
2016
5 p. 435-456
22 p.
article
77 Some remarks on the Open Coloring Axiom Moore, Justin Tatch

5 p.
article
78 Spatial logic of tangled closure operators and modal mu-calculus Goldblatt, Robert
2017
5 p. 1032-1090
59 p.
article
79 Strong ergodicity phenomena for Bernoulli shifts of bounded algebraic dimension Panagiotopoulos, Aristotelis

5 p.
article
80 Structure and enumeration theorems for hereditary properties in finite relational languages Terry, C.
2018
5 p. 413-449
article
81 Tarski's theorem on intuitionistic logic, for polyhedra Bezhanishvili, Nick
2018
5 p. 373-391
article
82 The Borel complexity of von Neumann equivalence Moroz, Inessa

5 p.
article
83 The comparison of various club guessing principles Ishiu, Tetsuya
2015
5 p. 583-600
18 p.
article
84 The computational complexity of module socles Wu, Huishan

5 p.
article
85 The extensional ordering of the sequential functionals Normann, D.
2012
5 p. 575-603
29 p.
article
86 The fixed-point property for represented spaces Hoyrup, Mathieu

5 p.
article
87 The formal verification of the ctm approach to forcing Gunther, Emmanuel

5 p.
article
88 The high/low hierarchy in the local structure of the ω -enumeration degrees Ganchev, Hristo
2012
5 p. 547-566
20 p.
article
89 The number of axioms Aguilera, J.P.

5 p.
article
90 The partial orderings of the computably enumerable ibT-degrees and cl-degrees are not elementarily equivalent Ambos-Spies, Klaus
2013
5 p. 577-588
12 p.
article
91 The tree property at first and double successors of singular cardinals with an arbitrary gap Poveda, Alejandro

5 p.
article
92 The variable hierarchy for the games μ -calculus Belkhir, Walid
2010
5 p. 690-707
18 p.
article
93 Totality in arena games Clairambault, Pierre
2010
5 p. 673-689
17 p.
article
94 Tracing and domination in the Turing degrees Barmpalias, George
2012
5 p. 500-505
6 p.
article
95 Two applications of topology to model theory Eagle, Christopher J.

5 p.
article
                             95 results found
 
 Koninklijke Bibliotheek - National Library of the Netherlands