Logique mathématique et analyse non-standard
Logique modale propositionnelle : une vue cavalière
Logique trivalente de Lukasiewicz
Lògiques distributives i booleanes.
Continuing the study of different types of Abstract Logics [5], and following works by Brown-Bloom [1] and Brown-Suszko [2], we analyze in this paper some logics in which, if we identify equivalent formulae by means of the consequence operator, we obtain distributive lattices or Boolean algebras.
Long chains in Rudin-Frolík order
L'ordre de Dehornoy sur les tresses
Lorenzen's theorem for pseudo-effect algebras
Low cardinality models for a type of infinitary theory
Lower and upper bounds for the provability of Herbrand consistency in weak arithmetics
We prove that for i ≥ 1, the arithmetic does not prove a variant of its own Herbrand consistency restricted to the terms of depth in , where ε is an arbitrarily small constant greater than zero. On the other hand, the provability holds for the set of terms of depths in .
L'universalité des semi-fonctions récursives universelles
Lusin sequences under CH and under Martin's Axiom
Assuming the continuum hypothesis there is an inseparable sequence of length ω₁ that contains no Lusin subsequence, while if Martin's Axiom and ¬ CH are assumed then every inseparable sequence (of length ω₁) is a union of countably many Lusin subsequences.
Luzin and anti-Luzin almost disjoint families
Under every uncountable almost disjoint family is either anti-Luzin or has an uncountable Luzin subfamily. This fails under CH. Related properties are also investigated.