Articles 1 to 18 of 18

31 Mar

arXiv:0803.4466 On the strength of dependent products in the type theory of Martin-Löf. Richard Garner. math.LO.

31 Mar

arXiv:0803.4349 The identity type weak factorisation system. Nicola Gambino, Richard Garner. math.LO (math.CT).

25 Mar

arXiv:0803.3560 Definably complete and Baire structures. Antongiulio Fornasiero, Tamara Servi. math.LO.

25 Mar

arXiv:0803.3498 Combinatorial and model-theoretical principles related to regularity of ultrafilters and compactness of topological spaces. I. Paolo Lipparini. math.LO (math.GN).

22 Mar

arXiv:0803.3296 Structures in Familiar Classes Which Have Scott Rank $\omega_1^{CK}$. Wesley Calvert, Sergey S. Goncharov, Julia F. Knight. math.LO.

22 Mar

arXiv:0803.3294 Index Sets of Computable Structures. Wesley Calvert, Valentina S. Harizanov, Julia F. Knight, Sara Miller. Algebra and Logic 45 (2006), 306--325. math.LO.

22 Mar

arXiv:0803.3293 Classification from a Computable Viewpoint. Wesley Calvert, Julia F. Knight. Bulletin of Symbolic Logic,12 (2006), 191--218. math.LO.

22 Mar

arXiv:0803.3291 Comparing Classes of Finite Structures. Wesley Calvert, Desmond Cummins, Sara Miller, Julia F. Knight. Algebra and Logic 43 (2004), 374--392. math.LO.

20 Mar

arXiv:0803.3073 $\mathbb{R}$-Computability and $F$-Parameterization. Wesley Calvert. math.LO.

16 Mar

arXiv:0803.2338 Interval valued $(\in,\ivq)$-fuzzy filters of pseudo $BL$-algebras. J. Zhan, W. A. Dudek, Y. B. Jun. math.LO (math.GM).

11 Mar

arXiv:0803.1648 Logics preserving degrees of truth from varieties of residuated lattices. F. Bou, F. Esteva, J. M. Font, A. Gil, L. Godo, A. Torrens, V. Verdú. math.LO.

24 Mar

arXiv:0803.3404 Infinitary Queries in Spatial Databases. Wesley Calvert, John E. Porter. cs.DB (cs.LO math.LO).

21 Mar

arXiv:0803.3131 Countable Choice and Compactness. Marianne Morillon (ERMIT). math.FA (math.GN math.LO).

13 Mar

arXiv:0803.1947 SPM Bulletin 24. Boaz Tsaban (ed. ). math.GN (math.CO math.LO).

12 Mar

arXiv:0803.1842 Closure Properties of Locally Finite Omega Languages. Olivier Finkel (ELM). Theoretical Computer Science 322 (1) (2004) 69-84. cs.LO (math.LO).

12 Mar

arXiv:0803.1841 On the Topological Complexity of Infinitary Rational Relations. Olivier Finkel (ELM). RAIRO-Theoretical Informatics and Applications 37 (2) (2003) 105-113. cs.LO (cs.CC math.LO).

12 Mar

arXiv:0803.1830 On Winning Conditions of High Borel Complexity in Pushdown Games. Olivier Finkel (ELM). Fundamenta Informaticae 66 (3) (2005) 277-298. cs.LO (cs.GT math.LO).

6 Mar

arXiv:0803.0853 Girard couples of quantales. J. M. Egger, David Kruml. math.CT (math.LO math.QA).

Articles 1 to 18 of 18

- for questions or comments about the Front arXiv contact page - for questions about downloading and submitting e-prints